• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.42 no.4 s.304
• /
• pp.1-10
• /
• 2005

This paper presents a map matching method using multiple hypothesis technique(MHT) to identify the road that a land vehicle is located on. To realize a map matching method using MHT, Pseudo-measurements are generated utilizing adjacent roads of GPS/DR position and the MHT is reformulated as a single target problem. Since pseudo-measurements are generated using digital map, topological properties such as road connection, direction, and road facility information are considered in calculating probabilities of hypotheses. In order to improve the map matching performance under when bias errors exist in digital road map data, a Kalman filter is employed to estimate the biases. Field experimental results show that the proposed map matching method provides the consistent performance even in complex downtown areas, overpass/underpass areas, and in the areas where roads are adjacent in parallel.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.41 no.1
• /
• pp.55-62
• /
• 2004

A semi-automatic registration process of determining specified points is presented, which is required to register brain MR images based on Talairach atlas. Generally, ten specified points that define Talairach coordinates are anterior commissure(AC), posterior commissure (PC), anterior feint (AP), posterior point (PP), superior point (SP), inferior point (IP), left point (LP), right point (RP) and two points for the midline of the brain. The suggested method reduces user interaction for S points, and finds the necessary points for registration in a more stable manner by finding AC and PC using two-level shape matching of the corpus callosum (CC) in an edge-enhanced brain M image. Remaining points are found using the intensity information of cutview.

• 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
• /
• v.43 no.9
• /
• pp.1034-1042
• /
• 2016

Together with machine-learning frameworks, area-based imagery registration techniques can be easily applied to diverse types of image pairs without predefined features and feature descriptors. However, feature detectors are often used to quickly identify candidate image patch pairs, limiting the applicability of these registration techniques. In this paper, we propose a ConvNet (Convolutional Network) "Dart" that provides not only the matching metric between patches, but also information about their distance, which are helpful in reducing the search space of the corresponding patch pairs. In addition, we propose a ConvNet "Fad" to identify the patches that are difficult for Dart to improve the accuracy of registration. These two networks were successfully implemented using Deep Learning with the help of a number of training instances generated from a few registered image pairs, and were successfully applied to solve a simple image registration problem, suggesting that this line of research is promising.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.10
• /
• pp.123-131
• /
• 1999

In this paper, we proposed stereo matching algorithm by dynamic programming with edges emphasized. Existing algorithms show blur generally at depth discontinuities owing to smoothness constraint and non-existence of matching pixel in occlusion regions. Also it accompanies matching error by lackness of matching information in the untextured regions. This paper defines new cost function to make up for the problems occurred to existing algorithms. It is possible through deriving matching of edges in left and right images to be carried out between edge regions anf deriving that in the other regions to be peformed between the other regions. In case of the possibility that edges can be Produced in a large amount, matching between edge information adds weight to cost function in proportion to Path distance. Proposed algorithm was applied to various images obtained by convergent camera model as well as parallel camera model. As the result, proposed algorithm showed improved performance in the aspect of matching error and processing in the occlusion regions compared to existing algorithms. Also it could improve blur especially in discontinuity regions.

• 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 KIISE:Computer Systems and Theory
• /
• v.31 no.3_4
• /
• pp.224-238
• /
• 2004

Multi-modality image registration is a widely used image processing technique to obtain composite information from two different kinds of image sources. This study proposes an image registration method based on moment information and surface distance, which improves the previous surface-based registration method. The proposed method ensures stable registration results with low registration error without being subject to the initial position and direction of the object. In the preprocessing step, the surface points of the object are extracted, and then moment information is computed based on the surface points. Moment information is matched prior to fine registration based on the surface distance, in order to ensure stable registration results even when the initial positions and directions of the objects are very different. Moreover, surface comer sampling algorithm has been used in extracting representative surface points of the image to overcome the limits of the existed random sampling or systematic sampling methods. The proposed method has been applied to brain MRI(Magnetic Resonance Imaging) and PET(Positron Emission Tomography), and its accuracy and stability were verified through registration error ratio and visual inspection of the 2D/3D registration result images.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2011.02a
• /
• pp.242-242
• /
• 2011

현재 반도체 및 디스플레이 장비들이 공정 매개변수 및 플라즈마 변수를 독립적으로 제어하기 위하여 전원 주파수를 다양하게 사용된다. 플라즈마의 상태나 에너지 전달 효율은 반도체 및 디스플레이 공정에 중요한 요소이다. 따라서 플라즈마 발생장치의 전원 주파수를 바꾸었을 때의 플라즈마 밀도와 에너지 전달 효율에 관하여 연구하였다. 공정용 유도 결합 플라즈마(ICP)를 발생시키기 위하여 신호 발생기에서 전력 증폭기와 임피던스 정합회로(Matcher)를 거쳐 반응 용기에서 플라즈마를 발생시켰다. 6 mTorr의 압력에서 주파수는 13.56 MHz에서부터 80 MHz까지, 15~60 W의 전력을 인가하였다. 플라즈마의 에너지 효율을 측정은 제작한 로고스키코일(Rogowski Coil)을 이용하여 시스템 전반을 등가회로로 계산하였으며, 플라즈마 밀도는 반응용기 중앙에서 부유 탐침법을 적용하여 도출하였다. 같은 전력 조건에서 주파수가 증가함에 따라 플라즈마 밀도가 증가함을 볼 수 있었다. 그러나 플라즈마 에너지 효율은 주파수가 높아짐에 따라 점점 커지다 작아지는 경향을 볼 수 있었다. 에너지 전달 효율의 변화는 정합회로의 표피효과(Skin effect)에 기인하며 플라즈마 밀도의 변화는 이온의 에너지 손실에 기인한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.615-618
• /
• 2006

The broadband power detector for direct- onversion Six-port output circuit was designed and implementaed in this paper. The power detector should linearly operated to produce the linear amplitude and phase signal fer input RF signal in required broadband. So, the power detector should be designed under conditions of matching circuit with low VSWR. The designed power detectors, which were implemented in L-band with 50 ohm matching and Ku-band with matching circuit and isolator, respectively, were evaluated in the performances.

• Journal of KIISE:Software and Applications
• /
• v.27 no.11
• /
• pp.1115-1122
• /
• 2000

기존의 블록 정합 알고리즘인 FS(Full Search) 알고리즘은 정확한 움직임 벡터를 구할 수 있으나 요구되는 계산량이 많다. 반면에 국부 탐색을 하는 고속 블록 정합 알고리즘은 FS보다 빠른 탐색을 할 수 있으나 FS 보다 정합 오차가 크다. 본 연구는 전역탐색을 하는 유전자 알고리즘에 빠른 탐색을 하는 블록 정합 알고리즘인 NTSS(New Three Ste Search)알고리즘을 제안한다. 제안한 방법에서 각 염색체는 움직임 벡터를 표현하며 초기 염색체는 탐색 공간의 중심 탐색점 가까이에 고정적으로 발생시키고 각 염색체는 MSE(Mean Square Error)값으로 평가된다. 평가된 염색체 중 작은 MSE값을 가지는 염색체가 NTSS의 탐색점 수만큼 다음 세대의 탐색점으로 선택된다. 선택된 염색체는 세대를 거치면서 돌연변이 연산과 교배연산이 행해지고 이 때 돌연변이 연산의 크기는 NTSS의 탐색 단계 크기가 된다. 제안한 세대 수 만큼 반복 후 최소의 MSE 값을 가지는 유전자가 해당 블록의 움직임 벡터가 된다. 시뮬레이션 결과 제안한 방법을 가장 우수한 성능을 가지는 FS와 유사한 MSE 값을 얻을 수 있었고 동시에 FS에서 요구되는 계산량에 비해 많은 계산량을 줄일 수 있었다.