Results 1 - 10
of
113
A Survey of Shape Analysis Techniques
- Pattern Recognition
, 1998
"... This paper provides a review of shape analysis methods. Shape analysis methods play an important role in systems for object recognition, matching, registration, and analysis. Researchin shape analysis has been motivated, in part, by studies of human visual form perception systems. ..."
Abstract
-
Cited by 171 (2 self)
- Add to MetaCart
This paper provides a review of shape analysis methods. Shape analysis methods play an important role in systems for object recognition, matching, registration, and analysis. Researchin shape analysis has been motivated, in part, by studies of human visual form perception systems.
Shock Graphs and Shape Matching
, 1998
"... We have been developing a theory for the generic representation of 2-D shape, where structural descriptions are derived from the shocks (singularities) of a curve evolution process, acting on bounding contours. We now apply the theory to the problem of shape matching. The shocks are organized into a ..."
Abstract
-
Cited by 160 (26 self)
- Add to MetaCart
We have been developing a theory for the generic representation of 2-D shape, where structural descriptions are derived from the shocks (singularities) of a curve evolution process, acting on bounding contours. We now apply the theory to the problem of shape matching. The shocks are organized into a directed, acyclic shock graph, and complexity is managed by attending to the most significant (central) shape components first. The space of all such graphs is highly structured and can be characterized by the rules of a shock graph grammar. The grammar permits a reduction of a shock graph to a unique rooted shock tree. We introduce a novel tree matching algorithm which finds the best set of corresponding nodes between two shock trees in polynomial time. Using a diverse database of shapes, we demonstrate our system's performance under articulation, occlusion, and changes in viewpoint. Keywords: shape representation; shape matching; shock graph; shock graph grammar; subgraph isomorphism. 1 I...
Gradient Flows and Geometric Active Contour Models
, 1994
"... In this note, we analyze the geometric active contour models proposed in [10, 31] from a curve evolution point of view and propose some modifications based on gradient flows relative to certain new metrics. This leads to a novel snake paradigm in which the feature of interest may be considered to li ..."
Abstract
-
Cited by 157 (12 self)
- Add to MetaCart
In this note, we analyze the geometric active contour models proposed in [10, 31] from a curve evolution point of view and propose some modifications based on gradient flows relative to certain new metrics. This leads to a novel snake paradigm in which the feature of interest may be considered to lie at the bottom of a potential well. Thus the snake is attracted very naturally and efficiently to the desired feature. Moreover, we consider some 3-D active surface models based on these ideas. Key words: Active vision, shape and object representation, object recognition, active contours, snakes, visual tracking, edge detection, segmentation, gradient flows, Riemannian metrics, geometric heat equations, curve and surface evolution. Gradient Flows and Geometric Active Contour Models Abstract In this note, we analyze the geometric active contour models proposed in [10, 31] from a curve evolution point of view and propose some modifications based on gradient flows relative to certain new m...
Efficient and Robust Retrieval by Shape Content through Curvature Scale Space
, 1996
"... . We introduce a very fast and reliable method for shape similarity retrieval in large image databases which is robust with respect to noise, scale and orientation changes of the objects. The maxima of curvature zero crossing contours of Curvature Scale Space (CSS) image are used to represent the sh ..."
Abstract
-
Cited by 112 (1 self)
- Add to MetaCart
. We introduce a very fast and reliable method for shape similarity retrieval in large image databases which is robust with respect to noise, scale and orientation changes of the objects. The maxima of curvature zero crossing contours of Curvature Scale Space (CSS) image are used to represent the shapes of object boundary contours. While a complex boundary is represented by about five pairs of integer values, an effective indexing method based on the aspect ratio of the CSS image, eccentricity and circularity is used to narrow down the range of searching. Since the matching algorithm has been designed to use global information, it is sensitive to major occlusion, but some minor occlusion will not cause any problems. We have tested and evaluated our method on a prototype database of 450 images of marine animals with a vast variety of shapes with very good results. The method can either be used in real applications or produce a reliable shape description for more complicated images when ...
Shape Similarity Measure Based on Correspondence of Visual Parts
- IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2000
"... AbstractÐA cognitively motivated similarity measure is presented and its properties are analyzed with respect to retrieval of similar objects in image databases of silhouettes of 2D objects. To reduce influence of digitization noise, as well as segmentation errors, the shapes are simplified by a nov ..."
Abstract
-
Cited by 98 (28 self)
- Add to MetaCart
AbstractÐA cognitively motivated similarity measure is presented and its properties are analyzed with respect to retrieval of similar objects in image databases of silhouettes of 2D objects. To reduce influence of digitization noise, as well as segmentation errors, the shapes are simplified by a novel process of digital curve evolution. To compute our similarity measure, we first establish the best possible correspondence of visual parts (without explicitly computing the visual parts). Then, the similarity between corresponding parts is computed and aggregated. We applied our similarity measure to shape matching of object contours in various image databases and compared it to well-known approaches in the literature. The experimental results justify that our shape matching procedure gives an intuitive shape correspondence and is stable with respect to noise distortions. Index TermsÐShape representation, shape similarity measure, visual parts, discrete curve evolution. 1
Conformal Curvature Flows: From Phase Transitions to Active Vision
, 1995
"... In this paper, we analyze geometric active contour models from a curve evolution point of view and propose some modifications based on gradient flows relative to certain new feature-based Riemannian metrics. This leads to a novel edge-detection paradigm in which the feature of interest may be consid ..."
Abstract
-
Cited by 97 (25 self)
- Add to MetaCart
In this paper, we analyze geometric active contour models from a curve evolution point of view and propose some modifications based on gradient flows relative to certain new feature-based Riemannian metrics. This leads to a novel edge-detection paradigm in which the feature of interest may be considered to lie at the bottom of a potential well. Thus an edge-seeking curve is attracted very naturally and efficiently to the desired feature. Comparison with the Allen-Cahn model clarifies some of the choices made in these models, and suggests inhomogeneous models which may in return be useful in phase transitions. We also consider some 3-D active surface models based on these ideas. The justification of this model rests on the careful study of the viscosity solutions of evolution equations derived from a level-set approach. Key words: Active vision, antiphase boundary, visual tracking, edge detection, segmentation, gradient flows, Riemannian metrics, viscosity solutions, geometric heat equ...
Shape Descriptors for Non-rigid Shapes with a Single Closed Contour
- Proc. IEEE Conf. Computer Vision and Pattern Recognition
, 2000
"... The Core Experiment CE-Shape-1 for shape descriptors performed for the MPEG-7 standard gave a unique opportunity to compare various shape descriptors for non-rigid shapes with a single closed contour. There are two main differences with respect to other comparison results reported in the literature: ..."
Abstract
-
Cited by 90 (18 self)
- Add to MetaCart
The Core Experiment CE-Shape-1 for shape descriptors performed for the MPEG-7 standard gave a unique opportunity to compare various shape descriptors for non-rigid shapes with a single closed contour. There are two main differences with respect to other comparison results reported in the literature: (1) For each shape descriptor, the experiments were carried out by an institute that is in favor of this descriptor. This implies that the parameters for each system were optimally determined and the implementations were throughly tested. (2) It was possible to compare the performance of shape descriptors based on totally different mathematical approaches. A more theoretical comparison of these descriptors seems to be extremely hard. In this paper we report on the MPEG-7 Core Experiment CE-Shape1. 1.
MPEG-7 visual shape descriptors
- IEEE Trans. Circuits Systems
, 2001
"... This paper describes techniques and tools for shape representation and matching, developed in the context of MPEG-7 standardisation. The application domains for each descriptor are considered, and the contour-based shape descriptor is presented in some detail. Example applications are also shown. ..."
Abstract
-
Cited by 66 (1 self)
- Add to MetaCart
This paper describes techniques and tools for shape representation and matching, developed in the context of MPEG-7 standardisation. The application domains for each descriptor are considered, and the contour-based shape descriptor is presented in some detail. Example applications are also shown.
Symmetry as a Continuous Feature
, 1995
"... Symmetry is treated as a continuous feature and a Continuous Measure of Distance from Symmetry in shapes is defined. The Symmetry Distance (SD) of a shape is defined to be the minimum mean squared distance required to move points of the original shape in order to obtain a symmetrical shape. This gen ..."
Abstract
-
Cited by 65 (4 self)
- Add to MetaCart
Symmetry is treated as a continuous feature and a Continuous Measure of Distance from Symmetry in shapes is defined. The Symmetry Distance (SD) of a shape is defined to be the minimum mean squared distance required to move points of the original shape in order to obtain a symmetrical shape. This general definition of a symmetry measure enables a comparison of the "amount" of symmetry of different shapes and the "amount" of different symmetries of a single shape. This measure is applicable to any type of symmetry in any dimension. The Symmetry Distance gives rise to a method of reconstructing symmetry of occluded shapes. We extend the method to deal with symmetries of noisy and fuzzy data. Finally, we consider grayscale images as 3D shapes, and use the Symmetry Distance to find the orientation of symmetric objects from their images, and to find locally symmetric regions in images.
Convexity Rule for Shape Decomposition Based on Discrete Contour Evolution
- Computer Vision and Image Understanding
, 1999
"... We concentrate here on decomposition of 2D objects into meaningful parts of visual form,orvisual parts. It is a simple observation that convex parts of objects determine visual parts. However, the problem is that many significant visual parts are not convex, since a visual part may have concavities. ..."
Abstract
-
Cited by 56 (18 self)
- Add to MetaCart
We concentrate here on decomposition of 2D objects into meaningful parts of visual form,orvisual parts. It is a simple observation that convex parts of objects determine visual parts. However, the problem is that many significant visual parts are not convex, since a visual part may have concavities. We solve this problem by identifying convex parts at different stages of a proposed contour evolution method in which significant visual parts will become convex object parts at higher stages of the evolution. We obtain a novel rule for decomposition of 2D objects into visual parts, called the hierarchical convexity rule, which states that visual parts are enclosed by maximal convex (with respect to the object) boundary arcs at different stages of the contour evolution. This rule determines not only parts of boundary curves but directly the visual parts of objects. Moreover, the stages of the evolution hierarchy induce a hierarchical structure of the visual parts. The more advanced the stage of contour evolution, the more significant is the shape contribution of the obtained visual parts. c ○ 1999 Academic Press Key Words: visual parts; discrete curve evolution; digital curves; digital straight line segments; total curvature; shape hierarchy; digital geometry. 1.

