[Home ] [Archive]   [ فارسی ]  
:: Main :: About :: Current Issue :: Archive :: Search :: Submit :: Contact ::
Main Menu
Journal Information::
Articles archive::
For Authors::
For Reviewers::
Contact us::
Site Facilities::
Search in website

Advanced Search
Receive site information
Enter your Email in the following box to receive the site news and information.
:: Volume 7, Issue 3 (12-2019) ::
jgit 2019, 7(3): 199-212 Back to browse issues page
Optimization of RFM's Structure Using a New Reformulation of PSO in Case of Limited GCPs
Saeed Gholinejad , Amin Alizadeh Naeini * , Alireza Amiri-Simkooei
University of Isfahan
Abstract:   (2663 Views)
Metaheuristic algorithms have been widely used in determining the optimum rational polynomial coefficients (RPCs). By eliminating a number of unnecessary RPCs, these algorithms increase the accuracy of geometric correction of high-resolution satellite images. To this end, these algorithms use ordinary least squares and a number of ground control points (GCPs) to determine RPCs' values. Due to the cost of GCPs collection, using limited GCPs has become an attractive topic in various researches. In this study, a new reformulation of particle swarm optimization (PSO) algorithm, namely, Discrete-Binary PSO for Rational Function Model (DBPSORFM), is presented to find the optimal number and combination of RPCs in the case of limited GCPs. Based on the fact that the maximum number of RPCs, the values of which are obtained through least squares, is twice the number of GCPs, the particle of the proposed algorithm is composed of two binary and discrete parts. The discrete part contains the number of rational coefficients that can vary from 1 to 78. In the binary section, which contains 0 and 1 values, the absence or presence of the corresponding coefficient in the discrete section is investigated. This method is not only compatible with the nature of the metaheuristic algorithms but also significantly reduces the search space. The proposed method has been tested on various types of high-resolution data. The results of the experiments indicate the superiority of the proposed method in comparison with the conventional approach in metaheuristic algorithms.
Keywords: Rational Function Models (RFMs), Particle Swarm Optimization (PSO), Limited number of GCPs.
Full-Text [PDF 1775 kb]   (1117 Downloads)    
Type of Study: Research | Subject: Aerial Photogrammetry
Received: 2018/07/8 | Accepted: 2019/04/13 | Published: 2019/12/21
Send email to the article author

XML   Persian Abstract   Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Gholinejad S, Alizadeh Naeini A, Amiri-Simkooei A. Optimization of RFM's Structure Using a New Reformulation of PSO in Case of Limited GCPs. jgit 2019; 7 (3) :199-212
URL: http://jgit.kntu.ac.ir/article-1-749-en.html

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Volume 7, Issue 3 (12-2019) Back to browse issues page
نشریه علمی-پژوهشی مهندسی فناوری اطلاعات مکانی Engineering Journal of Geospatial Information Technology
Persian site map - English site map - Created in 0.05 seconds with 36 queries by YEKTAWEB 4657