• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.47-51
• /
• 2005

Using satellite images, an optimal solution to water motion has been presented in this study. Since temperature patterns are suitable tracers in water motion, Sea Surface Temperature (SST) images of Caspian Sea taken by MODIS sensor on board Terra satellite have been used in this study. Two daily SST images with 24 hours time interval are used as input data. Computation of templates correspondence between pairs of images is crucial within motion algorithms using non-rigid body objects. Image matching methods have been applied to estimate water body motion within the two SST images. The least squares matching technique, as a flexible technique for most data matching problems, offers an optimal spatial solution for the motion estimation. The algorithm allows for simultaneous local radiometric correction and local geometrical image orientation estimation. Actually, the correspondence between the two image templates is modeled both geometrically and radiometrically. Geometric component of the model includes six geometric transformation parameters and radiometric component of the model includes two radiometric transformation parameters. Using the algorithm, the parameters are automatically corrected, optimized and assessed iteratively by the least squares algorithm. The method used in this study, has presented more efficient and robust solution compared to the traditional motion estimation schemes.

• Journal of Korean Society for Geospatial Information Science
• /
• v.8 no.1 s.15
• /
• pp.73-84
• /
• 2000

Map matching technique is an essential part of the car navigation and other related positioning fields such as dead reckoning and GPS data logging upon the GIS database. This paper is to break down map matching techniques, to categorize them, and to propose a simple technique for GPS based map matching technique. For categorization of techniques, two approaches have been adopted. One is to only use geometric information, and the other is to use both geometric and topological information. Some pros and cons of each method have been described. In addition, a simple map matching technique, set forth in this paper, has been introduced for properly utilizing the advantage of GPS points after the absence of the chronic problem of selective availability, which had been prevailed recently. Some research opportunities and problems of the technique have also been discussed.

• Korean Journal of Remote Sensing
• /
• v.10 no.2
• /
• pp.133-160
• /
• 1994

In this paper, we propose a comprehensive geometric correction algorithm of Along Track Scanning Radiometer(ATSR) images. The procedure consists of two cascaded modules; precorrection and fine co-location. The pre-correction algorithm is based on the navigation model which was derived in mathematical forms. This model was applied for correction raw(un-geolocated) ATSR images. The non-systematic geometric errors are also introduced as the limitation of the geometric correction by this analytical method. A fast and automatic algorithm is also presented in the paper for co-locating nadir and forward views of the ATSR images by using a binary cross-correlation matching technique. It removes small non-systematic errors which cannot be corrected by the analytic method. The proposed algorithm does not require any auxiliary informations, or a priori processing and avoiding the imperfect co-registratio problem observed with multiple channels. Coastlines in images are detected by a ragion segmentation and an automatic thresholding technique. The matching procedure is carried out with binaty coastline images (nadir and forward), and it gives comparable accuracy and faster processing than a patch based matching technique. This technique automatically reduces non-systematic errors between two views to .$\pm$ 1 pixel.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.92.3-92
• /
• 2002

A lot of localization algorithms have been developed in order to achieve autonomous navigation. However, most of localization algorithms are restricted to certain conditions. In this paper, Monte Carlo localization scheme with a map-matching algorithm is suggested as a robust localization method for the Public Service Robot to accomplish its tasks autonomously. Monte Carlo localization can be applied to local, global and kidnapping localization problems. A range image based measure function and a geometric pattern matching measure function are applied for map matching algorithm. This map matching method can be applied to both polygonal environments and un-polygonal environments and achieves...

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.6
• /
• pp.58-67
• /
• 2009

A correspondence matching is one of the important tasks in computer vision, and it is not easy to find corresponding points in variable environment where a scale, rotation, view point and illumination are changed. A SURF(Speeded Up Robust Features) algorithm have been widely used to solve the problem of the correspondence matching because it is faster than SIFT(Scale Invariant Feature Transform) with closely maintaining the matching performance. However, because SURF considers only gray image and local geometric information, it is difficult to match corresponding points on the image where similar local patterns are scattered. In order to solve this problem, this paper proposes an extended SURF algorithm that uses the invariant color and global geometric information. The proposed algorithm can improves the matching performance since the color information and global geometric information is used to discriminate similar patterns. In this paper, the superiority of the proposed algorithm is proved by experiments that it is compared with conventional methods on the image where an illumination and a view point are changed and similar patterns exist.

• Journal of Korea Multimedia Society
• /
• v.18 no.8
• /
• pp.901-908
• /
• 2015

Methods of detecting, describing, matching image features, like corners and blobs, have been actively studied as a fundamental step for image processing and computer vision applications. As one of feature description/matching methods, LLAH(Locally Likely Arrangement Hashing) describes image features based on the geometric relationship between their neighbors, and thus is suitable for scenes with poor texture. This paper presents a modified LLAH algorithm, which includes the image features themselves for robustly describing the geometric relationship unlike the original LLAH, and employes a voting-based feature matching scheme that makes feature description much simpler. Then, this paper quantitatively analyzes its performance with synthetic images in the presence of Gaussian noise.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.1
• /
• pp.94-99
• /
• 2007

In this paper, a 2-dimensional edge-based matching algorithm is proposed that combines the generalized Hough transform (GHT) and the Chamfer matching to complement weakness of either method. First, the GHT is used to find approximate object positions and orientations, and then these positions and orientations are used as starling parameter values to find more accurate position and orientation using the Chamfer matching. Finally, matching accuracy is further refined by using a subpixel algorithm. The algorithm was implemented and successfully tested on a number of images containing various electronic components.

• 한국지형공간정보학회:학술대회논문집
• /
• 2004.10a
• /
• pp.25-31
• /
• 2004

To obtain the 3-D coordinates of the urban roads from aerial images, the accurate matching technique in road areas is required. In this paper, we suggest the relational matching method that is performed by comparison of relationships of road pavement markings after they are extracted from aerial images using geometric properties and spatial relationships of the pavement markings. Relational matching requires not only high level description of features but also the solution for inexact matching problems. In addition, it needs a lot of tests for the reliable final result. In this research, we described features as calculating geometric properties of the pavement markings, suggested the solution for inextact matching problems, and performed tests to decide whether the result is acceptable or not, which use the property that road areas are flat. In order to evaluate the accuracy of matching, we made a visual evaluation and compared the result of this technique with those measured by analytical photogrammetry.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.5
• /
• pp.493-498
• /
• 2007

In this paper, a 2-dimensional accurate edge-based matching algorithm using subpixel edges is proposed that combines the Generalized Hough Transform(GHT) and the Chamfer matching to complement the weakness of either method. First, the GHT is used to find the approximate object positions and orientations, and then these positions and orientations are used as starting parameter values to find more accurate position and orientation using the Chamfer matching with distance interpolation. Finally, matching accuracy is further refined by using a subpixel algorithm. Testing results demonstrate that greater matching accuracy is achieved using subpixel edges rather than edge pixels.

• Korean Journal of Remote Sensing
• /
• v.40 no.1
• /
• pp.103-114
• /
• 2024

The escalating demands for high-resolution satellite imagery necessitate the dissemination of geospatial data with superior accuracy.Achieving precise positioning is imperative for mitigating geometric distortions inherent in high-resolution satellite imagery. However, maintaining sub-pixel level accuracy poses significant challenges within the current technological landscape. This research introduces an approach wherein upsampling is employed on both the satellite image and ground control points (GCPs) chip, facilitating the establishment of a high-resolution satellite image precision sensor orientation. The ensuing analysis entails a comprehensive comparison of matching performance. To evaluate the proposed methodology, the Compact Advanced Satellite 500-1 (CAS500-1), boasting a resolution of 0.5 m, serves as the high-resolution satellite image. Correspondingly, GCP chips with resolutions of 0.25 m and 0.5 m are utilized for the South Korean and North Korean regions, respectively. Results from the experiment reveal that concurrent upsampling of satellite imagery and GCP chips enhances matching performance by up to 50% in comparison to the original resolution. Furthermore, the position error only improved with 2x upsampling. However,with 3x upsampling, the position error tended to increase. This study affirms that meticulous upsampling of high-resolution satellite imagery and GCP chips can yield sub-pixel-level positioning accuracy, thereby advancing the state-of-the-art in the field.