• Journal of the Korean Institute of Telematics and Electronics
• /
• v.22 no.5
• /
• pp.10-16
• /
• 1985

In this paper, a computer vision system, which catches printed music score image using CCTV camera and microcomputer, and then recognizes the image and performs tar music with speaker, is discussed. Integral projection method is adopted for feature detection and recognition of the music score image. The range of recognition is con(ined to staffs, perpen-dicular lines and musical notes including chord notes among the various kinds of elements of music score. The practical recognition algorithm considering noises, the preprocessing processes getting rid of noises are also showed, and simple hardware system playing chord is made, In the results, good recognition ratio and performance are obtained.

• Smart Media Journal
• /
• v.1 no.4
• /
• pp.27-34
• /
• 2012

In this paper, a novel text binarization is presented that can deal with some complex conditions, such as shadows, non-uniform illumination due to highlight or object projection, and messy backgrounds. To locate the target text region, a focus line is assumed to pass through a text region. Next, connected component analysis and stroke width estimation based on location information of the focus line is used to locate the bounding box of the text region, and each box of connected components. A series of classifications are applied to identify whether each CC(Connected component) is text or non-text. Also, a modified K-means clustering method based on an HCL color space is applied to reduce the color dimension. A text binarization procedure based on location of text component and seed color pixel is then used to generate the final result.

• Korean Journal of Computational Design and Engineering
• /
• v.14 no.1
• /
• pp.10-17
• /
• 2009

Surface detection and parameter estimation in point cloud is a relevant subject in CAD/CAM, reverse engineering, computer vision, coordinate metrology and digital factory. In this paper we present a software for a fully automatic surface detection and parameter estimation in unordered, incomplete and error-contaminated point cloud with a large number of data points. The software consists of three algorithmic modules each for object identification, point segmentation, and model fitting, which work interactively. Our newly developed algorithms for orthogonal distance fitting(ODF) play a fundamental role in each of the three modules. The ODF algorithms estimate the model parameters by minimizing the square sum of the shortest distances between the model feature and the measurement points. We demonstrate the performance of the software on a variety of point clouds generated by laser radar, computer tomography, and stripe-projection method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.1041-1044
• /
• 2005

홍채인식 시스템에 있어서 동공 검출은 가장 먼저 이루어져아 할 전처리 과정이다. 현재 홍채인식 시스템에 있어서 사용되는 동공 검출은 영상의 모든 위치에서 원형돌출부(circular projection)를 구한 후, 경계선을 검출하여 원형의 경계 성분이 가장 강한 위치를 찾는 방법으로 연산량이 너무 많은 단점을 가지고 있다. 본 논문에서 제안하는 알고리즘은 같은 고주파성분에 해당 되더라도 경계선의Amplitude는 잡음의 경계선에 비해 그 값이 크다는 것을 이용하여, 경계선과 잡음을 구별할 수 있게 되고, 따라서 잡음 제거 성능을 기존의 방법에 비하여 상당히 향상시킨 웨이블렛 변환을 이용하여 동공의 특징을 추출할 수 있었다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1999.06a
• /
• pp.171-176
• /
• 1999

Template matching is one of the most often used techniques for machine vision applications to find a template of size M$\times$M or subimage in a scene image of size N$\times$N. Most template matching methods, however, require pixel operations between the template and the image under analysis resulting in high computational cost of O(M2N2). So in this thesis, we present a two stage template matching method. In the first stage, we use a novel low cost feature whose complexity is approaching O(N2) to select matching candidates. In the second stage, we use conventional template matching method to find out the exact matching point. We compare the result with other methods in terms of complexity, efficiency and performance. Proposed method was proved to have constant time complexity and to be quite invariant to noise.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.591-594
• /
• 2004

In this paper, The identity distinction of the moving objects using distance among hue normalization levels was proposed. Moving objects are detected by using difference image method and integral projection method to background image and objects image only with hue area. Hue information of the detected moving area are normalized by 24 levels from 0$^{\circ}$ to 360$^{\circ}$. A distance in between normalized levels with a hue distribution chart of the normalized moving objects is used for the identity distinction feature parameters of the moving objects. To examine proposed method in this paper, image of moving cars are obtained by setting up three cameras at different places every 1 km on outer motorway. The simulation results of identity distinction show that it is possible to distinct the identity a distance in between normalization levels of a hue distribution chart without background.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6C
• /
• pp.815-823
• /
• 2004

A hue-based attention operator and a combinational integral projection function(CIPF) are proposed to extract the normalized regions of face and facial features robustly against illumination variation. The face candidate regions are efficiently detected by using skin color filter, and the eyes are located accurately nil robustly against illumination variation by applying the proposed hue- and symmetry-based attention operator to the face candidate regions. And the faces are confirmed by verifying the eyes with the color-based eye variance filter. The proposed CIPF, which combines the weighted hue and intensity, is applied to detect the accurate vertical locations of the eyebrows and the mouth under illumination variations and the existence of mustache. The global face and its local feature regions are exactly located and normalized based on these accurate geometrical information. Experimental results on the AR face database［8］ show that the proposed eye detection method yields better detection rate by about 39.3% than the conventional gray GST-based method. As a result, the normalized facial features can be extracted robustly and consistently based on the exact eye location under illumination variations.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.9 no.4
• /
• pp.414-418
• /
• 2016

In this paper, a hardware architecture of low area gradient magnitude calculator is proposed. For the hardware complexity reduction, the characteristic of orthogonal projection vector and hardware resource sharing technique are applied. The proposed hardware architecture can be implemented without degradation of the gradient magnitude data quality since the proposed hardware is implemented with original algorithm. The FPGA implementation result shows the 15% of logic elements and 38% embedded multiplier savings compared with previous work using Altera Cyclone VI (EP4CE115F29C7N) FPGA and Quartus II v15.0 environment.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.9 no.4
• /
• pp.444-450
• /
• 1999

This paper deals with several methods: the clustering method that uses k-means algorithm to abstract the area of characters on the image document and the distance function that suits for the HIS coordinate system to cluster the image. For the prepossessing step to recognize this, or the method of characters segmentate, the algorithm to abstract a discrete character is also proposed, using the linking picture element. This algorithm provides the feature that separates any character such as the touching or overlapped character. The methods of projecting and tracking the edge have so far been used to segment them. However, with the new method proposed here, the picture element extracts a discrete character with only one-time projection after abstracting the character string. it is possible to pull out it. dividing the area into the character and the rest (non-character). This has great significance in terms of processing color documents, not the simple binary image, and already received verification that it is more advanced than the previous document processing system.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.4 s.316
• /
• pp.1-7
• /
• 2007

In this paper, we analyze geometrical relations of 3D shape reconstruction from 2D images taken under anne projection. The purpose of this research is to contribute to more accurate 3-D reconstruction under noise distribution by analyzing geometrically the 2D to 3D relationship. In situation for no missing feature points (FPs) or no noise in 2D image plane, the accurate solution of 3D shape reconstruction is blown to be provided by Singular Yalue Decomposition (SVD) factorization. However, if several FPs not been observed because of object occlusion and image low resolution, and so on, there is no simple solution. Moreover, the 3D shape reconstructed from noise-distributed FPs is peturbed because of the influence of the noise. This paper focuses on analysis of geometrical properties which can interpret the missing FPs even though the noise is distributed on other FPs.