2064 search results - page 275 / 413 » Segmentation Problems |
141
Voted
DMTCS
2010
14 years 10 months ago
2010
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
135
click to vote
COMPGEOM
2007
ACM
15 years 2 months ago
2007
ACM
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full l...
88
Voted
ICPR
2004
IEEE
16 years 1 months ago
2004
IEEE
Recent work has shown tracking groups of lines through the parameter space represented by a Hough accumulator array to be efficient and insensitive to both occlusion and changes i...
115
click to vote
ACCV
2006
Springer
15 years 6 months ago
2006
Springer
Performing segmentation of narrow, elongated structures with low contrast boundaries is a challenging problem. Boundaries of these structures are difficult to be located when noise...
102
click to vote
ICIP
2009
IEEE
16 years 1 months ago
2009
IEEE
H.264/AVC has brought an important increase in coding efficiency in comparison to previous video coding standards. One of its features is the use of macroblock partitioning in a t...