• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.169-172
• /
• 2009

In this paper, we propose the method to improving touch recognition using edge mask on a touched object at vision-based touchscreen. Because vision-based touchscreen recognizes touch using threshold simply, noise occur in fist or wrist in case of touch directly with hand, correct touch recognition was difficult. However, in this paper, we execute morphology and extract surrounding mask in object that approximate to touchscreen, use change of contrast for the mask. When we touch screen to use these dynamic information, prevent noise. The goal of this paper is when hand was touched on screen it can recognize to touch.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2005.11a
• /
• pp.526-535
• /
• 2005

우리나라의 주민등록증은 주소지, 주민등록 변호, 얼굴사진, 지문 등 개개인의 방대한 정보를 가진다. 현재의 플라스틱 주민등록증은 위조 및 변조가 쉽고 날로 전문화 되어가고 있다. 따라서 육안으로 위조 및 변조 사실을 쉽게 확인하기가 어려워 사회적으로 많은 문제를 일으키고 있다. 이에 본 논문에서는 주민등록증 영상을 자동 인식할 수 있는 개선된 ART2 기반 RBF 네트워크와 얼굴인증을 이용한 주민등록증 자동 인식 방법을 제안한다. 제안된 방법은 주민등록증 영상에서 주민등록번호와 발행일을 추출하기 위하여 영상을 소벨마스크와 미디언 필터링을 적용한 후에 수평 스미어링을 적용하여 주민등록번호와 발행일 영역을 검출한다. 그리고 4 방향 윤곽선 추적 알고리즘으로 개별 문자를 추출하기 위한 전 단계로 주민등록증 영상에 대해 고주파 필터링을 적용하여 주민등록증 영상 전체를 이진화 한다. 이진화된 주민등록영상에서 COM 마스크를 적용하여 주민등록번호와 발행일 코드를 복원하고 검출된 각 영역에 대해 4 방향 윤곽선 추적 알고리즘으로 개별 문자를 추출한다. 추출된 개별 문자는 개선된 ART2 기반 RBF 네트워크를 제안하여 인식에 적용한다. 제안된 ART2 기반 RBF 네트워크는 학습 성능을 개선하기 위하여 중간충과 출력층의 학습에 퍼지 제어 기법을 적용하여 학습률을 동적으로 조정한다. 얼굴인증은 템플릿 매칭 알고리즘을 이용하여 얼굴 템플릿 데이터베이스를 구축하고 주민등록증애서 추출된 얼굴영역과의 유사도를 측정하여 주민등록증 얼굴 영역의 위조여부를 판별한다.

• Journal of the Korean Society for Precision Engineering
• /
• v.23 no.7 s.184
• /
• pp.146-151
• /
• 2006

In order to increase the productivity of conventional microstereolithography, a new method using a digital micromirror device ($DMD^{TM}$) as the dynamic patter generator is proposed. The deviation from the level of clear optical images to the level of photopolymer surface is a key for the fabrication of an accurate 3D structure, so this deviation is minimized by controlling the viscosity of FA 1260T with organic solvents. After finding the appropriate process variables, the feasibility of microstructure fabrication such as a microgear and a microsphere is demonstrated. Microstereolithography with $DMD^{TM}$ showed the potential to replace the existing focused beam microstereolithography.

• Journal of Broadcast Engineering
• /
• v.22 no.1
• /
• pp.70-77
• /
• 2017

Among available people counting methods, map-based approaches based on moving interest points have shown good performance. However, the stationary people counting is challenging in such methods since all static points of interest are considered as background. To include stationary people in counting, it is needed to discriminate between the static points of stationary people and the background region. In this paper, we propose a people counting method based on using both moving and static points. The proposed method separates the moving and static points by motion information. Then, the static points of the stationary people are classified using foreground mask processing and point pattern analysis. The experimental results reveal that the proposed method provides more accurate count estimation by including stationary people. Also, the background updating is enabled to solve the static point misclassification problem due to background changes.

• The KIPS Transactions:PartB
• /
• v.17B no.6
• /
• pp.421-428
• /
• 2010

It takes a long time for the users to view a whole image from the image server under the low-bandwidth internet environments or in case of a big sized image. In this case, as there needs a technique that preferentially transfers a part of image, JPEG2000 offers a ROI(Region-of-Interest) coding. In ROI coding, the users see the thumbnail of image from the server and specifies some regions that they want to see first. And then if an information about the regions are informed to the server, the server preferentially transfers the regions of the image. The existing methods requested a huge time to compute the mask information, but this thesis approximately computes the regions and reduces the creating time of the ROI masks. If each code block is a mixed block which ROI and background are mixed, the proper boundary points should be acquired. Searching the edges of the block, getting the two points on the edge, to get the boundary point inside the code block, the method searches a mid point between the two edge points. The proposed method doesn't have a big difference compared to the existing methods in quality, but the processing time is more speedy than the ones.

• Journal of Korea Multimedia Society
• /
• v.11 no.1
• /
• pp.13-22
• /
• 2008

This paper proposes an efficient ROI code block discrimination algorithm for dynamic ROI coding. The proposed algorithm calculates the girth of the ROI only with some mask information in consideration of the characteristics of the shape of the ROI for reducing a ROI code block discrimination time, and this proposed algorithm discriminates whether there is a ROI code block by the girth and the critical value of the ROI. Also, this discrimination algorithm is capable of treating the coefficients of the background within a ROI code block preferentially and controlling a loss by controlling the threshold value of the ROI. In order to demonstrate the utility of the proposed method, this paper conducted a comparative experiment of the proposed method with the existing methods. As a result of this experiment, it was confirmed that the proposed method was superior to the conventional methods in terms of quality and speed.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.5 s.37
• /
• pp.333-342
• /
• 2005

This paper proposes a method, which recognizes student's identification card by using image processing and recognition technology and can manage student information on the web. The presented scheme sets up an average brightness as a threshold, based on the brightest Pixel and the least bright one for the source image of the ID card. It is converting to binary image, applies a horizontal histogram, and extracts student number through its location. And, it removes the noise of the student number region by the mode smoothing with 3$\times$3 mask. After removing noise from the student number region, each number is extracted using vertical histogram and normalized. Using the enhanced ART1 algorithm recognized the extracted student number region. In this study, we propose the enhanced ART1 algorithm different from the conventional ART1 algorithm by the dynamical establishment of the vigilance parameter. which shows a tolerance limit of unbalance between voluntary and stored patterns for clustering. The Experiment results showed that the recognition rate of the proposed ART1 algorithm was improved much more than that of the conventional ART1 algorithm. So, we develop an educational matters administration system by using the proposed recognition method of the student's identification card.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.5
• /
• pp.275-280
• /
• 2013

In this paper, a new stereo object extraction algorithm using a block-based MSE (mean square error) algorithm and the configuration parameters of a stereo camera is proposed. That is, by applying the SSD algorithm between the initial reference image and the next stereo input image, location coordinates of a target object in the right and left images are acquired and then with these values, the pan/tilt system is controlled. And using the moving angle of this pan/tilt system and the configulation parameters of the stereo camera system, the mask window size of a target object is adaptively determined. The newly segmented target image is used as a reference image in the next stage and it is automatically updated in the course of target tracking basing on the same procedure. Meanwhile, a target object is under tracking through continuously controlling the convergence and FOV by using the sequentiall extracted location coordinates of a moving target.

• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.665-670
• /
• 2003

In the applications like automatic masks generation for semiconductor production, a drawing consists of lots of polygons that are partitioned into trapezoids. The addition/deletion of a polygon to/from the drawing is performed through geometric operations such as insertion, deletion, and search of trapezoids. Depending on partitioning algorithm being used, a polygon can be partitioned differently in terms of shape, size, and so on. So, It's necessary to invent some comparison algorithm of sets of trapezoids in which each set represents interested parts of a drawing. This comparison algorithm, for example, may be used to verify a software program handling geometric objects consisted of trapezoids. In this paper, given k sets of trapezoids in which each set forms the regions of interest of each drawing, we present how to compare the k sets to see if all k sets represent the same geometric scene. When each input set has the same number n of trapezoids, the algorithm proposed has O(2$^{k-2}$ $n^2$(log n＋k)) time complexity. It is also shown that the algorithm suggested has the same time complexity O( $n^2$ log n) as the sweeping-based algorithm when the number k(<< n) of input sets is small. Furthermore, the proposed algorithm can be kn times faster than the sweeping-based algorithm when all the trapezoids in the k input sets are almost the same.

• The KIPS Transactions:PartB
• /
• v.9B no.4
• /
• pp.481-490
• /
• 2002

Off-line handwritten character recognition is in difficulty of incomplete preprocessing because it has not dynamic information has various handwriting, extreme overlap of the consonant and vowel and many error image of stroke. Consequently off-line handwritten character recognition needs to study about preprocessing of various methods such as binarization and thinning. This paper considers running time of watershed algorithm and the quality of resulting image as preprocessing for off-line handwritten Korean character recognition. So it proposes application of effective watershed algorithm for segmentation of character region and background region in gray level character image and segmentation function for binarization by extracted watershed image. Besides it proposes thinning methods that effectively extracts skeleton through conditional test mask considering routing time and quality of skeleton, estimates efficiency of existing methods and this paper's methods as running time and quality. Average execution time on the previous method was 2.16 second and on this paper method was 1.72 second. We prove that this paper's method removed noise effectively with overlap stroke as compared with the previous method.