Overcomplete steerable pyramid filters and rotation invariance

A given (overcomplete) discrete oriented pyramid may be converted into a steerable pyramid by interpolation. We present a technique for deriving the optimal interpolation functions (otherwise called 'steering coefficients'). The proposed scheme is demonstrated on a computationally efficient oriented pyramid, which is a variation on the Burt and Adelson (1983) pyramid. We apply the generated steerable pyramid to orientation-invariant texture analysis in order to demonstrate its excellent rotational isotropy. High classification rates and precise rotation identification are demonstrated

Modern Methods of Time-Frequency Warping of Sound Signals

Tato práce se zabývá reprezentací nestacionárních harmonických signálů s časově proměnnými komponentami. Primárně je zaměřena na Harmonickou transformaci a jeji variantu se subkvadratickou výpočetní složitostí, Rychlou harmonickou transformaci. V této práci jsou prezentovány dva algoritmy využívající Rychlou harmonickou transformaci. Prvni používá jako metodu odhadu změny základního kmitočtu sbírané logaritmické spektrum a druhá používá metodu analýzy syntézou. Oba algoritmy jsou použity k analýze řečového segmentu pro porovnání vystupů. Nakonec je algoritmus využívající metody analýzy syntézou použit na reálné zvukové signály, aby bylo možné změřit zlepšení reprezentace kmitočtově modulovaných signálů za použití Harmonické transformace.This thesis deals with representation of non-stationary harmonic signals with time-varying components. Its main focus is aimed at Harmonic Transform and its variant with subquadratic computational complexity, the Fast Harmonic Transform. Two algorithms using the Fast Harmonic Transform are presented. The first uses the gathered log-spectrum as fundamental frequency change estimation method, the second uses analysis-by-synthesis approach. Both algorithms are used on a speech segment to compare its output. Further the analysis-by-synthesis algorithm is applied on several real sound signals to measure the increase in the ability to represent real frequency-modulated signals using the Harmonic Transform.

Cyclic LTI systems in digital signal processing

Cyclic signal processing refers to situations where all the time indices are interpreted modulo some integer L. In such cases, the frequency domain is defined as a uniform discrete grid (as in L-point DFT). This offers more freedom in theoretical as well as design aspects. While circular convolution has been the centerpiece of many algorithms in signal processing for decades, such freedom, especially from the viewpoint of linear system theory, has not been studied in the past. In this paper, we introduce the fundamentals of cyclic multirate systems and filter banks, presenting several important differences between the cyclic and noncyclic cases. Cyclic systems with allpass and paraunitary properties are studied. The paraunitary interpolation problem is introduced, and it is shown that the interpolation does not always succeed. State-space descriptions of cyclic LTI systems are introduced, and the notions of reachability and observability of state equations are revisited. It is shown that unlike in traditional linear systems, these two notions are not related to the system minimality in a simple way. Throughout the paper, a number of open problems are pointed out from the perspective of the signal processor as well as the system theorist

Detection of dirt impairments from archived film sequences : survey and evaluations

Film dirt is the most commonly encountered artifact in archive restoration applications. Since dirt usually appears as a temporally impulsive event, motion-compensated interframe processing is widely applied for its detection. However, motion-compensated prediction requires a high degree of complexity and can be unreliable when motion estimation fails. Consequently, many techniques using spatial or spatiotemporal filtering without motion were also been proposed as alternatives. A comprehensive survey and evaluation of existing methods is presented, in which both qualitative and quantitative performances are compared in terms of accuracy, robustness, and complexity. After analyzing these algorithms and identifying their limitations, we conclude with guidance in choosing from these algorithms and promising directions for future research