1629 search results - page 137 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
CVIU
2008
2008
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
14 years 10 months ago
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
100
click to vote
BMCBI
2010
14 years 10 months ago
2010
Background: Biochemical networks play an essential role in systems biology. Rapidly growing network data and e research activities call for convenient visualization tools to aid i...
ECCV
2008
Springer
15 years 12 months ago
2008
Springer
Many recent techniques for low-level vision problems such as image denoising are formulated in terms of Markov random field (MRF) or conditional random field (CRF) models. Nonethel...
SIGMOD
2003
ACM
15 years 10 months ago
2003
ACM
To facilitate queries over semi-structured data, various structural summaries have been proposed. Structural summaries are derived directly from the data and serve as indices for ...
PAMI
2006
14 years 10 months ago
2006
Efficient segmentation of globally optimal surfaces representing object boundaries in volumetric data sets is important and challenging in many medical image analysis applications....