• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.28B no.9
• /
• pp.739-746
• /
• 1991

This paper develops a modified multilayer perceptron architecture which speeds up learning as well as the net's mapping accuracy. In Phase I, a cluster partitioning algorithm like the Kohonen's self-organizing feature map or the leader clustering algorithm is used as the front end that determines the cluster to which the input data belongs. In Phase II, this cluster selects a subset of the hidden layer nodes that combines the input and outputs nodes into a subnet of the full scale backpropagation network. The proposed net has been applied to two mapping problems, one rather smooth and the other highly nonlinear. Namely, the inverse kinematic problem for a 3-link robot manipulator and the 5-bit parity mapping have been chosen as examples. The results demonstrate the proposed net's superior accuracy and convergence properties over the original backpropagation network or its existing improvement techniques.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2005.11a
• /
• pp.295-303
• /
• 2005

Semantic Web and its related technologies have been opening the era of information sharing via Web. In the meantime, there are several huddles to overcome toward the new era and one of the major huddles is information integration issue unless we build and use a single unified but huge ontology which address everything in the world. Particularly in e-business area, information integration problem must be a great concern in search and comparison of products from various internet shopping sites and e-marketplaces. To overcome such an information integration problem, we propose an ontology driven mapping algorithm between heterogeneous product classification and description frameworks. We also perform comparative evaluation of the proposed mapping algorithm against a well-known ontology mapping tool, PROMPT.

• Journal for History of Mathematics
• /
• v.30 no.1
• /
• pp.1-15
• /
• 2017

The original proof-argument of Riemann in 1851 for the Riemann mapping theorem, one of the most central theorems in Complex analysis, was found faulty and essentially buried underneath the proof by $Carath{\acute{e}}odory$ of 1929, now accepted as the "textbook" proof. On the other hand, the original Riemann's "proof" was rediscovered and made correct by R.E. Greene and the author of this article in 2016. In this article, we try to shed lights onto the history related to the Riemann mapping theorem and the surrounding developments of 1850-1930 by reflecting upon the main flow of ideas and methods of the proof by R. E. Greene and K.-T. Kim.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1994.06a
• /
• pp.1015-1020
• /
• 1994

This paper presents the Korean digit recognition method under noise environment using the spectral mapping training based on static supervised adaptation algorithm. In the presented recognition method, as a result of spectral mapping from one space of noisy speech spectrum to another space of speech spectrum without noise, spectral distortion of noisy speech is improved, and the recognition rate is higher than that of the conventional method using VQ and DTW without noise processing, and even when SNR level is 0 dB, the recognition rate is 10 times of that using the conventional method. It has been confirmed that the spectral mapping training has an ability to improve the recognition performance for speech in noise environment.

• International Journal of Advanced Culture Technology
• /
• v.9 no.4
• /
• pp.302-306
• /
• 2021

Indoor localization is one of the basic elements of Location-Based Service, such as indoor navigation, location-based precision marketing, spatial recognition of robotics, augmented reality, and mixed reality. We propose a Voxel Labeling-based visual positioning system using object simultaneous localization and mapping (SLAM). Our method is a method of determining a location through single image 3D cuboid object detection and object SLAM for indoor navigation, then mapping to create an indoor map, addressing it with voxels, and matching with a defined space. First, high-quality cuboids are created from sampling 2D bounding boxes and vanishing points for single image object detection. And after jointly optimizing the poses of cameras, objects, and points, it is a Visual Positioning System (VPS) through matching with the pose information of the object in the voxel database. Our method provided the spatial information needed to the user with improved location accuracy and direction estimation.

• Journal of The Korean Association For Science Education
• /
• v.28 no.4
• /
• pp.340-349
• /
• 2008

This study investigated the mapping errors induced in learning the concept of reaction rate with analogies, and compared these mapping errors by the analogy presentation types. Tenth graders (N=418) at a high school were assigned to the four groups by the target concepts and the analogy presentation types. The target concepts were 'concentration and reaction rate' and 'temperature and reaction rate'. In presenting analogy, the verbal and the verbal/pictorial analogs were used. After the students learned one of the analogs, a mapping test was administered. From the analysis, eight types of mapping errors were identified: overmapping, artificial mapping, failure to map, rash mapping, mismapping, mapping of a superficial feature, retention of a base feature, and impossible mapping. According to the analogy presentation types and the features of the target concepts, there were some differences in the frequencies of mapping errors. Educational implications of these findings are discussed.

• Journal of computational fluids engineering
• /
• v.9 no.4
• /
• pp.7-12
• /
• 2004

In the present study a semi-automatic mesh generation program has been developed by using DXF file containing contour line data. The program consists of DXF file reader and mapping algorithm. Pre-generated 2-D planar mesh points are to be mapped one by one onto triangular surface whose three vertices are three nearest contour points surrounding the mapping point. The present program has been successfully tested for mesh generations for the road tunnel ventilation analysis and analysis of lava movement in mountain area.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.18 no.6
• /
• pp.1455-1464
• /
• 1994

A new and efficient algorithm for the integration of the thermal-elasto-plastic constitutive equation is proposed. While it falls into the category of the return mapping method, the algorithm adopts the three point approximation of plastic corrector within one time increment step. The results of its application to a von Mises-type thermal-elasto-plastic model with combined hardening and temperature-dependent material properties show that the accurate iso-error maps are obtained for both angular and radial errors. The accuracy achieved is because the predicted stress increment in a single step calculation follows the exact value closely not only at the end of the step but also through the whole path. Also, the comparison of the computational time for the new and other algorithms shows that the new one is very efficient.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.360-363
• /
• 1999

Video data compression is a major key technology in the field of multimedia applications. Variable-length coding is the most popular data compression technique which has been used in many data compression standards, such as JPEG, MPEG and image data compression standards, etc. In this paper, we present memory efficient VLC decoder architecture for MPEG-2 application which can achieve small memory space and higher throughput. To reduce the memory size, we propose a new grouping, remainder generation method and merged lookup table (LUT) for variable length decoders (VLD's). In the MPEG-2, the discrete cosine transform (DCT) coefficient table zero and one are mapped onto one memory whose space requirement has been minimized by using efficient memory mapping strategy The proposed memory size is only 256 words in spite of mapping two DCT coefficient tables.

• Journal of Information Processing Systems
• /
• v.13 no.3
• /
• pp.435-447
• /
• 2017

Associative and bidirectional associative memories are examples of associative structures studied intensively in the literature. The underlying idea is to realize associative mapping so that the recall processes (one-directional and bidirectional ones) are realized with minimal recall errors. Associative and fuzzy associative memories have been studied in numerous areas yielding efficient applications for image recall and enhancements and fuzzy controllers, which can be regarded as one-directional associative memories. In this study, we revisit and augment the concept of associative memories by offering some new design insights where the corresponding mappings are realized on the basis of a related collection of landmarks (prototypes) over which an associative mapping becomes spanned. In light of the bidirectional character of mappings, we have developed an augmentation of the existing fuzzy clustering (fuzzy c-means, FCM) in the form of a so-called collaborative fuzzy clustering. Here, an interaction in the formation of prototypes is optimized so that the bidirectional recall errors can be minimized. Furthermore, we generalized the mapping into its granular version in which numeric prototypes that are formed through the clustering process are made granular so that the quality of the recall can be quantified. We propose several scenarios in which the allocation of information granularity is aimed at the optimization of the characteristics of recalled results (information granules) that are quantified in terms of coverage and specificity. We also introduce various architectural augmentations of the associative structures.