• 지구물리
• /
• 제7권4호
• /
• pp.247-253
• /
• 2004

3차원 형상화를 통한 분석이 많은 분야에서 연구 및 적용되고 있다. 3차원 형상화는 사진영상의 중첩에서 (3차원)레이저 스캐닝(laser scanning)으로 발전을 하여 가고 있으며, 각 방법이 각기 그 자체로서 발전을 해가고 있는 추세이다. 본 연구에서는 물체에 대한 데이터베이스를 구축하여 대상 이미지에 대하여 기하학적 패턴 매칭(patter matching)을 기반으로 한 인지(인식) 알고리즘을 도입하여 3차원 형상화를 통한 지질 및 지반조사를 위한 기초 기술로 활용하고자 하였다. 물체의 외형적인 성질에 기반하며 특별한 광원없이 물체를 인지할 수 있는 3차원 형상화 알고리즘은 지질 및 지반조사 분야 외에서도 많은 도움이 될 것이다.

• 한국음향학회지
• /
• 제3권1호
• /
• pp.25-35
• /
• 1984

This paper analysis the Dynamic Time Warping algorithms for time normalization of speech pattern and discusses the Dynamic Programming algorithm for spoken Korean isolated digits recognition. In the DP matching, feature vectors of the reference and test pattern are consisted of first three formant frequencies extracted by power spectrum density estimation algorithm of the ARMA model. The major differences in the various DTW algorithms include the global path constrains, the local continuity constraints on the path, and the distance weighting/normalization used to give the overall minimum distance. The performance criterias to evaluate these DP algorithms are memory requirement, speed of implementation, and recognition accuracy.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2002년도 추계학술대회 논문집
• /
• pp.345-350
• /
• 2002

In this study, researchers classifying the artificial flaws in semiconductor packages are performed by pattern recognition technology. For this purposes, image pattern recognition package including the user made software was developed and total procedure including ultrasonic image acquisition, equalization filtration, binary process, edge detection and classifier design is treated by Backpropagation Neural Network. Specially, it is compared with various weights of Backpropagation Neural Network and it is compared with threshold level of edge detection in preprocessing method fur entrance into Multi-Layer Perceptron(Backpropagation Neural network). Also, the pattern recognition techniques is applied to the classification problem of defects in semiconductor packages as normal, crack, delamination. According to this results, it is possible to acquire the recognition rate of 100% for Backpropagation Neural Network.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2005년도 추계학술대회 논문집
• /
• pp.721-726
• /
• 2005

In this study, researchers classifying the artificial flaws in semiconductor. packages are performed by pattern recognition technology. For this purposes, image pattern recognition package including the user made software was developed and total procedure including ultrasonic image acquisition, equalization filtration, binary process, edge detection and classifier design is treated by Backpropagation Neural Network. Specially, it is compared with various weights of Backpropagation Neural Network and it is compared with threshold level of edge detection in preprocessing method for entrance into Multi-Layer Perceptron(Backpropagation Neural network). Also, the pattern recognition techniques is applied to the classification problem of defects in semiconductor packages as normal, crack, delamination. According to this results, it is possible to acquire the recognition rate of 100% for Backpropagation Neural Network.

• 한국통신학회논문지
• /
• 제5권1호
• /
• pp.44-48
• /
• 1980

본 논문에서는 필기체 한글인식을 위한 한 방법을 제안했다. 기본 자모를 대상으로 하였으며, 임의의 Pattern에 대하여 접합보상및 정형 Algorithm을 제안하므로써 본래의 표준 한글 pattern으로 정형화하였다. 인식에는 Tree grammar를 사용하였으며, 새로운 Parsing 방법을 제안하므로써 종래의 방법보다 처리를 간단화시켰으며 error를 감소시켰다. 제한된 필기체에 대하여는 매우 효과적이었으며 on line 필기체 인식에도 유용성이 있음을 보였다.

• 한국통신학회논문지
• /
• 제28권5C호
• /
• pp.486-492
• /
• 2003

퍼지 ART 알고리즘에서 경계 변수는 임의의 패턴과 저장된 패턴과의 불일치(mismatch) 허용도를 결정한다. 이 경계 변수가 크면 입력 패턴과 저장 패턴 사이에 약간의 차이가 있어도 새로운 카테고리(category)로 분류하게 된다. 반대로 경계 변수가 작으면 입력 패턴과 저장 패턴 사이에 많은 차이가 있더라도 유사성이 인정되어 입력 패턴을 저장 패턴의 카테고리로 분류한다. 따라서 영상 인식에 적용하기 위해서는 경계 변수를 경험적으로 설정한다. 그리고 연결 가중치를 조정하는 과정에서 저장된 패턴들의 정보들이 손실되는 경우가 발생하여 인식률을 저하시킨다. 본 논문에서는 퍼지 ART 알고리즘의 문제점을 개선하기 위하여 퍼지 논리 접속 연산자를 이용하여 경계 변수를 동적으로 조정하고 저장 패턴과 학습 패턴간의 실제적인 왜곡 정도를 충분히 고려하여 승자 노드로 선택된 빈도수를 가중치 조정에 적용하는 개선된 퍼지 ART 알고리즘을 제안하였다. 제안된 방법의 인식 성능을 확인하기 위해서 운송 컨테이너 영상을 대상으로 실험한 결과, 기존의 ART2 알고리즘이나 퍼지 ART 알고리즘보다 클러스터의 수가 적게 생성되었고 인식 성능도 기존의 방법들보다 우수한 성능이 있음을 확인하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 하계학술대회 논문집 C
• /
• pp.1930-1932
• /
• 2004

SOM(Self Organizing Map) algorithm which has some advantages such as data accumulation ability and the degradation trend trace ability was compared with conventionally used BP(Back Propagation) algorithm. For the purpose, partial discharge data were acquired and analysed from the artificial defects in GIS. As a result, basically the pattern recognition rate of BP algorithm was found out to be better than that of SOM algorithm. However, SOM algorithm showed a great on-site-applicability such as ability of suggesting new-pattern-possibility. Therefore, through increasing pattern recognition rate it is possible to apply SOM algorithm to partial discharge analysis. Also, for the image processing method it is required the normalization of the PRPDA graph. However, due to the normalization both BP and SOM algorithm have shown worse results, so that it is required further study to solve the problem.

• 한국음향학회:학술대회논문집
• /
• 한국음향학회 1992년도 학술논문발표회 논문집 제11권 1호
• /
• pp.66-70
• /
• 1992

This paper describes the simplified DTW algorithm for real time korean digit recognition and construct the digit recognition system using that algorithm. The DTW algorithm which is used nowadays have problems on real time recognition because of its massive computation. But, simplified DTW algorithm, which is proposed in this paper, solved these problems. In the case of single syllable, we use the characteristic of uniform distribution of epansion and contraction on time ais, compare distance of input pattern and reference pattern using constrainedly restricted path. As a result, we can reduce a great deal of computation and achieved that the real time korean digit recognition system.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2003년도 학술회의 논문집 정보 및 제어부문 B
• /
• pp.532-535
• /
• 2003

In this paper, we propose a new algorithm that can enhance the speed of template matching of hand vascular pattern person verification or recognition system. Various template matching algorithms have advantages in the matching accuracy, but most of the algorithms suffer from computational burden. To reduce the computational amount, with accuracy maintained, we propose following template matching scenario as follows. firstly, original hand vascular image is re-sampled in order to reduce spatial resolution. Secondly, reconstructed image is projected to vertical and horizontal direction, being converted to two one dimensional (1D) data. Thirdly, converted data is used to estimate spatial discrepancy between stored template image and target image. Finally, matching begins from where the estimated order is highest, and finishes when matching decision function is computed to be over certain threshold. We've applied the proposed algorithm to hand vascular pattern identification application for biometrics, and observed dramatic matching speed enhancement. This paper presents detailed explanation of the proposed algorithm and evaluation results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권6호
• /
• pp.3121-3143
• /
• 2019

Segmentation plays an important role in the field of image processing and computer vision. Intuitionistic fuzzy C-means (IFCM) clustering algorithm emerged as an effective technique for image segmentation in recent years. However, standard fuzzy C-means (FCM) and IFCM algorithms are sensitive to noise and initial cluster centers, and they ignore the spatial relationship of pixels. In view of these shortcomings, an improved algorithm based on IFCM is proposed in this paper. Firstly, we propose a modified non-membership function to generate intuitionistic fuzzy set and a method of determining initial clustering centers based on grayscale features, they highlight the effect of uncertainty in intuitionistic fuzzy set and improve the robustness to noise. Secondly, an improved nonlinear kernel function is proposed to map data into kernel space to measure the distance between data and the cluster centers more accurately. Thirdly, the local spatial-gray information measure is introduced, which considers membership degree, gray features and spatial position information at the same time. Finally, we propose a new measure of intuitionistic fuzzy entropy, it takes into account fuzziness and intuition of intuitionistic fuzzy set. The experimental results show that compared with other IFCM based algorithms, the proposed algorithm has better segmentation and clustering performance.