1995
DOI: 10.1117/12.217425
|View full text |Cite
|
Sign up to set email alerts
|

<title>Optimal sign selection for discriminant analysis of textures</title>

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

1998
1998
1998
1998

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…Among other, it permits to construct an approximate KL algorithm, as it was suggested in Ref. 3 The procedure of such basis construction has its origin in the wavelet packet theory. For this purpose each detail space W can be recursively decomposed in a sequence of detail spaces by the operators I and H .…”
Section: Fast Wavelet Algorithm For Approximate Kl Transformmentioning
confidence: 98%
See 1 more Smart Citation
“…Among other, it permits to construct an approximate KL algorithm, as it was suggested in Ref. 3 The procedure of such basis construction has its origin in the wavelet packet theory. For this purpose each detail space W can be recursively decomposed in a sequence of detail spaces by the operators I and H .…”
Section: Fast Wavelet Algorithm For Approximate Kl Transformmentioning
confidence: 98%
“…Approximate correlation matrix G is defined by the equation: (n1,m1;n2,m2)= r('1I,h12)c('uh1,m2) (15) where matrices t:7; are correlation matrices of row and column ensembles respectively:…”
Section: Approximate 2d Kl Algorithmmentioning
confidence: 99%