• Journal of Broadcast Engineering
• /
• v.17 no.4
• /
• pp.634-639
• /
• 2012

In this paper, we propose nonlinear optimization method for feature matching from multiple view image. Typical solution of feature matching is by solving linear equation. However this solution has large error due to nonlinearity of image formation model. If typical nonlinear optimization method is used, complexity grows exponentially over the number of features. To make complexity lower, we use sparse Levenberg-Marquardt nonlinear optimization for matching of features over multiple view image.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.515-517
• /
• 2007

In this study we attempted to estimate damage scope such as bridges destruction, farmland deformation, forest damage, etc occurred by typhoon using two digital aerial images for future high-resolution Kompsat-3 applications. The process procedures are followings: First, image registration between time-different aerial images was implemented. In this process one image was geometrically corrected by image-to-image registration. Second, image classification was done according to 4 classes. Finally through the comparison of classified two images the area of damage by flood and storm was approximately calculated. These results showed that it is possible to estimate the damage scale relatively rapidly using high-resolution images.

• Journal of Sensor Science and Technology
• /
• v.32 no.5
• /
• pp.313-319
• /
• 2023

In this study, we propose a method to improve the accuracy of acoustic odometry using optimal frame interval selection for Fourier-based image registration. The accuracy of acoustic odometry is related to the phase correlation result of image pairs obtained from the forward-looking sonar (FLS). Phase correlation failure is caused by spurious peaks and high-similarity image pairs that can be prevented by optimal frame interval selection. We proposed a method of selecting the optimal frame interval by analyzing the factors affecting phase correlation. Acoustic odometry error was reduced by selecting the optimal frame interval. The proposed method was verified using field data.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.40 no.4
• /
• pp.293-304
• /
• 2022

In this study, to analyze the effect of buildings on the image co-registration performance, co-registration results are compared according to the presence or absence of matching points extracted from buildings. To remove the matching points extracted from buildings, a building mask generated by extracting building objects from the digital topographic map was used. In addition, matching points extraction performance and image co-registration accuracy were analyzed according to the magnitude of the convergence angle. Image co-registration results were compared by applying the affine and piecewise linear transformation models, respectively. According to the experimental results, the affine transformation model showed an overall improvement in accuracy after removing the matching points extracted from buildings. On the other hand, the piecewise linear transformation model improved the accuracy at the checkpoints including the surrounding buildings, but the accuracy improvement was not significant at checkpoints in the flat area without the existence of buildings. In addition, when the piecewise linear transformation model was applied, stable accuracy of less than 2 pixels was derived from images with a convergence angle of 20° or less.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.6
• /
• pp.652-658
• /
• 2019

When IoT is applied to various research experiment fields such as physics, pharmacy, biology and medicine, it can increase the safety and convenience of researchers by intelligently monitoring and controlling research equipment and environment with various sensors and devices. For accurate and convenient record management and the research history and the basis but also for the reverse tracking, real-time reagent measurement and registration should be provided as a research support automation services. Currently, existing methods of reagent management are operated by computerized method, but reagent registration and management are not automated. And also record is managed manually, there are many hassles and problems such as a record error and too much time required for quantification and registration for many reagents. In this paper, we study a real time reagent measuring and registration method based on IoT to resolve the problems aforementioned, by the information of the reagent acquired by image recognition and NFC method.

• Journal of Biomedical Engineering Research
• /
• v.44 no.5
• /
• pp.303-314
• /
• 2023

This study aimed to assess the practical feasibility of advanced deformable image registration (DIR) algorithms in radiotherapy by employing two distinct datasets. The first dataset included 14 4D lung CT scans and 31 head and neck CT scans. In the 4D lung CT dataset, we employed the DIR algorithm to register organs at risk and tumors based on respiratory phases. The second dataset comprised pre-, mid-, and post-treatment CT images of the head and neck region, along with organ at risk and tumor delineations. These images underwent registration using the DIR algorithm, and Dice similarity coefficients (DSCs) were compared. In the 4D lung CT dataset, registration accuracy was evaluated for the spinal cord, lung, lung nodules, esophagus, and tumors. The average DSCs for the non-learning-based SyN and NiftyReg algorithms were 0.92±0.07 and 0.88±0.09, respectively. Deep learning methods, namely Voxelmorph, Cyclemorph, and Transmorph, achieved average DSCs of 0.90±0.07, 0.91±0.04, and 0.89±0.05, respectively. For the head and neck CT dataset, the average DSCs for SyN and NiftyReg were 0.82±0.04 and 0.79±0.05, respectively, while Voxelmorph, Cyclemorph, and Transmorph showed average DSCs of 0.80±0.08, 0.78±0.11, and 0.78±0.09, respectively. Additionally, the deep learning DIR algorithms demonstrated faster transformation times compared to other models, including commercial and conventional mathematical algorithms (Voxelmorph: 0.36 sec/images, Cyclemorph: 0.3 sec/images, Transmorph: 5.1 sec/images, SyN: 140 sec/images, NiftyReg: 40.2 sec/images). In conclusion, this study highlights the varying clinical applicability of deep learning-based DIR methods in different anatomical regions. While challenges were encountered in head and neck CT registrations, 4D lung CT registrations exhibited favorable results, indicating the potential for clinical implementation. Further research and development in DIR algorithms tailored to specific anatomical regions are warranted to improve the overall clinical utility of these methods.

• Journal of radiological science and technology
• /
• v.32 no.2
• /
• pp.195-203
• /
• 2009

Image registration is a fundamental task in image processing used to match two or more images. It gives new information to the radiologists by matching images from different modalities. The objective of this study is to develop 2D image registration algorithm for PET/CT and CT images acquired by different systems at different times. We matched two CT images first (one from standalone CT and the other from PET/CT) that contain affluent anatomical information. Then, we geometrically transformed PET image according to the results of transformation parameters calculated by the previous step. We have used Affine transform to match the target and reference images. For the similarity measure, mutual information was explored. Use of particle swarm algorithm optimized the performance by finding the best matched parameter set within a reasonable amount of time. The results show good agreements of the images between PET/CT and CT. We expect the proposed algorithm can be used not only for PET/CT and CT image registration but also for different multi-modality imaging systems such as SPECT/CT, MRI/PET and so on.

• Proceedings of the KOSOMBE Conference
• /
• v.1996 no.11
• /
• pp.155-156
• /
• 1996

The intercommissural(AC-PC) line is automatically detected for HR and PET images. With the detected AC-PC lines from MR and PET images, fully non-iterative automatic co- registration is accomplished. It provides a new automated method for image co-registration.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.28 no.2
• /
• pp.281-287
• /
• 2010

This study compares transformation algorithms for co-registration of terrestrial laser scan data. Pair-wise transformation which is used for transformation of scan data from more than two different view accumulates errors. ICP algorithm commonly used for co-registration between scan data needs initial geometry information. And it is difficult to co-register simultaneously because of too many control points when managing scan at the same time. Therefore, this study perform global registration technique using matching points. Matching points are extracted automatically from intensity image by SIFT and global registration is performed using GP analysis. There are advantages for operation speed, accuracy, automation in suggested global registration algorithm. Through the result from it, registration algorithms can be developed by considering accuracy and speed.

• The KIPS Transactions:PartB
• /
• v.12B no.3 s.99
• /
• pp.265-272
• /
• 2005

In this paper, we propose a technique which is speedily searching for correspondent points of two images using Voronoi-Distance, as an image registration method for feature based image mosaics. It extracts feature points in two images by the SUSAN corner detector, and then create not only the Voronoi Surface which has distance information among the feature points in the base image using a priority based Voronoi distance algorithm but also select the model area which has the maximum variance value of coordinates of the feature points in the model image. We propose a method for searching for the correspondent points in the Voronoi surface of the base image overlapped with the model area by use of the partitive search algorithm using queues. The feature of the method is that we can rapidly search for the correspondent points between adjacent images using the new Voronoi distance algorithm which has $O(width{\times}height{\times}logN)$ time complexity and the the partitive search algerian using queues which reduces the search range by a fourth at a time.