• Journal of Computing Science and Engineering
• /
• v.6 no.1
• /
• pp.1-11
• /
• 2012

Computed tomography (CT) images are widely used for the analysis of the temporal evaluation or monitoring of the progression of a disease. The follow-up examinations of CT scan images of the same patient require a 3D registration technique. In this paper, an automatic and robust registration is proposed for the rigid registration of 3D CT images. The proposed method involves two steps. Firstly, the two CT volumes are aligned based on their principal axes, and then, the alignment from the previous step is refined by the optimization of the similarity score of the image's voxel. Normalized cross correlation (NCC) is used as a similarity metric and a downhill simplex method is employed to find out the optimal score. The performance of the algorithm is evaluated on phantom images and knee synthetic CT images. By the extraction of the initial transformation parameters with principal axis of the binary volumes, the searching space to find out the parameters is reduced in the optimization step. Thus, the overall registration time is algorithmically decreased without the deterioration of the accuracy. The preliminary experimental results of the study demonstrate that the proposed method can be applied to rigid registration problems of real patient images.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7A
• /
• pp.520-528
• /
• 2003

This paper proposes a method of implementing synthetic stereo and an acoustic echo cancellation algorithm for multiple participant conference system. Synthetic stereo is generated by HRTF and two loudspeakers. A robust adaptive algorithm for synthetic stereo echo cancellation is proposed to reduce the weight misalignment due to near-end speech signals and ambient noises. The proposed adaptive algorithm is modified version of SMAP algorithm and the coefficients of adaptive filter is updated with cross correlation of input and estimation error signal normalized with sum of the autocorrelation of input signal and the power of the estimation error signal multiplied with projection order. This is more robust to projection order and ambient noise than conventional SMAP. Computer simulation show that the proposed algorithm effectively attenuates synthetic stereo acoustic echo.

• Proceedings of the KIEE Conference
• /
• 2003.11b
• /
• pp.91-94
• /
• 2003

In this paper, we achieve implementation of a Time-Frequency Domain Reflectometry(TFDR) system through comparatively low performance(100MS/s) PCI extensions for Instrumentation(PXI). The TFDR is the general methodology of Time Domain Reflectometry(TDR) and Frequency Domain Reflectometry(FDR). This methodology is robust in Gaussian noises, because the fixed frequency bandwidth is used. Moreover, the methodology can get more information of the fault by using the normalized time-frequency cross correlation function. The Arbitrary Waveform Generator(AWG) module generates the input signal, and the digital oscilloscope module acquires the input and reflected signals, while PXI controller module performs the control of the total PXI modules and execution of the main algorithm. The maximum range of measurement and the blind spot are calculated according ta variations of time duration and frequency bandwidth. On the basis of above calculations, the algorithm and the design of input signals used in the TFDR system are verified by real experiments. The correlation function is added to the TDR methodology for reduction of the blind spot in the TFDR system.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.9
• /
• pp.521-530
• /
• 2005

In this paper, a new high resolution reflectometry scheme, time-frequency domain reflectometry(TFDR), isproposed to detect and estimate a fault in a transmission line. Traditional reflectometry methodologies have been achieved either in the time domain or in the frequency domain only. However, the TFDR can jump over the performance limits of the traditional reflectometry methodologies because the acquired signal is analyzed in time and frequency domain simultaneously. In the TFDR, the new reference signal and the novel TFDR algorithm are proposed for analyzing the acquired signal in the time-frequency domain. Because the reference signal of Gaussian envelop chirp signal is localized in the time and frequency domain simultaneously, it is suitable to the analysis in the time-frequency domain. In the proposed TFDR algorithm, the time-frequency distribution function and the normalized time-frequency cross correlation function are used to detect and estimate a fault in a transmission line. That algorithm is verified for real-world coaxial cables which are typical transmission line with different types of faults by the TFDR system composed of real instruments. The performance of the TFDR methodology is compared with that o( the commercial time domain reflectomeoy(TDR) experiments, so that concludes the TFDR methodology can detect and estimate the fault with smaller error than TDR methodology.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.2 no.3
• /
• pp.227-230
• /
• 2002

A new iris segmentation and recognition method is described. Combining a statistical classification and elastic boundary fitting, the iris is first segmented robustly and accurately. Once the iris is segmented, one-dimensional signals are computed in the iris and decomposed into multiple frequency bands. Each decomposed signal is approximated by a piecewise linear curve connecting a small set of node points. The node points represent features of each signal. The similarity measture between two iris images is the normalized cross-correlation coefficients between simplified signals.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.24 no.5
• /
• pp.409-416
• /
• 2006

To use image data obtained from different sensors and different techniques, the preprocessing step that registers them in a common coordinate system is needed. For this purpose, we developed the methodology to register middle- and low-resolution satellite images automatically. Firstly, candidate matching points were extracted using the Harris and Harris-affine algorithm. Secondly, we used the correlation coefficient, normalized correlation coefficient and SIFT algorithm to detect conjugate matching points from candidates. Then, to test the feasibility of approaches, we applied the developed methodology to various kinds of satellite images and compared results. The results clearly demonstrate that the methology using the SIFT is appropriate to register these multi-resolution satellite images automatically, compared with the classical cross-correlation.

• Korean Journal of Remote Sensing
• /
• v.37 no.3
• /
• pp.475-491
• /
• 2021

With the recent increase in available high-resolution (< ~1 m) satellite SAR images, the demand for precise registration of SAR images is increasing in various fields including change detection. The registration between high-resolution SAR images acquired in different look angle is difficult due to speckle noise and geometric distortion caused by the characteristics of SAR images. In this study, registration is performed in two stages, coarse and fine, using the x-band SAR data imaged at staring spotlight mode of TerraSAR-X. For the coarse registration, a method combining the adaptive sampling method and SAR-SIFT (Scale Invariant Feature Transform) is applied, and three rigid methods (NCC: Normalized Cross Correlation, Phase Congruency-NCC, MI: Mutual Information) and one non-rigid (Gefolki: Geoscience extended Flow Optical Flow Lucas-Kanade Iterative), for the fine registration stage, was performed for performance comparison. The results were compared by using RMSE (Root Mean Square Error) and FSIM (Feature Similarity) index, and all rigid models showed poor results in all image combinations. It is confirmed that the rigid models have a large registration error in the rugged terrain area. As a result of applying the Gefolki algorithm, it was confirmed that the RMSE of Gefolki showed the best result as a 1~3 pixels, and the FSIM index also obtained a higher value than 0.02~0.03 compared to other rigid methods. It was confirmed that the mis-registration due to terrain effect could be sufficiently reduced by the Gefolki algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.8
• /
• pp.2366-2380
• /
• 2024

In this study, a high-speed template matching system is proposed for wafer-vision alignment. The proposed system is designed to rapidly locate markers in semiconductor equipment used for wafer-vision alignment. We optimized and implemented a template-matching algorithm for the high-speed processing of high-resolution wafer images. Owing to the simplicity of wafer markers, we removed unnecessary components in the algorithm and designed the system using a field-programmable gate array (FPGA) to implement high-speed processing. The hardware blocks were designed using the Xilinx ZCU104 board, and the pyramid and matching blocks were designed using programmable logic for accelerated operations. To validate the proposed system, we established a verification environment using stage equipment commonly used in industrial settings and reference-software-based validation frameworks. The output results from the FPGA were transmitted to the wafer-alignment controller for system verification. The proposed system reduced the data-processing time by approximately 30% and achieved a level of accuracy in detecting wafer markers that was comparable to that achieved by reference software, with minimal deviation. This system can be used to increase precision and productivity during semiconductor manufacturing processes.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.8
• /
• pp.81-87
• /
• 1999

In general, feature detection and tracking algorithms is classified by EBGM using Garbor-jet, NNC-R and STK algorithm using pixel eigenvalue. In those algorithms, EBGM and NCC-R detect features with feature model, but STK algorithm has a characteristics of an automatic feature selection. In this paper, to solve the initial problem of NR tracking in STK algorithm, we detected features using STK algorithm in modelled feature region and tracked features with NR method. In tracking, to improve the tracking accuracy for features by NR method, we proposed BMA-NR method. We evaluated that BMA-NR method was superior to NBMA-NR in that feature tracking accuracy, since BMA-NR method was able to solve the local minimum problem due to search window size of NR.

• Korean Journal of Remote Sensing
• /
• v.40 no.4
• /
• pp.387-396
• /
• 2024

Most very high-resolution (VHR) satellite images provide rational polynomial coefficients (RPC) data to facilitate the transformation between ground coordinates and image coordinates. However, initial RPC often contains geometric errors, necessitating correction through matching with ground control points (GCPs). A GCP chip is a small image patch extracted from an orthorectified image together with height information of the center point, which can be directly used for geometric correction. Many studies have focused on area-based matching methods to accurately align GCP chips with VHR satellite images. In cases with seasonal differences or changed areas, edge-based algorithms are often used for matching due to the difficulty of relying solely on pixel values. However, traditional edge extraction algorithms,such as canny edge detectors, require appropriate threshold settings tailored to the spectral characteristics of satellite images. Therefore, this study utilizes deep learning-based edge information that is insensitive to the regional characteristics of satellite images for matching. Specifically,we use a pretrained pixel difference network (PiDiNet) to generate the edge maps for both satellite images and GCP chips. These edge maps are then used as input for normalized cross-correlation (NCC) and relative edge cross-correlation (RECC) to identify the peak points with the highest correlation between the two edge maps. To remove mismatched pairs and thus obtain the bias-compensated RPC, we iteratively apply the data snooping. Finally, we compare the results qualitatively and quantitatively with those obtained from traditional NCC and RECC methods. The PiDiNet network approach achieved high matching accuracy with root mean square error (RMSE) values ranging from 0.3 to 0.9 pixels. However, the PiDiNet-generated edges were thicker compared to those from the canny method, leading to slightly lower registration accuracy in some images. Nevertheless, PiDiNet consistently produced characteristic edge information, allowing for successful matching even in challenging regions. This study demonstrates that improving the robustness of edge-based registration methods can facilitate effective registration across diverse regions.