Sciweavers

31 search results - page 4 / 7
» Explaining a Result to the End-User: A Geometric Approach fo...
Sort
View
CVPR
2010
IEEE
14 years 2 months ago
Curious Snakes: a minimum-latency solution to the cluttered background problem in active contours
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embe...
Ganesh Sundaramoorthi, Stefano Soatto, Anthony Yez...
CVPR
2010
IEEE
13 years 2 months ago
Curious snakes: A minimum latency solution to the cluttered background problem in active contours
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...
Ganesh Sundaramoorthi, Stefano Soatto, Anthony J. ...
PR
2007
141views more  PR 2007»
13 years 5 months ago
A Riemannian approach to graph embedding
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...
Antonio Robles-Kelly, Edwin R. Hancock
ICIP
2009
IEEE
13 years 3 months ago
Shapes as empirical distributions
We address the problem of shape based classification. We interpret the shape of an object as a probability distribution governing the location of the points of the object. An imag...
Bernardo Rodrigues Pires, José M. F. Moura
NIPS
2001
13 years 7 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio