Sciweavers

1133 search results - page 185 / 227
» Basics of Graph Cuts
Sort
View
ICCV
2009
IEEE
2301views Computer Vision» more  ICCV 2009»
15 years 1 months ago
Class Segmentation and Object Localization with Superpixel Neighborhoods
We propose a method to identify and localize object classes in images. Instead of operating at the pixel level, we advocate the use of superpixels as the basic unit of a class s...
Brian Fulkerson, Andrea Vedaldi, Stefano Soatto
ICCV
2003
IEEE
14 years 11 months ago
A Bayesian Network Framework for Relational Shape Matching
A Bayesian network formulation for relational shape matching is presented. The main advantage of the relational shape matching approach is the obviation of the non-rigid spatial m...
Anand Rangarajan, James M. Coughlan, Alan L. Yuill...
ICML
2006
IEEE
14 years 9 months ago
A new approach to data driven clustering
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
Arik Azran, Zoubin Ghahramani
ICCD
2005
IEEE
128views Hardware» more  ICCD 2005»
14 years 5 months ago
Automatic Synthesis of Composable Sequential Quantum Boolean Circuits
This paper presents a methodology to transfer self-timed circuit specifications into sequential quantum Boolean circuits (SQBCs) and composable SQBCs (CQBCs). State graphs (SGs) a...
Li-Kai Chang, Fu-Chiung Cheng
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
14 years 3 months ago
Iterative Rounding for Multi-Objective Optimization Problems
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
Fabrizio Grandoni, R. Ravi, Mohit Singh