142 search results - page 4 / 29 » Computing Maximum-Scoring Segments in Almost Linear Time |
113
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
148
click to vote
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
We present a parameter free approach that utilizes multiple cues for image segmentation. Beginning with an image, we execute a sequence of bottom-up aggregation steps in which pix...
159
Voted
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
We present a fast graph cut algorithm for planar graphs.
It is based on the graph theoretical work [2] and leads to an
efficient method that we apply on shape matching and im-
a...
125
click to vote
ICPR
2008
IEEE
15 years 9 months ago
2008
IEEE
We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast suboptimal algorithm for constrain...
148
click to vote
HUMO
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. In this paper we present a novel tool for body-part segmentation and tracking in the context of multiple camera systems. Our goal is to produce robust motion cues over ti...