Principal Component Analysis of Random Particles

  • Authors:
  • Graham W. Horgan

  • Affiliations:
  • Biomathematics & Statistics Scotland, Rowett Research Institute, Aberdeen, AB21 9SB, Scotland. g.horgan@bioss.sari.ac.uk

  • Venue:
  • Journal of Mathematical Imaging and Vision
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

Particles are random sets whose position and orientation areirrelevant. They are traditionally handled by calculating summariesof shape, such as compactness and elongation, or by defininglandmarks, whose positions are then subject to statistical analysis. Itwould be advantageous in many applications if shape variabilitycould be addressed without the need for landmarks. This paperproposes a way to do this. The first step is to definesimilarity/distance between shapes. This is done in terms of the areaof non-overlap between them, when they have been brought into theclosest possible alignment. The resulting distance matrix can thenbe treated by the methods of principal coordinate analysis. It isshown that this is equivalent to principal component analysis on thebinary sets in R^2 defined as the regions within the shapeoutlines. The method is illustrated by application to a set of carrotoutlines.