• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.2
• /
• pp.63-70
• /
• 1997

This paper proposes a new algorithm for recognizing polyhedral objects using a single 2-D image. It is base don a new representation scheme having two level hierarchey. In the lower level, geometrical features of each primitive surface are represented using their signatures and the variation of signature due to rotation is represented suing the rotation map. In the higher level, topological features are represented in the inter-surface description table(SDT). Based on the proposed representaton scheme, loer level database searched to find a matching primitive surface. The srotation map determines the degree of rotation as well as the matchness. If all surfaces in a test object find their matching primitive surfaces, its structural information is compared with the SDTs of object models. If primitive surfaces of a test object equal to tha tof certain model and satisfy inter-surfaces relationship in SDT, a test object is recognized as the model.

• International Journal of Contents
• /
• v.13 no.2
• /
• pp.21-28
• /
• 2017

Abnormal data in the manufacturing process makes it difficult to find useful information that can be applied in data management for the manufacturing industry. It causes various problems in the daily process of production. An issue from the abnormal data can be handled by our method that uses big data and visualization. Visualization is a new technology that transforms data representation into a two-dimensional representation. Nowadays, many newly developed technologies provide data analysis, algorithm, optimization, and high efficiency, and they meet user requirements. We propose combined production of the data visualization approach that uses integrative visualization of sources of abnormal pattern analysis results. The perceived idea of the proposed approach can solve the problem as it also works for big data. It can also improve the performance and understanding by using visualization and solving issues that occur in the manufacturing process with a calendar heat map.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.3
• /
• pp.871-879
• /
• 1997

The comversion of printed maps into computerixed data bases is an enormous rask. Thus the autmaotion of the conversion process is essential. Efficient computer representation of printed maps and line drawings depends on codes assigened to chracaters, symbools, and vestor representation of the graphics. In many cases, maps ard constructed in a number of layers, where each layer is printed in a distinct color, and it represents a subste of the map infromation. In order to properly repressnet road information from color map images, an automatic road extraction algorithm is proposed. Road image is separated from graghics by color segmentation, and then restored by the proposed concurrent conditional dilation operation. The internal and external noise of the road image is eliminated by opening and closing operation. By thining and vectorizing line segments, the desited road information is extracted.

• The Journal of Korea Robotics Society
• /
• v.16 no.2
• /
• pp.103-111
• /
• 2021

This study addresses a low-cost lidar sensor-based glass feature extraction method for an accurate map representation using statistical moments, i.e. the mean and variance. Since the low-cost lidar sensor produces range-only data without intensity and multi-echo data, there are some difficulties in detecting glass-like objects. In this study, a principle that an incidence angle of a ray emitted from the lidar with respect to a glass surface is close to zero degrees is concerned for glass detection. Besides, all sensor data are preprocessed and clustered, which is represented using statistical moments as glass feature candidates. Glass features are selected among the candidates according to several conditions based on the principle and geometric relation in the global coordinate system. The accumulated glass features are classified according to the distance, which is lastly represented on the map. Several experiments were conducted in glass environments. The results showed that the proposed method accurately extracted and represented glass windows using proper parameters. The parameters were empirically designed and carefully analyzed. In future work, we will implement and perform the conventional SLAM algorithms combined with our glass feature extraction method in glass environments.

• Journal of the Korean Mathematical Society
• /
• v.40 no.3
• /
• pp.447-460
• /
• 2003

In this paper we study the non-degenerate n-connected canonical domains with n>1 related to the conjecture of S. Bell in [4]. They are connected to the algebraic property of the Bergman kernel and the Szego kernel. We characterize the non-degenerate doubly connected canonical domains.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.1031-1032
• /
• 2006

A 3D model based face recognition system is generally inefficient in computation time because 3D face model consists of a large number of vertices. In this paper, we propose a novel 3D face representation algorithm to reduce the number of vertices and optimize its computation time.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.887-890
• /
• 1998

We present a method for initialization of asynchronous circuits using binary decision space representation. From state transition graph(STG) which is given as a specification a circuit, the BDD is generated to solve the state space explosion problem which is caused by concurrecy of STG. We first step, we construct the necessary informaton as a form of K-map from BDD, then find an initial state on the K-map by assignment of don't care assignment.

• The Pure and Applied Mathematics
• /
• v.3 no.1
• /
• pp.53-58
• /
• 1996

In 1981, R . Badard introduced the notion of fuzzy pretopological spaces and their representation[1]. And in 1992, R. Badard, et al. introduced the L-fuzzy pretopological spaces and studied properties of continuity, open map, closed map, and homeomorphism in L-fuzzy pretopological spaces. In this paper we introduce and study the concepts of almost continuous functions and weakly pre-continuous functions on L-fpts's.(omitted)

• Honam Mathematical Journal
• /
• v.46 no.1
• /
• pp.60-69
• /
• 2024

We consider a special orthonormal basis for the Hardy space of the unit disc to compute the matrix representations of the composition operators with respect to the basis particulary associated to two symbols which are the inverse and the origin symmetry of the Riemann self map in the unit disc, and then we find a certain symmetry of the matrices.

• IEIE Transactions on Smart Processing and Computing
• /
• v.2 no.5
• /
• pp.277-281
• /
• 2013

Modern speaker verification systems based on support vector machines (SVMs) use Gaussian mixture model (GMM) supervectors as their input feature vectors, and the maximum a posteriori (MAP) adaptation is a conventional method for generating speaker-dependent GMMs by adapting a universal background model (UBM). MAP adaptation requires the appropriate amount of input utterance due to the number of model parameters to be estimated. On the other hand, with limited utterances, unreliable MAP adaptation can be performed, which causes adaptation noise even though the Bayesian priors used in the MAP adaptation smooth the movements between the UBM and speaker dependent GMMs. This paper proposes a sparse MAP adaptation method, which is known to perform well in the automatic speech recognition area. By introducing sparse MAP adaptation to the GMM-SVM-based speaker verification system, the adaptation noise can be mitigated effectively. The proposed method utilizes the L0 norm as a regularizer to induce sparsity. The experimental results on the TIMIT database showed that the sparse MAP-based GMM-SVM speaker verification system yields a 42.6% relative reduction in the equal error rate with few additional computations.