Sciweavers

38 search results - page 3 / 8
» Stereo matching using random walks
Sort
View
ECCV
2002
Springer
14 years 9 months ago
Finding the Largest Unambiguous Component of Stereo Matching
Abstract. Stereo matching is an ill-posed problem for at least two principal reasons: (1) because of the random nature of match similarity measure and (2) because of structural amb...
Radim Sára
IJCV
2007
178views more  IJCV 2007»
13 years 7 months ago
Stereo for Image-Based Rendering using Image Over-Segmentation
In this paper, we propose a stereo method specifically designed for image-based rendering. For effective image-based rendering, the interpolated views need only be visually plaus...
C. Lawrence Zitnick, Sing Bing Kang
ICPR
2010
IEEE
14 years 2 months ago
Continuous Markov Random Field Optimization using Fusion Move Driven Markov Chain Monte Carlo Technique
Many vision applications have been formulated as Markov Random Field (MRF) problems. Although many of them are discrete labeling problems, continuous formulation often achieves gre...
Wonsik Kim (Seoul National University), Kyoung Mu ...
ECCV
2008
Springer
14 years 9 months ago
Efficiently Learning Random Fields for Stereo Vision with Sparse Message Passing
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
Jerod J. Weinman, Lam Tran, Christopher J. Pal
ERCIMDL
2010
Springer
158views Education» more  ERCIMDL 2010»
13 years 8 months ago
Ranking Entities Using Web Search Query Logs
Abstract Searching for entities is an emerging task in Information Retrieval for which the goal is finding well defined entities instead of documents matching the query terms. In t...
Bodo Billerbeck, Gianluca Demartini, Claudiu S. Fi...