724 search results - page 11 / 145 » Practical Performance of Efficient Minimum Cut Algorithms |
MICCAI
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. An N-dimensional image is divided into "object" and "background" segments using a graph cut approach. A graph is formed by connecting all pairs of nei...
142
click to vote
ACCV
2007
Springer
15 years 7 months ago
2007
Springer
Normalized Cuts has successfully been applied to a wide range of tasks in computer vision, it is indisputably one of the most popular segmentation algorithms in use today. A number...
142
Voted
SIAMJO
2010
14 years 9 months ago
2010
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
132
click to vote
VLSISP
2002
15 years 2 months ago
2002
Dimensionality reduction is an important problem in pattern recognition. There is a tendency of using more and more features to improve the performance of classifiers. However, not...
106
click to vote
DAC
2006
ACM
16 years 3 months ago
2006
ACM
As a prevalent constraint, sharp slew rate is often required in circuit design which causes a huge demand for buffering resources. This problem requires ultra-fast buffering techn...