DocumentCode
249466
Title
Symmetric polynomials for 2D shape representation
Author
Negrinho, Renato M. P. ; Aguiar, Pedro M. Q.
Author_Institution
Inst. for Syst. & Robot., Inst. Super. Tecnico, Lisbon, Portugal
fYear
2014
fDate
27-30 Oct. 2014
Firstpage
4732
Lastpage
4736
Abstract
We discuss the usage of symmetric polynomials for representing 2D shapes in their most general form, i.e., arbitrary sets of unlabeled points in the plane. Although particular families of these polynomials have been used in the past, we present general results that pave the way for the development of new representations that exhibit key properties for shape recognition. We show that all monomial symmetric polynomials satisfy homogeneity, which enables leveraging on previous work on spectral invariants to obtain invariance/completeness with respect to shape orientation. Representations based on symmetric polynomials are invariant to shape point relabeling. We single out elementary symmetric polynomials and power sums as particular families of polynomials that further enable obtaining completeness with respect to point labeling. We discuss the efficient computation of these polynomials and study how perturbations in the shape point coordinates affect their values.
Keywords
polynomials; shape recognition; 2D shape representation; elementary symmetric polynomials; power sums; shape orientation; shape point relabeling; shape recognition; unlabeled points; Arrays; Indexing; Measurement; Pattern recognition; Polynomials; Shape; Tin; Completeness; Elementary symmetric polynomials; Homogeneity; Invariance; Monomial symmetric polynomials; Power sums; Shape representation; Symmetric polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
Image Processing (ICIP), 2014 IEEE International Conference on
Conference_Location
Paris
Type
conf
DOI
10.1109/ICIP.2014.7025959
Filename
7025959
Link To Document