Polygonal shape description for recognition of partially occluded objects

Authors:
Filip Krolupper;Jan Flusser
Affiliations:
Institute of Information Theory and Automation Academy of Sciences of the Czech Republic, Pod vodarenskou vezi 4, 182 08 Praha 8, Czech Republic;Institute of Information Theory and Automation Academy of Sciences of the Czech Republic, Pod vodarenskou vezi 4, 182 08 Praha 8, Czech Republic
Venue:
Pattern Recognition Letters
Year:
2007

Citing 9
Cited 1

Scale-Based Description and Recognition of Planar Curves and Two-Dimensional Shapes

IEEE Transactions on Pattern Analysis and Machine Intelligence
The use of maximum curvature points for the recognition of partially occluded objects

Pattern Recognition
On detecting dominant points

Pattern Recognition
Detecting cusps and inflection points in curves

Computer Aided Geometric Design
Wavelet-Based Affine Invariant Representation: A Tool for Recognizing Planar Objects in 3D Space

IEEE Transactions on Pattern Analysis and Machine Intelligence
Similarity and Affine Invariant Distances Between 2D Point Sets

IEEE Transactions on Pattern Analysis and Machine Intelligence
Recognition of Occluded Objects by a Genetic Algorithm

ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 1 - Volume 1
Recognizing Partially Occluded Parts

IEEE Transactions on Pattern Analysis and Machine Intelligence
Invariant matching and identification of curves using B-splines curve representation

IEEE Transactions on Image Processing

Pattern recognition for high throughput zebrafish imaging using genetic algorithm optimization

PRIB'10 Proceedings of the 5th IAPR international conference on Pattern recognition in bioinformatics

Quantified Score

Hi-index	0.11

Visualization

Abstract

We introduce a new method for the recognition of partially occluded objects represented only by their contours. Object description, which stems from the inflection point detection, approximates the object by polygon and is affine invariant. The matching algorithm is simple and easy to implement.