• Journal of Korea Society of Industrial Information Systems
• /
• v.12 no.4
• /
• pp.74-88
• /
• 2007

In order to automate the process of mail sorting by delivery sequence, it is necessary to prepare a postal address database and to interpret written addresses on the mail-pieces with the database and OCR technology. The address database is a critical factor of automation and informatization of postal service since it could be used not only in address recognition but also in various mail processing. In this study, we design the schema of postal address database, design the postal address file based on it and explain the method of address interpretation and retrieval using it. We analyze infonnation requirements for transformation of postal address into the standardized format and consider them in the process of design. The postal address file can be used by address matching or retrieval system as well as by Hangul address recognition system for automation of delivery sequence mail-sorting.

• The KIPS Transactions:PartD
• /
• v.8D no.3
• /
• pp.273-284
• /
• 2001

A systematic approach for interpreting Korean addresses based on postal code is presented in this paper. The implementation is focused on producing the final delivery point code from various types of address recognized. There are two stages in the address interpretation : 1) agreement verification between the recognized postal code and upper part of the address and 2) analysis of lower part of the address. In the agreement verification procedure, the recognized postal code is used as the key to the address dictionary and each of the retrieved addresses is compared with the words in the recognized address. As the result, the boundary between the upper part and the lower part is located. The confusion matrix, which is introduced to correct possible mis-recognized characters, is applied to improve the performance of the process. In the procedure for interpreting the lower part address, a delivery code is assigned using the house number and/or the building name. Several rules for the interpretation have been developed based on the real addresses collected. Experiments have been performed to evaluate the proposed approach using addresses collected from Kwangju and Pusan areas.

• Journal of Korea Society of Industrial Information Systems
• /
• v.12 no.4
• /
• pp.15-24
• /
• 2007

The recognition of postal address images is indispensable for the automatic sorting of postal envelopes. The process of the address image recognition is composed of three steps-address image preprocessing, character recognition, address interpretation. The extracted character images from the preprocessing step are forwarded to the character recognition step, in which multiple candidate characters with reliability scores are obtained for each character image extracted. aracters with reliability scores are obtained for each character image extracted. Utilizing those character candidates with scores, we obtain the final valid address for the input envelope image through the address interpretation step. The envelope sorting rate depends on the performance of all three steps, among which character recognition step could be said to be very important. The good character recognizer would be the one which could produce valid candidates with very reliable scores to help the address interpretation step go easy. In this paper, we propose the method of generating character candidates with reliable recognition scores. We utilize the existing MLP(multilayered perceptrons) neural network of the address recognition system in the current automatic postal envelope sorters, as the classifier for the each image from the preprocessing step. The MLP is well known to be one of the best classifiers in terms of processing speed and recognition rate. The false alarm problem, however, might be occurred in recognition results, which made the address interpretation hard. To make address interpretation easy and improve the envelope sorting rate, we propose promising methods to reestimate the recognition score (confidence) of the existing MLP classifier: the generation method of the statistical recognition properties of the classifier and the method of the combination of the MLP and the subspace classifier which roles as a reestimator of the confidence. To confirm the superiority of the proposed method, we have used the character images of the real postal envelopes from the sorters in the post office. The experimental results show that the proposed method produces high reliability in terms of error and rejection for individual characters and non-characters.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.608-611
• /
• 2003

A large part of the embedded system, compared with the PC, have low performance CPU and small memory. So the embedded operating system fits the condition of that hardware system. A Single Address Space (SAS) OS has the operating system and all applications in the single address space. The SAS architecture enhances sharing and co-operation, because addresses have a unique interpretation. Thus, pointer-based date structures can be directly communicated and shared between programs at any time, and can be stored directly on storage. The key point of the SAS OS on the embedded system is the low overhead inter-action between programs in process and usage. So SAS OS can be ported on the low performance CPU. In this paper, we design the SAS OS (named emNOS, Embedded Network Operating System) on the ARMTTDMI processor. Finally we show the benefits of the SAS OS on the embedded system.

• The KIPS Transactions:PartB
• /
• v.10B no.4
• /
• pp.429-442
• /
• 2003

In this paper, we describe an address image recognition system for automatic processing of standard- size letter mail. The inputs to the system are gray-level mail piece images and the outputs are delivery point codes with which a delivery sequence of carrier can be generated. The system includes five main modules; destination address block location, text line separation, character segmentation, character recognition and finally address interpretation. The destination address block is extracted on the basis of experimental knowledge and the line separation and character segmentation is done through the analysis of connected components and vortical runs. For recognizing characters, we developed MLP-based recognizers and dynamical programming technique for interpretation. Since each module has been implemented in an independent way, the system has a benefit that the optimization of each module is relatively easy. We have done the experiment with live mail piece images directly sampled from mail sorting machine in Yuseong post office. The experimental results prove the feasibility of our system.

• International Journal of Computer Science & Network Security
• /
• v.23 no.3
• /
• pp.144-150
• /
• 2023

With progressive advancements in Man-made consciousness (computer based intelligence) and Profound Learning (DL), contributing altogether to Normal Language Handling (NLP), the precision and nature of Machine Interpretation (MT) has worked on complex. There is a discussion, but that its no time like the present the human interpretation became immaterial or excess. All things considered, human flaws are consistently dealt with by its own creations. With the utilization of brain networks in machine interpretation, its been as of late guaranteed that keen frameworks can now decipher at standard with human interpreters. In any case, simulated intelligence is as yet not without any trace of issues related with handling of a language, let be the intricacies and complexities common of interpretation. Then, at that point, comes the innate predispositions while planning smart frameworks. How we plan these frameworks relies upon what our identity is, subsequently setting in a one-sided perspective and social encounters. Given the variety of language designs and societies they address, their taking care of by keen machines, even with profound learning abilities, with human proficiency looks exceptionally far-fetched, at any rate, for the time being.

• Language and Information
• /
• v.10 no.2
• /
• pp.47-65
• /
• 2006

In this paper I address the problems of defining the semantics of numerals and accounting for how pragmatic inferences are made. I basically assume that a numeral n simply means '${\lambda}P{\lambda}x[#(x)n\;&\;P(x)]$', as commonly assumed. Even when a numeral n has 'at least' interpretation, a sentence with the number does not entail a sentence with n replaced with n-1. But when a sentence with n-1 holds, it is possible that a sentence with n or a larger number holds too. This is not based on a semantic relation, but on pragmatic informativeness. In addition to pragmatic strength, the actual reading of a numeral is affected by some background knowledge of generalizations about the world, but the ordering of pragmatic strength among numbers always plays a role in determining unilateral interpretations. In such a case, we can assume that a set of numbers relevant in the context forms a scale. Forming a scale does not necessarily lead to a unilateral interpretation. The bilateral interpretation of a number is possible in the context where it is known whether or not alternative sentences with contextually salient alternative numbers are true.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.133-136
• /
• 2002

This paper presents a new method of Huffman decoding which gives a significant improvement of processing efficiency based on the reconstruction of an efficient one-dimensional array data structure incorporating the numeric interpretation of the accrued codewords in the binary tree. In the Proposed search method, the branching address is directly obtained by the arithematic operation with the incoming digit value eliminating the compare instruction needed in the binary tree search. The proposed search method gives 30% of improved Processing efficiency and the memory space of the reconstructed Huffman table is reduced to one third compared to the ordinary ‘compare and jump’ based binary tree. The experimental result with the six MPEG-2 AAC test files also shows about 198% of performance improvement compared to those of the widely used conventional sequential search method.

• Korean Institute of Interior Design Journal
• /
• no.36
• /
• pp.102-110
• /
• 2003

This Study is concerned with the architectural problems particular to the design of the sanctuary in Catholic churches. The paper is meant to address two distinct groups - clerics and architects. Architects do not tend to think the church buildings theologically or liturgically, and priests, though they are often trained in the arts, do not tend to look at buildings the same way architects do. Hence, my goal is to adequately address the concerns of each in a language the other will understand, thereby building a bridge of communication between the two groups. The two main concerns of the study are to provide guidelines and reflection lot liturgically correct buildings, and to re-establish the traditions of church buildings. I discuss the idea of the sanctuary in the Catholic church,(in chapter 2) and examine each of the main furnishings of the sanctuary with regard to history, liturgical use, symbolism and related pastoral concerns.(in chapter 3,4).

• Journal of the Korean Society for Precision Engineering
• /
• v.11 no.5
• /
• pp.88-97
• /
• 1994

We persent a method for kinematic calibration of open chain mechanisms based on the product of exponentials (POE) formula. The POE formula represents the forward kinematics of an open chain as a product of matrix exponentials, and is based on a modern geometric interpretation of classical screw theory. Unlike the kinematic parameters in the POE formula vary smoothly with changes in the joint axes;ad hoc methods designed to address the inherent singularities in the D-H parameters are therefore are therefore unnecessary. After introducing the POE formula, we derive a least-squares kinematic calibration algorithm for general open chain mechanisms. Simulation results with a 6-axis open chain are presented.