• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.262-267
• /
• 2007

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

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.1
• /
• pp.75-80
• /
• 2008

This paper proposes a method to detect scene change using global decision tree that extract boundary cut that have width of big change that happen by camera brake from difference value of frames. First, calculate frame difference value through regional X2-histogram and normalization, next, calculate distance between difference value using normalization. Shot boundary detection is performed by compare global threshold distance with distance value for two adjacent frames that calculating global threshold distance based on distance between calculated difference value. Global decision tree proposed this paper can detect easily sudden scene change such as motion from object or camera and flashlight.

• Proceedings of the Acoustical Society of Korea Conference
• /
• spring
• /
• pp.77-82
• /
• 2002

운율은 음성의 초분절적인 면에 연관하는 음성의 한 성으로서 통상적으로 화자는 음성을 달하는 과정에서 청자의 이해를 돕기 위해 운율을 사용하게 된다. 본 논문은 이러한 운율을 이루는 성분 중의 하나인 운율구의 위치 예측에 대한 성능을 향상시키는 것에 그 목적을 둔다. 한국어 운율 정보에 대한 표기 방법 중의 하나인 K-ToBI를 기반으로 하여, 운율구의 경계와 그에 대한 레벨을 Break Indices 정보로서 나타내었고, 통계학 분야에서 제안된 Support Vector Machine(SVM)을 이용하여 시스템의 예측률 향상을 꾀하였다. 기존의 방법에서 사용된 트리 기반 모델을 이용하여 한국어 운율에 가장 많은 영향을 끼치는 언어 정보들을 추출하였고 이를 실험에 적용하였다. 기존의 트리 모델과 SVM 모델에 대한 예측률을 비교한 결과, 경계 유무 정보 예측과 4단계의 레벨을 가지는 경계 정보의 예측에서 모두 본 방법이 보다 높은 예측률을 보여 주어 본 연구에서 제시한 접근법이 운율구의 경계 정보를 예측하는 데에 있어 더욱 효과적인 접근법임을 실험적으로 입증하였다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.11a
• /
• pp.256-261
• /
• 2000

디지털 방송, 웹의 발전으로 내용 기반 검색, 비디오 인덱싱, 비디오 검색 등의 시스템들이 많이 연구, 개발되고 있으며, 이러한 시스템에서는 사람을 주제로 검색하는 요구가 많이 발생한다. 대부분의 얼굴 영역 추출 및 인식 시스템들은 질감, 모양, 움직임, 칼라 등의 특징들을 이용하는데, 이들 중 칼라 특징은 기존 시스템의 첫 번째 처리 단계에서 많이 사용된다. 하지만, 복잡한 배경, 조명, 화장(make up), 잡영들 때문에 미리 정의된 단일 칼라 임계값을 이용하여 얼굴 영역과 비 얼굴 영역으로 구분하면 정확한 추출 결과를 얻기 힘들다는 문제가 있다. 본 논문에서는, 점진적으로 피부색 영역을 확장시키면서 얼굴 영역을 추출하는 방법을 제안한다. 이때 확장 단계에서 얼굴 영역을 판단하기 위해, 일굴 각 기관들의 위치적 정보를 사용하였다. 얼굴 기관은 눈과 입을 사용했는데, 여러 가지 요인으로 인해 이들을 정확하게 추출하기가 어렵기 때문에, 각 단계에서 얼굴 후보 영역 내부의 수평 방향성을 가지는 경계를 눈과 입의 영역으로 간주했다. 실험을 통해, 제안한 방법이 하이라이트(highlight)에 의해 얼굴 영역의 일부가 왜곡된 경우와 얼굴 영역이 피부색과 유사한 배경에 인접해 있는 경우에 대해서도 강인하게 얼굴 영역을 추출할 수 있음을 확인하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.12
• /
• pp.1249-1265
• /
• 1991

In this paper, a fast and adaptive feature extraction algorithm for textured image segmentation is proposed. First, a conventional algorithm to extract the statistical texture features are described and we obtain the recursive equations from that conventional method and it is used for extraction of sevaral texture features. And also we propose the adaptive algorithm which extract the texture features. To evaluate the performance of proposed algorithm, we apply the proposed method to artificial texture images. From the results of computer simulation, the proposed method is superior to the conventional one.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.32 no.2
• /
• pp.87-93
• /
• 2014

Cadastral parcel objects as polygons are fundamental dataset which represent land administration and management of the real world. Thus it is necessary to assure topological seamlessness of cadastral datasets which means no overlaps or gaps between adjacent parcels. However, the problem of overlaps or gaps are frequently found due to non-coinciding edges between adjacent parcels. These erroneous edges are called uncertain edges, and polygons containing at least one uncertain edge are called uncertain polygons. In this paper, we proposed a new algorithm to efficiently search parcels of uncertain polygons between two adjacent cadastral datasets. The algorithm first selects points and polylines around adjacent datasets. Then the Constrained Delaunay Triangulation (CDT) is applied to extract triangles. These triangles are tagged by the number of the original cadastral datasets which intersected with the triangles. If the tagging value is zero, the area of triangles mean gaps, meanwhile, the value is two, the area means overlaps. Merging these triangles with the same tagging values according to adjacency analysis, uncertain edges and uncertain polygons could be found. We have performed experimental application of this automated derivation of partitioned boundary from a real land-cadastral dataset.

• Journal of Digital Contents Society
• /
• v.17 no.5
• /
• pp.441-448
• /
• 2016

In this paper, we propose a method that segments the image, extracts its slope and compensate it in the image that text and background are mixed. The proposed method uses morphology based preprocessing and extracts the edges using canny operator. And after segmenting the image which the edges are extracted, it excludes the areas which the edges are included, only uses the area which the edges are included and creates the projection histograms according to their various direction slopes. Using them, it takes a slope having the greatest edge concentrativeness of each area and compensates the slope of the scene. On extracting the slope of the mixed scene of the text and background, the method can get better results as 0.7% than the existing methods as it excludes the useless areas that the edges do not exist.

• The Journal of the Korea Contents Association
• /
• v.10 no.12
• /
• pp.101-108
• /
• 2010

Many works on energy-efficient cluster event detection schemes have been done considering the energy restriction of sensor networks. The existing cluster event detection schemes transmit only the boundary information of detected cluster event nodes to the base station. However, If the range of the cluster event is widened and the distribution density of sensor nodes is high, the existing cluster event detection schemes need high transmission costs due to the increase of sensor nodes located in the event boundary. In this paper, we propose an energy-efficient cluster event detection scheme using the minimum boundary polygons (MBP) that can compress and summarize the information of event boundary nodes. The proposed scheme represents the boundary information of cluster events using the MBP creation technique in the large scale of sensor network environments. In order to show the superiority of the proposed scheme, we compare it with the existing scheme through the performance evaluation. Simulation results show that our scheme maintains about 92% accuracy and decreases about 80% in energy consumption to detect the cluster event over the existing schemes on average.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.3
• /
• pp.48-60
• /
• 2007

In previous researches for iris feature extraction, they transform a original iris image into rectangular one by stretching and interpolation, which causes the distortion of iris patterns. Consequently, it reduce iris recognition accuracy. So we are propose the method that extracts iris feature by using polar coordinates without distortion of iris patterns. Our proposed method has three strengths compared with previous researches. First, we extract iris feature directly from polar coordinate circular iris image. Though it requires a little more processing time, there is no degradation of accuracy for iris recognition and we compares the recognition performance of polar coordinate to rectangular type using by Hamming Distance, Cosine Distance and Euclidean Distance. Second, in general, the center position of pupil is different from that of iris due to camera angle, head position and gaze direction of user. So, we propose the method of iris feature detection based on polar coordinate circular iris region, which uses pupil and iris position and radius at the same time. Third, we overcome override point from iris patterns by using polar coordinates circular method. each overlapped point would be extracted from the same position of iris region. To overcome such problem, we modify Gabor filter's size and frequency on first track in order to consider low frequency iris patterns caused by overlapped points. Experimental results showed that EER is 0.29%, d' is 5,9 and EER is 0.16%, d' is 6,4 in case of using conventional rectangular image and proposed method, respectively.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.21 no.1
• /
• pp.27-36
• /
• 2003

Generally, the latest acquisition method of geo-spatial informations in urban area is executed by generation of digital elevation model (DEM) and digital ortho image by digital photogrammetry method which is used large scale photo image. However, the biggest problem of this method is coarse accuracy of DEM which is automatically generated by digital photogrammetry workstation system. The coarse accuracy of DEM caused geo-spatial information in urban area to reduce of accuracy. Therefore, this study is purposed to increase of DEM accuracy which is applied to method terrain classification in urban area. As the results of this study, the proposed method of this study which is increased to accuracy of DEM by classification of terrain is better than accuracy of DEM which is automatically generated by digital photogrammetry workstaion system. And, the edge detection method which is proposed by this study is established to capability of 3D digital mapping in urban area.