Sciweavers

1133 search results - page 19 / 227
» Basics of Graph Cuts
Sort
View
SDM
2004
SIAM
163views Data Mining» more  SDM 2004»
13 years 9 months ago
Basic Association Rules
Previous approaches for mining association rules generate large sets of association rules. Such sets are difficult for users to understand and manage. Here, the concept of a restri...
Guichong Li, Howard J. Hamilton
ARSCOM
2005
98views more  ARSCOM 2005»
13 years 7 months ago
Supereulerian planar graphs
We investigate the supereulerian graph problems within planar graphs, and we prove that if a 2-edge-connected planar graph G is at most three edges short of having two edge-disjoi...
Hong-Jian Lai, Deying Li, Jingzhong Mao, Mingquan ...
ISVC
2009
Springer
14 years 7 days ago
A Novel 3D Segmentation of Vertebral Bones from Volumetric CT Images Using Graph Cuts
Bone mineral density (BMD) measurements and fracture analysis of the spine bones are restricted to the Vertebral bodies (VBs). In this paper, we present a novel and fast 3D segment...
Melih S. Aslan, Asem M. Ali, Ham M. Rara, Ben Arno...
DAGM
2009
Springer
13 years 8 months ago
A Gradient Descent Approximation for Graph Cuts
Abstract. Graph cuts have become very popular in many areas of computer vision including segmentation, energy minimization, and 3D reconstruction. Their ability to find optimal res...
Alparslan Yildiz, Yusuf Sinan Akgul
ICIP
2010
IEEE
13 years 5 months ago
Image partitioning with kernel mapping and graph cuts
A novel multiregion graph cut image partitioning method combined with kernel mapping is presented. A kernel function transforms implicitly the image data into data of a higher dim...
Mohamed Ben Salah, Amar Mitiche, Ismail Ben Ayed