#### Filter Results:

- Full text PDF available (419)

#### Publication Year

1983

2017

- This year (7)
- Last 5 years (107)
- Last 10 years (213)

#### Publication Type

#### Co-author

#### Publication Venue

#### Brain Region

#### Data Set Used

#### Key Phrases

#### Method

#### Organism

Learn More

- S. Grace Chang, Bin Yu, Martin Vetterli
- IEEE Trans. Image Processing
- 2000

The first part of this paper proposes an adaptive, data-driven threshold for image denoising via wavelet soft-thresholding. The threshold is derived in a Bayesian framework, and the prior used on the wavelet coefficients is the generalized Gaussian distribution (GGD) widely used in image processing applications. The proposed threshold is simple and… (More)

- Minh N. Do, Martin Vetterli
- IEEE Transactions on Image Processing
- 2005

The limitations of commonly used separable extensions of one-dimensional transforms, such as the Fourier and wavelet transforms, in capturing the geometry of image edges are well known. In this paper, we pursue a "true" two-dimensional transform that can capture the intrinsic geometrical structure that is key in visual information. The main challenge in… (More)

- Martin Vetterli, Pina Marziliano, Thierry Blu
- IEEE Trans. Signal Processing
- 2002

—Consider classes of signals that have a finite number of degrees of freedom per unit of time and call this number the rate of innovation. Examples of signals with a finite rate of innovation include streams of Diracs (e.g., the Poisson process), nonuniform splines, and piecewise polynomials. Even though these signals are not bandlimited, we show that they… (More)

- Minh N. Do, Martin Vetterli
- IEEE Trans. Image Processing
- 2002

We present a statistical view of the texture retrieval problem by combining the two related tasks, namely feature extraction (FE) and similarity measurement (SM), into a joint modeling and classification scheme. We show that using a consistent estimator of texture model parameters for the FE step followed by computing the Kullback-Leibler distance (KLD)… (More)

- Steven McCanne, Van Jacobson, Martin Vetterli
- SIGCOMM
- 1996

State of the art, real-time, rate-adaptive, multimedia applications adjust their transmission rate to match the available network capacity. Unfortunately, this source-based rate-adaptation performs poorly in a heterogeneous multicast environment because there is no single target rate --- the conflicting bandwidth requirements of all receivers cannot be… (More)

- Minh N. Do, Martin Vetterli
- IEEE Trans. Image Processing
- 2003

The ridgelet transform was introduced as a sparse expansion for functions on continuous spaces that are smooth away from discontinuities along lines. We propose an orthonormal version of the ridgelet transform for discrete and finite-size images. Our construction uses the finite Radon transform (FRAT) as a building block. To overcome the periodization… (More)

- Razvan Cristescu, Baltasar Beferull-Lozano, Martin Vetterli
- INFOCOM
- 2004

— We consider the problem of correlated data gathering by a network with a sink node and a tree communication structure, where the goal is to minimize the total transmission cost of transporting the information collected by the nodes, to the sink node. Two coding strategies are analyzed: a Slepian-Wolf model where optimal coding is complex and transmission… (More)

- S. Grace Chang, Bin Yu, Martin Vetterli
- IEEE Trans. Image Processing
- 1998

The method of wavelet thresholding for removing noise, or denoising, has been researched extensively due to its effectiveness and simplicity. Much of the literature has focused on developing the best uniform threshold or best basis selection. However, not much has been done to make the threshold values adaptive to the spatially changing statistics of… (More)

- Michael Gastpar, Pier Luigi Dragotti, Martin Vetterli
- IEEE Workshop on Multimedia Signal Processing
- 2002

The Karhunen-Lò eve transform (KLT) is a key element of many signal processing and communication tasks. Many recent applications involve distributed signal processing , where it is not generally possible to apply the KLT to the entire signal ; rather , the KLT must be approximated in a distributed fashion. This paper investigates such distributed approaches… (More)

- T. Blu, P.-L. Dragotti, M. Vetterli, P. Marziliano, L. Coulot
- IEEE Signal Processing Magazine
- 2008

Sparse sampling of continuous-time sparse signals is addressed. In particular, it is shown that sampling at the rate of innovation is possible, in some sense applying Occam's razor to the sampling of sparse signals. The noisy case is analyzed and solved, proposing methods reaching the optimal performance given by the Cramer-Rao bounds. Finally, a number of… (More)