• Proceedings of the KIEE Conference
• /
• 2007.07a
• /
• pp.1758-1759
• /
• 2007

본 논문에서는 표면실장기판을 위한 자동 광학 검사 시스템에서 사용되는 데이터 산출방법에 대한 알고리즘을 제안 한다. 제안된 새로운 부품검사 알고리즘은 검사영역을 분할해 템플릿에서의 매칭률이 가장 높은 부분만을 세밀하게 재검사하는 방법을 사용하여 기존의 방법들보다 시간이 단축 될 뿐만 아니라 많은 양의 메모리를 필요로 하는 템플릿의 패턴들의 메모리 용량상의 문제점을 해결할 수 있다. 실험 결과를 제시하여 제안된 검사 알고리즘을 검증한다.

• Journal of the Korean Wood Science and Technology
• /
• v.37 no.6
• /
• pp.556-565
• /
• 2009

Automated visual grading system of lumber needs correct input image. In order to create a correct image of domestic red pine lumber 3.6 m long feeding on a conveyer, part images were captured using area sensor and template matching algorithm was applied to merge part images. Two kinds of template matching algorithms and six kinds of template sizes were adopted in this operation. Feature extracted method appeared to have more excellent image merging performance than fixed template method. Error length was attributed to a decline of similarity related by difference of partial brightness on a part image, specific pattern and template size. The mismatch part was repetitively generated at the long grain. The best size of template for image merging was $100{\times}100$ pixels. In a further study, assignment of exact template size, preprocessing of image merging for reduction of brightness difference will be needed to improve image merging.

• Broadcasting and Media Magazine
• /
• v.22 no.4
• /
• pp.34-40
• /
• 2017

현재 멀티미디어는 사용자의 감성을 자극하며 몰입감과 현장감을 자아내고 극대화할 수 있는 실감 미디어(Immersive media)로 발전하고 있다. 이러한 실감 미디어 내 시청각 정보의 저장과 표현을 위한 데이터 템플릿과 인터페이스들은 상당히 많은 부분에서 표준화되어 왔지만, 이와 달리 후각, 미각, 촉각 등의 실감 정보들은 관련 표준들의 부재로 인해 많은 연구 개발에도 불구하고 해당 서비스들의 상용화가 지연되고 있는 중이다. 이 문제를 해결하기 위해 이 논문에서는 후각 미디어에 초점을 맞추어 MPEG-V 표준과 현재 진행 중인 MPEG-IoMT(Internet of Media Thing) 표준을 사용하여 미디어 사물 인터넷 내 후각 인터렉션을 위해 필요한 표준 데이터 템플릿과 인터페이스를 기술하였다.

• The Journal of the Korea Contents Association
• /
• v.14 no.11
• /
• pp.7-15
• /
• 2014

This paper proposed a recognition algorithm of human facial expressions using the PCA and the template matching. Firstly, face image is acquired using the Haar-like feature mask from an input image. The face image is divided into two images. One is the upper image including eye and eyebrow. The other is the lower image including mouth and jaw. The extraction of facial components, such as eye and mouth, begins getting eye image and mouth image. Then an eigenface is produced by the PCA training process with learning images. An eigeneye and an eigenmouth are produced from the eigenface. The eye image is obtained by the template matching the upper image with the eigeneye, and the mouth image is obtained by the template matching the lower image with the eigenmouth. The face recognition uses geometrical properties of the eye and mouth. The simulation results show that the proposed method has superior extraction ratio rather than previous results; the extraction ratio of mouth image is particularly reached to 99%. The face recognition system using the proposed method shows that recognition ratio is greater than 80% about three facial expressions, which are fright, being angered, happiness.

• KIPS Transactions on Software and Data Engineering
• /
• v.1 no.1
• /
• pp.1-6
• /
• 2012

Web pages in a template-based web application (TWA) are automatically populated using a template shared by the pages with contents specific to the pages. So users can easily obtain information guided by a consistent structure of the template. Reduced duplicated code helps to increase the level of maintainability as well. However, TWA still has the interaction problem of classic web applications that each time a user clicks a hyperlink a new page is loaded, although a partial update of the page is desirable. This paper proposes a reengineering technique to transform the multi-page structure of legacy Java-based TWA to a single page one with partial page refresh. In this approach, hyperlinks in HTML code are refactored to AJAX-enabled event handlers to achieve the single page structure. In addition, JSP and Servlet code is transformed in order not to send data unnecessary for the partial update. The new single page consists of individual components that are updateable independently when interacting with a user. Therefore, our approach can improve interactivity and responsiveness towards a user while reducing CPU and network usage. The measurement of our technique applied to a typical TWA shows that our technique improves the response time of user requests over the TWA in the range from 1 to 87%.

• Korean Journal of Remote Sensing
• /
• v.38 no.3
• /
• pp.283-298
• /
• 2022

As Synthetic Aperture Radar (SAR) image can be acquired regardless of the weather and day or night, it is highly recommended to be used for Automatic Target Recognition (ATR) in the fields of surveillance, reconnaissance, and national security. However, there are some limitations in terms of cost and operation to build various and vast amounts of target images for the SAR-ATR system. Recently, interest in the development of an ATR system based on simulated SAR images using a target model is increasing. Attributed Scattering Center (ASC) matching and template matching mainly used in SAR-ATR are applied to target classification. The method based on ASC matching was developed by World View Vector (WVV) feature reconstruction and Weighted Bipartite Graph Matching (WBGM). The template matching was carried out by calculating the correlation coefficient between two simulated images reconstructed with adjacent points to each other. For the performance analysis of the two proposed methods, the Synthetic and Measured Paired Labeled Experiment (SAMPLE) dataset was used, which has been recently published by the U.S. Defense Advanced Research Projects Agency (DARPA). We conducted experiments under standard operating conditions, partial target occlusion, and random occlusion. The performance of the ASC matching is generally superior to that of the template matching. Under the standard operating condition, the average recognition rate of the ASC matching is 85.1%, and the rate of the template matching is 74.4%. Also, the ASC matching has less performance variation across 10 targets. The ASC matching performed about 10% higher than the template matching according to the amount of target partial occlusion, and even with 60% random occlusion, the recognition rate was 73.4%.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.688-690
• /
• 2004

최근 전자화된 문서 영상을 효율적으로 관리하고 검색하기 위한 문서구조분석 방법과 문서의 자동 분류에 관한 많은 연구가 발표되고 있다. 본 논문에서는 NMF(non-negative matrix factorization) 알고리즘을 사용하여 폰트를 자동으로 분류하는 방법을 제안한다. 제안된 방법은 폰트의 구분 특징들이 공간적으로 국부성을 가지는 부분으로 표현될 수 있다는 가정을 바탕으로, 전체의 폰트 이미지들로부터 각 폰트들의 구분 특징인 부분을 학습하고, 학습된 부분들을 특징으로 사용하여 폰트를 분류하는 방법이다. 학습된 폰트의 특징들은 계층적 군집화 알고리즘을 이용하여 템플릿을 생성하고, 테스트 패턴을 분류하기 위하여 템플릿 패턴과의 EMD(earth mover's distance)를 사용한다. 실험결과에서 폰트 이미지들의 공간적으로 국부적인 특징들이 조사되고, 그 특징들의 폰트 식별을 위한 적절성을 보였다. 제안된 방법이 기존의 문자인식. 문서 검색 시스템들의 전처리기로 사용되면. 그 시스템들의 성능을 향상시킬 것으로 기대된다.

• The KIPS Transactions:PartD
• /
• v.13D no.2 s.105
• /
• pp.191-198
• /
• 2006

Many enterprises have introduced workflow to enhance work efficiency and support effective work processes in their various work environments. Recently, Business Process Management(BPM), an extension of workflow, is spotlighted in enterprise software markets Although woklflow plays an important role in Business Process Managements, researches in workflow are mostly concentrated on temporal constraints which finds exact execution sequences for complicated jobs. On that reason, majority of workflow scheduling has concentrated on modeling of various resources which should be handled and the interest for workflow scheduling under constraints related to resources is rather unsatisfactory In this paper we presents the Transformation Template based on Concurrent Transaction Logic(CTR) which is suitable for scheduling workflows with resource allocation constraints, and the logical framework. The Transformation Template consists of a Workflow Transformation Template and a Constraint Transaction Template. Especially the Transformation Template can be conveniently used to logically represent new workflows under the existing resource allocation constraints.

• The Journal of the Korea Contents Association
• /
• v.8 no.11
• /
• pp.85-93
• /
• 2008

For music score recognition, several approaches have been proposed including shape matching, statistical methods, neural network based methods and structural methods. In this paper, we deal with recognition for low resolution images which are captured by the digital camera of a mobile phone. Considerable distortions are included in these low resolution images, so when existing technology is used, many problems appear. First, captured images are not stable in the sense that they contain lots of distortions or non-uniform illumination changes. Therefore, notes or symbols in the music score are damaged and recognition process gets difficult. This paper presents recognition technology to overcome these problems. First, musical note to head, stick, tail part are separated. Then template matching on head part of musical note, and remainder part is applied. Experimental results show nearly 100% recognition rate for music scores with single musical notes.

• Smart Media Journal
• /
• v.5 no.1
• /
• pp.88-94
• /
• 2016

In this paper, we proposed a new object tracking algorithm based on sparse representation to handle the drifting problem. In APG-L1(accelerated proximal gradient) tracking, the sparse representation is applied to model the appearance of object using linear combination of target templates and trivial templates with proper coefficients. Also, the particle filter based on affine transformation matrix is applied to find the location of object and APG method is used to minimize the l1-norm of sparse representation. In this paper, we make use of the trivial template coefficients actively to block the drifting problem. We experiment the various videos with diverse challenges and the result shows better performance than others.