• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.6
• /
• pp.178-188
• /
• 1996

In this paper, we propose a new opto-digital object recognition system which has rotation, scale, and shift invariant characteristics. The fourier power spectrum of the object image is modified to get shift invariance. The log-polar transform is used for rotation and scale invariance. And the decision of similarities is performed by nonlinear joint transform correlator (NJTC) that can control the ratio of phase and amplitude signals. Experimental verification of th eproposed optical object recognition system is presented.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.1136-1142
• /
• 1999

A difficulty of the visual inspection for translated, magnified and rotated objects exists owing to the limitation of recognition rate. In this paper, we perform to define Integral Logarithm Transform(ILT), to consider its characteristic for implementation of Translation-, Magnification- and Rotation-invariant inspection system, and to compare with other methods in inspection error rate. By using magnification and rotation invariance properties of ILT, it makes easier than other methods to extract the rotation degree. The new method employs the ILT for the good/bad inspection of translated, magnified and rotated objects and experiment is performed to achieve translation, magnification and rotation invariance. In other methods both magnification and rotation invariance can't be available. As the result of he experiment, it is not better than the self-organizing map in the improvement of recognition rate, but it shows us the possibility to be used as a tool for the good/bad inspection system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.6
• /
• pp.280-298
• /
• 2008

For efficient content-based image retrieval, diverse visual features such as color, texture, and shape have been widely used. In the case of leaf images, further improvement can be achieved based on the following observations. Most plants have unique shape of leaves that consist of one or more blades. Hence, blade-based matching can be more efficient than whole shape-based matching since the number and shape of blades are very effective to filtering out dissimilar leaves. Guaranteeing rotational invariance is critical for matching accuracy. In this paper, we propose a new shape representation, indexing and matching scheme for leaf image retrieval. For leaf shape representation, we generated a distance curve that is a sequence of distances between the leaf’s center and all the contour points. For matching, we developed a blade-based matching algorithm called rotation invariant - partial dynamic time warping (RI-PDTW). To speed up the matching, we suggest two additional techniques: i) priority queue-based pruning of unnecessary blade sequences for rotational invariance, and ii) lower bound-based pruning of unnecessary partial dynamic time warping (PDTW) calculations. We implemented a prototype system on the GEMINI framework [1][2]. Using experimental results, we showed that our scheme achieves excellent performance compared to competitive schemes.

• The Journal of Information Technology
• /
• v.12 no.4
• /
• pp.25-32
• /
• 2009

Iris recognition is a biometric technology which can identify a person using the iris pattern. It is important for the iris recognition system to extract the feature which is invariant to changes in iris patterns. Those changes can be occurred by the influence of lights, changes in the size of the pupil, and head tilting. This paper is appropriate for the embedded environment using local gradient histogram embedded system using iris feature extraction methods have implement. The proposed method enables high-speed feature extraction and feature comparison because it requires no additional processing to obtain the rotation invariance, and shows comparable performance to the well-known previous methods.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.4
• /
• pp.44-55
• /
• 1993

In this paper, we proposed a new optical method for the efficient recognition of Korean characters. There are six filters in the proposed method which employed the concepts of amplitude-modulated phase-only filter(AMPOF) and spatial frequency modulation(SFM). Here, amplitude modulation is used to achieve improved correlation discrimination and SFM is to reduce the number of filters. We also used a simplified synthetic discriminant function(SDF) for distortion invariance of input image. In order to recognize the partial rotation invariant Korean characters, the proposed distortion invariant minimum average correlation energy (MACE) filter is synthesized SFM, partial rotation invariant filter (PRIF), AMPOF and MACE for partial rotation invariance in the frequency domain. The advantage of the proposed filters is to supress the sidelobes of cross correlation peak away from the autocorrelation peak and to produce sharp correlation peaks. We performed simulation and optical experiment for some of Korea characters using the proposed method. The results show that the proposed method has more improved discriminant ability and reduced processing time than the conventional methods.

• Honam Mathematical Journal
• /
• v.21 no.1
• /
• pp.139-147
• /
• 1999

In this paper we generalize the definition of strongly close-to-convex functions by using the functions g(z) of bounded boundary rotation and investigate the distortion and rotation theorem, coefficient inequalities, invariance property and inclusion relation for the new class $G_{k}[A,\;B]$.

• International Journal of Contents
• /
• v.5 no.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.

• International Journal of Precision Engineering and Manufacturing
• /
• v.9 no.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.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1420-1423
• /
• 2002

The classification and recognition of two-dimensional trademark patterns independently of their position, orientation, size and scale by proposing two feature vectors has been discussed. The paper presents experimentation on two feature vectors showing size- invariance and scale-invariance respectively. Both feature vectors are equally invariant to rotation as well. The feature extraction is based on local as well as global statistics of the image. These feature vectors have appealing mathematical simplicity and are versatile. The results so far have shown the best performance of the developed system based on these unique sets of feature. The goal has been achieved by segmenting the image using connected-component (nearest neighbours) algorithm. Second part of this work considers the possibility of using back propagation neural networks (BPN) for the learning and matching tasks, by simply feeding the feature vectosr. The effectiveness of the proposed feature vectors is tested with various trademarks, not used in learning phase.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.869-872
• /
• 2000

Although many content-based image retrieval systems using shape feature have tried to cover rotation-, position- and scale-invariance between images, there have been problems to cover three kinds of variance at the same time. In this paper, we introduce new approach to extract shape feature from image using MBR(Minimum Bounding Rectangle). The proposed method scans image for extracting MBR information and, based on MBR information, compute contour information that consists of 16 points. The extracted information is converted to specific values by normalization and rotation. The proposed method can cover three kinds of invariance at the same time. We implemented our method and carried out experiments. We constructed R*_tree indexing structure, perform k-nearest neighbor search from query image, and demonstrate the capability and usefulness of our method.