Pier Luigi Dragotti

About
Privacy
Disclaimer

Graph Chatbot

Related publications (15)

Sensing and communication with and without bits

Martin Vetterli, Michael Christoph Gastpar, Pier Luigi Dragotti

The successful design of sensor network architectures depends crucially on the structure of the sampling, observation, and communication processes. One of the most fundamental ques- tions concerns the sufficiency of discrete approximations in time, space, ...

2006

Exact Local Reconstruction Algorithms for Signals with Finite Rate of Innovation

Martin Vetterli, Pier Luigi Dragotti, Thierry Blu

Consider the problem of sampling signals which are not bandlimited, but still have a finite number of degrees of freedom per unit of time, such as, for example, piecewise polynomial or piecewise sinusoidal signals, and call the number of degrees of freedom ...

2006

Low-Rate Reduced Complexity Image Compression using Directionlets

Martin Vetterli, Vladan Velisavljevic, Pier Luigi Dragotti

The standard separable two-dimensional (2-D) wavelet transform (WT) has recently achieved a great success in image processing because it provides a sparse representation of smooth images. However, it fails to capture efficiently one-dimensional (1-D) disco ...

2006

Directionlets: Anisotropic Multidirectional representation with separable filtering

Martin Vetterli, Vladan Velisavljevic, Pier Luigi Dragotti

In spite of the success of the standard wavelet transform (WT) in image processing in recent years, the efficiency of its representation is limited by the spatial isotropy of its basis functions built in the horizontal and vertical directions. One-dimensio ...

2006

Rate-Distortion Optimized Tree-Structured Compression Algorithms for Piecewise Polynomial Images

Martin Vetterli, Pier Luigi Dragotti, Minh Do, Rahul Shukla

This paper presents novel coding algorithms based on tree-structured segmentation, which achieve the correct asymp- totic rate-distortion (R-D) behavior for a simple class of signals, known as piecewise polynomials, by using an R-D based prune and join sch ...

2005

Page 2 of 2