• Korean Journal of Remote Sensing
• /
• v.28 no.1
• /
• pp.55-67
• /
• 2012

Real-time image georeferencing is required to generate spatial information rapidly from the image sequences acquired by multi-sensor systems. To complement the performance of position/attitude sensors and process in real-time, we should employ on-line aerial triangulation based on a sequential estimation algorithm. In this study, we thus attempt to derive an efficient on-line aerial triangulation algorithm for real-time georeferencing of image sequences. We implemented on-line aerial triangulation using the existing Given transformation update algorithm, and a new inverse normal matrix update algorithm based on observation classification, respectively. To compare the performance of two algorithms in terms of the accuracy and processing time, we applied these algorithms to simulated airborne multi-sensory data. The experimental results indicate that the inverse normal matrix update algorithm shows 40 % higher accuracy in the estimated ground point coordinates and eight times faster processing speed comparing to the Given transformation update algorithm. Therefore, the inverse normal matrix update algorithm is more appropriate for the real-time image georeferencing.

• The Journal of the Acoustical Society of Korea
• /
• v.23 no.6
• /
• pp.473-480
• /
• 2004

In this paper we propose an effective feature compensation scheme based on the speech model in order to achieve robust speech recognition. The proposed feature compensation method is based on parallel combined mixture model (PCMM). The previous PCMM works require a highly sophisticated procedure for estimation of the combined mixture model in order to reflect the time-varying noisy conditions at every utterance. The proposed schemes can cope with the time-varying background noise by employing the interpolation method of the multiple mixture models. We apply the‘data-driven’method to PCMM tot move reliable model combination and introduce a frame-synched version for estimation of environments posteriori. In order to reduce the computational complexity due to multiple models, we propose a technique for mixture sharing. The statistically similar Gaussian components are selected and the smoothed versions are generated for sharing. The performance is examined over Aurora 2.0 and speech corpus recorded while car-driving. The experimental results indicate that the proposed schemes are effective in realizing robust speech recognition and reducing the computational complexities under both simulated environments and real-life conditions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5B
• /
• pp.542-551
• /
• 2009

We proposed the context based user profile which is aware of its user's situation and based on user's situation it recommends personalized services. The user profile which consists of (context, service) pair can be acquired by the context and the service usage of a user; it then can be used to recommend personalized services for the user. In this paper, we show how they can be evolved without previously known user information so that not to violate privacy during the learning phase; in the result our user profile can be applied to any new environment without any modification to model only except context profiles. Using context-awareness based user profile, the service usage pattern of a user can be learned by the union of contexts and the preferred services can be recommended by the current environments. Finally, we evaluate the precision of proposed approach using simulation with data sets of UCI depository and Weka tool-kit.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.1
• /
• pp.38-43
• /
• 2011

Cluster-based routing is high energy consumption of cluster head nodes. A recent approach to resolving the problem is the dynamic cluster technique that periodically re-selects cluster head nodes to distribute energy consumption of the sensor nodes. However, the dynamic clustering technique has a problem that repetitive construction of clustering consumes the more energies. This paper proposes a solution to the problems described above from the energy efficiency perspective. The round-robin cluster header(RRCH) technique, which fixes the initially structured cluster and sequentially selects cluster head nodes, is suggested for solving the energy consumption problem regarding repetitive cluster construction. A simulation result were compared with the performances of two of the most widely used conventional techniques, the LEACH(Low Energy Adaptive Clustering Hierarchy) and HEED(Hybrid, Energy Efficient, Distributed Clustering) algorithms, based on energy consumption, remaining energy for each node and uniform distribution. The evaluation confirmed that in terms of energy consumption, the technique proposed in this paper was 26.5% and 20% more efficient than LEACH and HEED, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5C
• /
• pp.479-486
• /
• 2010

In this paper, we propose a novel low-complexity Alamouti coded orthogonal frequency division multiplexing (OFDM) scheme for asynchronous cooperative communications. Exploiting the combination of OFDM symbols at the source node and simple operations including sign change and complex product at the relay node, the proposed scheme can achieve cooperative diversity gain without use of time-reversion and shifting operations that the conventional scheme proposed by Li and Xia needs. In addition, by using the cyclic prefix (CP) removal and insertion operations at the relay node, the proposed scheme does not suffer from a considerable degradation of bit-error-rate (BER) performance even though perfect timing synchronization is not achieved at the relay node. From the simulation results, it is demonstrated that the BER performance of the proposed scheme is much superior to that of the conventional scheme in the presence of timing synchronization error at the relay node. It is also shown that the proposed scheme obtains two times higher diversity gain compared with the conventional scheme at the cost of half reduction in transmission efficiency.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.44 no.10
• /
• pp.921-932
• /
• 2016

In this paper, a modified FSA(Frequency Scaling Algorithm) is proposed for KOMPSAT-5 high-resolution SAR image generation. In order to enhance performance of azimuth compression, degraded in sub-aperture processing due to the imperfect geometric parameter of data acquisition, the full-aperture signal processing algorithm is designed based on the exact time-frequency analysis. In addition, an azimuth scaling function is newly devised to make the full-aperture processing algorithm suitable for KOMPSAT-5 sliding-spotlight mode. Different from the previous sub-aperture FSA schemes, the suggested technique could accommodate the merit of unified signal processing structure regardless of operational modes of KOMPSAT-5. Through the point target simulation, it is verified that the suggested algorithm provides superior performance of azimuth compression over the existing full-aperture processing methods. The experimental results using real data acquired by KOMPSAT-5 are also given to demonstrate the effectiveness of our scheme as well.

• The Korean Journal of Applied Statistics
• /
• v.24 no.5
• /
• pp.861-869
• /
• 2011

One of the main objects of recent genetic studies is to understand genetic factors that induce complex diseases. If there are interactions between loci, it is difficult to find such associations through a single-locus analysis strategy. Thus we need to consider the gene-gene interactions and/or gene-environment interactions. The MDR(multifactor dimensionality reduction) method is being used frequently; however, it is not appropriate to detect interactions caused by a small fraction of the possible genotype pairs. In this study, we propose a relative risk interaction explorer that detects interactions through the calculation of the relative risks between the control and disease groups from each genetic combinations. For illustration, we apply this method to MDR open source data. We also compare the MDR and the proposed method using the simulated data eight genetic models.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.8
• /
• pp.651-659
• /
• 2014

In this paper, we consider a two way relay network for ship-to-ship communications in a fleet, where two communicating ships exchange the information with the help of a multi-antenna relay ship. For the network, we propose a rate-aware three-phase analog network coding to improve the reliability of the information exchange with asymmetric rates. The proposed scheme allows low-complex implementation of the relay without channel estimation by generating an improved analog network coded signal with the orthogonally received signals from two ships by using only the received signal power at each antenna. In addition, the proposed scheme reduces outages in the data exchange at asymmetric rates by adopting a rate-aware relay power allocation, which is confirmed by evaluating the outage performance via simulation.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.3
• /
• pp.397-405
• /
• 2010

Data mining is the method to find useful information for large amounts of data in database, and one of the important goals is to search and decide the association for several variables. The task of association rule mining is to find certain association relationships among a set of data items in a database. There are three primary measures for association rule, support and confidence and lift. In this paper we developed a association rule ranking function by decreased lift influence to generate association rule for items satisfying at least one of three criteria. We compared our function with the functions suggested by Park (2010), and Wu et al. (2004) using some numerical examples. As the result, we knew that our decision function was better than the function of Park's and Wu's functions because our function had a value between -1 and 1regardless of the range for three association thresholds. Our function had the value of 1 if all of three association measures were greater than their thresholds and had the value of -1 if all of three measures were smaller than the thresholds.

• The Journal of the Acoustical Society of Korea
• /
• v.35 no.5
• /
• pp.368-374
• /
• 2016

This paper presents constructing transmitter and receiver by using a direct sequence spread spectrum techniques to DPSK (Differential Phase-Shift Keying) scheme in underwater acoustic communication. Since DPSK signal can be demodulated if the receiver knows only the phase difference between the adjacent bits, DPSK receiver structure has the advantage of being simplified. In the conventional receiver, two adjacent symbols of transmitted signal before despread are passed to the transition correlator that detects data by comparing maximum correlation outputs. At this time, the error for maximum value of the correlator output may increase because of low SNR (Signal to Noise Ratio) or high Doppler shift frequency according to the underwater channel. In this paper, we propose a method for accurate detection result using the width as well as the magnitude among outputs produced by the correlator. The performances of the proposed method was evaluated by simulation and lake trial data.