Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Electronic and Information Engineering | en_US |
| dc.creator | Sun, Xin | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/5107 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | GA method for image registration | en_US |
| dcterms.abstract | Image registration is one of the elementary steps in image processing. The purpose of image registration is to overlay two images (or more images) of the same scene that are obtained at different times, from different viewpoints, or by different sensors. Typically, image registration can be applied hi medical imaging, remote sensing and computer vision. The images used in the process of registration are called the reference image and the study image. The reference image is the target image while the study image is the transformed image hi the registration process. During the process of image registration, the transformation method is an important component. In brief, the transformation method transforms the study image to the reference image based on the corresponding relationship of the objects. The judgment criteria can be used to calculate the performance after the registration. For the purpose of achieving satisfied performance of the registered image, there are many mathematical optimization methods used hi the process of the transformation method, such as steepest gradient descent optimization, conjugate gradient optimization and Newton methods, etc. However, most of the gradient optimization methods are easily trapped in the local minimum value. Genetic Algorithms (GA) is one of the optimization technologies in global area. Basically, Genetic Algorithms is an adaptive searching algorithm which is inspired by biological evolution. Generally speaking, Genetic Algorithms optimize the fitness function, an objective function, mainly by three GA operations. The optimization results are generated iteratively until the termination conditions are satisfied. In order to overcome the non-optimal solution drawback, Genetic Algorithms is applied in the dissertation as the optimization method. Compared with other gradient based optimization methods, Genetic Algorithms is a derivative free optimization algorithm where only similarity cost function needs to be assessed during the optimization iterations. In my dissertation, the main contributions focus on using Genetic Algorithms to optimize the process of image registration in the platform of MATLAB software. The study image is transformed followed by B-spline transformation method based on the reference image. The performance of the proposed Genetic Algorithms method is compared with those of the other different optimization methods in the dissertation. The benefits and the limitations of GA image registration are analyzed as well. | en_US |
| dcterms.extent | ix, 101 leaves : ill. (some col.) ; 30 cm. | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 2009 | en_US |
| dcterms.educationalLevel | All Master | en_US |
| dcterms.educationalLevel | M.Sc. | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations. | en_US |
| dcterms.LCSH | Image processing. | en_US |
| dcterms.LCSH | Genetic algorithms. | en_US |
| dcterms.accessRights | restricted access | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b23030665.pdf | For All Users (off-campus access for PolyU Staff & Students only) | 4.21 MB | Adobe PDF | View/Open |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/5107