Efficient Retrieval by Deformed and Occluded Shapes (2000) [1 citations — 1 self]
Download:
pdf
by Zusheng Rao, Euripides G. M, Petrakis Evangelos Milios
In Intern. Conference on Pattern Recognition (ICPR’00
http://www.ced.tuc.gr/~petrakis/publications/rapemi00.pdf
Add To MetaCart
Abstract:
We propose an approach for matching deformed and occluded shapes using Dynamic Programming (DP). Our algorithms handle noise and shape distortions by allowing matching of merged sequences of consecutive small segments in a shape, with larger segments of another shape, while being invariant to translation, scale and orientation transformations of shapes. We illustrate the effectiveness of our algorithms in retrieval of shapes on two different twodimensional datasets, one of static hand gesture shapes and another of marine life shapes. 1.
Citations
| 86 | Efficient and Robust Retrieval by Shape Content through – Mokhtarian, Abbasi, et al. - 1997 |
| 71 | Shape-based retrieval: A case study with trademark image databases – Jain, Vailaya - 1998 |
| 55 | Shape measures for content based image retrieval: A comparison – Mehtre, Kankanhalli, et al. - 1997 |
| 23 | Learning Visual Models from Shape Contours Using Multiscale Convex/Concave Structure Matching – Ueda, Suzuki - 1993 |
| 22 | Shape retrieval based on dynamic programming – Milios, Petrakis - 2000 |
| 20 | Shape Matching using Curvature Processes – Milios - 1989 |
| 1 | Retrieval of Deformed and Occluded Shapes using Dynamic Programming – Rao, Milios, et al. - 1999 |
