Sciweavers

14 search results - page 3 / 3
» Path smoothing via discrete optimization
Sort
View
MICCAI
2007
Springer
14 years 5 months ago
Non-rigid Image Registration Using Graph-cuts
Non-rigid image registration is an ill-posed yet challenging problem due to its supernormal high degree of freedoms and inherent requirement of smoothness. Graph-cuts method is a p...
Tommy W. H. Tang, Albert C. S. Chung

Publication
592views
15 years 1 months ago
Coupling Graph Cuts and Level Sets
"This paper presents an efficient algorithm for solving one sort of region-based active contour models, i.e. the active contours without edges model. We develop the link betwe...
Xiang Zeng, Wei Chen, and Qunsheng Peng
SODA
2010
ACM
197views Algorithms» more  SODA 2010»
14 years 2 months ago
Quasirandom Load Balancing
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
ICASSP
2009
IEEE
13 years 11 months ago
Multi-level non-rigid image registration using graph-cuts
Non-rigid image registration is widely used in medical image analysis and image processing. It remains a challenging research problem due to its smoothness requirement and high de...
Ronald W. K. So, Albert C. S. Chung