Sciweavers

138 search results - page 16 / 28
» A Generalized Sampling Theorem for Reconstructions in Arbitr...
Sort
View
MLDM
2005
Springer
14 years 6 days ago
Linear Manifold Clustering
In this paper we describe a new cluster model which is based on the concept of linear manifolds. The method identifies subsets of the data which are embedded in arbitrary oriented...
Robert M. Haralick, Rave Harpaz
RT
2001
Springer
13 years 11 months ago
Path Differentials and Applications
Abstract. Photo-realistic rendering algorithms such as Monte Carlo ray tracing sample individual paths to compute images. Noise and aliasing artefacts are usually reduced by supers...
Frank Suykens, Yves D. Willems
ICCV
2005
IEEE
14 years 10 days ago
Patch Based Blind Image Super Resolution
In this paper, a novel method for learning based image super resolution (SR) is presented. The basic idea is to bridge the gap between a set of low resolution (LR) images and the ...
Qiang Wang, Xiaoou Tang, Harry Shum
ICASSP
2007
IEEE
13 years 10 months ago
A Framework for wavelet-Based Analysis and Processing of Color Filter Array Images with Applications to Denoising and Demosaicin
This paper presents a new approach to demosaicing of spatially sampled image data observed through a color filter array, in which properties of Smith-Barnwell filterbanks are empl...
Keigo Hirakawa, Xiao-Li Meng, Patrick J. Wolfe
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
14 years 7 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer