• International Journal of Contents
• /
• 제5권2호
• /
• pp.26-31
• /
• 2009

This paper describes a new image watermarking scheme invariant to rotation, scaling and translation (RST) attacks. For obtaining the invariance properties we propose to present an image of watermark by wedges and rings to convert its rotation to shift and then utilize the shift invariance property of the Direct Fourier Transform (DFT). But in contrast to conversional schemes based on the Fourier-Mellin transform (FMT), we do not use a log-polar mapping (LPM). As a result, our scheme preserves high quality of original image since it is not underwent to LPM For withstanding against JPEG compression, noise addition and low-pass (LP) filtering attacks a low frequency watermark is embedded into middle frequencies of the original image. Experiments with various attacks show the robustness of the proposed scheme.

• Proceedings of the IEEK Conference
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.2128-2131
• /
• 2003

We present an efficient algorithm for skew correction of business card images obtained by a PDA camera. The proposed method is composed of four parts: block adaptive binarization (BAB), stripe generation, skew angle calculation, and image rotation. In the BAB, an input image is binarized block by block so as to lessen the effects of irregular illumination and shadows over the input image. In the stripe generation, character string clusters are generated merging character strings and their inter-spaces, and then only clusters useful for skew angle calculation are output as stripes. In the skew angle calculation, the direction angles of the stripes are calculated using their central moments and then the skew angle of the input image is determined averaging the direction angles. In the image rotation, the input image is rotated by the skew angle. Experimental results shows that the proposed method yields correction rates of 97％ for business card images.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• 제28B권5호
• /
• pp.327-334
• /
• 1991

This paper proposes an efficient method of implementing the generalized Hough transform (GHT), which has been hindered by an excessive computing load and a large memory requirement. The conventional algorithm requires a parameter space of 4 dimensions in detection a rotated, scaled, and translated object in an input image. Prior to the application of GHT to the input image, the proposed method determines the angle of rotation and the scaling factor of the test image using the proportion of the edge components between the reference image and test image. With the rotation angle and the scaling factor already determined, the parameter spaceis to be reduced to a simple array of 2 dimensions by applying the unit GHT only one time. The experiments with the image of airplanes reveal that both of the computing time and the requires memory size are reduced by 95 percent, without any degradatationof accuracy, compared with the conventional GHT algorithm.

• International Journal of Precision Engineering and Manufacturing
• /
• 제9권4호
• /
• pp.45-50
• /
• 2008

The Fourier-Mellin transform is the theoretical basis for the translation, rotation, and scale invariance of an image. However, its implementation requires a log-polar map of the original image, which requires logarithmic sampling of a radial variable in that image. This means that the mapping process is accompanied by considerable loss of data. To solve this problem, we propose a dual log-polar map that uses both a forward image map and a reverse image map simultaneously. Data loss due to the forward map sub-sampling can be offset by the reverse map. This is the first step in creating an invertible log-polar map. Experimental results have demonstrated the effectiveness of the proposed scheme.

• Journal of the Institute of Convergence Signal Processing
• /
• 제12권1호
• /
• pp.26-32
• /
• 2011

This paper proposes a new method to process panoramic image stitching using SURF(Speeded Up Robust Features). Panoramic image stitching is considered a problem of the correspondence matching. In computer vision, it is difficult to find corresponding points in variable environment where a scale, rotation, view point and illumination are changed. However, SURF algorithm have been widely used to solve the problem of the correspondence matching because it is faster than SIFT(Scale Invariant Feature Transform). In this work, we also describe an efficient approach to decreasing computation time through the homography estimation using RANSAC(random sample consensus). RANSAC is a robust estimation procedure that uses a minimal set of randomly sampled correspondences to estimate image transformation parameters. Experimental results show that our method is robust to rotation, zoom, Gaussian noise and illumination change of the input images and computation time is greatly reduced.

• The KIPS Transactions:PartB
• /
• 제9B권4호
• /
• pp.509-516
• /
• 2002

This paper proposes an efficient algorithm which recognizes the mixed document image consisting of the images, texts, tables, and straight lines. This system is composed of three steps. The first step is the detection of rotation angle for complementing skewed images, the second is detection of erasing an unnecessary background region and last is the classification of each component included in document images. This algorithm performs preprocessing of detecting rotation angles and correcting documents based on the detected rotation angles in order to minimize the error rate by skewness of the documentation. We detected the rotation angie using only horizontal and vertical components in document images and minimized calculation time by erasing unnecessary background region in the detecting process of component of document. In the next step, we classify various components such as image, text, table and line area included in document images. we applied this method to various document images in order to evaluate the performance of document recognition system and show the successful experimental results.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• 제51권6호
• /
• pp.267-271
• /
• 2002

The Hotelling transform is based on statistical properties of an image. The principal uses of this transform are in data compression. The basic concept of the Hotelling transform is that the choice of basis vectors pointing the direction of maximum variance of the data. This property can be used for rotation normalization. Many objects of interest in pattern recognition applications can be easily standardized by performing a rotation normalization that aligns the coordinate axes with the axes of maximum variance of the pixels in the object. However, this transform can not be used to rotation normalization of color images directly. In this paper, we propose a new method for rotation normalization of color images based on the Hotelling transform. The Hotelling transform is performed to calculate basis vectors of each channel. Then the summation of vectors of all channels are processed. Rotation normalization is performed using the result of summation of vectors. Experimental results showed the proposed method can be used for rotation normalization of color images effectively.

• Journal of the Institute of Electronics and Information Engineers
• /
• 제53권1호
• /
• pp.118-125
• /
• 2016

This study evaluates the performance of image to patient registration algorithm by using stereo vision and CT image for facial region surgical navigation. For the process of image to patient registration, feature extraction and 3D coordinate calculation are conducted, and then 3D CT image to 3D coordinate registration is conducted. Of the five combinations that can be generated by using three facial feature extraction methods and three registration methods on stereo vision image, this study evaluates the one with the highest registration accuracy. In addition, image to patient registration accuracy was compared by changing the facial rotation angle. As a result of the experiment, it turned out that when the facial rotation angle is within 20 degrees, registration using Active Appearance Model and Pseudo Inverse Matching has the highest accuracy, and when the facial rotation angle is over 20 degrees, registration using Speeded Up Robust Features and Iterative Closest Point has the highest accuracy. These results indicate that, Active Appearance Model and Pseudo Inverse Matching methods should be used in order to reduce registration error when the facial rotation angle is within 20 degrees, and Speeded Up Robust Features and Iterative Closest Point methods should be used when the facial rotation angle is over 20 degrees.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• 제25권9호
• /
• pp.952-958
• /
• 2014

In this paper, we propose a parametric sparse recovery algorithm(SRA) applied to a radar signal model, based on the compressive sensing(CS), for the ISAR(Inverse Synthetic Aperture Radar) image reconstruction from an incomplete radar-cross-section(RCS) data and for the estimation of rotation rate of a target. As the SRA, the iteratively-reweighted-least-square(IRLS) is combined with the radar signal model including chirp components with unknown chirp rate in the cross-range direction. In addition, the particle swarm optimization(PSO) technique is considered for searching correct parameters related to the rotation rate. Therefore, the parametric SRA based on the IRLS can reconstruct ISAR image and estimate the rotation rate of a target efficiently, although there exists missing data in observed RCS data samples. The performance of the proposed method in terms of image entropy is also compared with that of the traditional interpolation methods for the incomplete RCS data.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• 제39권5호
• /
• pp.522-534
• /
• 2002

In this paper, we propose a new object tracking system using stereo images to improve the performance of the automatic object tracking system. The existing object tracking system has optimum characteristics, but it requires a lot of computation. In the case of the image with a single eye, the system is difficult to estimate and track for the various transformation of the object. Because the stereo image by both eyes is difficult to estimate the translation and the rotation, this paper deals with the tracking method, which has the ability to track the image for translation for real time, with block matching algorithm in order to decrease the calculation. The experimental results demonstrate the usefulness of proposed system with the recognition rate of 88% in the rotation, 89% in the translation, 88% in various image, and with the mean rate of 88.3%.