• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.8
• /
• pp.868-876
• /
• 2016

MUSIC (multiple signal classification) algorithm is a representative algorithm estimating the angle of arrival using the eigenvalues and eigenvectors. Generally, the eigenvalues and eigenvectors are obtained through the eigen-analysis, but this analysis requires high computational complexity and late convergence time. For this reason, it is almost impossible to construct the real-time system with low-cost using this approach. Even though QR iteration is considered as the eigen-analysis approach to improve these problems, this is inappropriate to apply to the MUSIC algorithm. In this paper, we analyze the problems of conventional method based on the eigenvalues for convergence decision and propose the improved decision algorithm using the eigenvectors.

• Journal of the Korea Computer Graphics Society
• /
• v.17 no.2
• /
• pp.17-26
• /
• 2011

This paper presents an interactive progressive image transmission method, which enables a remote user to interactively select and transmit preferred regions from an index image. Our enhanced quadtree decomposition using PSNR-based rules and new implicit quadtree coding provide better rate-distortion performance than previous quadtree coders as well as leading bit plane methods. An adaptive traversal of child nodes is introduced for better visual display of restored images. Depth-first traversal combined with breadth-first traversal of the quadtree to accomplish interactive transmission as presented, results in a method that provides competitive performance at a low level of computational complexity. Moreover, our decoding requires only simple arithmetic which is enabling our method to be used for real-time mobile applications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1378-1383
• /
• 1999

In this paper, an effective variable-block-based image compression technique using wavelet transform is proposed. Since the statistical property of each wavelet subband is different, we apply the adaptive quantization to each wavelet subband. In the proposed algorithm, each subband is divided into non-overlapping variable-sized blocks based on directional properties. In addition, we remove wavelet coefficients which are below a certain threshold value for coding efficiency. To compress the transformed data, the proposed algorithm quantizes the wavelet coefficients using scalar quantizer in LL subband and vector quantizers for other subbands to increase compression ratio. The proposed algorithm shows improvements in compression ratio as well as PSNR compared with the existing block-based compression algorithms. In addition, it does not cause any blocking artifacts in very low bit rates even though it is also a block-based method. The proposed algorithm also has advantage in computational complexity over the existing wavelet-based compression algorithms since it is a block-based algorithm.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.8
• /
• pp.1179-1186
• /
• 2013

In this paper, an efficient vehicle detection and tracking algorithm for detection incident in tunnel is proposed. The proposed algorithm consists of three steps. The first one is a step for background estimates, low computational complexity and memory consumption Running Gaussian Average (RGA) is used. The second step is vehicle detection step, Adaboost algorithm is applied to this step. In order to reduce false detection from a relatively remote location of the vehicles, local features according to height of vehicles are used to detect vehicles. If the local features of an object are more than the threshold value, the object is classified as a vehicle. The last step is a vehicle tracking step, the Kalman filter is applied to track moving objects. Through computer simulations, the proposed algorithm was found that useful to detect and track vehicles in the tunnel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.12
• /
• pp.1125-1134
• /
• 2013

Small cells such as pico or femto cells are promising as a solution to cope with higher traffic explosion and the large number of users. However, the users within small cells are likely to suffer severe inter-cell interference (ICI) from neighboring base stations (BSs). To tackle this, several papers suggest BS transmit power on/off control algorithms which increase edge user throughput. However, these algorithms require centralized coordinator and have high computational complexity. This paper makes a contribution towards presenting fully distributed and low complex joint BS on/off control and user scheduling algorithm (FDA) by selecting on/off pattern of BSs. Throughput the extensive simulations, we verify the performance of our algorithm as follows: (i) Our FDA provides better throughput performance of cell edge users by 170% than the algorithm without the ICI management. (ii) Our FDA catches up with the performance of optimal algorithm by 88-96% in geometric average throughput and sufficiently small gap in edge user throughput.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.1
• /
• pp.321-340
• /
• 2016

The Compressive Video Sensing (CVS) is a useful technology for wireless systems requiring simple encoders but handling more complex decoders, and its rate-distortion performance is highly affected by the quantization of measurements and reconstruction of video frame, which motivates us to presents the Space-Time Quantization (ST-Q) and Motion-Aligned Reconstruction (MA-R) in this paper to both improve the performance of CVS system. The ST-Q removes the space-time redundancy in the measurement vector to reduce the amount of bits required to encode the video frame, and it also guarantees a low quantization error due to the fact that the high frequency of small values close to zero in the predictive residuals limits the intensity of quantizing noise. The MA-R constructs the Multi-Hypothesis (MH) matrix by selecting the temporal neighbors along the motion trajectory of current to-be-reconstructed block to improve the accuracy of prediction, and besides it reduces the computational complexity of motion estimation by the extraction of static area and 3-D Recursive Search (3DRS). Extensive experiments validate that the significant improvements is achieved by ST-Q in the rate-distortion as compared with the existing quantization methods, and the MA-R improves both the objective and the subjective quality of the reconstructed video frame. Combined with ST-Q and MA-R, the CVS system obtains a significant rate-distortion performance gain when compared with the existing CS-based video codecs.

• Journal of Korea Multimedia Society
• /
• v.10 no.11
• /
• pp.1530-1537
• /
• 2007

In this paper, we implemented a speech emotion recognition system that can distinguish human emotional states from recorded speech captured by a single microphone and classify them into four categories: neutrality, happiness, sadness and anger. In general, a speech recorded with a microphone contains background noises due to the speaker environment and the microphone characteristic, which can result in serious system performance degradation. In order to minimize the effect of these noises and to improve the system performance, a MA(Moving Average) filter with a relatively simple structure and low computational complexity was adopted. Then a SFS(Sequential Forward Selection) feature optimization method was implemented to further improve and stabilize the system performance. For speech emotion classification, a SVM pattern classifier is used. The experimental results indicate the emotional classification performance around 65% in the computer simulation and 62% on the ARM platform.

• Journal of KIISE:Databases
• /
• v.33 no.5
• /
• pp.538-550
• /
• 2006

XML Keyword search enables us to get information easily without knowledge of structure of documents and returns specific and useful partial document results instead of whole documents. Element level query processing makes it possible, but computational complexity, as the number of documents grows, increases significantly overhead costs. In this paper, we present document-level ranking scheme over XML documents which predicts results of element-level processing to reduce processing cost. To do this, we propose the notion of 'keyword proximity' - the correlation of keywords in a document that affects the results of element-level query processing using path information of occurrence nodes and their resemblances - for document ranking process. In benefit of document-centric view, it is possible to reduce processing time using ranked document list or filtering of low scored documents. Our experimental evaluation shows that document-level processing technique using ranked document list is effective and improves performance by the early termination for top-k query.

• Journal of Navigation and Port Research
• /
• v.36 no.10
• /
• pp.833-838
• /
• 2012

TDOA which is one of the position estimation methods is used on indoor positioning, jammer localization, rescue of life, etc. due to high accuracy and simple structure. This paper proposes the super-resolution TDOA estimator using MPM(Matrix Pencil Method). The proposed estimator has more accuracy and is applicable to narrowband signal compared with the conventional cross-correlation. Furthermore, its complexity is low because obtained data directly is used for construction of matrix unlike the MUSIC(Multiple Signal Classification) which is one of the well-known super-resolution estimator using covariance matrix. To validate the performance of proposed estimator, errors of estimation and computational burden is compared to MUSIC through software simulation.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.4
• /
• pp.427-431
• /
• 2010

Multidimensional scaling (MDS) is a widely used method for dimensionality reduction, of which purpose is to represent high-dimensional data in a low-dimensional space while preserving distances among objects as much as possible. MDS has mainly been applied to data visualization and feature selection. Among various MDS methods, the classical MDS is not readily applicable to data which has large numbers of objects, on normal desktop computers due to its computational complexity. More precisely, it needs to solve eigenpair problems on dissimilarity matrices based on Euclidean distance. Thus, running time and required memory of the classical MDS highly increase as n (the number of objects) grows up, restricting its use in large-scale domains. In this paper, we propose an efficient approximation algorithm for the classical MDS based on divide-and-conquer and CUDA. Through a set of experiments, we show that our approach is highly efficient and effective for analysis and visualization of data consisting of several thousands of objects.