Sciweavers

666 search results - page 7 / 134
» Unbalanced Graph Cuts
Sort
View
ICIAR
2007
Springer
14 years 4 months ago
Landmark-Based Non-rigid Registration Via Graph Cuts
Abstract. This paper presents an approach based on graph cuts initially used for motion segmentation that is being applied to the nonrigid registration problem. The main contributi...
Herve Lombaert, Yiyong Sun, Farida Cheriet
JMMA
2010
162views more  JMMA 2010»
13 years 4 months ago
Co-clustering Documents and Words by Minimizing the Normalized Cut Objective Function
This paper follows a word-document co-clustering model independently introduced in 2001 by several authors such as I.S. Dhillon, H. Zha and C. Ding. This model consists in creatin...
Charles-Edmond Bichot
CORR
2002
Springer
135views Education» more  CORR 2002»
13 years 9 months ago
Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs
We improve on random sampling techniques for approximately solving problems that involve cuts and flows in graphs. We give a near-linear-time construction that transforms any grap...
András A. Benczúr, David R. Karger
ICPR
2008
IEEE
14 years 4 months ago
Graph cut based deformable model with statistical shape priors
This paper presents a novel graph cut based segmentation approach with shape priors. The model incorporates statistical shape prior information with the active contour without edg...
Noha Youssry El-Zehiry, Adel Elmaghraby
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
13 years 11 months ago
Clustering by weighted cuts in directed graphs
In this paper we formulate spectral clustering in directed graphs as an optimization problem, the objective being a weighted cut in the directed graph. This objective extends seve...
Marina Meila, William Pentney