1996
DOI: 10.1007/bf01826247
|View full text |Cite
|
Sign up to set email alerts
|

Local orthogonal bases I: Construction

Abstract: Abstract. We present a new method for constructing local orthogonal bases, both in continuous and discrete time. All basis functions are obtained from a single prototype window, and there exists a fast algorithm for implementation. The approach is very general and can handle a large variety of cases interesting for applications, such as audio and image coding.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
23
0

Year Published

1996
1996
2005
2005

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 19 publications
(23 citation statements)
references
References 10 publications
0
23
0
Order By: Relevance
“…The conditions that group F, weights s(u) and window w must satisfy in order to obtain an orthogonal decomposition of 12x are presented in the first part of this work [1], where the reader can also find all the details pertaining to notation. It is worth remembering, as a result from the first part, that window w must satisfy the condition of power-complementarity:…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The conditions that group F, weights s(u) and window w must satisfy in order to obtain an orthogonal decomposition of 12x are presented in the first part of this work [1], where the reader can also find all the details pertaining to notation. It is worth remembering, as a result from the first part, that window w must satisfy the condition of power-complementarity:…”
Section: Introductionmentioning
confidence: 99%
“…In the first part of this work [1] we presented a general theory for the construction of local orthogonal bases. The scenario is the following: we have a set X and a vector space l)x of functions defined on X and we want to find a basis bi,j, i, j = 1, 2 .…”
Section: Introductionmentioning
confidence: 99%
“…Other papers that mention or pursue some representationtheoretic aspects of multiresolution analysis include [3], [6], [8], [9], [11], [12], [13], [21], [22], [26], [27], but these complement rather than overlap substantially with this paper. The work of Chirikjian and his collaborators, [5], [15], uses the tools of harmonic analysis on the affine group and motion groups in various pattern recognition problems.…”
Section: Introductionmentioning
confidence: 99%
“…In [17], we extend the theory of local cosine bases (cosine-modulated filter banks) to a more general case. In a cosine-modulated filter bank, all the filters are obtained by modulating a prototype filter (also known as the window) with suitable cosine functions.…”
Section: Summary Of Local Orthogonal Basesmentioning
confidence: 99%
“…Consider the one-dimensional (1-D) case as an example. From [17], we can deduce a recipe to obtain a critically sampled orthogonal filter bank with filters of length .…”
Section: Summary Of Local Orthogonal Basesmentioning
confidence: 99%