Abstract
We have proposed a two-stage framework for polygon retrieval [12, 11] which incorporates both qualitative and quantitative measures of polygons in the first and second stage respectively. In this paper, we introduce an extension to our two-stage framework. We propose a new polygon matching technique using Circular Error Bound and describe how this technique works under translation and scaling of polygons. Base on this technique, we propose a new translation invariant similarity measure for polygons named Minimum Circular Error Bound, which can be used in the second stage of the two-stage framework. We compare the Minimum Circular Error Bound method with the Hausdorf Distance method and demonstrate the advantages of our method.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full chapter text
Chapter PDF
References
P. K. Agarwa, M. Sharir, and S. Toledo. Applications of Parametric Searching in Geometric Optimization. Proc. of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, pages pp. 72–82, 1992.
B. Bhavnagri. A Method for Representing Shape Based on an Equivalent Relation on Polygons. Pattern Recognition, Vol. 27(No. 2):pp. 247–260, 1994.
Daniel P. Huttenlocher and William J. Rucklidge. A Multi-Resolution Technique for Comparing Images Using the Hausdorff Distance. Department of Computer Science, Cornell University, Technical Report TR92-1328, 1992.
H. V. Jagadish. A Retrieval Technique for Similar Shapes. Proc. of the ACM SIGMOD Int. Conf. on the Management of Data, pages pp. 208–217, May 1991.
Helmut Alt, Bernd Behrebds, and Johnnes Blömer. Approximate Matching of Polygonal Shapes. Annals of Mathematics and Artificial Intelligence, Vol. 13:pp. 251–265, 1995.
Jia Guu Leu. Computing a Shape's Moments from its Boundary. Pattern Recognition, Vol. 24(No. 10):pp. 949–957, 1991.
Jonathan Ashley, Ron Barber, Myron Flickner, James Hafner, Denis Lee, Wayne Niblack, and Dragutin Petkovic. Automatic and Semi-Automatic Methods for Image Annotation and Retrieval in QBIC. SPIE, Vol. 2420:pp. 24–35, 1995.
I. King and T. K. Lau. A Feature-Bassed Image Retrieval Database for the Fashion, Textile, and Clothing Industry in Hong Kong. Proc. of International Symposium Multi-Technology Information Processing '96, pages pp. 333–240, 1996.
Pedro Cox, Henri Maitre, Michel Minoux, and Celso Ribeiro. Optimal Matching of Convex Polygons. Pattern Recognition Letters, Vol. 9:pp. 327–334, 1989.
Rajiv Mehrotra and James E. Gary. Feature-Based Retrieval of Similar Shape. Proc. 9th Int. Conf. on Data Engineering, pages pp. 108–115, 1993.
L. H. Tung, I. King, P. F. Fung, and W. S. Lee. A Two-Stage Framework for Efficient Simple Polygon Retrieval in Image Databases, journal = Proc. of International Symposium Multi-Technology Information Processing '96. 1996.
L. H. Tung, I. King, P. F. Fung, and W. S. Lee. Two-Stage Polygon Representation for Efficient Shape Retrieval in Image Databases. Proc. of the 1st International Workshop on Image Databases and Multimedia Search, 1996.
W. Niblack, R. Barber, W. Equitz, M. Flickner, E. Glasman, D. Petkovic, and P. Yanker. The QBIC Project: Querying Images By Content Using Color, Texture, and Shape. SPIE, Vol. 1908:pp. 173–187,1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tung, L.H., King, I. (1997). A two-stage framework for polygon retrieval using Minimum Circular Error Bound. In: Del Bimbo, A. (eds) Image Analysis and Processing. ICIAP 1997. Lecture Notes in Computer Science, vol 1310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63507-6_246
Download citation
DOI: https://doi.org/10.1007/3-540-63507-6_246
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63507-9
Online ISBN: 978-3-540-69585-1
eBook Packages: Springer Book Archive