Sciweavers

142 search results - page 5 / 29
» Computing Maximum-Scoring Segments in Almost Linear Time
Sort
View
PAMI
2010
245views more  PAMI 2010»
13 years 5 months ago
A Combinatorial Solution for Model-Based Image Segmentation and Real-Time Tracking
—We propose a combinatorial solution to determine the optimal elastic matching of a deformable template to an image. The central idea is to cast the optimal matching of each temp...
Thomas Schoenemann, Daniel Cremers
CG
2006
Springer
13 years 7 months ago
Drawing lines by uniform packing
In this paper, we introduce a new approach to line drawing that attempts to maintain a uniform packing density of horizontal segments to diagonal segments throughout the line. Whi...
Asif-ul Haque, Mohammad Saifur Rahman, Mehedi Bakh...
COMPGEOM
2010
ACM
14 years 14 days ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
DAGM
2008
Springer
13 years 9 months ago
Segmentation of SBFSEM Volume Data of Neural Tissue by Hierarchical Classification
Three-dimensional electron-microscopic image stacks with almost isotropic resolution allow, for the first time, to determine the complete connection matrix of parts of the brain. I...
Björn Andres, Ullrich Köthe, Moritz Helm...
SMA
2008
ACM
396views Solid Modeling» more  SMA 2008»
13 years 7 months ago
Fast mesh segmentation using random walks
3D mesh models are now widely available for use in various applications. The demand for automatic model analysis and understanding is ever increasing. Mesh segmentation is an impo...
Yu-Kun Lai, Shi-Min Hu, Ralph R. Martin, Paul L. R...