2013
DOI: 10.1109/tip.2013.2237917
|View full text |Cite
|
Sign up to set email alerts
|

Design of Low-Complexity High-Performance Wavelet Filters for Image Analysis

Abstract: This paper addresses the construction of a family of wavelets based on halfband polynomials. An algorithm is proposed that ensures maximum zeros at ω = π for a desired length of analysis and synthesis filters. We start with the coefficients of the polynomial (x+1)(n) and then use a generalized matrix formulation method to construct the filter halfband polynomial. The designed wavelets are efficient and give acceptable levels of peak signal-to-noise ratio when used for image compression. Furthermore, these wave… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 23 publications
(5 citation statements)
references
References 33 publications
0
5
0
Order By: Relevance
“…The article focuses on such a design approach to construct integer and dyadic wavelets for image compression applications. This paper is an extension of the work presented in [8]. Whereas WCHP (Wavelets Constructed using Halfband Polynomial) ensures maximum vanishing moments, they may not be necessarily dyadic.…”
Section: Related Workmentioning
confidence: 94%
See 1 more Smart Citation
“…The article focuses on such a design approach to construct integer and dyadic wavelets for image compression applications. This paper is an extension of the work presented in [8]. Whereas WCHP (Wavelets Constructed using Halfband Polynomial) ensures maximum vanishing moments, they may not be necessarily dyadic.…”
Section: Related Workmentioning
confidence: 94%
“…It is well known that the CDF 9/7 filters have irrational coefficients and thus require floating point arithmetic. The problems associated with the floating point implementation of filters and the associated higher complexity has been addressed in [8]- [11]. Complexity reduction can be achieved by designing filters that have rational coefficients with preferably dyadic values.…”
Section: Related Workmentioning
confidence: 99%
“…Triplet half-band filter bank (THFB) has been presented by Rahulkar and Holambe [15], where the authors found out the coefficients are irrational numbers, which is difficult to implement on hardware. Further, Naik and Holambe [16] have designed low complexity wavelet filter banks. Anbarjafari et al [17] have obtained high resolution satellite image with the help of dual tree complex wavelet transform from noisy, blurred, and undersampled low resolution images.…”
Section: Banksmentioning
confidence: 99%
“…Let us assume that all samples have the same order of magnitude, then, the difference between and can be large due to the shift operation. This idea can be exploited to predict the probability of the th carry signal to be "1": (13) For some of the values taken by , if and is "small," then (14) The condition in (14) applied to (13) leads to (15) with…”
Section: B Probability-based Thresholdingmentioning
confidence: 99%
“…As an example in [6], [7] the B-spline factorization [8], [9] is exploited to design multiplierless FB architectures. Recently, other approaches have been proposed as well, e.g., algebraic integer quantization [10], [11], coefficient rationalization [12], polymorphic implementation [13], and half-band polynomial factorization [14].…”
Section: Introductionmentioning
confidence: 99%