2013
DOI: 10.14257/ijhit.2013.6.5.26
|View full text |Cite
|
Sign up to set email alerts
|

Computational Complexity of Adaptive Synthesis Filter Banks for Image Compression

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2014
2014
2014
2014

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 10 publications
0
2
0
Order By: Relevance
“…However, this computational complexity can be reduced to "2n-1" by combining each set of delay filters with corresponding linear phase filters only because other combinations do not significantly contribute in optimal image reconstruction [9].…”
Section: As = Bmentioning
confidence: 99%
See 1 more Smart Citation
“…However, this computational complexity can be reduced to "2n-1" by combining each set of delay filters with corresponding linear phase filters only because other combinations do not significantly contribute in optimal image reconstruction [9].…”
Section: As = Bmentioning
confidence: 99%
“…Adaptive synthesis filter banks [7] have no issue of maintaining dynamic synchronization between the analysis and synthesis filters as analysis section is non adaptive, which also simply the operation of filter banks. They have the ability to improve the reconstruction quality in particular at lower bit rates, by exploiting the phase diversity of the synthesis section in an adaptive mechanism.…”
Section: Introductionmentioning
confidence: 99%