• 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.

• Korean Journal of Remote Sensing
• /
• v.30 no.6
• /
• pp.769-776
• /
• 2014

It is necessary to detect the feature points existing simultaneously in both images and then find the corresponding relationship between the detected feature points. We propose a new feature detector based on geometric mean of two eigenvalues of gradient matrix which is able to measure the change of pixel intensities. The corner response of the proposed detector is proportional to the geometric mean and also the difference of two eigenvalues in the case of same geometric mean. We analyzed the localization error of the feature detection using aerial image and artificial image with various types of corners. The localization error of the proposed detector was smaller than that of the typical corner detector, Harris detector.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.3
• /
• pp.615-622
• /
• 2007

In general, Harris detector is commonly used for finding salient points in watermarking systems using feature points. Harris detector is a kind of combined comer 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. In this paper, we have used cross reference points which use 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 find cross reference points and take inverse normalization of these points. Next, we construct a group of triangles using tessellation with inversely normalized cross reference points. The watermarks are affine transformed and transformed-watermarks are embedded into not normalized image but original one. Only locations of watermarks are determined on the normalized image. Therefore, we can reduce data loss of watermark which is caused by inverse normalization. As a result, we can detect watermarks with high correlation after several digital attacks.

• 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.

• 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.

• Journal of KIISE:Software and Applications
• /
• v.34 no.7
• /
• pp.646-654
• /
• 2007

In recent years, the use of text inserted into TV contents has grown to provide viewers with better visual understanding. In this paper, video text is defined as superimposed text region located of the bottom of video. Video text extraction is the first step for video information retrieval and video indexing. Most of video text detection and extraction methods in the previous work are based on text color, contrast between text and background, edge, character filter, and so on. However, the video text extraction has big problems due to low resolution of video and complex background. To solve these problems, we propose a method to extract text from videos using the Harris corner detector. The proposed algorithm consists of four steps: corer map generation using the Harris corner detector, extraction of text candidates considering density of comers, text region determination using labeling, and post-processing. The proposed algorithm is language independent and can be applied to texts with various colors. Text region update between frames is also exploited to reduce the processing time. Experiments are performed on diverse videos to confirm the efficiency of the proposed method.

• KIEE International Transaction on Systems and Control
• /
• v.12D no.1
• /
• pp.7-11
• /
• 2002

In this study, fur the shape-based image retrieval, a method using local differential invariants is proposed. This method calculates the differential invariant feature vector at every feature point extracted by Harris comer point detector. Then through vector quantization using LBG algorithm, all feature vectors are represented by a codebook index. All images are indexed by the histogram of codebook index, and by comparing the histograms the similarity between images is obtained. The proposed method is compared with the existing method by performing experiments for image database including various 1100 trademarks.

• 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.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.1
• /
• pp.160-170
• /
• 2010

This paper proposes a Haar Wavelet Feature Detector (HWFD) based on the Haar wavelet transform and average box filter. By decomposing the original image using the Haar wavelet transform, the proposed detector obtains the variance information of the image, making it possible to extract more distinctive features from the original image. For detection of interest points that represent the regions whose variance is the highest among their neighbor regions, we apply the average box filter to evaluate the local variance information and use the integral image technique for fast computation. Due to utilization of the Haar wavelet transform and the average box filter, the proposed detector is robust to illumination change, scale change, and rotation of the image. Experimental results show that even though the proposed method detects fewer interest points, it achieves higher repeatability, higher efficiency and higher matching accuracy compared with the DoG detector and Harris corner detector.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.5
• /
• pp.990-995
• /
• 2010

Harris corner detector is commonly used to detect feature points for recognizing 2-D or 3-D objects. However, the feature points calculated from both of query and target objects need to be same positions to guarantee accurate recognitions. In order to check the positions of calculated feature points, we generate a Huffman tree which is based on adjacent feature values as inputs. However, the structures of two Huffman trees will be same as long as both of a query and targets have same feature values no matter how different their positions are. In this paper, we sort feature values and calculate the Euclidean distances of coordinates between two adjacent feature values. The Huffman Tree is generated with these Euclidean distances. As a result, the information of point locations can be included in the generated Huffman tree. This is the main strategy for accurate recognitions. We call this system as the HRM(Hybrid Retrieval Machine). This system works very well even when artificial random noises are added to original data. HRM can be used to recognize biological data such as proteins, and it will curtail the costs which are required to biological experiments.