Coarse-to-Fine Multiscale Affine Invariant Shape Matching and Classification

Authors:
I. A. El Rube;M. Ahmed;M. Kamel
Affiliations:
University of Waterloo, Canada;Wilfrid Laurier University, Canada;University of Waterloo, Canada
Venue:
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 2 - Volume 02
Year:
2004

Citing 0
Cited 8

Shape retrieval using triangle-area representation and dynamic space warping

Pattern Recognition
Affine invariant matching of broken boundaries based on particle swarm optimization

Image and Vision Computing
Enhanced affine invariant matching of broken boundaries based on particle swarm optimization and the dynamic migrant principle

Applied Soft Computing
Affine invariant matching of broken boundaries based on simple genetic algorithm and contour reconstruction

Pattern Recognition Letters
Affine invariant matching of broken boundaries in noisy images based on the quality migrant injection genetic algorithm and a successive erosion and distance accumulation scheme

Applied Soft Computing
A Graphics Processing Unit Accelerated Genetic Algorithm for Affine Invariant Matching of Broken Contours

Journal of Signal Processing Systems
Fast affine invariant shape matching from 3d images based on the distance association map and the genetic algorithm

ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part IV
Coarse to fine K nearest neighbor classifier

Pattern Recognition Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a multiscale algorithm for matching and classifying 2-D shapes is developed. The algorithm uses the 1-D Dyadic Wavelet Transform (DWT) to decompose a shape's boundary into multiscale levels. Then the coarse to fine matching and classification are achieved in two stages. In the first stage, the global features are extracted by calculating the curve moment invariants of the approximation coefficients. By calculating the normalized cross correlation of the 1-D triangle area representation of the detail coefficients, the local similarity is achieved by the second stage. The proposed algorithm is invariant to the affine transformation and to the boundary starting point variation. In addition, the results demonstrate that the new algorithm is not sensitive to small boundary deformations.