Sciweavers

285 search results - page 18 / 57
» Illumination invariants based on Markov random fields
Sort
View
ICDE
2008
IEEE
117views Database» more  ICDE 2008»
16 years 7 months ago
Mining Search-Phrase Definitions from Item Descriptions
In this paper, we develop a model for representing term dependence based on Markov Random Fields and present an approach based on Markov Chain Monte Carlo technique for generating ...
Hung V. Nguyen, Hasan Davulcu
ICASSP
2009
IEEE
16 years 24 days ago
Structured variational methods for distributed inference in wireless ad hoc and sensor networks
Abstract –In this paper, a variational message passing framework is proposed for Markov random fields, which is computationally more efficient and admits wider applicability comp...
Yanbing Zhang, Huaiyu Dai
CVPR
2004
IEEE
16 years 8 months ago
Invariant Operators, Small Samples, and the Bias-Variance Dilemma
Invariant features or operators are often used to shield the recognition process from the effect of "nuisance" parameters, such as rotations, foreshortening, or illumina...
Xiaojin Shi, Roberto Manduchi
CIKM
2009
Springer
16 years 19 days ago
A social recommendation framework based on multi-scale continuous conditional random fields
This paper addresses the issue of social recommendation based on collaborative filtering (CF) algorithms. Social recommendation emphasizes utilizing various attributes informatio...
Xin Xin, Irwin King, Hongbo Deng, Michael R. Lyu
ICIP
1995
IEEE
16 years 7 months ago
3D super-resolution using generalized sampling expansion
A 3D super-resolution algorithm is proposed below, based on a probabilistic interpretation of the ndimensional version of Papoulis' generalized sampling theorem. The algorith...
Hassan Shekarforoush, Marc Berthod, Josiane Zerubi...