Abstract
We present a framework for representing and matching multi-scale, qualitative feature hierarchies. The coarse shape of an object is captured by a set of blobs and ridges, representing compact and elongated parts of an object. These parts, in turn, map to nodes in a directed acyclic graph, in which parent/child edges represent feature overlap, sibling edges join nodes with shared parents, and all edges encode geometric relations between the features. Given two feature hierarchies, represented as directed acyclic graphs, we present an algorithm for computing both similarity and node correspondence in the presence of noise and occlusion. Similarity, in turn, is a function of structural similarity, contextual similarity (geometric relations among neighboring nodes), and node contents similarity. Moreover, the weights of these components can be varied on a node by node basis, allowing a graph-based model to effectively parameterize the saliency of its constraints. We demonstrate the approach on two domains: gesture recognition and face detection.
Dr. Shokoufandeh gratefully acknowledges the support of the US National Science Foundation (NSF-IDM0136337).
Dr. Dickinson gratefully acknowledges the support of NSERC Canada.
Chapter PDF
Similar content being viewed by others
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.
References
L. Bretzner and T. Lindeberg. Qualitative multi-scale feature hierarchies for object tracking. Journal of Visual Communication and Image Representation, 11:115–129, 2000.
P. J. Burt. Attention Mechanisms for Vision in a Dynamic World. In Proceedings of the International Conference on Pattern Recognition, Vol.1, pages 977–987, The Hague, The Netherlands, 1988.
J. L. Crowley and A. C. Sanderson. Multiple Resolution Representation and Probabilistic Matching of 2-D Gray-Scale Shape. IEEE Transactions on Pattern Analysis and Machine Intelligence, 9(1):113–121, January 1987.
H. Gabow, M. Goemans, and D. Williamson. An efficient approximate algorithm for survivable network design problems. Proc. of the Third MPS Conference on Integer Programming and Combinatorial Optimization, pages 57–74, 1993.
I. Laptev and T. Lindeberg. Tracking of multi-state hand models using particle filtering and a hierarchy of multi-scale image features. In Proc. Scale-Space’01, Vancouver, Canada, Jul. 2001.
T. Lindeberg. Detecting Salient Blob-Like Image Structures and Their Scales With a Scale-Space Primal Sketch—A Method for Focus-of-Attention. International Journal of Computer Vision, 11(3):283–318, December 1993.
T. Lindeberg. Edge detection and ridge detection with automatic scale selection. International Journal of Computer Vision, 30:117–154, 1998.
T. Lindeberg. Feature detection with automatic scale selection. International Journal of Computer Vision, 30:77–116, 1998.
L. Lovász and J. Pelicán. On the eigenvalues of a tree. Periodica Math. Hung., 3:1082–1096, 1970.
A. Neumaier. Second largest eigenvalue of a tree. Linear Algebra and its Applications, 46:9–25, 1982.
S. Pizer, C. Sarang, P. Joshi, P. Fletcher, M. Styner, G. Tracton, and J. Chen. Segmentation of single-figure objects by deformable m-reps. In Proceedings, MICCAI, pages 862–871, 2001.
R. P. N. Rao, G. J. Zelinsky, M. M. Hayhoe, and D. H. Ballard. Modeling Saccadic Targeting in Visual Search. In D. Touretzky, M. Mozer, and M. Hasselmo, editors, Advances in Neural Information Processing Systems 8, pages 830–836. MIT Press, Cambridge, MA, 1996.
S. W. Reyner. An analysis of a good algorithm for the subtree problem. SIAM J. Comput., 6:730–732, 1977.
G. Rote. Computing the minimum Hausdorff distance between two-point sets on a line under translation. Information Processing Letters, 38(3):123–127, 1991.
A. Shokoufandeh, I. Marsic, and S. Dickinson. View-based object recognition using saliency maps. Image and Vision Computing, 17:445–460, 1999.
K. Siddiqi, A. Shokoufandeh, S. Dickinson, and S. Zucker. Shock graphs and shape matching. International Journal of Computer Vision, 30:1–24, 1999.
G. Stewart and J.-G. Sun. Matrix Perturbation Theory. Academic Press, San Diego, 1990.
J. Triesch and C. von der Malsburg. Robust classification of hand postures against complex background. In Proc. Int. Conf. on Face and Gesture Recognition, pages 170–175, Killington, Vermont, Oct. 1996.
J. Tsotsos. An inhibitory beam for attentional selection. In L. Harris and M. Jenkin, editors, Spatial Vision in Humans and Robots. Cambridge University Press, 1993.
J. Wilkinson. The Algebraic Eigenvalue Problem. Clarendon Press, Oxford, England, 1965.
L. Wiskott, J.-M. Fellous, N. Krüger, and C. von der Malsburg. Face Recognition by Elastic Bunch Graph Matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(7):775–779, July 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shokoufandeh, A., Dickinson, S., Jönsson, C., Bretzner, L., Lindeberg, T. (2002). On the Representation and Matching of Qualitative Shape at Multiple Scales. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds) Computer Vision — ECCV 2002. ECCV 2002. Lecture Notes in Computer Science, vol 2352. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47977-5_50
Download citation
DOI: https://doi.org/10.1007/3-540-47977-5_50
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43746-8
Online ISBN: 978-3-540-47977-2
eBook Packages: Springer Book Archive