Particle swarm optimisation enhancement approach for improving image quality
by Malik Braik, Alaa Sheta, Aladdin Ayesh
International Journal of Innovative Computing and Applications (IJICA), Vol. 1, No. 2, 2007

Abstract: Particle Swarm Optimisation (PSO) algorithm represents a new approach to optimisation problems. In this paper, image enhancement is presented as an optimisation problem to which PSO is applied. This application is done within a nouvelle automatic image enhancement technique encompassing a real-coded particle swarms algorithm. The enhancement process is a non-linear optimisation problem with several constraints. Based upon a mathematical model of the social interactions of swarms, the algorithm has been shown to be effective at finding good solutions of the enhancement problem by adapting the parameters of a novel extension to a local enhancement technique similar to statistical scaling. This enhances the contrast and detail in the image according to an objective fitness criterion. The proposed algorithm has been compared with Genetic Algorithms (GAs) to a number of tested images. The obtained results using grey scale images indicate that PSO is better than GAs in terms of the computational time and both the objective evaluation and maximisation of the number of pixels in the edges of the tested images.

Online publication date: Tue, 22-Jan-2008

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Innovative Computing and Applications (IJICA):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email