• The KIPS Transactions:PartD
• /
• v.15D no.1
• /
• pp.31-40
• /
• 2008

We generally use lower-dimensional transformations to convert high-dimensional sequences into low-dimensional points in similar sequence matching. These traditional transformations, however, show different characteristics in indexing performance by the type of time-series data. It means that the selection of lower-dimensional transformations makes a significant influence on the indexing performance in similar sequence matching. To solve this problem, in this paper we propose a hybrid approach that integrates multiple transformations and uses them in a single multidimensional index. We first propose a new notion of hybrid lower-dimensional transformation that exploits different lower-dimensional transformations for a sequence. We next define the hybrid distance to compute the distance between the transformed sequences. We then formally prove that the hybrid approach performs the similar sequence matching correctly. We also present the index building and the similar sequence matching algorithms that use the hybrid approach. Experimental results for various time-series data sets show that our hybrid approach outperforms the single transformation-based approach. These results indicate that the hybrid approach can be widely used for various time-series data with different characteristics.

• Journal of Ocean Engineering and Technology
• /
• v.33 no.6
• /
• pp.510-517
• /
• 2019

Efficient path planning is essential for unmanned surface vehicle (USV) navigation. The A^* algorithm is an effective algorithm for identifying a safe path with optimal distance cost. In this study, a modified version of the A^* algorithm is applied for planning the path of a USV in a static and dynamic obstacle environment. The current study adopts the A^* approach while maintaining a safe distance between the USV and obstacles. Two important parameters-path length and computational time-are considered at various start times. The results demonstrate that the modified approach is effective for obstacle avoidance by a USV that is compliant with the International Regulations for Preventing Collision at Sea (COLREGs).

• Journal of Broadcast Engineering
• /
• v.7 no.2
• /
• pp.168-180
• /
• 2002

This paper proposes a novel method to detect unauthorized copies of digital images. This copy detection scheme can be used as either an alternative approach or a complementary approach to watermarking. A test image is reduced to 8$\times$8 sub-image by intensity averaging, and the AC coefficients of its discrete cosine transform (DCT) are used to compute distance from those generated from the query image, of which a user wants to find copies. Copies may be Processed to avoid copy detection or enhance image quality. We show ordinal measure of DCT coefficients, which is based on relative ordering of AC magnitude values and using distance metrics between two rank permutations, are robust to various modifications of the original image. The optimal threshold selection scheme using the maximum a posteriori (MAP) criterion is also addressed.

• Korean System Dynamics Review
• /
• v.13 no.3
• /
• pp.67-98
• /
• 2012

This study suggests a set of Causal Loop Diagram (CLD) of Causality Mechanism which integrates the matter of characteristics of emerging market and its expansion strategies. In order to make CLD more objective, all causalities are articulated from recent 55 studies (2000~2012) of SSCI Top Journals. This approach is valuable in that it is a first try to draw all the causalities from rigorous literature review regarding emerging market strategy. The 5 CLDs will show and clarify the strategies of how to expand into emerging market for MNCs. In sum, political activity and institutional void is a critical factor related to characteristics of emerging market, and CSV and cultural distance should be considered as a leverage point. For all this study's contribution to clarify the causality of emerging market strategies with abundant literature review, the study has its limits in integrating and testing CLD.

• Journal of Computing Science and Engineering
• /
• v.7 no.4
• /
• pp.272-284
• /
• 2013

In this paper, we propose a new framework for anomaly detection in medical wireless sensor networks, which are used for remote monitoring of patient vital signs. The proposed framework performs sequential data analysis on a mini gateway used as a base station to detect abnormal changes and to cope with unreliable measurements in collected data without prior knowledge of anomalous events or normal data patterns. The proposed approach is based on the Mahalanobis distance for spatial analysis, and a kernel density estimator for the identification of abnormal temporal patterns. Our main objective is to distinguish between faulty measurements and clinical emergencies in order to reduce false alarms triggered by faulty measurements or ill-behaved sensors. Our experimental results on both real and synthetic medical datasets show that the proposed approach can achieve good detection accuracy with a low false alarm rate (less than 5.5%).

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.125-132
• /
• 1993

When a mobile robot moves around autonomously without man-made landmarks, it is essential to recognize the placement of surrounding objects especially for current position estimation, obstacle avoidance, or homing into the work station. In this paper, we propose a novel approach to recognize the floor paln for indoor mobile robot navigation using ultrasonic time-of-flight method. We model the floor plan as a collection of polygonal plane objects and recognize the floor plan by locating edges and vertices of the objects. The direction is estimated by the patterns of transmission beam and reception sensitivity of the ultrasonic transducer, and the distance is estimated by the correlation detection method. We show the validity of the proposed approach through experimental results and discuss the resolution and the accuracy of the estimation of direction and distance.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1140-1143
• /
• 1996

A new approach based on artificial potential function is proposed for the obstacle avoidance of redundant manipulators. Unlike the so-called "global" path planning method, which requires expensive computation for the path search before the manipulator starts to move, this new approach, "local" path planning, researches the path in real-time using the local distance information. Previous use of artificial potential function has exhibited local minima in some complex environments. This thesis proposes a potential function that has no local minima even for a cluttered environment. This potential function has been implemented for the collision avoidance of a redundant robot in Simulation. The simulation also employ an algorithm that eliminates collisions with obstacles by calculating the repulsive potential exerted on links, based on the shortest distance to object.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5A
• /
• pp.331-340
• /
• 2009

In this paper, we propose a new power loading algorithm for orthogonalized spatial multiplexing(OSM) systems over flat-fading multiple-input multiple-output (MIMO) channels. Compared to SVD-based transmission scheme, the OSM scheme exhibits a good system performance with lower complexity and feedback overhead. To further improve the performance in OSM systems with power loading, we introduce a geometric approach on the Euclidean distance between the constellation points in the effective channel. Using this approach, we show that the optimal power loading parameters in terms of the minimum distance can be obtained. Simulation results demonstrate that our algorithm provides a 5dB gain at a bit error rate (BER) of $10^{-4}$ over that of no power loading case with both QPSK and 16-QAM. Consequently, our power loading algorithm allows us to significantly improve the system performance with one additional feedback value.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.04a
• /
• pp.291-300
• /
• 1994

In this paper we consider the frequency assignment problem (FAP) in a cellular mobile communication system which has a maximal distance of channel interference. This special structure is observed in most cellular systems. To handle the considered FAP, we use the pattern approach which fits naturally to the problem. Based on this approach, we are able to formulate the considered FAP into a manageable optimization problem and propose a two phase heuristic algorithm for the problem. Computational experiments show that our algorithm performs much better in both solution quality and computational time than the recently developed algorithms for FAP. Since the considered FAP well reflects most cellular systems, our algorithm can be applied to many practical situations.

• Proceedings of the KSPS conference
• /
• 2006.05a
• /
• pp.41-44
• /
• 2006

The purpose of state tying is to reduce the number of models and to use relatively reliable output probability distributions. There are two approaches: one is top down clustering and the other is bottom up clustering. For seen data, the performance of bottom up approach is better than that of top down approach. In this paper, we propose a new clustering technique that can enhance the undertrained triphone clustering performance. The basic idea is to tie unreliable triphones before clustering. An unreliable triphone is the one that appears in the training data too infrequently to train the model accurately. We propose to use monophone distance to preprocess these unreliable triphones. It has been shown in a pilot experiment that the proposed method reduces the error rate significantly.