• Journal of the Korea Society of Computer and Information
• /
• v.11 no.4 s.42
• /
• pp.77-85
• /
• 2006

There is the spatial correlation of the video sequence between the motion vector of current blocks. In this paper, we propose the enhanced fast block matching algorithm using the spatial correlation of the video sequence and the center-biased properly of motion vectors. The proposed algorithm determines an exact motion vector using the predicted motion vector from the adjacent macro blocks of the current frame and the Cross-Hexagonal search pattern. From the of experimental results, we can see that our proposed algorithm outperforms both the prediction search algorithm (NNS) and the fast block matching algorithm (CHS) in terms of the search speed and the coded video's quality. Using our algorithm, we can improve the search speed by up to $0.1{\sim}38%$ and also diminish the PSNR (Peak Signal Noise Ratio) by at nst $0.05{\sim}2.5dB$, thereby improving the video qualify.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.2
• /
• pp.69-80
• /
• 1999

Recently, social requirements of personal identification techniques are rapidly expanding in a number of new application ares. Especially fingerprint recognition is the most important technology. Fingerprint recognition technologies are well established, proven, cost and legally accepted. Therefore, it has more spot lighted among the any other biometrics technologies. In this paper we propose a new on-line fingerprint recognition algorithm for non-inked type live scanner to fit their increasing of security level under the computing environment. Fingerprint recognition system consists of two distinct structural blocks: feature extraction and feature matching. The main topic in this paper focuses on the feature matching using the fingerprint minutiae (ridge ending and bifurcation). Minutiae matching is composed in the alignment stage and matching stage. Success of optimizing the alignment stage is the key of real-time (on-line) fingerprint recognition. Proposed alignment algorithm using clique shows the strength in the search space optimization and partially incomplete image. We make our own database to get the generality. Using the traditional statistical discriminant analysis, 0.05% false acceptance rate (FAR) at 8.83% false rejection rate (FRR) in 1.55 second average matching speed on a Pentium system have been achieved. This makes it possible to construct high performance fingerprint recognition system.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.4
• /
• pp.256-265
• /
• 2003

To improve reliability and practicality, a fingerprint-based biometric system needs to be robust to rotations of an input fingerprint and the processing speed should be fast. Accordingly, this paper presents a new filterbank-based fingerprint feature extraction and matching method that is robust to diverse rotations and reasonably fast. The proposed method fast extracts fingerprint features using a directional filter bank, which effectively decomposes an image into several subband outputs Since matching is also performed rapidly based on the Euclidean distance between the corresponding feature vectors, the overall processing speed is so fast. To make the system robust to rotations, the proposed method generates a set of feature vectors considering various rotations of an input fingerprint and then matches these feature vectors with the enrolled single template feature vector. Experimental results demonstrated the high speed of the proposed method in feature extraction and matching, along with a comparable verification accuracy to that of other leading techniques.

• Journal of Korea Multimedia Society
• /
• v.16 no.12
• /
• pp.1454-1464
• /
• 2013

In this paper, we propose a rapid rigid registration method for the fusion visualization of intra-operative 2D XA and pre-operative 3D CTA images. In this paper, we propose a global movement estimation based on a trilateration for the fast and robust initial registration. In addition, the principal axis of each image is generated and aligned, and the bounding box of the vascular shape is compared for more accurate initial registration. For the fine registration, two images are registered where the distance between two vascular structures is minimized by selective distance measure. In the experiment, we evaluate a speed, accuracy and robustness using five patients' data by comparing the previous registration method. Our proposed method shows that two volumes can be registered at optimal location rapidly, and robustly comparing with the previous method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.1
• /
• pp.112-119
• /
• 2010

This paper defines the probability models for determining the disparity map given stereo images and derives the methods for solving the problem, which is proven to be equivalent to an energy-based stereo matching. Under the assumptions the difference between the pixel on the left image and the corresponding pixel on the right image and the difference between the disparities of the neighboring pixels are exponentially distributed, a recursive approach for estimating the MRF regularizing parameter is proposed. Usually energy-based stereo matching methods are so sensitive to the parameter that it should be carefully determined. The proposed method alternates between estimating the parameter with the intermediate disparity map and estimating the disparity map with the estimated parameter, after computing it with random initial parameter. It is shown that the parameter estimated by the proposed method converges to the optimum and its performance can be improved significantly by adjusting the parameter and modifying the energy term.

• Journal of KIISE:Software and Applications
• /
• v.32 no.1
• /
• pp.41-49
• /
• 2005

In this Paper, we Propose an automatic lung registration technique using local distance propagation for correcting the difference between two temporal images by a patient's movement in abdomen CT image obtained from the same patient to be taken at different time. The proposed method is composed of three steps. First, lung boundaries of two temporal volumes are extracted, and optimal bounding volumes including a lung are initially registered. Second, 3D distance map is generated from lung boundaries in the initially taken volume data by local distance propagation. Third, two images are registered where the distance between two surfaces is minimized by selective distance measure. In the experiment, we evaluate a speed and robustness using three patients' data by comparing chamfer-matching registration. Our proposed method shows that two volumes can be registered at optimal location rapidly. and robustly using selective distance measure on locally propagated 3D distance map.

• Journal of Broadcast Engineering
• /
• v.26 no.1
• /
• pp.26-38
• /
• 2021

In this paper, DLKF (Deep Learning Keypoint Filtering), the deep learning-based keypoint filtering method for the rapidization of the image registration method for remote sensing images is proposed. The complexity of the conventional feature-based image registration method arises during the feature matching step. To reduce this complexity, this paper proposes to filter only the keypoints detected in the artificial structure among the keypoints detected in the keypoint detector by ensuring that the feature matching is matched with the keypoints detected in the artificial structure of the image. For reducing the number of keypoints points as preserving essential keypoints, we preserve keypoints adjacent to the boundaries of the artificial structure, and use reduced images, and crop image patches overlapping to eliminate noise from the patch boundary as a result of the image segmentation method. the proposed method improves the speed and accuracy of registration. To verify the performance of DLKF, the speed and accuracy of the conventional keypoints extraction method were compared using the remote sensing image of KOMPSAT-3 satellite. Based on the SIFT-based registration method, which is commonly used in households, the SURF-based registration method, which improved the speed of the SIFT method, improved the speed by 2.6 times while reducing the number of keypoints by about 18%, but the accuracy decreased from 3.42 to 5.43. Became. However, when the proposed method, DLKF, was used, the number of keypoints was reduced by about 82%, improving the speed by about 20.5 times, while reducing the accuracy to 4.51.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.1
• /
• pp.276-284
• /
• 2013

This paper considers the transfer alignment in the inertial navigation system and the observability analysis is performed for velocity matching. The state variable of the Kalman filter is modeled including the lever arm error and the measurement equation is obtained. The SOM(Stripped Observability Matrix) method is used for the observability analysis for various maneuvering conditions of the vehicle, which gives the full state observability condition as a specific maneuver sequence of the vehicle. While the observability analysis of a lever arm effect in the existing papers is mainly performed by simulations, we performed it analytically by the observability analysis method. The analysis result is verified using the computer simulations.

• Proceedings of the KSRS Conference
• /
• 2008.03a
• /
• pp.80-85
• /
• 2008

최근 도심지역이 급변하고 고해상도 위성영상의 보급이 증가함에 따라 고해상도 위성영상을 이용한 수치표고모델과 정사영상 생성에 관한 연구가 활발해 지고 있다. 본 연구에서는 IKONOS, SPOT5, QUICKBIRD, KOMPSAT2 위성영상을 이용하여 DEM 과 정사영상을 생성하였으며 USGS DTED 와 기준점을 이용하여 결과의 정확도를 비교 분석하였다. 보다 정확한 DEM 생성을 위해 자동 피라미드 알고리즘을 적용하고 영상 정합시 에피폴라 기하학을 적용하였다. 정사 영상 생성시 DTED 높이값을 이용하여 보정을 수행하였으며 생성 속도를 높이기 위하여 리샘플링 그리드를 적용하였다. 본 연구에서 DEM 과 정사영상 생성시 QUICKBIRD 와 SPOT5 의 경우 영상의 용량이 매우 커 메모리 부족문제와 알고리즘 수행 속도 저하가 발생함을 확인하였다. 이를 개선하기 위하여 DEM 생성시 정합 후보점의 개수를 줄이는 알고리즘을 고안하여 기존에 메모리 문제로 생성하지 못했던 QUICKBIRD와 SPOT5 의 DEM 을 생성하였으며 정사 영상 생성시 리샘플링 그리드를 적용하여 고해상도 정상영상 생성 속도 개선에 상당한 효과를 가져왔다. 그러나 고해상도 위성 영상의 용량이 점점 커져감에 따라 이러한 메모리 문제와 처리 속도 저하에 관한 문제는 추후 계속적으로 연구되어야 할 부분이라고 할 수 있다. 본 연구에서 생성한 IKONOS, SPOT5, QUICKBIRD DEM 의 정확도를 USGS DTED 와 비교한 결과 13${\sim}$15 m 정도의 RMS 높이 오차가 산출되었으며 생성된 IKONOS, QUICKBIRD, KOMPSAT2 정사영상을 기준점과 비교한 결과 3 m 정도의 거리오차가 산출되었음을 확인하였다.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.12
• /
• pp.953-964
• /
• 2003

In the block matching algorithm, search patterns of different shapes or sizes and the distribution of motion vectors have a large impact on both the searching speed and the image quality. In this paper, we propose a new fast block matching algorithm using the cross pattern and the flat-hexagon search pattern. Our algorithm first finds the motion vectors that are close to the center of search window using the cross pattern, and then lastly finds the other motion vectors that are not close to the center of search window using the flat-hexagon search pattern. Through experiments, compared with the hexagon-based search algorithm(HEXBS), the proposed cross pattern and flat-hexagonal pattern search algorithm(CFHPS ) improves about 0.2-6.2% in terms of average number of search point per motion vector estimation and improves about 0.02-0.31dB in terms of PSNR(Peak Signal to Noise Ratio).