• Electrical & Electronic Materials
• /
• v.5 no.2
• /
• pp.224-236
• /
• 1992

본 논문에서는 내부전극을 갖는 마이카-에폭시 복합시료의 계면정합상태에 따른 계면층에서의 절연파괴특성에 대해 조사 연구하였다. 실험결과, 계면은 이상수지층으로 작용되며 마이카는 계면결합제와의 화학적반응 및 흡착에 의해 친수성이 적어짐을 확인하였고 또한 계면의 정합상태는 계면결합제의 수용액 농도에 의해 좌우되었다. 계면정합이 불량하면 인가전압의 상승에 따라 부분방전량의 증가 및 발생빈도의 직선적인 증가 특성이 보이며 계면정합이 양호한 경우는 방전량이 포화되는 시점에서 발생빈도는 지수함수적으로 증가되었다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.06a
• /
• pp.112-115
• /
• 2018

본 논문에서는 공간적 일관성과 시간적 일관성을 모두 고려하는 그래프 컷(graph cuts, GC) 알고리즘을 적용한 새로운 비디오 정합(video stitching) 방법을 제안한다. 먼저 입력 비디오로부터 취득한 전체 프레임에 대해서 정렬(frame alignment) 작업이 완료된 후, 프레임 합성(frame composition)을 위한 정합선 찾기(seam finding) 과정을 진행한다. 정합선을 찾는 과정에서 개선된 그래프 컷 알고리즘을 이용해 정렬된 프레임들을 자연스럽게 합성할 수 있는 최적의 정합선을 찾는다. 우선, 첫번째 입력 프레임에서 찾은 최적 정합선을 참조 정합선으로 설정한다. 그 다음, 연속된 프레임들의 정합선 찾기 과정을 수행할 때, 참조 정합선과의 거리 값을 가중치로 이용하는 새로운 비용 함수를 적용한다. 본 논문에서 제안하는 알고리즘으로 찾은 최적 정합선은 입력 프레임의 중첩 영역에 움직이는 물체가 존재할 때, 물체의 모양을 손상시키지 않으면서 동시에 연속된 프레임의 정합선을 유사한 형태로 유지시킨다. 결과적으로 공간적, 시간적 자연스러움이 보장되는 고품질의 비디오 정합 결과를 얻을 수 있다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.7
• /
• pp.1437-1446
• /
• 2012

In this paper we propose a new stereo matching algorithm which is suitable for application to obtain depth information with high-speed in stereoscopic camera environment. For satisfying these condition we propose a new adaptive stereo matching technique using frequency information in discrete wavelet (DWT) domain and variable matching window. The size of the matching window is selected by analysis of the local property of the image in spatial domain and the feature and scaling factor of the matching window is selected by the frequency property in the frequency domain. For using frequency information we use local DWT and global DWT. We identified that the proposed technique has better peak noise to signal ratio (PSNR) than the fixed matching techniques with similar complexity.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.5
• /
• pp.1-8
• /
• 2000

Point pattern matching schemes for finger print recognition do not guarantee robust matching performance for fingerprint Images of poor quality We present a finger print recognition scheme, where transformation parameters of matched ridge pairs are estimated by Hough transform and the matching hypothesis is verified by a new measure of the matching degree using selective directional information Proposed method may exhibit extremely low FAR(False accept rate) while maintaining low reject rate even for the Images of poor quality because of the robustness to the variation of minutia points.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.8
• /
• pp.701-709
• /
• 1991

In this paper, an analysis approach for the performance of serial search burst format direct sequence spread spectrum[DS-SS] code aequision system using matched filter is persented. And an acquisition system using digital matched filter is chosen for the analysis by this approach. In this acqusition system, since chip decision should be performaned before matched filter

• The KIPS Transactions:PartB
• /
• v.17B no.2
• /
• pp.115-124
• /
• 2010

Stereo matching techniques are categorized in two major schemes, local and global matching techniques. In global matching schemes, several investigations are introduced, where cost accumulation is performed in multiple matching lines. In this paper, we introduce a new multi-line stereo matching techniques which expands a conventional single-line matching scheme to multiple one. Matching cost is based on simple normalized cross correlation. We expand the scan-line optimization technique to a multi-line scan-line optimization technique. The proposed technique first generates a reliability image, which is iteratively updated based on the previous reliability measure. After some number of iterations, the reliability image is completed by a hole-filling algorithm. The hole-filling algorithm introduces a disparity score table which records the disparity score of the current pixel. The disparity of an empty pixel is determined by comparing the scores of the neighboring pixels. The proposed technique is tested using the Middlebury and CMU stereo images. The error analysis shows that the proposed matching technique yields better performance than using conventional global matching algorithm.

• Journal of KIISE:Software and Applications
• /
• v.33 no.3
• /
• pp.335-343
• /
• 2006

This paper proposes a novel technique of marker-based 2D-3D registration to combine 3D information obtained from preoperative CT images into 2D image obtained from intraoperative x-ray fluoroscopy image. Our method is divided into preoperative and intraoperative procedures. In preoperative procedure, we generate CT-derived DRRs using graphics hardware and detect markers automatically. In intraoperative procedure, we propose a hierarchical two- step registration to reduce a degree of freedom from 6-DOP to 2-DOF which is composed of in-plane registration using principal axis method and out-plane registration using minimal error searching method in spherical coordinate. For experimentation, we use cardiac phantom datasets with confirmation markers and evaluate our method in the aspects of visual inspection, accuracy and processing time. As experimental results, our method keeps accuracy and aligns very fast by reducing real-time computations.

• Progress in Medical Physics
• /
• v.13 no.4
• /
• pp.209-217
• /
• 2002

There have been many studies on the application of the reciprocal advantages of multimodality image to define accurate target volume in the Process of radiation treatment planning. For the proper use of the multimodality images, the registration works between different modality images should be performed in advance. In this study, we selected chamfer matching method and mutual information method as most popular methods in recent image registration studies considering the registration accuracy and clinical practicality. And the two registration methods were analyzed to deduce the optimal registration method according to the characteristics of images. Lung phantom of which multimodality images could be acquired was fabricated and CT, MRI and SPECT images of the phantom were used in this study. We developed the registration program which can perform the two registration methods properly and analyzed the registration results which were produced by the developed program in many different images' conditions. Although the overall accuracy of the registration in both chamfer matching method and mutual information method was acceptable, the registration errors in SPECT images which had lower resolution and in degraded images of which data were removed in some part were increased when chamfer matching method was applied. Especially in the case of degraded reference image, chamfer matching methods produce relatively large errors compared with mutual information method. Mutual information method can be estimated as more robust registration method than chamfer matching method in this study because it did not need the prerequisite works, the extraction of accurate contour points, and it produced more accurate registration results consistently regardless of the images' characteristics. The analysis of the registration methods in this study can be expected to provide useful information to the utilization of multimodality images in delineating target volume for radiation treatment planning and in many other clinical applications.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06c
• /
• pp.555-560
• /
• 2008

두 장의 2차원 영상을 가지고 3차원을 재구성하기 위해서는 스테레오 정합을 이용한다. 이러한 이유로 그 동안에 많은 스테레오 정합에 대한 연구가 진행되었다. 스테레오 정합은 컴퓨터 기술의 발전과 더불어 좀 더 빠르고 높은 정확성을 보이고 있다. 하지만 속도와 정확성을 동시에 만족시키면서 대형영상에서도 동작할 수 있게 메모리을 적게 사용하는 방법은 많지가 않다. 본 논문에서는 이런 요구 조건을 만족시키기 위하여 새로운 스테레오 정합방법을 제시한다. 우리가 제시하는 새로운 방법은 다중 방향성 Greedy 알고리즘과 RANSAC을 반복적으로 사용하여 영상전체에 대한 스테레오 정합을 시도하는 방법이다. 우선 Greedy 알고리즘을 이용하여 여러 방향의 scan-line을 따라 깊이값 영상을 구한다. 그리고 이 여러 장의 깊이값 영상들의 분포를 RANSAC을 이용하여 신뢰영역을 찾아낸다. 구해진 신뢰영역을 바탕으로 Greedy 알고리즘과 RANSAC을 수 차례 반복하여 신뢰영역을 확장해 나가면 최종 깊이값 영상을 얻는다. 우리가 제안하는 알고리즘은 적은 메모리로도 큰 영상의 정합이 가능하고, 속도와 정확도 측면에서도 우수한 결과를 보인다.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.8
• /
• pp.329-334
• /
• 2014

In this study, a new method that automatically segments trabecular bone for its morphological analysis using micro-computed tomography imaging was proposed. In the proposed method, the bone region was extracted using a threshold value, and the outer boundary of the bone was detected. The sphere of maximum size with the corresponding voxel as the center was obtained by applying the sphere-fitting method to each voxel of the bone region. If this sphere includes the outer boundary of the bone, the voxels included in the sphere are classified as cortical bone; otherwise, they are classified as trabecular bone. The proposed method was applied to images of the distal femurs of 15 mice, and comparative experiments, with results manually divided by a person, were performed. Four morphological parameters-BV/TV, Tb.Th, Tb.Sp, and Tb.N-for the segmented trabecular bone were measured. The results were compared by regression analysis and the Bland-Altman method; BV/TV, Tb.Th, Tb.Sp, and Tb.N were all in the credible range. In addition, not only can the sphere-fitting method be simply implemented, but trabecular bone can also be divided precisely by using the three-dimensional information.