• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11C
• /
• pp.1140-1151
• /
• 2003

This paper proposes a face recognition method based on modified Otsu's binarization and Hu moment. Proposed method is robust to brightness, contrast, scale, rotation, and translation changes. As the proposed modified Otsu's binarization computes other thresholds from conventional Otsu's binarization, namely we create two binary images, we can extract higher dimensional feature vector. Here the feature vector has properties of robustness to brightness and contrast changes because the proposed method is based on Otsu's binarization. And our face recognition system is robust to scale, rotation, and translation changes because of using Hu moment. In the perspective of brightness, contrast, scale, rotation, and translation changes, experimental results with Olivetti Research Laboratory (ORL) database and the AR database showed that average recognition rates of conventional well-known principal component analysis (PCA) are 93.2% and 81.4%, respectively. Meanwhile, the proposed method for the same databases has superior performance of the average recognition rates of 93.2% and 81.4%, respectively.

• Spatial Information Research
• /
• v.15 no.4
• /
• pp.385-395
• /
• 2007

As the growth of performance of the computer and the development of the Internet are exponential, sharing and using the information illegally have also increased to the same proportion. In this paper, we proposed a novel method on the vector map data among digital contents. Vector map data are used for GIS, navigation and web-based services etc. We embedded watermark into the coordinate of the vector map data using bit operation and extracted the watermark. This method helps to protect the copyright of the vector map data. This watermarking method is a spatial domain method and it embeds the watermark within an allowable error. Our experiment shows that the watermark produced by this method is resistant to simplification and translation.

• The Plant Pathology Journal
• /
• v.22 no.4
• /
• pp.386-390
• /
• 2006

Extensive research of the Potato virus X(PVX) has been performed in in vitro transcription system using the bacteriophage T7 promoter. We constructed an efficient T-DNA based binary vector, pSNU1, and modified vectors carrying PVX replicons. The suitability of the construct to transiently express PVX RNA using Agrobacterium tumefaciens was tested by analysis of infectivity in plants. The expressed PVX RNA was infectous and systemically spread in three plant species including Nicotiana benthamiana, N. tabacum cv. Xanthi-nc, and Capsicum annuum cv. Chilsungcho. The PVX full length construct, pSPVXp31, was caused severe mosaic symptoms on N. benthamiana, severe necrotic lesions on C. annuum while milder symptoms and delayed mosaic symptoms were appeared on the systemic leaves on N. tabaccum. RT-PCR analysis confirmed the presence of PVX RNAs on both inoculated and systemic leaves in all three plant species tested. Our results indicated that PVX replicons were efficiently expressed PVX RNA in at least three tested species. Further investigation win be needed to elucidate the mechanism of PVX replication, translation, movement and assembly/disassembly processes.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.32 no.11
• /
• pp.863-869
• /
• 2008

This paper investigated the new calibration algorithm of a straight-type five-hole pressure probe for measuring three-dimensional flow velocity components. This new calibration algorithm was used for velocity data reduction from the calibration map and based on the combination of a look-up, a binary search algorithm and a geometry transformation including the translation and reflection of nodes in a calibration map. The calibration map was expanded up to the application angle, ${\pm}55^{\circ}$ of a probe. This velocity data reduction method showed a perfect performance without any kind of interpolating errors in calculating yaw and pitch angles from the calibration map. Moreover, when it was applied to an actual flow field including a swirling flow, a good result came out on the whole.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.05a
• /
• pp.185-191
• /
• 1999

Mathematical morphology based on set theory has been applied to various areas in image processing. Pitas proposed a object recognition algorithm using Morphological Shape Decomposition(MSD), and a new representation scheme called Morphological Shape Representation(MSR). The Pitas's algorithm is a simple and adequate approach to recognize objects that are rotated 45 degree-units with respect to the model object. However, this recognition scheme fails in case of random rotation. This disadvantage may be compensated by defining small angle increments. However, this solution may greatly increase computational complexity because the smaller the step makes more number of rotations to be necessary. In this paper, we propose a new method for object recognition based on MSD. The first step of our method decomposes a binary shape into a union of simple binary shapes, and then a new tree structure is constructed which ran represent the relations of binary shapes in an object. finally, we obtain the feature informations invariant to the rotation, translation, and scaling from the tree and calculate matching scores using efficient matching measure. Because our method does not need to rotate the object to be tested, it could be more efficient than Pitas's one. MSR has an intricate structure so that it might be difficult to calculate matching scores even for a little complex object. But our tree has simpler structure than MSR, and easier to calculated the matchng score. We experimented 20 test images scaled, rotated, and translated versions of five kinds of automobile images. The simulation result using octagonal structure elements shows 95% correct recognition rate. The experimental results using approximated circular structure elements are examined. Also, the effect of noise on MSR scheme is considered.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.943-946
• /
• 2006

XML is the most widely used document format by advantage that self-contained for platform. So, currently the most used among other document format. but XML appeared new problem that memory and transmission. And that be used in environment a request restriction memory and fast transmission as like mobile field. Although discussion of XML binarization is going on progress. And fast Infoset configuration using XML Information Set is receiving attention that a way to lower file size of hold down a existing usage. In this paper, we designed of module using fast Infoset and PER among ASN.1 Encoding Rule for XML binarization. And we implementation of encoder constructed interlace by stage of translation from XML into binary XML.

• International Journal of Contents
• /
• v.14 no.1
• /
• pp.1-6
• /
• 2018

Text, as one of the most influential inventions of humanity, has played an important role in human life since ancient times. The rich and precise information embodied in text is very useful in a wide range of vision-based applications such as the text data extracted from images that can provide information for automatic annotation, indexing, language translation, and the assistance systems for impaired persons. Therefore, natural-scene text detection with active research topics regarding computer vision and document analysis is very important. Previous methods have poor performances due to numerous false-positive and true-negative regions. In this paper, a fully-convolutional-network (FCN)-based method that uses supervised architecture is used to localize textual regions. The model was trained directly using images wherein pixel values were used as inputs and binary ground truth was used as label. The method was evaluated using ICDAR-2013 dataset and proved to be comparable to other feature-based methods. It could expedite research on text detection using deep-learning based approach in the future.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.19 no.4
• /
• pp.44-50
• /
• 2011

This paper presents the algorithm for attitude determination of an aircraft using binary image. An image feature vector, which is invariant to translation, scale and rotation, is constructed to capture the functional relations between the feature vector and the corresponding aircraft attitude. An iterated least squares method is suggested for estimating the attitude of given aircraft using the constructed feature vector library. Simulation results show that the proposed algorithm yields good estimates of aircraft attitude in most viewing range, although a relatively large error occurs in some limited viewing direction.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.30 no.5 s.248
• /
• pp.488-495
• /
• 2006

The demand for the use of 3D CAD data over the Internet environment has been increased. However, transmission of 3D CAD data has delayed the communication effectiveness because of the CAD data size. Lightweight CAD file design methodology is required for rapid transmission in the distributed environment. In this paper, to derive lightweight CAD files from commercial CAD systems, a file translation system producing a native file is constructed first by using the InterOp and API of the ACIS kernel. Using the B-rep model and mesh data extracted from the native file, the lightweight CAD file with topological information is constructed as a binary file. Since the lightweight CAD file retains topological information, it is applied to the dimensional verification, digital mock-ups and visualization of CAD files. Effectiveness of the proposed lightweight CAD file is confirmed through various case studies.

• Journal of Power System Engineering
• /
• v.12 no.4
• /
• pp.18-25
• /
• 2008

This paper investigated the new calibration algorithm of a straight-type five-hole pressure probe necessary for calculating three-dimensional flow velocity components. The new data reduction method Includes a look-up, a geometry transformation such as the translation and reflection of nodes, and a binary search algorithm. This new calibration map was applied up to the application angle, ${\pm}55^{\circ}$ of a probe. As a result, this data reduction method showed a perfect performance without any kind of interpolation errors In calculating yaw and pitch angle from the calibration map.