• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.6
• /
• pp.1441-1446
• /
• 2014

For the escape from a maze, the cooperative method by robot swarm was proposed in this paper. The robots can freely move by collecting essential data and making a decision in the use of sensors; however, a central control system is required to organize all robots for the escape from the maze. The robots explore new mazes and then send the information to the system for analyzing and mapping the escaping route. Three issues were considered as follows for the effective escape by multiple robots from the mazes in this paper. In the first, the mazes began to divide and secondly, dead-ends should be blocked. Finally, after the first arrivals at the destination, a shortcut should be provided for rapid escaping from the maze. The parallel-escape algorithms were applied to the different size of mazes, so that robot swarm can effectively get away the mazes.

• The KIPS Transactions:PartA
• /
• v.11A no.2
• /
• pp.189-194
• /
• 2004

This paper describes method to distribute much high-dimensional facial expression motion data to 2 dimensional space, and method to create facial expression animation by select expressions that want by realtime as animator navigates this space. In this paper composed expression space using about 2400 facial expression frames. The creation of facial space is ended by decision of shortest distance between any two expressions. The expression space as manifold space expresses approximately distance between two points as following. After define expression state vector that express state of each expression using distance matrix which represent distance between any markers, if two expression adjoin, regard this as approximate about shortest distance between two expressions. So, if adjacency distance is decided between adjacency expressions, connect these adjacency distances and yield shortest distance between any two expression states, use Floyd algorithm for this. To materialize expression space that is high-dimensional space, project on 2 dimensions using Sammon's Mapping. Facial animation create by realtime with animators navigating 2 dimensional space using user interface.

• The KIPS Transactions:PartD
• /
• v.9D no.1
• /
• pp.167-172
• /
• 2002

Recently, some of people are keep in research and development of the further more efficient and convenient auction systems using intelligent software agents in electronic commerce. The purpose of this thesis is that a simple auction system has web bulletin boards, is aided by intelligent agent, and generates pertinent auction duration time and starting price for auction goods of auctioneer into a auction system, then the auctioneer gets the highest margin. The seller who want to sell goods, is using internet sends mail that has information for goods to agent of internet auction system. The agent undertake filtering process for already learned information about similar goods. And it calculate duration time and start price from stored bidding history database. In this thesis we propose a mailing agent system pushing information in internet auction that enables to aid decision for auctioneer about the starting time and price which delivers the highest margin.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6C
• /
• pp.560-569
• /
• 2005

This paper proposes an algorithm for transmit antenna selection in a multi-input multi-output(MIMO) spatial multiplexing system with per antenna rate control(PARC) and an ordered successive interference cancellation (OSIC) receiver. The active antenna subset is determined at the receiver and conveyed to the transmitter using feedback information on transmission rate per antenna. We propose a serial decision procedure consisting of a successive process that tests whether antenna selection gain exists when the antenna with the lowest pre-processing signal to interference and noise ratio(SINR) is discarded at each stage. Furthermore, we show that 'reverse detection ordering', whereby the signal with the lowest SINR is decoded at each stage of successive decoding, widens the disparities among fractions of the whole capacity allocated to each individual antenna and thus maximizes a gain of antenna selection. Numerical results show that the proposed reverse detection ordering based serial antenna selection approaches the closed-loop MIMO capacity and that it induces a negligible capacity loss compared with the heuristic selection strategy even with considerably reduced complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.9
• /
• pp.811-819
• /
• 2014

Activity recognition is a key component in identifying the context of a user for providing services based on the application such as medical, entertainment and tactical scenarios. Instead of applying numerous sensor devices, as observed in many previous investigations, we are proposing the use of smartphone with its built-in multimodal sensors as an unobtrusive sensor device for recognition of six physical daily activities. As an improvement to previous works, accelerometer, gyroscope and magnetometer data are fused to recognize activities more reliably. The evaluation indicates that the IBK classifier using window size of 2s with 50% overlapping yields the highest accuracy (i.e., up to 99.33%). To achieve this peak accuracy, simple time-domain and frequency-domain features were extracted from raw sensor data of the smartphone.

• Geophysics and Geophysical Exploration
• /
• v.10 no.2
• /
• pp.124-130
• /
• 2007

Least squares ($l^2$ norm) solutions of seismic inversion tend to be very sensitive to data points with large errors. The $l^1$ norm minimization gives more robust solutions, but usually with higher computational cost. Iteratively reweighted least squares (IRLS) method gives efficient approximate solutions of these $l^1$ norm problems. I propose an efficient implementation of the IRLS method for a hybrid $l^1/l^2$ minimization problem that behaves as $l^2$ norm fit for small residual and $l^1$ norm fit for large residuals. The proposed algorithm shows more robust characteristics to the decision of the threshold value than the l1 norm IRLS inversion does with respect to the threshold value to avoid singularity.

• Journal of Sasang Constitutional Medicine
• /
• v.23 no.2
• /
• pp.194-207
• /
• 2011

1. Objectives: This study is about a development of Sasang constitutional classification algorithm using facial information. 2. Methods: We analysed the datum of middle aged (20~48) women collected by multi-center researchers in 2007. And this study analysed the data of the measurement of the face by 3D-AFRA (3-Dimensional Automatic Face Recognition Apparatus) and the items of impression by SDQ. We used multiple comparison, exploratory discriminant analysis and clinical decision to select optimal 3D facial variables which will be input in discriminant analysis model. And we used univariate F values and stepwise discriminant function analysis to choose best impression variables. 3. Results and Conclusions: In this study, derived discriminant function's explanation power was 39% in female group. Diagnostic accuracy rate was 66.0% in female group. And in test sample, Sasang constitutional diagnostic accuracy rate was 56.9%. In this process we could help improve the objectification of Sasang constitution diagnosis.

• Spatial Information Research
• /
• v.19 no.6
• /
• pp.111-121
• /
• 2011

In this paper, we proposes a sensor node positioning algorithm that utilizes the geo-spatial elements and considers the factors to represent the propagation loss generated by the various obstacles in the urban wireless environments. First, we measures the propagation loss about the radio frequencies in major road of the urban, and defines the correlation between the measured loss and the environment information for the road and its surrounding get from Urban GIS. Secondly, through the utilization of the loss-environment correlation, we describes the detailed instruction for requiring the radio coverage decision and deploy system implementation for the wireless sensor node in urban. By the consideration of interference factor by the building and the linear structure of road, we can evaluate the path loss below 5dB RMS error. And, we proposes the way to revise the sensor node deployment based on the corelation and the measured path loss.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.39 no.1
• /
• pp.35-47
• /
• 2002

This paper proposes a self organizing RBF neural network equalizer for the equalization of digital communications. It is the most important for the equalizer using the RBF neural network to estimate the RBF centers correctly and quickly, which are the desired channel states. However, the previous RBF equalizers are not used in the actual communication system because of some drawbacks that the number of channel states has to be known in advance and many centers are necessary. Self organizing neural network equalizer proposed in this paper can implement the equalization without prior information regarding the number of channel states because it selects RBF centers among the signals that are transmitted to the equalizer by the new addition and removal criteria. Furthermore, the proposed equalizer has a merit that is able to make a equalization with fewer centers than those of prior one by the course of the training using LMS and clustering algorithm. In the linear, nonlinear and standard telephone channel, the proposed equalizer is compared with the optimal Bayesian equalizer for the BER performance, the symbol decision boundary and the number of centers. As a result of the comparison, we can confirm that the proposed equalizer has almost similar performance with the Bavesian enualizer.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.5
• /
• pp.388-402
• /
• 2003

In this paper, we carried out the word, 4 continuous digits. continuous, and task-independent word recognition experiments to verify the effectiveness of the re-defined phoneme-likely units (PLUs) for the phonetic decision tree based HM-Net (Hidden Markov Network) context-dependent (CD) acoustic modeling in Korean appropriately. In case of the 48 PLUs, the phonemes /ㅂ/, /ㄷ/, /ㄱ/ are separated by initial sound, medial vowel, final consonant, and the consonants /ㄹ/, /ㅈ/, /ㅎ/ are also separated by initial sound, final consonant according to the position of syllable, word, and sentence, respectively. In this paper. therefore, we re-define the 39 PLUs by unifying the one phoneme in the separated initial sound, medial vowel, and final consonant of the 48 PLUs to construct the CD acoustic models effectively. Through the experimental results using the re-defined 39 PLUs, in word recognition experiments with the context-independent (CI) acoustic models, the 48 PLUs has an average of 7.06%, higher recognition accuracy than the 39 PLUs used. But in the speaker-independent word recognition experiments with the CD acoustic models, the 39 PLUs has an average of 0.61% better recognition accuracy than the 48 PLUs used. In the 4 continuous digits recognition experiments with the liaison phenomena. the 39 PLUs has also an average of 6.55% higher recognition accuracy. And then, in continuous speech recognition experiments, the 39 PLUs has an average of 15.08% better recognition accuracy than the 48 PLUs used too. Finally, though the 48, 39 PLUs have the lower recognition accuracy, the 39 PLUs has an average of 1.17% higher recognition characteristic than the 48 PLUs used in the task-independent word recognition experiments according to the unknown contextual factor. Through the above experiments, we verified the effectiveness of the re-defined 39 PLUs compared to the 48PLUs to construct the CD acoustic models in this paper.