Sciweavers

185 search results - page 11 / 37
» A Simple Min Cut Algorithm
Sort
View
ICCV
2009
IEEE
15 years 14 days ago
Higher-Order Gradient Descent by Fusion-Move Graph Cut
Markov Random Field is now ubiquitous in many formulations of various vision problems. Recently, optimization of higher-order potentials became practical using higherorder graph...
Hiroshi Ishikawa
SPIESR
2004
110views Database» more  SPIESR 2004»
13 years 9 months ago
Perceptual analysis for music segmentation
In this paper, a music segmentation framework is proposed to segment music streams based on human perception. In the proposed framework, three perceptual features corresponding to...
Min-Hong Jian, Chia-Han Lin, Arbee L. P. Chen
CVPR
2010
IEEE
13 years 9 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...
CP
2009
Springer
14 years 8 months ago
The Complexity of Valued Constraint Models
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
Peter G. Jeavons, Stanislav Zivný
INFOCOM
2009
IEEE
14 years 2 months ago
Cross-Layer Survivability in WDM-Based Networks
—In layered networks, a single failure at a lower layer may cause multiple failures in the upper layers. As a result, traditional schemes that protect against single failures may...
Kyunghan Lee, Eytan Modiano