#### Filter Results:

#### Publication Year

1999

2013

#### Co-author

#### Key Phrase

#### Publication Venue

#### Data Set Used

Learn More

- David L Donoho, Yaakov Tsaig, Iddo Drori, Jean-Luc Starck
- 2006

Finding the sparsest solution to underdetermined systems of linear equations y = Φx is NP-hard in general. We show here that for systems with 'typical'/'random' Φ, a good approximation to the sparsest solution is obtained by applying a fixed number of standard operations from linear algebra. Our proposal, Stagewise Orthogonal Matching Pursuit (StOMP),… (More)

We present an anisotropic mesh denoising algorithm that is effective, simple and fast. This is accomplished by filtering vertices of the mesh in the normal direction using local neighborhoods. Motivated by the impressive results of bilateral filtering for image denoising, we adopt it to denoise 3D meshes; addressing the specific issues required in the… (More)

We present a new method for completing missing parts caused by the removal of foreground or background elements from an image. Our goal is to synthesize a complete, visually plausible and coherent image. The visible parts of the image serve as a training set to infer the unknown parts. Our method iteratively approximates the unknown regions and composites… (More)

We describe multiscale representations for data observed on equispaced grids and taking values in manifolds such as the sphere S 2 , the special orthogonal group SO(3), the positive definite matrices SP D(n), and the Grassmann manifolds G(n, k). The representations are based on the deployment of Deslauriers–Dubuc and average-interpolating pyramids " in the… (More)

Many applications in signal processing lead to the optimization problems min x 1 subject to y = Ax, and min x 1 subject to y − Ax ≤ ε, where A is a given d times n matrix, d < n, and y is a given n × 1 vector. In this work we consider 1 minimization by using LARS, Lasso, and homotopy methods [1, 2, 3] (Efron et el., Tibshi-rani, Osborne et al.). While these… (More)

Fast multidimensional NMR is important in chemical shift assignment and for studying structures of large proteins. We present the first method which takes advantage of the sparsity of the wavelet representation of the NMR spectra and reconstructs the spectra from partial random measurements of its free induction decay (FID) by solving the following… (More)

A wide class of operations on images can be performed directly in the wavelet domain by operating on coefficients of the wavelet transforms of the images and other matrices defined by the operation. Operating in the wavelet domain enables to perform these operations progressively in a coarse-to-fine fashion, to operate on different resolutions, manipulate… (More)

We introduce an example-based synthesis technique that extrapolates novel styles for a given input image. The technique is based on separating the style and content of image fragments. Given an image with a new style and content, it is first adaptively partitioned into fragments. Stitching together novel fragments produces a coherent image in a new style… (More)

- Iddo Drori
- 2007

Recently, the notions of Compressed Sensing and Compressive Sampling have attracted attention as an innovative concept in signal processing. Compressed sensing proposes that, when dealing with signals which are highly compressible in a known basis, for example in a wavelet basis, one can dispense with traditional sampling and instead take a small number of… (More)