Sciweavers

1554 search results - page 115 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
197
Voted
CVPR
2009
IEEE
1372views Computer Vision» more  CVPR 2009»
16 years 10 months ago
Blind motion deblurring from a single image using sparse approximation
Restoring a clear image from a single motion-blurred image due to camera shake has long been a challenging problem in digital imaging. Existing blind deblurring techniques eithe...
Jian-Feng Cai (National University of Singapore), ...
122
Voted
ICML
2004
IEEE
16 years 4 months ago
A multiplicative up-propagation algorithm
We present a generalization of the nonnegative matrix factorization (NMF), where a multilayer generative network with nonnegative weights is used to approximate the observed nonne...
Jong-Hoon Ahn, Seungjin Choi, Jong-Hoon Oh
126
Voted
ICIP
2003
IEEE
16 years 5 months ago
Fast GEM wavelet-based image deconvolution algorithm
The paper proposes a new wavelet-based Bayesian approach to image deconvolution, under the space-invariant blur and additive white Gaussian noise assumptions. Image deconvolution ...
José M. Bioucas-Dias
153
Voted
ICIP
2003
IEEE
16 years 5 months ago
Shape analysis algorithm based on information theory
In this paper, we describe an algorithm to measure the shape complexity for discrete approximations of planar curves in 2D images and manifold surfaces for 3D triangle meshes. We ...
Andreas Koschan, Besma Roui-Abidi, David L. Page, ...
136
Voted
MOC
2002
135views more  MOC 2002»
15 years 3 months ago
A fast spherical harmonics transform algorithm
The spectral method with discrete spherical harmonics transform plays an important role in many applications. In spite of its advantages, the spherical harmonics transform has a dr...
Reiji Suda, Masayasu Takami