Sciweavers

98 search results - page 12 / 20
» Segment-Based Stereo Matching Using Graph Cuts
Sort
View
ICPR
2008
IEEE
15 years 6 months ago
Resolution enhancement for binocular stereo
Traditional stereo algorithms estimate disparity at the same resolution as the observations. In this work we address the problem of estimating disparity and occlusion information ...
Arnav V. Bhavsar, A. N. Rajagopalan
ICIP
2010
IEEE
14 years 9 months ago
3D vertebrae segmentation using graph cuts with shape prior constraints
Osteoporosis is a bone disease characterized by a reduction in bone mass, resulting in an increased risk of fractures. To diagnose the osteoporosis accurately, bone mineral densit...
Melih S. Aslan, Asem M. Ali, Dongqing Chen, Ben Ar...
ICPR
2010
IEEE
14 years 9 months ago
3D Vertebral Body Segmentation Using Shape Based 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 propose a novel 3D shape based met...
Melih S. Aslan, Asem M. Ali, Aly A. Farag, Ham M. ...
CVPR
2009
IEEE
16 years 7 months ago
Efficient Planar Graph Cuts with Applications in Computer Vision
We present a fast graph cut algorithm for planar graphs. It is based on the graph theoretical work [2] and leads to an efficient method that we apply on shape matching and im- a...
Daniel Cremers, Eno Töppe, Frank R. Schmidt
84
Voted
IJCV
2002
156views more  IJCV 2002»
14 years 11 months ago
Trinocular Stereo Using Shortest Paths and the Ordering Constraint
This paper describes a new algorithm for disparity estimation using trinocular stereo. The three cameras are placed in a right angled configuration. A graph is then constructed wh...
Motilal Agrawal