Sciweavers

190 search results - page 22 / 38
» Markov Random Fields with Efficient Approximations
Sort
View
ICCV
2009
IEEE
1069views Computer Vision» more  ICCV 2009»
15 years 14 days ago
An efficient algorithm for Co-segmentation
This paper is focused on the Co-segmentation problem [1] – where the objective is to segment a similar object from a pair of images. The background in the two images may be ar...
Dorit S. Hochbaum, Vikas Singh
CVPR
2004
IEEE
14 years 9 months ago
Efficient Belief Propagation for Early Vision
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
Pedro F. Felzenszwalb, Daniel P. Huttenlocher
ICIP
2008
IEEE
14 years 9 months ago
Efficient BP stereo with automatic paramemeter estimation
In this paper, we propose a series of techniques to enhance the computational performance of existing Belief Propagation (BP) based stereo matching that relies on automatic estima...
Shafik Huq, Andreas Koschan, Besma R. Abidi, Mongi...
ICPR
2008
IEEE
14 years 8 months ago
HOPS: Efficient region labeling using Higher Order Proxy Neighborhoods
We present the Higher Order Proxy Neighborhoods (HOPS) approach to modeling higher order neighborhoods in Markov Random Fields (MRFs). HOPS incorporates more context information i...
Albert Y. C. Chen, Jason J. Corso, Le Wang
ICCAD
2009
IEEE
136views Hardware» more  ICCAD 2009»
13 years 5 months ago
A hierarchical floating random walk algorithm for fabric-aware 3D capacitance extraction
With the adoption of ultra regular fabric paradigms for controlling design printability at the 22nm node and beyond, there is an emerging need for a layout-driven, pattern-based p...
Tarek A. El-Moselhy, Ibrahim M. Elfadel, Luca Dani...