Sciweavers

724 search results - page 15 / 145
» Practical Performance of Efficient Minimum Cut Algorithms
Sort
View
ISCAS
1994
IEEE
131views Hardware» more  ISCAS 1994»
15 years 3 months ago
An Efficient Design Method for Optimal Weighted Median Filtering
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
Ruikang Yang, Moncef Gabbouj, Yrjö Neuvo
MVA
2008
305views Computer Vision» more  MVA 2008»
14 years 11 months ago
A new graph cut-based multiple active contour algorithm without initial contours and seed points
This paper presents a new graph cut-based multiple active contour algorithm to detect optimal boundaries and regions in images without initial contours and seed points. The task of...
Jong-Sung Kim, Ki-Sang Hong

Publication
592views
16 years 8 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
IBPRIA
2005
Springer
15 years 5 months ago
A New Algorithm for Pattern Optimization in Protein-Protein Interaction Extraction System
Abstract. In pattern matching based Protein-Protein Interaction Extraction systems, patterns generated manually or automatically exist erroneous and redundancy, which greatly affec...
Yu Hao, Xiaoyan Zhu, Ming Li
MICCAI
2006
Springer
16 years 19 days ago
Accurate Banded Graph Cut Segmentation of Thin Structures Using Laplacian Pyramids
The Graph Cuts method of interactive segmentation has become very popular in recent years. This method performs at interactive speeds for smaller images/volumes, but an unacceptabl...
Ali Kemal Sinop, Leo Grady