Abstract
The more a priori knowledge we encode into a signal processing algorithm, the better performance we can expect. In this paper, we overview several approaches to capturing the structure of singularities (edges, ridges, etc.) in wavelet-based signal processing schemes. Leveraging results from approximation theory, we discuss nonlinear approximations on trees and point out that an optimal tree approximant exists and is easily computed. The optimal tree approximation inspires a new hierarchical interpretation of the wavelet decomposition and a tree-based wavelet denoising algorithm that suppresses spurious noise bumps.
© (1999) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Richard G. Baraniuk, "Optimal tree approximation with wavelets", Proc. SPIE 3813, Wavelet Applications in Signal and Image Processing VII, (26 October 1999); doi: 10.1117/12.366780; https://doi.org/10.1117/12.366780
PROCEEDINGS
12 PAGES


SHARE
Back to Top