Sciweavers

7351 search results - page 149 / 1471
» Segmenting Point Sets
Sort
View
STACS
2010
Springer
15 years 11 months ago
Long Non-crossing Configurations in the Plane
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
Noga Alon, Sridhar Rajagopalan, Subhash Suri
FUN
2007
Springer
120views Algorithms» more  FUN 2007»
15 years 8 months ago
Drawing Borders Efficiently
A spreadsheet, especially MS Excel, is probably one of the most popular software applications for personal-computer users and gives us convenient and user-friendly tools for drawin...
Kazuo Iwama, Eiji Miyano, Hirotaka Ono
ICCVW
1999
Springer
15 years 8 months ago
Characterizing the Performance of Multiple-Image Point-Correspondence Algorithms Using Self-Consistency
A new approach to characterizing the performance of point-correspondencealgorithmsis presented. Instead of relyingon any \ground truth', it uses the self-consistency of the o...
Yvan G. Leclerc, Quang-Tuan Luong, Pascal Fua
FOCM
2002
97views more  FOCM 2002»
15 years 4 months ago
On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point Methods
We consider the Riemannian geometry defined on a convex set by the Hessian of a selfconcordant barrier function, and its associated geodesic curves. These provide guidance for the...
Yu. E. Nesterov, Michael J. Todd
ICCV
2007
IEEE
16 years 6 months ago
Joint Affinity Propagation for Multiple View Segmentation
A joint segmentation is a simultaneous segmentation of registered 2D images and 3D points reconstructed from the multiple view images. It is fundamental in structuring the data fo...
Jianxiong Xiao, Jingdong Wang, Ping Tan, Long Quan