• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.97-100
• /
• 2013

In this paper, we propose a detection method of the character rather than cursive, containing many components of the vertical and horizontal direction in complex background image. The characters have many dense corners but the background has few sparse corners. So we use harris corner detector and cluster the corners by using the position of the detected corners for detecting character regions. To merge or filter character regions, we analysis a histogram of gray image of character regions. In each improved region, we compare histograms of R, G, B channels to detect characters.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1997.11a
• /
• pp.228-233
• /
• 1997

An efficient corner matching algorithm is developed to minimize the amount of calculation. To reduce the amount of calculation, all available information from a corner detector is used to make model. This information has uncertainties due to discretization noise and geometric distortion, and this is represented by fuzzy rule base which can represent and handle the uncertainties. Form fuzzy inference procedure, a matched segment list is extracted, and resulted segment list is used to calculate the transformation between object of model and scene. To reduce the false hypotheses, a vote and re-vote method is developed. Also an auto tuning scheme of the fuzzy rule base is developed to find out the uncertainties of features from recognized results automatically. To show the effectiveness of the developed algorithm, experiments are conducted for images of real electronic components.

• Journal of Korea Multimedia Society
• /
• v.14 no.5
• /
• pp.622-631
• /
• 2011

Corners play an important role in describing object features for pattern recognition and identification. This paper proposed a fast and adaptive corner detector in both coarse and fine scale, followed by the framework of the curvature scale space (CSS). An adaptive curvature threshold and evaluating of angles of corner candidates are added to original CSS to remove round corners and false corners in the detecting process. The efficiency of proposed method is compared to other popular detectors in both accuracy criteria, stability and time consuming. Results illustrate that the proposed method performs extremely surpass in both areas.

• The KIPS Transactions:PartB
• /
• v.10B no.1
• /
• pp.73-80
• /
• 2003

In this paper we propose an algorithm which matches the corresponding feature points between the reference image and the search image. We use Harris's corner detector to find the feature points in both image. For each feature point in the reference image, we can extract the candidate matching points as feature points in the starch image which the normalized correlation coefficient goes greater than a threshold. Finally we determine a corresponding feature points among candidate points by using dynamic programming. In experiments we show results that match feature points in synthetic image and real image.

• The Journal of the Korea Contents Association
• /
• v.11 no.4
• /
• pp.67-73
• /
• 2011

The image retrieval generally shows the same or similar images to a query image as a result. In the case of rotated image, however, its performance tends to be debased significantly. We propose a method to ensure a reliable image retrieval of rotated images as follows; First, to obtain feature points of query/DB images by Harris Corner Detector; and then, utilizing the feature points, to find the object's axis and query/DB images into rotation invariant images with Principal Components Analysis algorithm. We have experimented with 6,000 natural images which are 256 pixels in diameter. They are 1,000 Wang's images and their rotated images by $30^{\circ}$, $45^{\circ}$, $90^{\circ}$, $135^{\circ}$ and $180^{\circ}$. The simulation results show that the proposed method retrieves rotated images more effectively than the conventional method.

• Journal of Intelligence and Information Systems
• /
• v.18 no.2
• /
• pp.47-60
• /
• 2012

Video data comes in the form of the unstructured and the complex structure. As the importance of efficient management and retrieval for video data increases, studies on the video parsing based on the visual features contained in the video contents are researched to reconstruct video data as the meaningful structure. The early studies on video parsing are focused on splitting video data into shots, but detecting the shot boundary defined with the physical boundary does not cosider the semantic association of video data. Recently, studies on structuralizing video shots having the semantic association to the video scene defined with the semantic boundary by utilizing clustering methods are actively progressed. Previous studies on detecting the video scene try to detect video scenes by utilizing clustering algorithms based on the similarity measure between video shots mainly depended on color features. However, the correct identification of a video shot or scene and the detection of the gradual transitions such as dissolve, fade and wipe are difficult because color features of video data contain a noise and are abruptly changed due to the intervention of an unexpected object. In this paper, to solve these problems, we propose the Scene Detector by using Color histogram, corner Edge and Object color histogram (SDCEO) that clusters similar shots organizing same event based on visual features including the color histogram, the corner edge and the object color histogram to detect video scenes. The SDCEO is worthy of notice in a sense that it uses the edge feature with the color feature, and as a result, it effectively detects the gradual transitions as well as the abrupt transitions. The SDCEO consists of the Shot Bound Identifier and the Video Scene Detector. The Shot Bound Identifier is comprised of the Color Histogram Analysis step and the Corner Edge Analysis step. In the Color Histogram Analysis step, SDCEO uses the color histogram feature to organizing shot boundaries. The color histogram, recording the percentage of each quantized color among all pixels in a frame, are chosen for their good performance, as also reported in other work of content-based image and video analysis. To organize shot boundaries, SDCEO joins associated sequential frames into shot boundaries by measuring the similarity of the color histogram between frames. In the Corner Edge Analysis step, SDCEO identifies the final shot boundaries by using the corner edge feature. SDCEO detect associated shot boundaries comparing the corner edge feature between the last frame of previous shot boundary and the first frame of next shot boundary. In the Key-frame Extraction step, SDCEO compares each frame with all frames and measures the similarity by using histogram euclidean distance, and then select the frame the most similar with all frames contained in same shot boundary as the key-frame. Video Scene Detector clusters associated shots organizing same event by utilizing the hierarchical agglomerative clustering method based on the visual features including the color histogram and the object color histogram. After detecting video scenes, SDCEO organizes final video scene by repetitive clustering until the simiarity distance between shot boundaries less than the threshold h. In this paper, we construct the prototype of SDCEO and experiments are carried out with the baseline data that are manually constructed, and the experimental results that the precision of shot boundary detection is 93.3% and the precision of video scene detection is 83.3% are satisfactory.

• Journal of the Institute of Convergence Signal Processing
• /
• v.13 no.4
• /
• pp.173-179
• /
• 2012

In this paper, we presents a new method for vehicle number plate detection. Our method is basically the method extracting a rectangles from a car image because the shape of a vehicle number plate is a rectangle. For detecting the vehicle number plate, firstly, the contrast of the input image is enhanced. Then, the lines in the image are obtained by using LSD(line segment detector), and rectangles in the image are detected from the line data. These rectangles are the candidates of the car plate, from which the car plate is selected. In this procedure, the method of detecting rectangles is our proposed method, which consists of three stages: (1) extracting corners from the line segments by LSD; (2) extracting diagonal lines from the corner data; and (3) detecting rectangles from diagonal line information. And finally the vehicle number plate is selected from these rectangles by using the feature of the vehicle number plate and the inside information of rectangles. In the experiments with the 100 images captured by our digital camera, we have achieved a detection rate of 94%.

• International Journal of Contents
• /
• v.13 no.1
• /
• pp.68-75
• /
• 2017

Interactive Typography is a process where a user communicates by interacting with text and a moving factor. This research covers interactive typography using real-time response to a user's gesture. In order to form a language-independent system, preprocessing of entered text data presents image data. This preprocessing is followed by recognizing the image data and the setting interaction points. This is done using computer vision technology such as the Harris corner detector and contour detection. User interaction is achieved using skeleton information tracked by a depth camera. By synchronizing the user's skeleton information acquired by Kinect (a depth camera,) and the typography components (interaction points), all user gestures are linked with the typography in real time. An experiment was conducted, in both English and Korean, where users showed an 81% satisfaction level using an interactive typography system where text components showed discrete movements in accordance with the users' gestures. Through this experiment, it was possible to ascertain that sensibility varied depending on the size and the speed of the text and interactive alteration. The results show that interactive typography can potentially be an accurate communication tool, and not merely a uniform text transmission system.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2013.07a
• /
• pp.23-26
• /
• 2013

최근 모바일 장치의 영상 데이터 처리 능력 확대와 더불어 사용자가 요구하는 다양한 영상 데이터의 효율적인 인식 기술 연구가 요구되어지고 있다. 모바일 환경은 고성능 PC 환경과 달리 저사양의 CPU와 메모리를 탑재하고 있어, 영상에서 원하는 객체를 인식하기 위한 기존의 방법론으로는 사용자 요구를 실시간으로 충족하기 어려운 부분이 존재한다. 이에 모바일 환경에 맞는 객체 인식 방법론의 개발이 요구된다. 모바일 환경에서 실시간으로 객체 인식을 하기 위하여, 본 논문에서는 객체 코너 정보를 이용한 Harris corner detector[1]로부터 객체의 특징점을 추출하고, 이를 바탕으로 하여 영상내의 객체 정보 인식 방법을 제안한다. 제안하는 방법에 의해, 입력 영상에서 객체의 코너 정보를 빠르게 추출, 기존 특징점과의 비교를 통하여 영상 내부의 객체 인식을 진행한다. 일반적으로, 회전된 특징점 객체의 정보는 객체의 회전 정도에 따라 코너 픽셀 색상 정보의 변화가 발생하게 된다. 특징점의 색상값은 객체의 회전 정도에 영향을 받아 주변의 픽셀값과 혼합되는 특성이 존재한다. 본 논문에서는 회전 변경된 픽셀 색상값의 영향을 분석하여, 회전된 객체의 특징점 추출 및 객체 검출에 반영하도록 하여, 영상 내부의 회전된 객체 검출의 수행에 효과적으로 이용될 수 있도록 한다. 특징점의 코너 정보를 이용하여 객체를 인식하는 것은, 객체의 인식률은 다소 감소하더라도 모바일 환경에서 계산량의 감소를 통한 실시간 활용이 가능하도록 한다. 이러한 특성은 저성능 CPU와 메모리에서도 회전된 객체의 인식을 수행할 수 있게 하는데 상당히 효과적이다.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.55 no.4
• /
• pp.165-172
• /
• 2006

In this paper we present a technique for detecting cross-reference points that allows improving watermark detect-ability. In general, Harris detector is commonly used for finding salient points. Harris detector is a kind of combined corner and edge detector which is based on neighboring image data distribution, therefore it has some limitation to find accurate salient points after watermark embedding or any kinds of digital attacks. The new method proposed in this paper used not data distribution but geometrical structure of a normalized image in order to avoid pointing error caused by the distortion of image data. After normalization, we constructed pre-specified number of virtual lines from top to bottom and left to right, and several of cross points were selected by a random key. These selected points specify almost same positions with the accuracy more than that of Harris detector after digital attacks. These points were arranged by a random key, and blocks centered in these points were formed. A reference watermark is formed by a block and embedded in the next block. Because same alteration is applied to the watermark generated and embedded blocks. the detect-ability of watermark is improved even after digital attacks.