Sciweavers

22 search results - page 1 / 5
» A Computer-Assisted Colorization Approach Based on Efficient...
Sort
View
CIARP
2009
Springer
13 years 2 months ago
A Computer-Assisted Colorization Approach Based on Efficient Belief Propagation and Graph Matching
Abstract. Region-based approaches have been proposed to computerassisted colorization problem, typically using shape similarity and topology relations between regions. Given a colo...
Alexandre Noma, Luiz Velho, Roberto M. Cesar
NIPS
2008
13 years 6 months ago
Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
Lukas Kroc, Ashish Sabharwal, Bart Selman
ICIP
2007
IEEE
14 years 6 months ago
Multicues 2D Articulated Pose Tracking using Particle Filtering and Belief Propagation on Factor Graphs
This paper describes a method for articulated upper body tracking in monocular scenes. The compatibility between model and the image is estimated using one particle filter for eac...
Philippe Noriega, Olivier Bernier
ACCV
2010
Springer
12 years 11 months ago
Four Color Theorem for Fast Early Vision
Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these problems using Markov Random Fields. Although this formula...
Radu Timofte, Luc J. Van Gool
CVPR
2004
IEEE
14 years 6 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