Sciweavers

1404 search results - page 224 / 281
» Optimization problems in multiple-interval graphs
Sort
View
ICCV
2009
IEEE
16 years 2 months ago
Beyond Connecting the Dots: A Polynomial-time Algorithm for Segmentation and Boundary Estimation with Imprecise User Input
We propose a polynomial-time algorithm for segmentation and (open) boundary estimation which takes into account a series of user-specified attraction points. In contrast to exis...
Thomas Windheuser, Thomas Schoenemann, Daniel Crem...
61
Voted
CVPR
2010
IEEE
15 years 5 months ago
Parallel Graph-cuts by Adaptive Bottom-up Merging
Graph-cuts optimization is prevalent in vision and graphics problems. It is thus of great practical importance to parallelize the graph-cuts optimization using today’s ubiquitou...
Jiangyu Liu, Jian Sun
CORR
2010
Springer
140views Education» more  CORR 2010»
14 years 9 months ago
Image Segmentation by Discounted Cumulative Ranking on Maximal Cliques
We propose a mid-level image segmentation framework that combines multiple figure-ground hypothesis (FG) constrained at different locations and scales, into interpretations that t...
João Carreira, Adrian Ion, Cristian Sminchi...
ML
2008
ACM
14 years 9 months ago
Margin-based first-order rule learning
Abstract We present a new margin-based approach to first-order rule learning. The approach addresses many of the prominent challenges in first-order rule learning, such as the comp...
Ulrich Rückert, Stefan Kramer
GIS
2005
ACM
15 years 10 months ago
Contraflow network reconfiguration for evacuation planning: a summary of results
Contraflow, or lane reversal, is a way of increasing outbound capacity of a real network by reversing the direction of inbound roads during evacuations. The contraflow is consider...
Sangho Kim, Shashi Shekhar