By Topic

Counterpoint Harmony Search: An accurate algorithm for the blind deconvolution of binary images

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
$33 $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

3 Author(s)
J. Fourie ; Computer Science and Software Engineering, University of Canterbury, Christchurch, New Zealand ; R. Green ; S. Mills

In this paper a novel algorithm, called Counterpoint Harmony Search (CHS), is presented for the simultaneous denoising and deconvolution of binary images. No prior information about the noise or blur shape and size is required, which makes so called blind decon-volution of binary images possible using CHS. CHS is based on the Harmony Search algorithm and inspired by the island model parallel genetic algorithm. We compare results from the CHS algorithm with recent results from modern blind binary image deconvolution algorithms. We achieve 100% accuracy in all our examples and show that CHS is robust even when deconvolving severely noisy images. These results improve significantly on results reported by a recent binary image deconvolution algorithm.

Published in:

Audio Language and Image Processing (ICALIP), 2010 International Conference on

Date of Conference:

23-25 Nov. 2010