Resistant Procrustes Superimposition

[Up] [Top]

Documentation for package ‘RPS’ version 1.0.1

Help Pages

'RPS'-package Resistant Procrustes Superposition Package in R (RPS): a novel package for landmark-based resistant shape analysis
'RPS' Resistant Procrustes Superposition Package in R (RPS): a novel package for landmark-based resistant shape analysis
cmdistance_RPS This function computes the least-squares Procrustes distance between each pair of matrices (configurations of landmarks) from the input set
eucunivMDS_RPS Given a n x n distance matrix D (not necessarily Euclidean) and a initial set X0 of n seeds in k dim (that is, an initial n x k matrix), this function finds a set of n points in k dimensions X (a final n x k matrix) through a least-squares criterion such that the n x n matrix Dk of euclidean distances among these new points X is as close as possible to D.
matchingsymm_RPS This function obtains the individual resistant-symmetric shape for 2D matching-symmetry data. The input is an array A of size n (landmarks) x p (dimensions) x 2k (objects: the left-right sides for each). Configurations are ordered in this way: left side Object 1, right side Object 1, left side Object 2, right side Object 2, etc
objectsymm_RPS This function obtains the individual resistant-symmetric shape for 2D object-symmetry data. The input is an array A of size n (landmarks) x p (dimensions) x k (objects) Landmarks must be in this order: saggital (or unpaired) landmarks first, then left paired landmarks and finally right paired landmarks. Configurations are ordered in this way: L side Object 1 and R side Object 1, L side Object 2 and R side Object 2, etc
procrustesCM_RPS This function s simply a wrapper for the geomorph function gpagen that performs the classical least squares Procrustes superimposition of the input configurations of landmarks.
readlandtxtMorphJ_RPS Reads a MorphoJ .txt file and returns it as an array of n x k matrices in s dimensions (s=2 or s=3)
resdistance_RPS This function computes the a resistant distance between each pair of matrices from the input set
resunivMDS_RPS Given a n x n distance matrix D (not necessarily Euclidean) and a initial set X0 (that is, a n x k matrix) of n seeds in k dim, this function finds a set of n points in k dimensions X (that is, a k x n matrix) using a resistant criterion such that the n x n matrix Dk of euclidean distances among these new points X is as close as possible to D.
robgit_RPS Resistant Procrustes Superposition Package in R (RPS): a novel package for landmark-based resistant shape analysis