Sciweavers

11151 search results - page 236 / 2231
» On the Complexity of Model Expansion
Sort
View
ICCV
2005
IEEE
16 years 9 months ago
Fixed Point Probability Field for Complex Occlusion Handling
In this paper, we show that in a multi-camera context, we can effectively handle occlusions in real-time at each frame independently, even when the only available data comes from ...
François Fleuret, Pascal Fua, Richard Lenga...
ICIP
2002
IEEE
16 years 8 months ago
Satellite and aerial image deconvolution using an EM method with complex wavelets
In this paper, we present a new deconvolution method, able to deal with noninvertible blurring functions. To avoid noise amplification, a prior model of the image to be reconstruc...
André Jalobeanu, Josiane Zerubia, Má...
APPROX
2009
Springer
118views Algorithms» more  APPROX 2009»
16 years 1 months ago
Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND
The AND problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (NO instance) or all t bits are set to 1 (YES instance). In this note...
T. S. Jayram
ICPR
2008
IEEE
16 years 1 months ago
Double-edge-model based character stroke extraction from complex backgrounds
Global gray-level thresholding techniques such as Otsu’s method, and local gray-level thresholding techniques such as adaptive thresholding method are powerful in extracting cha...
Jing Yu, Lei Huang, Changping Liu
CIE
2007
Springer
16 years 1 months ago
The Complexity of Quickly ORM-Decidable Sets
Abstract. The Ordinal Register Machine (ORM) is one of several different machine models for infinitary computability. We classify, by complexity, the sets that can be decided quic...
Joel David Hamkins, David Linetsky, Russell G. Mil...