Results 1  10
of
248
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 220 (2 self)
 Add to MetaCart
(Show Context)
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.
Collision Detection for Interactive Graphics Applications
 IEEE Transactions on Visualizationand Computer Graphics
, 1995
"... ..."
(Show Context)
FORMS: A Flexible Object Recognition and Modeling System
 International Journal of Computer Vision
, 1995
"... We describe a flexible object recognition and modeling system (FORMS) which represents and recognizes animate objects from their silhouettes. This consists of a model for generating the shapes of animate objects which gives a formalism for solving the inverse problem of object recognition. We model ..."
Abstract

Cited by 152 (11 self)
 Add to MetaCart
(Show Context)
We describe a flexible object recognition and modeling system (FORMS) which represents and recognizes animate objects from their silhouettes. This consists of a model for generating the shapes of animate objects which gives a formalism for solving the inverse problem of object recognition. We model all objects at three levels of complexity: (i) the primitives, (ii) the midgrained shapes, which are deformations of the primitives, and (iii) objects constructed by using a grammar to join midgrained shapes together. The deformations of the primitives can be characterized by principal component analysis or modal analysis. When doing recognition the representations of these objects are obtained in a bottomup manner from their silhouettes by a novel method for skeleton extraction and part segmentation based on deformable circles. These representations are then matched to a database of prototypical objects to obtain a set of candidate interpretations. These interpretations are verified in a...
Segmentation, registration, and measurement of shape variation via image object shape
 IEEE Transactions on Medical Imaging
, 1999
"... A model of object shape by nets of medial and boundary primitives is justified as richly capturing multiple aspects of shape and yet requiring representation space and image analysis work proportional to the number of primitives. Metrics are described that compute an object representation's pri ..."
Abstract

Cited by 139 (24 self)
 Add to MetaCart
(Show Context)
A model of object shape by nets of medial and boundary primitives is justified as richly capturing multiple aspects of shape and yet requiring representation space and image analysis work proportional to the number of primitives. Metrics are described that compute an object representation's prior probability of local geometry by reflecting variabilities in the net's node and link parameter values and that compute a likelihood function measuring the degree of match of an image to that object representation. A paradigm for image analysis of deforming such a model to optimize a posterior probability is described, and this paradigm is shown to be usable as a uniform approach for object definition, objectbased registration between images of the same or different imaging modalities, and measurement of shape variation of an abnormal anatomical object compared with a normal. Examples of applications of these methods in radiotherapy, surgery, and psychiatry are given.
Hierarchic Voronoi Skeletons
, 1995
"... Robust and timeefficient skeletonization of a (planar) shape, which is connectivity preserving and based on Euclidean metrics, can be achieved by first regularizing the Voronoi diagram (VD) of a shape's boundary points, i.e., by removal of noisesensitive parts of the tessellation and then by ..."
Abstract

Cited by 133 (3 self)
 Add to MetaCart
Robust and timeefficient skeletonization of a (planar) shape, which is connectivity preserving and based on Euclidean metrics, can be achieved by first regularizing the Voronoi diagram (VD) of a shape's boundary points, i.e., by removal of noisesensitive parts of the tessellation and then by establishing a hierarchic organization of skeleton constituents. Each component of the VD is attributed with a measure of prominence which exhibits the expected invariance under geometric transformations and noise. The second processing step, a hierarchic clustering of skeleton branches, leads to a multiresolution representation of the skeleton, termed skeleton pyramid.
Principal geodesic analysis for the study of nonlinear statistics of shape
 IEEE TRANSACTIONS ON MEDICAL IMAGING
, 2004
"... A primary goal of statistical shape analysis is to describe the variability of a population of geometric objects. A standard technique for computing such descriptions is principal component analysis. However, principal component analysis is limited in that it only works for data lying in a Euclidean ..."
Abstract

Cited by 124 (34 self)
 Add to MetaCart
A primary goal of statistical shape analysis is to describe the variability of a population of geometric objects. A standard technique for computing such descriptions is principal component analysis. However, principal component analysis is limited in that it only works for data lying in a Euclidean vector space. While this is certainly sufficient for geometric models that are parameterized by a set of landmarks or a dense collection of boundary points, it does not handle more complex representations of shape. We have been developing representations of geometry based on the medial axis description or mrep. While the medial representation provides a rich language for variability in terms of bending, twisting, and widening, the medial parameters are not elements of a Euclidean vector space. They are in fact elements of a nonlinear Riemannian symmetric space. In this paper, we develop the method of principal geodesic analysis, a generalization of principal component analysis to the manifold setting. We demonstrate its use in describing the variability of mediallydefined anatomical objects. Results of applying this framework on a population of hippocampi in a schizophrenia study are presented.
Machine recognition of human activities: A survey
, 2008
"... The past decade has witnessed a rapid proliferation of video cameras in all walks of life and has resulted in a tremendous explosion of video content. Several applications such as contentbased video annotation and retrieval, highlight extraction and video summarization require recognition of the a ..."
Abstract

Cited by 116 (0 self)
 Add to MetaCart
(Show Context)
The past decade has witnessed a rapid proliferation of video cameras in all walks of life and has resulted in a tremendous explosion of video content. Several applications such as contentbased video annotation and retrieval, highlight extraction and video summarization require recognition of the activities occurring in the video. The analysis of human activities in videos is an area with increasingly important consequences from security and surveillance to entertainment and personal archiving. Several challenges at various levels of processing—robustness against errors in lowlevel processing, view and rateinvariant representations at midlevel processing and semantic representation of human activities at higher level processing—make this problem hard to solve. In this review paper, we present a comprehensive survey of efforts in the past couple of decades to address the problems of representation, recognition, and learning of human activities from video and related applications. We discuss the problem at two major levels of complexity: 1) “actions ” and 2) “activities. ” “Actions ” are characterized by simple motion patterns typically executed by a single human. “Activities ” are more complex and involve coordinated actions among a small number of humans. We will discuss several approaches and classify them according to their ability to handle varying degrees of complexity as interpreted above. We begin with a discussion of approaches to model the simplest of action classes known as atomic or primitive actions that do not require sophisticated dynamical modeling. Then, methods to model actions with more complex dynamics are discussed. The discussion then leads naturally to methods for higher level representation of complex activities.
Initialization, Noise, Singularities, and Scale in Height Ridge Traversal for Tubular Object Centerline Extraction
, 2002
"... The extraction of the centerlines of tubular objects in two and threedimensional images is a part of many clinical image analysis tasks. One common approach to tubular object centerline extraction is based on intensity ridge traversal. In this paper, we evaluate the effects of initialization, noise ..."
Abstract

Cited by 105 (7 self)
 Add to MetaCart
The extraction of the centerlines of tubular objects in two and threedimensional images is a part of many clinical image analysis tasks. One common approach to tubular object centerline extraction is based on intensity ridge traversal. In this paper, we evaluate the effects of initialization, noise, and singularities on intensity ridge traversal and present multiscale heuristics and optimalscale measures that minimize these effects. Monte Carlo experiments using simulated and clinical data are used to quantify how these "dynamicscale" enhancements address clinical needs regarding speed, accuracy, and automation. In particular, we show that dynamicscale ridge traversal is insensitive to its initial parameter settings, operates with little additional computational overhead, tracks centerlines with subvoxel accuracy, passes branch points, and handles significant image noise. We also illustrate the capabilities of the method for medical applications involving a variety of tubular structures in clinical data from different organs, patients, and imaging modalities.
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 94 (4 self)
 Add to MetaCart
(Show Context)
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.
Reconciling Distance Functions and Level Sets
 Journal of Visual Communication and Image Representation
, 1999
"... This paper is concerned with the simulation of the Partial Differential Equation (PDE) driven evolution of a closed surface by means of an implicit representation. In most applications, the natural choice for the implicit representation is the signed distance function to the closed surface. Osher an ..."
Abstract

Cited by 80 (8 self)
 Add to MetaCart
(Show Context)
This paper is concerned with the simulation of the Partial Differential Equation (PDE) driven evolution of a closed surface by means of an implicit representation. In most applications, the natural choice for the implicit representation is the signed distance function to the closed surface. Osher and Sethian propose to evolve the distance function with a HamiltonJacobi equation. Unfortunately the solution to this equation is not a distance function. As a consequence, the practical application of the level set method is plagued with such questions as when do we have to "reinitialize" the distance function? How do we "reinitialize" the distance function? Etc... which reveal a disagreement between the theory and its implementation. This paper proposes an alternative to the use of HamiltonJacobi equations which eliminates this contradiction: in our method the implicit representation always remains a distance function by construction, and the implementation does not differ from the theory...