Shape Classification using Approximately Convex Segment Features
By: Bimal Kumar Ray
Potential Business Impact:
Sorts shapes to tell what things are.
The existing object classification techniques based on descriptive features rely on object alignment to compute the similarity of objects for classification. This paper replaces the necessity of object alignment through sorting of feature. The object boundary is normalized and segmented into approximately convex segments and the segments are then sorted in descending order of their length. The segment length, number of extreme points in segments, area of segments, the base and the width of the segments - a bag of features - is used to measure the similarity between image boundaries. The proposed method is tested on datasets and acceptable results are observed.
Similar Papers
A Registration-Based Star-Shape Segmentation Model and Fast Algorithms
CV and Pattern Recognition
Finds star shapes in messy pictures.
Statistical analysis of multivariate planar curves and applications to X-ray classification
Methodology
Finds heart problems in X-rays using shapes.
Object-Centric Cropping for Visual Few-Shot Classification
CV and Pattern Recognition
Helps computers identify objects even with few examples.