#### Filter Results:

#### Publication Year

2003

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

This paper describes the construction of second generation bandelet bases and their application to 3D geometry compression. This new coding scheme is orthogonal and the corresponding basis functions are regular. In our method, surfaces are decomposed in a bandelet basis with a fast bandeletization algorithm that removes the geometric redundancy of… (More)

—This paper studies the properties of ℓ 1-analysis regularization for the resolution of linear inverse problems. Most previous works consider sparse synthesis priors where the sparsity is measured as the ℓ 1 norm of the coefficients that synthesize the signal in a given dictionary. In contrast, the more general analysis regularization minimizes the ℓ 1 norm… (More)

This paper presents a generative model for textures that uses a local sparse description of the image content. This model enforces the sparsity of the expansion of local texture patches on adapted atomic elements. The analysis of a given texture within this framework performs the sparse coding of all the patches of the texture into the dictionary of atoms.… (More)

Figure 1. Different steps in mesh parameterization. Abstract In this paper, we present a method for remeshing trian-gulated manifolds by using geodesic path calculations and distance maps. Our work builds on the Fast Marching algorithm , which has been extended to arbitrary meshes by Sethian and Kimmel in [17]. First, a set of points that are evenly spaced… (More)

- Hugo Raguet, Jalal Fadili, Gabriel Peyré
- 2011

This paper introduces the generalized forward-backward splitting algorithm for minimizing convex functions of the form F + ∑ n i=1 G i , where F has a Lipschitz-continuous gradient and the G i 's are simple in the sense that their Moreau proximity operators are easy to compute. While the forward-backward algorithm cannot deal with more than n = 1 non-smooth… (More)

This article proposes a new framework to regularize linear inverse problems using the total variation on non-local graphs. This non-local graph allows to adapt the penalization to the geometry of the underlying function to recover. A fast algorithm computes iteratively both the solution of the regularization process and the non-local graph adapted to this… (More)

This article proposes a new class of models for natural signals and images. The set of patches extracted from the data to analyze is constrained to be close to a low dimensional manifold. This manifold structure is detailed for various ensembles suitable for natural signals, images and textures modeling. These manifolds provide a low-dimensional… (More)