A variety of multiresolution models for arbitrary triangle meshes have been presented in the last years. In order to achieve an interactive visualization, multiresolution models must store and retrieve data efficiently. In this paper, we present a first step to evaluate and compare multiresolution models. We propose a set of tests to measure the speed performance of the models for interactive v...

Surface multiresolution processing is an important subject in CAGD. It also poses many challenging problems including the design of multiresolution algorithms. Unlike images which are in general sampled on a regular square or hexagonal lattice, the meshes in surfaces processing could have an arbitrary topology, namely, they consist of not only regular vertices but also extraordinary vertices, w...

Harten’s framework is a nonlinear generalization of the wavelet framework. Previously, the choice of discretization (scaling function) in Harten multiresolution schemes has been limited to point-value, cell-average, and hat-based discretization. This paper shows how to construct multiresolution schemes consistent with Harten’s framework for a variety of discretizations. The construction here be...

The paper deals with the problem of analyzing and visualizing large-size volume data sets. To this aim, we consider multiresolution representations based on a decomposition of the field domain into tetrahedral cells. We compare two types of multiresolution representations that differ on the rule applied to refine an initial coarse mesh: one is based on tetrahedron bisection, and one based on ve...

Abstract In recent years the concept of multiresolution-based adaptive discontinuous Galerkin (DG) schemes for hyperbolic conservation laws has been developed. The key idea is to perform a multiresolution analysis DG solution using multiwavelets defined on hierarchy nested grids. Typically this applied dyadic grid hierarchies where explicit construction be performed only one reference element. ...

in this paper, we characterize multiresolution analysis(mra) parseval frame multiwavelets in l^2(r^d) with matrix dilations of the form (d f )(x) = sqrt{2}f (ax), where a is an arbitrary expanding dtimes d matrix with integer coefficients, such that |deta| =2. we study a class of generalized low pass matrix filters that allow us to define (and construct) the subclass of mra tight frame multiwav...

A variety of multiresolution models for arbitrary triangle meshes have been presented in the last years. In order to achieve an interactive visualization, multiresolution models must store and retrieve data efficiently. In this paper, we present a first step to evaluate and compare multiresolution models. We propose a set of tests to measure the speed performance of the models for interactive v...

Given a compact group M, we de®ne the notion of multiresolution of L2…M† with respect to an in®nite sequence of subgroups G0 G1 G2 such that G ˆ [kˆ0Gk is a dense subgroup of M. We give characterizations of various axioms of multiresolution, demonstrate the existence and give the construction of a wavelet basis for L2…M†. We also construct stationary multiresolution and wavelets from cyclic vec...

The objective of this study is to propose multiresolution data fusion scheme using multiresolution analysis (MRA). Three techniques compared, respectively based on Haar wavelet basis (HWB), Daubechies wavelet basis (DWB), and IHS transform. Daubechies Wavelet Basis (DWB) is far more efficient than the HWB and IHS transform, thus establishing the advantages for data fusion of formally multiresol...

This paper presents some automatic shot detection techniques based on color histograms and also on multiresolution histograms. The approaches tested in the submitted runs are mainly focused on cut detection. The main goal of the runs is to study the behaviour of color histogram differences as a first step in the use of multiresolution color histograms into the adaptive threshold algorithm. Some...