Multiresolution

14,000,000 Leading Edge Experts on the ideXlab platform

Scan Science and Technology

Contact Leading Edge Experts & Companies

Scan Science and Technology

Contact Leading Edge Experts & Companies

The Experts below are selected from a list of 360 Experts worldwide ranked by ideXlab platform

Haizhao Yang - One of the best experts on this subject based on the ideXlab platform.

  • Multiresolution mode decomposition for adaptive time series analysis
    Applied and Computational Harmonic Analysis, 2019
    Co-Authors: Haizhao Yang
    Abstract:

    Abstract This paper proposes the Multiresolution mode decomposition (MMD) as a novel model for adaptive time series analysis. The main conceptual innovation is the introduction of the Multiresolution intrinsic mode function (MIMF) of the form ∑ n = − N / 2 N / 2 − 1 a n cos ⁡ ( 2 π n ϕ ( t ) ) s c n ( 2 π N ϕ ( t ) ) + ∑ n = − N / 2 N / 2 − 1 b n sin ⁡ ( 2 π n ϕ ( t ) ) s s n ( 2 π N ϕ ( t ) ) to model nonlinear and non-stationary data with time-dependent amplitudes, frequencies, and waveforms. The Multiresolution expansion coefficients { a n } , { b n } , and the shape function series { s c n ( t ) } and { s s n ( t ) } provide innovative features for adaptive time series analysis. For complex signals that are a superposition of several MIMFs with well-differentiated phase functions ϕ ( t ) , a new recursive scheme based on Gauss-Seidel iteration and diffeomorphisms is proposed to identify these MIMFs, their Multiresolution expansion coefficients, and shape function series. Numerical examples from synthetic data and natural phenomena are given to demonstrate the power of this new method.

  • Multiresolution mode decomposition for adaptive time series analysis
    arXiv: Numerical Analysis, 2017
    Co-Authors: Haizhao Yang
    Abstract:

    This paper proposes the \emph{Multiresolution mode decomposition} as a novel model for adaptive time series analysis. The main conceptual innovation is the introduction of the \emph{Multiresolution intrinsic mode function} (MIMF) of the form \[ \sum_{n=-N/2}^{N/2-1} a_n\cos(2\pi n\phi(t))s_{cn}(2\pi N\phi(t))+\sum_{n=-N/2}^{N/2-1}b_n \sin(2\pi n\phi(t))s_{sn}(2\pi N\phi(t))\] to model nonlinear and non-stationary data with time-dependent amplitudes, frequencies, and waveforms. %The MIMF explains the intrinsic difficulty in concentrating time-frequency representation of nonlinear and non-stationary data and provides a new direction for mode decomposition. The Multiresolution expansion coefficients $\{a_n\}$, $\{b_n\}$, and the shape function series $\{s_{cn}(t)\}$ and $\{s_{sn}(t)\}$ provide innovative features for adaptive time series analysis. For complex signals that are a superposition of several MIMFs with well-differentiated phase functions $\phi(t)$, a new recursive scheme based on Gauss-Seidel iteration and diffeomorphisms is proposed to identify these MIMFs, their Multiresolution expansion coefficients, and shape function series. Numerical examples from synthetic data and natural phenomena are given to demonstrate the power of this new method.

Martin Vetterli - One of the best experts on this subject based on the ideXlab platform.

  • Multiresolution broadcast for digital hdtv using joint source channel coding
    IEEE Journal on Selected Areas in Communications, 1993
    Co-Authors: Kannan Ramchandran, Antonio Ortega, Martin Vetterli
    Abstract:

    The use of Multiresolution (MR) joint source-channel coding in the context of digital terrestrial broadcasting of high-definition television (HDTV) is shown to be an efficient alternative to single-resolution techniques, which suffer from a sharp threshold effect in the fringes of the broadcast area. It is shown how matched Multiresolution source and channel coding can provide a stepwise graceful degradation and improve the behavior, in terms of coverage and robustness of the transmission scheme, over systems not specifically designed for broadcast situations. The alternative available for Multiresolution transmission through embedded modulation and error correction codes are examined. It is also shown how Multiresolution trellis-coded modulation (TCM) can be used to increase coverage range. Coding results and simulations of noisy transmission are presented, and tradeoffs are discussed. >

  • Multiresolution broadcast for digital hdtv using joint source channel coding
    International Conference on Communications, 1992
    Co-Authors: Kannan Ramchandran, Antonio Ortega, Martin Vetterli
    Abstract:

    In the context of digital terrestrial broadcast of high-definition television (HDTV), the use of Multiresolution joint source-channel coding is shown to provide an attractive alternative to traditional single resolution (SR) digital techniques. While SR schemes suffer from a sharp threshold effect in the fringes of the broadcast area, it is shown that a matched Multiresolution approach to both source and channel coding can provide a stepwise graceful degradation. Furthermore, this Multiresolution approach improves the behavior, in terms of coverage and robustness of the transmission scheme, over systems that are not specifically designed to broadcast situations. The authors examine the alternatives available for Multiresolution transmission, through embedded modulation, possibly trellis-coded to increase coverage range. From a systems point of view, they also discuss the tradeoffs involved in the choice of coverage areas for the low- and high-resolution signals. >

Wim Sweldens - One of the best experts on this subject based on the ideXlab platform.

  • Multiresolution mesh morphing
    International Conference on Computer Graphics and Interactive Techniques, 1999
    Co-Authors: Aaron W F Lee, Wim Sweldens, David P Dobkin, Peter Schroder
    Abstract:

    We present a new method for user controlled morphing of two homeomorphic triangle meshes of arbitrary topology. In particular we focus on the problem of establishing a correspondence map between source and target meshes. Our method employs the MAPS algorithm to parameterize both meshes over simple base domains and an additional harmonic map bringing the latter into correspondence. To control the mapping the user specifies any number of feature pairs, which control the parameterizations produced by the MAPS algorithm. Additional controls are provided through a direct manipulation interface allowing the user to tune the mapping between the base domains. We give several examples of aesthetically pleasing morphs which can be created in this manner with little user input. Additionally we demonstrate examples of temporal and spatial control over the morph.

  • interactive Multiresolution mesh editing
    International Conference on Computer Graphics and Interactive Techniques, 1997
    Co-Authors: Denis Zorin, Peter Schroder, Wim Sweldens
    Abstract:

    We describe a Multiresolution representation for meshes based on subdivision, which is a natural extension of the existing patch-based surface representations. Combining subdivision and the smoothing algorithms of Taubin [26] allows us to construct a set of algorithms for interactive Multiresolution editing of complex hierarchical meshes of arbitrary topology. The simplicity of the underlying algorithms for refinement and coarsification enables us to make them local and adaptive, thereby considerably improving their efficiency. We have built a scalable interactive Multiresolution editing system based on such algorithms.

András Antos - One of the best experts on this subject based on the ideXlab platform.

  • On Codecell Convexity of Optimal Multiresolution Scalar Quantizers for Continuous Sources
    2013
    Co-Authors: András Antos
    Abstract:

    Abstract—It has been shown by earlier results that for fixed rate Multiresolution scalar quantizers and for mean squared error distortion measure, codecell convexity precludes optimality for certain discrete sources. However it was unknown whether the same phenomenon can occur for any continuous source. In this paper, examples of continuous sources (even with bounded continuous densities) are presented for which optimal fixed rate Multiresolution scalar quantizers cannot have only convex codecells, proving that codecell convexity precludes optimality also for such regular sources. Index Terms—Clustering methods, codecell convexity, continuous density function, mean squared error methods, Multiresolution, optimization methods, quantization, rate distortion theory, source coding I. INTRODUCTION AND DEFINITION

  • On Codecell Convexity of Optimal Multiresolution Scalar Quantizers for Continuous Sources
    IEEE Transactions on Information Theory, 2012
    Co-Authors: András Antos
    Abstract:

    It has been shown by earlier results that for fixed rate Multiresolution scalar quantizers and for mean squared error distortion measure, codecell convexity precludes optimality for certain discrete sources. However it was unknown whether the same phenomenon can occur for any continuous source. In this paper, examples of continuous sources (even with bounded continuous densities) are presented for which optimal fixed rate Multiresolution scalar quantizers cannot have only convex codecells, proving that codecell convexity precludes optimality also for such regular sources.

P Moulin - One of the best experts on this subject based on the ideXlab platform.

  • optimal l sup 2 approximation of images in nonorthogonal Multiresolution bases
    International Conference on Acoustics Speech and Signal Processing, 1993
    Co-Authors: P Moulin
    Abstract:

    The author presents a fast optimization algorithm for L/sup 2/ approximation in 2-D, separable, nonorthogonal Multiresolution bases and discusses its application to image coding. The algorithm is applied to a Multiresolution bilinear spline basis and produces approximations that have two attractive features: fewer ringing artifacts and faster reconstruction than in commonly used Multiresolution bases. >