Sciweavers

88 search results - page 14 / 18
» Optimal Denoising in Redundant Representations
Sort
View
ICIP
2000
IEEE
14 years 8 months ago
Geometric and Topological Lossy Compression of Dense Range Images
This paper presents a technique for lossy compression of dense range images. Two separate compression schemes are applied. The first scheme (geometric compression) reduces redunda...
Angel Domingo Sappa, Boris Xavier Vintimilla, Migu...
MOBILWARE
2009
ACM
14 years 1 months ago
Map-Based Compressive Sensing Model for Wireless Sensor Network Architecture, A Starting Point
Sub-Nyquist sampling techniques for Wireless Sensor Networks (WSN) are gaining increasing attention as an alternative method to capture natural events with desired quality while mi...
Mohammadreza Mahmudimanesh, Abdelmajid Khelil, Nas...
AHS
2007
IEEE
253views Hardware» more  AHS 2007»
14 years 1 months ago
evolFIR: Evolving redundancy-free FIR structures
Finite impulse response (FIR) structures are the most commonly used digital filters and can be found in various areas of everyday life. In this paper we introduce a novel approac...
Szilvia Zvada, Gabriella Kókai, Róbe...
TSP
2008
124views more  TSP 2008»
13 years 6 months ago
Dictionary Preconditioning for Greedy Algorithms
This article introduces the concept of sensing dictionaries. It presents an alteration of greedy algorithms like thresholding or (Orthogonal) Matching Pursuit which improves their...
Karin Schnass, Pierre Vandergheynst
DCC
2005
IEEE
14 years 6 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said