Non-metric lens distortion correction using modified particle swarm optimisation
by Tianfei Chen; Yang Wang; Defeng Wu; Xiang Wu; Zi Ma
International Journal of Modelling, Identification and Control (IJMIC), Vol. 21, No. 3, 2014

Abstract: Lens distortion correction is crucial to obtain the best performance for vision system where rigorous accuracy is demanded. This paper presents a robust non-metric correction method which relies on the fact that straight lines in the real world must always project to straight lines in the image under the pinhole camera model. Neither calibration objects nor any known structure are required. Two types of distortion measurement are defined as objective function, and then optimisation algorithms are adopted to find distortion parameters. The comparison is analysed between the traditional optimisation algorithm, standard particle swarm optimisation (PSO) algorithm and two other modified particle swarm algorithms based on different typical strategies. Experiment results show that the opposition learning-based particle swarm algorithm (OPSO) with a mutation operator has strong robustness, and in the case of low-level noise, the performance of algorithms based on the particle swarm optimisation is better, and the effectiveness of the method is verified by different degrees of lens distortion.

Online publication date: Sat, 07-Jun-2014

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 Modelling, Identification and Control (IJMIC):
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