Sciweavers

7351 search results - page 37 / 1471
» Segmenting Point Sets
Sort
View
MICCAI
2006
Springer
14 years 9 months ago
Cell Segmentation Using Coupled Level Sets and Graph-Vertex Coloring
Sumit Kumar Nath, Kannappan Palaniappan, Filiz Bun...
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
13 years 10 months ago
Iterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
David Eppstein, Jeff Erickson
IJCNN
2006
IEEE
14 years 2 months ago
Improved Snake Model for Fast Image Segmentation
—This paper presents an Improved Snake Model (ISM) effective for performing fast image segmentation. The work takes advantage of two well-known snake models of Balloon [1] and GG...
Chi-Cheng Ting, Jhan-Syuan Yu, Jiun-Shuen Tzeng, J...
VLDB
2002
ACM
188views Database» more  VLDB 2002»
13 years 8 months ago
Continuous Nearest Neighbor Search
A continuous nearest neighbor query retrieves the nearest neighbor (NN) of every point on a line segment (e.g., "find all my nearest gas stations during my route from point s...
Yufei Tao, Dimitris Papadias, Qiongmao Shen
TSMC
2008
162views more  TSMC 2008»
13 years 8 months ago
Real-Time Motion Segmentation of Sparse Feature Points at Any Speed
Abstract--We present a real-time incremental approach to motion segmentation operating on sparse feature points. In contrast to previous work, the algorithm allows for a variable n...
Shrinivas J. Pundlik, Stanley T. Birchfield