Sciweavers

7930 search results - page 1137 / 1586
» Greedy in Approximation Algorithms
Sort
View
ICIP
1997
IEEE
16 years 8 months ago
Two-Dimensional Blind Deconvolution Using a Robust GCD Approach
In this paper we examine the applicability of the previously proposed Greatest Common Divisor (GCD) method to blind image deconvolution. In this method, the desired image is appro...
S. U. Pillai, B. Liang
ICDE
2006
IEEE
128views Database» more  ICDE 2006»
16 years 8 months ago
Partial Selection Query in Peer-to-Peer Databases
In this paper, we propose DBSampler, a query execution mechanism to answer "partial selection" queries in peerto-peer databases. A partial selection query is an arbitrar...
Farnoush Banaei Kashani, Cyrus Shahabi
MICCAI
2008
Springer
16 years 8 months ago
Efficient Computation of PDF-Based Characteristics from Diffusion MR Signal
Abstract. We present a general method for the computation of PDFbased characteristics of the tissue micro-architecture in MR imaging. The approach relies on the approximation of th...
David Tschumperlé, Haz-Edine Assemlal, Luc ...
ICPR
2002
IEEE
16 years 8 months ago
Fractional Component Analysis (FCA) for Mixed Signals
This paper proposes the fractional component analysis (FCA), whose goal is to decompose the observed signal into component signals and recover their fractions. The uniqueness of o...
Asanobu Kitamoto
ICIP
2009
IEEE
16 years 7 months ago
Non-local Image Smoothing By Applying Anisotropic Diffusion Pde's In The Space Of Patches
We design a family of non-local image smoothing algorithms which approximate the application of diffusion PDE's on a specific Euclidean space of image patches. We first map a...
« Prev « First page 1137 / 1586 Last » Next »