• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4A
• /
• pp.288-295
• /
• 2005

OFDM communications system is very attractive for the high data rate wireless transmission. However, it may be distorted in the nonlinear HPA since OFDM signal has high PAPR. So, a new SLM method using dummy sequence is studied for reducing the PAPR, and we call it DSI-SLM method. Unlike the conventional SLM method using the phase rotation, dummy sequences for PAPR reduction are assigned at the predefined sub-carriers. After IFFT, the OFDM data signal of the lowest PAPR is selected to transmit. So, it can cut down the computational complexity because it does not require the transmission and demodulation process of side information about the phase rotation. This proposed method can solve the time delay problem so that PAPR reduction can be made in real time processing.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.9
• /
• pp.64-75
• /
• 1993

This paper proposes a recovering technique of the elevation map by stereo modeling of the aerial image sequence which is transformed based on the aircraft situation. The area-based stereo matching method is simulated and the various parameters are experimentally chosen. In a depth extraction step, the depth is determined by solving the vector equation. The equation is suitable for stereo modeling of aerial images which do not satisfy the epipolar constraint. Also, the performance of the conventional feature-based matching scheme is compared. Finally, techniques analyzing the accuracy of the recovered elevation map (REM) are described. The analysis includes the error estimation for both height and contour lines, where the accuracy is based on the measurements of deviations from the estimates obtained manually. The experimental results show the efficiency of the proposed technique.

• The Journal of Korea Robotics Society
• /
• v.19 no.2
• /
• pp.196-202
• /
• 2024

The ability to understand given environments and plan a sequence of actions leading to goal state is crucial for personal service robots. With recent advancements in deep learning, numerous studies have proposed methods for state representation in planning. However, previous works lack explicit information about relationships between objects when the state observation is converted to a single visual embedding containing all state information. In this paper, we introduce graph-based state representation that incorporates both object and relationship features. To leverage these advantages in addressing the task planning problem, we propose a Graph Neural Network (GNN)-based subgoal prediction model. This model can extract rich information about object and their interconnected relationships from given state graph. Moreover, a search-based algorithm is integrated with pre-trained subgoal prediction model and state transition module to explore diverse states and find proper sequence of subgoals. The proposed method is trained with synthetic task dataset collected in simulation environment, demonstrating a higher success rate with fewer additional searches compared to baseline methods.

• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.577-590
• /
• 2003

The shape-based retrieval is defined as the operation that searches for the (sub) sequences whose shapes are similar to that of a query sequence regardless of their actual element values. In this paper, we propose a similarity model suitable for shape-based retrieval and present an indexing method for supporting the similarity model. The proposed similarity model enables to retrieve similar shapes accurately by providing the combination of various shape-preserving transformations such as normalization, moving average, and time warping. Our indexing method stores every distinct subsequence concisely into the disk-based suffix tree for efficient and adaptive query processing. We allow the user to dynamically choose a similarity model suitable for a given application. More specifically, we allow the user to determine the parameter p of the distance function $L_p$ when submitting a query. The result of extensive experiments revealed that our approach not only successfully finds the subsequences whose shapes are similar to a query shape but also significantly outperforms the sequence search.

• The Journal of the Acoustical Society of Korea
• /
• v.31 no.1
• /
• pp.39-50
• /
• 2012

A voice transformation (VT) method that can make the utterance of a source speaker mimic that of a target speaker is described. Speaker individuality transformation is achieved by altering three feature parameters, which include the LPC cepstrum, pitch period and gain. The main objective of this study involves construction of an optimal sequence of features selected from a target speaker's database, to maximize both the correlation probabilities between the transformed and the source features and the likelihood of the transformed features with respect to the target model. A set of two-pass conversion rules is proposed, where the feature parameters are first selected from a database then the optimal sequence of the feature parameters is then constructed in the second pass. The conversion rules were developed using a statistical approach that employed a maximum likelihood criterion. In constructing an optimal sequence of the features, a hidden Markov model (HMM) was employed to find the most likely combination of the features with respect to the target speaker's model. The effectiveness of the proposed transformation method was evaluated using objective tests and informal listening tests. We confirmed that the proposed method leads to perceptually more preferred results, compared with the conventional methods.

• Journal of IKEEE
• /
• v.22 no.3
• /
• pp.658-663
• /
• 2018

In this paper, we consider node deployment algorithms for the sequence-based localization (SBL) which is recently employed for in-door positioning systems, Whereas previous node selection or deployment algorithms seek to place nodes at centrold of the region where more targets are likely to be found, we observe that the boundaries dividing such regions can be good locations for the nodes in SBL systems. Motivated by this observation, we propose an efficient node deployment algorithm that determines the boundaries by using the well-known K-means algorithm and find the potential node locations based on the bi-section method for low-complexity design. We demonstrate through experiments that the proposed algorithm achieves significant localization performance over random node allocation with a substantially reduced complexity as compared with a full search.

• Journal of Industrial Technology
• /
• v.21 no.A
• /
• pp.167-179
• /
• 2001

This paper discusses an index-based subsequence matching that supports time warping in large sequence databases. Time warping enables finding sequences with similar patterns even when they are of different lengths. In earlier work, we suggested an efficient method for whole matching under time warping. This method constructs a multidimensional index on a set of feature vectors, which are invariant to time warping, from data sequences. For filtering at feature space, it also applies a lower-bound function, which consistently underestimates the time warping distance as well as satisfies the triangular inequality. In this paper, we incorporate the prefix-querying approach based on sliding windows into the earlier approach. For indexing, we extract a feature vector from every subsequence inside a sliding window and construct a multi-dimensional index using a feature vector as indexing attributes. For query precessing, we perform a series of index searches using the feature vectors of qualifying query prefixes. Our approach provides effective and scalable subsequence matching even with a large volume of a database. We also prove that our approach does not incur false dismissal. To verily the superiority of our method, we perform extensive experiments. The results reseal that our method achieves significant speedup with real-world S&P 500 stock data and with very large synthetic data.

• Journal of the Institute of Convergence Signal Processing
• /
• v.15 no.2
• /
• pp.48-54
• /
• 2014

For the element ${\alpha}{\in}GF(p^n)$, two kinds of bases are known. One is a conventional polynomial basis of the form $\{1,{\alpha},{\alpha}^2,{\cdots},{\alpha}^{n-1}\}$, and the other is a normal basis of the form $\{{\alpha},{\alpha}^p,{\alpha}^{p^2},{\cdots},{\alpha}^{p^{n-1}}\}$. In this paper we consider the method of generating normal bases which construct the finite field $GF(p^n)$, as an n-dimensional extension of the finite field GF(p). And we analyze the code sequence generating algorithm and derive the implementation functions of code sequence generator based on the normal bases. We find the normal polynomials of degrees, n=5 and n=7, which can generate normal bases respectively, design, and construct the code sequence generators based on these normal bases. Finally, we produce two code sequence groups(n=5, n=7) by using Simulink, and analyze the characteristics of the autocorrelation function, $R_{i,i}(\tau)$, and crosscorrelation function, $R_{i,j}(\tau)$, $i{\neq}j$ between two different code sequences. Based on these results, we confirm that the analysis of generating algorithms and the design and implementation of the code sequence generators based on normal bases are correct.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.585-588
• /
• 1997

This paper presents a construction method of logic-based switching control system which operates in widely changing environments. The logic-based switching controller is composed of a family of candidate controllers together with a supervisor. The system does not require any identification schemes of environments. Switching from one candidate controller to another is carried out based on monitoring the output of the system. The basic ideas of adaptation are as follows: (1)each candidate controller is prepared for each environment in advance; (2)the supervisor applies a sequence of speculative controls to a plant with candidate controllers just after the control has started and just after the change of the environment has been detected. It is important that each candidate controller can keep the system stable during a sequence of speculative controls, and the most appropriate candidate controller for the environment to which the system is exposed can be selected before the last speculative control is ended. An application to an antiskid braking system clarifies the effectiveness of the proposed method.

• International Journal of Control, Automation, and Systems
• /
• v.3 no.4
• /
• pp.542-551
• /
• 2005

A new distance measurement method with the use of a single camera and a rotating mirror is presented. A camera in front of a rotating mirror acquires a sequence of reflected images, from which distance information is extracted. The distance measurement is based on the idea that the corresponding pixel of an object point at a longer distance moves at a higher speed in a sequence of images in this type of system setting. Distance measurement based on such pixel movement is investigated. Like many other image-based techniques, this presented technique requires matching corresponding points in two images. To alleviate such difficulty, two kinds of techniques of image tracking through the sequence of images and the utilization of multiple sets of image frames are described. Precision improvement is possible and is one attractive merit. The presented approach with a rotating mirror is especially suitable for such multiple measurements. The imprecision caused by the physical limit could be improved through making several measurements and taking an average. In this paper, mathematics necessary for implementing the technique is derived and presented. Also, the error sensitivities of related parameters are analyzed. Experimental results using the real camera-mirror setup are reported.