Sciweavers

101 search results - page 1 / 21
» Fast approximation of the permanent for very dense problems
Sort
View
SODA
2008
ACM
122views Algorithms» more  SODA 2008»
13 years 6 months ago
Fast approximation of the permanent for very dense problems
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...
Mark Huber, Jenny Law
CORR
2011
Springer
215views Education» more  CORR 2011»
12 years 8 months ago
The Bethe Permanent of a Non-Negative Matrix
:  The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...
Pascal O. Vontobel
ACCV
2007
Springer
13 years 10 months ago
Fast 3-D Interpretation from Monocular Image Sequences on Large Motion Fields
Abstract. This paper proposes a fast method for dense 3-D interpretation to directly estimate a dense map of relative depth and motion from a monocular sequence of images on large ...
Jong-Sung Kim, Ki-Sang Hong
CVPR
2005
IEEE
13 years 6 months ago
Dense Photometric Stereo Using Tensorial Belief Propagation
We address the normal reconstruction problem by photometric stereo using a uniform and dense set of photometric images captured at fixed viewpoint. Our method is robust to spurio...
Kam-Lun Tang, Chi-Keung Tang, Tien-Tsin Wong
CIMAGING
2009
184views Hardware» more  CIMAGING 2009»
13 years 5 months ago
Fast space-varying convolution and its application in stray light reduction
Space-varying convolution often arises in the modeling or restoration of images captured by optical imaging systems. For example, in applications such as microscopy or photography...
Jianing Wei, Guangzhi Cao, Charles A. Bouman, Jan ...