• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.25 no.6_1
• /
• pp.529-536
• /
• 2007

Registration between image and object space is a fundamental step in photogrammetry and computer vision. Along with rapid development of sensors - multi/hyper spectral sensor, laser scanning sensor, radar sensor etc., the needs for registration between different sensors are ever increasing. There are two important considerations on different sensor registration. They are sensor invariant feature extraction and correspondence between them. Since point to point correspondence does not exist in image and laser scanning data, it is necessary to have higher entities for extraction and correspondence. This leads to modify first, existing mathematical and geometrical model which was suitable for point measurement to line measurements, second, matching scheme. In this research, linear feature is selected for sensor invariant features and matching entity. Linear features are incorporated into mathematical equation in the form of extended collinearity equation for registration problem known as photo resection which calculates exterior orientation parameters. The other emphasis is on the scheme of finding matched entities in the aide of RANSAC (RANdom SAmple Consensus) in the absence of correspondences. To relieve computational load which is a common problem in sampling theorem, deterministic sampling technique and selecting 4 line features from 4 sectors are applied.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.4
• /
• pp.48-57
• /
• 1992

This paper addresses the estimation of the shift vector from aerial image sequences. The conventional feature-based and area-based matching methods are simulated for determining the suitable image registration scheme. Computer simulations show that the feature-based matching schemes based on the co-occurrence matrix, autoregressive model, and edge information do not give a reliable matching for aerial image sequences which do not have a suitable statistical model or significant features. In area-based matching methods we try various similarity functions for a matching measure and discuss the factors determining the matching accuracy. To reduce the estimation error of the shift vector we propose the reference window selection scheme. We also discuss the performance of the proposed algorithm based on the simulation results.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.999-1000
• /
• 2008

Image Registration is used many works in image processing widely. But It is difficult to find the accuracy informations such as translation, rotation, and scaling between images. This paper proposes an algorithm that Fourier based image registration using the pyramid edge detection and line fitting. It can be estimated the informations by each sub-pixels. The proposed algorithm can be used for image registrations which high efficiency is required such as GIS, or MRI, CT, image mosaicing, weather forecasting, etc.

• Journal of Korean Society for Geospatial Information Science
• /
• v.16 no.2
• /
• pp.49-56
• /
• 2008

Image registration is one of the critical techniques of image mosaic which has many applications such as generating panoramas, video monitoring, image rendering and reconstruction, etc. The fundamental tasks of image registration are point features extraction and tracking which take much computation time. KLT(Kanade-Lucas-Tomasi) feature tracker has proposed for extracting and tracking features through image sequences. The aim of this study is to demonstrate the usage of effective and robust KLT feature detector and tracker for an image registration using the sequence image frames captured by UAV video camera. In result, by using iterative implementation of the KLT tracker, the features extracted from the first frame of image sequences could be successfully tracked through all frames. The process of feature tracking in the various frames with rotation, translation and small scaling could be improved by a careful choice of the process condition and KLT pyramid implementation.

• Radiation Oncology Journal
• /
• v.35 no.2
• /
• pp.101-111
• /
• 2017

The number of imaging data sets has significantly increased during radiation treatment after introducing a diverse range of advanced techniques into the field of radiation oncology. As a consequence, there have been many studies proposing meaningful applications of imaging data set use. These applications commonly require a method to align the data sets at a reference. Deformable image registration (DIR) is a process which satisfies this requirement by locally registering image data sets into a reference image set. DIR identifies the spatial correspondence in order to minimize the differences between two or among multiple sets of images. This article describes clinical applications, validation, and algorithms of DIR techniques. Applications of DIR in radiation treatment include dose accumulation, mathematical modeling, automatic segmentation, and functional imaging. Validation methods discussed are based on anatomical landmarks, physical phantoms, digital phantoms, and per application purpose. DIR algorithms are also briefly reviewed with respect to two algorithmic components: similarity index and deformation models.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.3
• /
• pp.287-293
• /
• 2012

This paper presents an efficient image registration method by measuring the similarity, which is based on multi-dimensional intensity fluctuation. Multi-dimensional intensity which considers 4 directions of the image, is applied to reflect more properties in similarity decision. And an intensity fluctuation is also applied to measure comprehensively the similarity by considering a change in brightness between the adjacent pixels of image. The normalized cross-correlation(NCC) is calculated by considering an intensity fluctuation to each of 4 directions. The 5 correlation coefficients based on the NCC have been used to measure the registration, which are total NCC, the arithmetical mean and a simple product on the correlation coefficient of each direction and on the normalized correlation coefficient by the maximum NCC, respectively. The proposed method has been applied to the problem for registrating the 22 face images of 243*243 pixels and the 9 person images of 500*500 pixels, respectively. The experimental results show that the proposed method has a superior registration performance that appears the image properties well. Especially, the arithmetical mean on the correlation coefficient of each direction is the best registration measure.

• Proceedings of the KIEE Conference
• /
• 2003.11b
• /
• pp.191-194
• /
• 2003

In this paper, we propose a new accurate and robust image mosaic technique of the mural underdrawing taken from the infra-red camera, which is based on multiple image registration and adaptive blending technique. The image mosaicing methods which have been developed so far have the following deficits. It is hard to generate a high resolution image when there are regions that do not have features or intensity gradients, and there is a trade-off in overlapping region site in view of registration and blending. We consider these issues as follows. First, in order to mosaic Images with neither noticeable features nor intensity gradients, we use a Projected supplementary pattern and pseudo color image for features in the image Pieces which are registered. Second, we search the overlapping region size with minimum blending error between two adjacent images and then apply blending technique to minimum error overlapping region. Finally, we could find our proposed method is more effective and efficient for image mosaicing than conventional mosaic techniques and also is more adequate for the application of infra-red mural underdrawing mosaicing. Experimental results show the accuracy and robustness of the algorithm.

• The Journal of Korean Society for Radiation Therapy
• /
• v.30 no.1_2
• /
• pp.97-105
• /
• 2018

Purpose : Proton Therapy using Bragg-peak, because it has distinct characteristics in providing maximum dosage for tumor and minimal dosage for normal tissue, a medical imaging system that can quantify changes in patient position or treatment area is of paramount importance to the treatment of protons. The purpose of this research is to evaluate the usefulness of the algorithm by comparing the image matching through the set-up and in-house code through the existing dips program by producing a Matlab-based in-house registration code to determine the error value between dips and DRR to evaluate the accuracy of the existing treatment. Materials and Methods : Thirteen patients with brain tumors and head and neck cancer who received proton therapy were included in this study and used the DIPS Program System (Version 2.4.3, IBA, Belgium) for image comparison and the Eclipse Proton Planning System (Version 13.7, Varian, USA) for patient treatment planning. For Validation of the Registration method, a test image was artificially rotated and moved to match the existing image, and the initial set up image of DIPS program of existing set up process was image-matched with plan DRR, and the error value was obtained, and the usefulness of the algorithm was evaluated. Results : When the test image was moved 0.5, 1, and 10 cm in the left and right directions, the average error was 0.018 cm. When the test image was rotated counterclockwise by 1 and $10^{\circ}$, the error was $0.0011^{\circ}$. When the initial images of four patients were imaged, the mean error was 0.056, 0.044, and 0.053 cm in the order of x, y, and z, and 0.190 and $0.206^{\circ}$ in the order of rotation and pitch. When the final images of 13 patients were imaged, the mean differences were 0.062, 0.085, and 0.074 cm in the order of x, y, and z, and 0.120 cm as the vector value. Rotation and pitch were 0.171 and $0.174^{\circ}$, respectively. Conclusion : The Matlab-based In-house Registration code produced through this study showed accurate Image matching based on Intensity as well as the simple image as well as anatomical structure. Also, the Set-up error through the DIPS program of the existing treatment method showed a very slight difference, confirming the accuracy of the proton therapy. Future development of additional programs and future Intensity-based Matlab In-house code research will be necessary for future clinical applications.

• Journal of Broadcast Engineering
• /
• v.8 no.1
• /
• pp.19-29
• /
• 2003

The demand for high-resolution images is gradually increasing, whereas many imaging systems yield aliased and undersampled images during image acquisition. In this paper, we propose a high-resolution image reconstruction algorithm considering inaccurate subpixel registration. A regularized Iterative reconstruction algorithm is adopted to overcome the ill-posedness problem resulting from inaccurate subpixel registration. In particular, we use multichannel image reconstruction algorithms suitable for application with multiframe environments. Since the registration error in each low-resolution has a different pattern, the regularization parameters are determined adaptively for each channel. We propose a methods for estimating the regularization parameter automatically. The preposed algorithm are robust against the registration error noise. and they do not require any prior information about the original image or the registration error process. Experimental results indicate that the proposed algorithms outperform conventional approaches in terms of both objective measurements and visual evaluation.

• International Journal of CAD/CAM
• /
• v.9 no.1
• /
• pp.37-46
• /
• 2010

Existing methods for the registration of blurred images are efficient for the artificially blurred images or a planar registration, but not suitable for the naturally blurred images existing in the real image mosaic process. In this paper, we attempt to resolve this problem and propose a method for a distortion-free stitching of naturally blurred images for image mosaic. It adopts a multi-resolution and robust feature based inter-layer mosaic together. In each layer, Harris corner detector is chosen to effectively detect features and RANSAC is used to find reliable matches for further calibration as well as an initial homography as the initial motion of next layer. Simplex and subspace trust region methods are used consequently to estimate the stable focal length and rotation matrix through the transformation property of feature matches. In order to stitch multiple images together, an iterative registration strategy is also adopted to estimate the focal length of each image. Experimental results demonstrate the performance of the proposed method.