Results 1  10
of
150
Shape Matching and Object Recognition Using Shape Contexts
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2001
"... We present a novel approach to measuring similarity between shapes and exploit it for object recognition. In our framework, the measurement of similarity is preceded by (1) solv ing for correspondences between points on the two shapes, (2) using the correspondences to estimate an aligning transform ..."
Abstract

Cited by 1787 (21 self)
 Add to MetaCart
(Show Context)
We present a novel approach to measuring similarity between shapes and exploit it for object recognition. In our framework, the measurement of similarity is preceded by (1) solv ing for correspondences between points on the two shapes, (2) using the correspondences to estimate an aligning transform. In order to solve the correspondence problem, we attach a descriptor, the shape context, to each point. The shape context at a reference point captures the distribution of the remaining points relative to it, thus offering a globally discriminative characterization. Corresponding points on two similar shapes will have similar shape con texts, enabling us to solve for correspondences as an optimal assignment problem. Given the point correspondences, we estimate the transformation that best aligns the two shapes; reg ularized thin plate splines provide a flexible class of transformation maps for this purpose. The dissimilarity between the two shapes is computed as a sum of matching errors between corresponding points, together with a term measuring the magnitude of the aligning trans form. We treat recognition in a nearestneighbor classification framework as the problem of finding the stored prototype shape that is maximally similar to that in the image. Results are presented for silhouettes, trademarks, handwritten digits and the COIL dataset.
CONDENSATION  conditional density propagation for visual tracking
 International Journal of Computer Vision
, 1998
"... The problem of tracking curves in dense visual clutter is challenging. Kalman filtering is inadequate because it is based on Gaussian densities which, being unimodal, cannot represent simultaneous alternative hypotheses. The Condensation algorithm uses "factored sampling", previously appli ..."
Abstract

Cited by 1499 (12 self)
 Add to MetaCart
(Show Context)
The problem of tracking curves in dense visual clutter is challenging. Kalman filtering is inadequate because it is based on Gaussian densities which, being unimodal, cannot represent simultaneous alternative hypotheses. The Condensation algorithm uses "factored sampling", previously applied to the interpretation of static images, in which the probability distribution of possible interpretations is represented by a randomly generated set. Condensation uses learned dynamical models, together with visual observations, to propagate the random set over time. The result is highly robust tracking of agile motion. Notwithstanding the use of stochastic methods, the algorithm runs in near realtime. Contents 1 Tracking curves in clutter 2 2 Discretetime propagation of state density 3 3 Factored sampling 6 4 The Condensation algorithm 8 5 Stochastic dynamical models for curve motion 10 6 Observation model 13 7 Applying the Condensation algorithm to videostreams 17 8 Conclusions 26 A Nonline...
Object Detection with Discriminatively Trained Part Based Models
"... We describe an object detection system based on mixtures of multiscale deformable part models. Our system is able to represent highly variable object classes and achieves stateoftheart results in the PASCAL object detection challenges. While deformable part models have become quite popular, their ..."
Abstract

Cited by 1398 (50 self)
 Add to MetaCart
We describe an object detection system based on mixtures of multiscale deformable part models. Our system is able to represent highly variable object classes and achieves stateoftheart results in the PASCAL object detection challenges. While deformable part models have become quite popular, their value had not been demonstrated on difficult benchmarks such as the PASCAL datasets. Our system relies on new methods for discriminative training with partially labeled data. We combine a marginsensitive approach for datamining hard negative examples with a formalism we call latent SVM. A latent SVM is a reformulation of MISVM in terms of latent variables. A latent SVM is semiconvex and the training problem becomes convex once latent information is specified for the positive examples. This leads to an iterative training algorithm that alternates between fixing latent values for positive examples and optimizing the latent SVM objective function.
Shape matching and object recognition using low distortion correspondence
 In CVPR
, 2005
"... We approach recognition in the framework of deformable shape matching, relying on a new algorithm for finding correspondences between feature points. This algorithm sets up correspondence as an integer quadratic programming problem, where the cost function has terms based on similarity of correspond ..."
Abstract

Cited by 421 (15 self)
 Add to MetaCart
(Show Context)
We approach recognition in the framework of deformable shape matching, relying on a new algorithm for finding correspondences between feature points. This algorithm sets up correspondence as an integer quadratic programming problem, where the cost function has terms based on similarity of corresponding geometric blur point descriptors as well as the geometric distortion between pairs of corresponding feature points. The algorithm handles outliers, and thus enables matching of exemplars to query images in the presence of occlusion and clutter. Given the correspondences, we estimate an aligning transform, typically a regularized thin plate spline, resulting in a dense correspondence between the two shapes. Object recognition is then handled in a nearest neighbor framework where the distance between exemplar and query is the matching cost between corresponding points. We show results on two datasets. One is the Caltech 101 dataset (FeiFei, Fergus and Perona), an extremely challenging dataset with large intraclass variation. Our approach yields a 48 % correct classification rate, compared to FeiFei et al’s 16%. We also show results for localizing frontal and profile faces that are comparable to special purpose approaches tuned to faces. 1.
The Use of Active Shape Models For Locating Structures in Medical Images
, 1994
"... This paper describes a technique for building compact models of the shape and appearance of flexible objects (such as organs) seen in 2D images. The models are derived from the statistics of sets of labelled images of examples of the objects. Each model
..."
Abstract

Cited by 371 (23 self)
 Add to MetaCart
This paper describes a technique for building compact models of the shape and appearance of flexible objects (such as organs) seen in 2D images. The models are derived from the statistics of sets of labelled images of examples of the objects. Each model
Boundary Finding with Parametrically Deformable Models
, 1992
"... Introduction This work describes an approach to finding objects in images based on deformable shape models. Boundary finding in two and three dimensional images is enhanced both by considering the bounding contour or surface as a whole and by using modelbased shape information. Boundary finding u ..."
Abstract

Cited by 318 (6 self)
 Add to MetaCart
Introduction This work describes an approach to finding objects in images based on deformable shape models. Boundary finding in two and three dimensional images is enhanced both by considering the bounding contour or surface as a whole and by using modelbased shape information. Boundary finding using only local information has often been frustrated by poorcontrast boundary regions due to occluding and occluded objects, adverse viewing conditions and noise. Imperfect image data can be augmented with the extrinsic information that a geometric shape model provides. In order to exploit modelbased information to the fullest extent, it should be incorporated explicitly, specifically, and early in the analysis. In addition, the bounding curve or surface can be profitably considered as a whole, rather than as curve or surface segments, because it tends to result in a more consistent solution overall. These models are best suited for objects whose diversity and irregularity of shape make
A review of statistical approaches to level set segmentation: Integrating color, texture, motion and shape
 International Journal of Computer Vision
, 2007
"... Abstract. Since their introduction as a means of front propagation and their first application to edgebased segmentation in the early 90’s, level set methods have become increasingly popular as a general framework for image segmentation. In this paper, we present a survey of a specific class of reg ..."
Abstract

Cited by 163 (4 self)
 Add to MetaCart
(Show Context)
Abstract. Since their introduction as a means of front propagation and their first application to edgebased segmentation in the early 90’s, level set methods have become increasingly popular as a general framework for image segmentation. In this paper, we present a survey of a specific class of regionbased level set segmentation methods and clarify how they can all be derived from a common statistical framework. Regionbased segmentation schemes aim at partitioning the image domain by progressively fitting statistical models to the intensity, color, texture or motion in each of a set of regions. In contrast to edgebased schemes such as the classical Snakes, regionbased methods tend to be less sensitive to noise. For typical images, the respective cost functionals tend to have less local minima which makes them particularly wellsuited for local optimization methods such as the level set method. We detail a general statistical formulation for level set segmentation. Subsequently, we clarify how the integration of various low level criteria leads to a set of cost functionals and point out relations between the different segmentation schemes. In experimental results, we demonstrate how the level set function is driven to partition the image plane into domains of coherent color, texture, dynamic texture or motion. Moreover, the Bayesian formulation allows to introduce prior shape knowledge into the level set method. We briefly review a number of advances in this domain.
Mathematical Textbook Of Deformable Neuroanatomies
, 1993
"... Mathematical techniques are presented for the transformation of digital anatomical textbooks from the ideal to the individual, allowing for the representation of the variabilities manifest in normal human anatomies. The ideal textbook is constructed on a fixed coordinate system to contain all of the ..."
Abstract

Cited by 134 (20 self)
 Add to MetaCart
Mathematical techniques are presented for the transformation of digital anatomical textbooks from the ideal to the individual, allowing for the representation of the variabilities manifest in normal human anatomies. The ideal textbook is constructed on a fixed coordinate system to contain all of the information currently available about the physical properties of neuroanatomies. This information is obtained via sensor probes such as magnetic resonance, computed axial and emission tomography, along with symbolic information such as white and gray matter tracts, nuclei, etc. Human variability associated with individuals is accommodated by defining probabilistic transformations on the textbook coordinate system, the transformations forming mathematical translation groups of high dimension. The ideal is applied to the individual patient by finding the transformation which is consistent with physical properties of deformable elastic solids and which brings the coordinate system of the textb...
Diffusion snakes: introducing statistical shape knowledge into the MumfordShah functional
 J. OF COMPUTER VISION
, 2002
"... We present a modification of the MumfordShah functional and its cartoon limit which facilitates the incorporation of a statistical prior on the shape of the segmenting contour. By minimizing a single energy functional, we obtain a segmentation process which maximizes both the grey value homogeneit ..."
Abstract

Cited by 130 (15 self)
 Add to MetaCart
(Show Context)
We present a modification of the MumfordShah functional and its cartoon limit which facilitates the incorporation of a statistical prior on the shape of the segmenting contour. By minimizing a single energy functional, we obtain a segmentation process which maximizes both the grey value homogeneity in the separated regions and the similarity of the contour with respect to a set of training shapes. We propose a closedform, parameterfree solution for incorporating invariance with respect to similarity transformations in the variational framework. We show segmentation results on artificial and realworld images with and without prior shape information. In the cases of noise, occlusion or strongly cluttered background the shape prior significantly improves segmentation. Finally we compare our results to those obtained by a level set implementation of geodesic active contours.
Kernel Density Estimation and Intrinsic Alignment for Knowledgedriven Segmentation: Teaching Level Sets to Walk
 International Journal of Computer Vision
, 2004
"... We address the problem of image segmentation with statistical shape priors in the context of the level set framework. Our paper makes two contributions: Firstly, we propose to generate invariance of the shape prior to certain transformations by intrinsic registration of the evolving level set fun ..."
Abstract

Cited by 114 (16 self)
 Add to MetaCart
We address the problem of image segmentation with statistical shape priors in the context of the level set framework. Our paper makes two contributions: Firstly, we propose to generate invariance of the shape prior to certain transformations by intrinsic registration of the evolving level set function. In contrast to existing approaches to invariance in the level set framework, this closedform solution removes the need to iteratively optimize explicit pose parameters. Moreover, we will argue that the resulting shape gradient is more accurate in that it takes into account the e#ect of boundary variation on the object's pose.