#### Filter Results:

#### Publication Year

1999

2006

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

—Using a saliency measure based on the global property of contour closure, we have developed a segmentation method which identifies smooth closed contours bounding objects of unknown shape in real images. The saliency measure incorporates the Gestalt principles of proximity and good continuity that previous methods have also exploited. Unlike previous… (More)

We develop a multi-class object detection framework whose core component is a nearest neighbor search over object part classes. The performance of the overall system is critically dependent on the distance measure used in the nearest neighbor search. A distance measure that minimizes the mis-classification risk for the 1-nearest neighbor search can be shown… (More)

Astract: The estimation of the projective structure of a scene from image correspondences can be formulated as the minimization of the mean-squared distance between predicted and observed image points with respect to the projection matrices, the scene point positions, and their depths. Since these unknowns are not independent, constraints must be chosen to… (More)

Using a saliency measure based on the global property of contour closure, we have developed a method that reliably segments out salient contours bounding unknown objects from real edge images. The measure also incorporates the Gestalt principles of proximity and smooth continuity that previous methods have exploited. Unlike previous measures, we incorporate… (More)

The optimal distance measure for a given discrimination task under the nearest neighbor framework has been shown to be the likelihood that a pair of measurements have different class labels [5]. For implementation and efficiency considerations, the optimal distance measure was approximated by combining more elementary distance measures defined on simple… (More)

We approach the task of object discrimination as that of learning efficient " codes " for each object class in terms of responses to a set of chosen discriminants. We formulate this approach in an energy minimization framework. The " code " is built incrementally by successively constructing discriminants that focus on pairs of training images of objects… (More)

Many modeling tasks in computer vision. e.g. structure from motion, shape/reeectance from shading , lter synthesis have a low-dimensional intrinsic structure even though the dimension of the input data can be relatively large. We propose a simple but surprisingly eeective iterative randomized algorithm that drastically cuts down the time required for… (More)

- ‹
- 1
- ›