Close category search window
 

A class of fast Gaussian binomial filters for speech and image processing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Haddad, R.A. ; Dept. of Electr. Eng. & Comput. Sci., Polytech. Univ., Hawthorne, NY, USA ; Akansu, A.N.

The authors present an efficient, in-place algorithm for the batch processing of linear data arrays. These algorithms are efficient, easily scaled, and have no multiply operations. They are suitable as front-end filters for a bank of quadrature mirror filters and for pyramid coding of images. In the latter application, the binomial filter was used as the low-pass filter in pyramid coding of images and compared with the Gaussian filter devised by P.J. Burt (Comput. Graph. Image Processing, vol.16, p.20-51, 1981). The binomial filter yielded a slightly larger signal-to-noise ratio in every case tested. More significantly, for an ( L+1)×(L+1) image array processed in (N+1)×(N+1) subblocks, the fast Burt algorithm requires a total of 2(L+1)2N adds and 2(L+1)2 (N/2+1) multiplies. The binomial algorithm requires 2L2N adds and zero multiplies

Published in:
Signal Processing, IEEE Transactions on  (Volume:39 ,  Issue: 3 )

Date of Publication: Mar 1991

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.