A Bivariate Autoregressive Technique for Analysis and Classification of Planar Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence
Generalized Multidimensional Orthogonal Polynomials with Applications to Shape Analysis
IEEE Transactions on Pattern Analysis and Machine Intelligence
Partial Shape Classification Using Contour Matching in Distance Transformation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Classical floorplanning harmful?
ISPD '00 Proceedings of the 2000 international symposium on Physical design
An Algebra of Geometric Shapes
IEEE Computer Graphics and Applications
Shock-Based Indexing into Large Shape Databases
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Curves vs. skeletons in object recognition
Signal Processing - Special section on content-based image and video retrieval
Information Sciences: an International Journal
Kernel PCA for similarity invariant shape recognition
Neurocomputing
Probabilistic Models of Object Geometry with Application to Grasping
International Journal of Robotics Research
On the Integration of Neural Classifiers through Similarity Analysis of Higher Order Features
ICDM '09 Proceedings of the 9th Industrial Conference on Advances in Data Mining. Applications and Theoretical Aspects
A Machine Learning Approach to Off-Line Signature Verification Using Bayesian Inference
IWCF '09 Proceedings of the 3rd International Workshop on Computational Forensics
Invariant pattern recognition using contourlets and AdaBoost
Pattern Recognition
Using diagonals of orthogonal projection matrices for affine invariant contour matching
Image and Vision Computing
| Hi-index | 0.15 |
We present a method for the classification of 2-D partial shapes using Fourier descriptors. We formulate the problem as one of estimating the Fourier descriptors of the unknown complete shape from the observations derived from an arbitrarily rotated and scaled shape with missing segments. The method used for obtaining the estimates of the Fourier descriptors minimizes a sum of two terms; the first term of which is a least square fit to the given data subject to the condition that the number of missing boundary points is not known and the second term is the perimeter2/area of the unknown shape. Experiments with synthetic and real boundaries show that estimates closer to the true values of Fourier descriptors of complete boundaries are obtained. Also, classification experiments performed using real boundaries indicate that reasonable classification accuracies are obtained even when 20-30 percent of the data is missing.