64 research outputs found
A Panorama on Multiscale Geometric Representations, Intertwining Spatial, Directional and Frequency Selectivity
The richness of natural images makes the quest for optimal representations in
image processing and computer vision challenging. The latter observation has
not prevented the design of image representations, which trade off between
efficiency and complexity, while achieving accurate rendering of smooth regions
as well as reproducing faithful contours and textures. The most recent ones,
proposed in the past decade, share an hybrid heritage highlighting the
multiscale and oriented nature of edges and patterns in images. This paper
presents a panorama of the aforementioned literature on decompositions in
multiscale, multi-orientation bases or dictionaries. They typically exhibit
redundancy to improve sparsity in the transformed domain and sometimes its
invariance with respect to simple geometric deformations (translation,
rotation). Oriented multiscale dictionaries extend traditional wavelet
processing and may offer rotation invariance. Highly redundant dictionaries
require specific algorithms to simplify the search for an efficient (sparse)
representation. We also discuss the extension of multiscale geometric
decompositions to non-Euclidean domains such as the sphere or arbitrary meshed
surfaces. The etymology of panorama suggests an overview, based on a choice of
partially overlapping "pictures". We hope that this paper will contribute to
the appreciation and apprehension of a stream of current research directions in
image understanding.Comment: 65 pages, 33 figures, 303 reference
Multiresolution and Explicit Methods for Vector Field Analysis and Visualization
We first report on our current progress in the area of explicit methods for tangent curve computation. The basic idea of this method is to decompose the domain into a collection of triangles (or tetrahedra) and assume linear variation of the vector field over each cell. With this assumption, the equations which define a tangent curve become a system of linear, constant coefficient ODE's which can be solved explicitly. There are five different representation of the solution depending on the eigenvalues of the Jacobian. The analysis of these five cases is somewhat similar to the phase plane analysis often associate with critical point classification within the context of topological methods, but it is not exactly the same. There are some critical differences. Moving from one cell to the next as a tangent curve is tracked, requires the computation of the exit point which is an intersection of the solution of the constant coefficient ODE and the edge of a triangle. There are two possible approaches to this root computation problem. We can express the tangent curve into parametric form and substitute into an implicit form for the edge or we can express the edge in parametric form and substitute in an implicit form of the tangent curve. Normally the solution of a system of ODE's is given in parametric form and so the first approach is the most accessible and straightforward. The second approach requires the 'implicitization' of these parametric curves. The implicitization of parametric curves can often be rather difficult, but in this case we have been successful and have been able to develop algorithms and subsequent computer programs for both approaches. We will give these details along with some comparisons in a forthcoming research paper on this topic
Wavelets on the Two-Sphere and Other Conic Sections
We survey the construction of the continuous wavelet transform (CWT) on the twosphere. Then we discuss the discretization of the spherical CWT, obtaining various types of discrete frames. Finally, we give some indications on the construction of a CWT on other conic section
Multiresolution Analysis with Non-Nested Spaces
International audienceTwo multiresolution analyses (MRA) intended to be used in scientiic visualization, and that are both based on a non-nested set of approximating spaces, are presented. The notion of approximated r eenement is introduced to deal with non nested spaces. The rst MRA scheme, referred to as BLaC (Blending of Linear and Constant) wavelets is based on a one parameter family of wavelet bases that realizes a blend between the Haar and the linear wavelet bases. The approximated reenement is applied in the last part to build a second MRA scheme for data deened on an arbitrary planar triangular mesh
Splines and Wavelets on Geophysically Relevant Manifolds
Analysis on the unit sphere found many applications in
seismology, weather prediction, astrophysics, signal analysis, crystallography,
computer vision, computerized tomography, neuroscience, and statistics.
In the last two decades, the importance of these and other applications
triggered the development of various tools such as splines and wavelet bases
suitable for the unit spheres , and the
rotation group . Present paper is a summary of some of results of the
author and his collaborators on generalized (average) variational splines and
localized frames (wavelets) on compact Riemannian manifolds. The results are
illustrated by applications to Radon-type transforms on and
.Comment: The final publication is available at http://www.springerlink.co
On Curved Simplicial Elements and Best Quadratic Spline Approximation for Hierarchical Data Representation
We present a method for hierarchical data approximation using curved quadratic simplicial elements for domain decomposition. Scientific data defined over two- or three-dimensional domains typically contain boundaries and discontinuities that are to be preserved and approximated well for data analysis and visualization. Curved simplicial elements make possible a better representation of curved geometry, domain boundaries, and discontinuities than simplicial elements with non-curved edges and faces. We use quadratic basis functions and compute best quadratic simplicial spline approximations that are -continuous everywhere except where field discontinuities occur whose locations we assume to be given. We adaptively refine a simplicial approximation by identifying and bisecting simplicial elements with largest errors. It is possible to store multiple approximation levels of increasing quality. Our method can be used for hierarchical data processing and visualization
- …