Sciweavers

1483 search results - page 37 / 297
» Geometric constraint satisfaction using optimization methods
Sort
View
ICCV
2001
IEEE
15 years 27 days ago
Segmentation with Pairwise Attraction and Repulsion
We propose a method of image segmentation by integrating pairwise attraction and directional repulsion derived from local grouping and figure-ground cues. These two kinds of pairw...
Stella X. Yu, Jianbo Shi
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
13 years 11 months ago
Cleansing uncertain databases leveraging aggregate constraints
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
14 years 2 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali
ICIP
2010
IEEE
14 years 5 months ago
Real-time content-aware image resizing using reduced linear model
In this paper is presented an effective and efficient method for content-aware image resizing. It is based on the solution of a linear system where each pixel displacement (compres...
Edoardo Ardizzone, Roberto Gallea, Roberto Pirrone
PAMI
2010
139views more  PAMI 2010»
13 years 9 months ago
Order-Preserving Moves for Graph-Cut-Based Optimization
— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...
Xiaoqing Liu, Olga Veksler, Jagath Samarabandu