10 search results - page 2 / 2 » Maximizing the Number of Independent Labels in the Plane |
ICPR
2006
IEEE
13 years 11 months ago
2006
IEEE
A novel stereo matching algorithm is proposed that utilizes color segmentation on the reference image and a selfadapting matching score that maximizes the number of reliable corre...
SDM
2009
SIAM
14 years 2 months ago
2009
SIAM
In active learning, one attempts to maximize classifier performance for a given number of labeled training points by allowing the active learning algorithm to choose which points...
TNN
2010
13 years 8 hour ago
2010
Clustering using the Hilbert Schmidt independence criterion (CLUHSIC) is a recent clustering algorithm that maximizes the dependence between cluster labels and data observations ac...
CCCG
2006
13 years 6 months ago
2006
Every simple planar polygon can undergo only a finite number of pocket flips before becoming convex. Since Erdos posed this as an open problem in 1935, several independent purport...
ICCV
2005
IEEE
13 years 11 months ago
2005
IEEE
Recently, nonrigid shape matching has received more and more attention. For nonrigid shapes, most neighboring points cannot move independently under deformation due to physical co...