817 search results - page 36 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
144
Voted
CVPR
2011
IEEE
14 years 7 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
241
click to vote
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
Multiple surface searching with only image intensity information is a difficult job in the presence of high noise and weak edges. We present in this paper a novel method for global...
112
Voted
ICASSP
2008
IEEE
15 years 9 months ago
2008
IEEE
In this paper, we cast discriminative training problems into standard linear programming (LP) optimization. Besides being convex and having globally optimal solution(s), LP progra...
131
Voted
GD
2006
Springer
15 years 7 months ago
2006
Springer
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
125
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...