• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.885-888
• /
• 2000

Among the previous searching methods, there are the typical methods such as full search and three-step search, etc. Block motion estimation using exhaustive search is too computationally intensive. To apply in practice, recently proposed fast algorithms have been focused on reducing the computational complexity by limiting the number of searching points. According to the reduction of searching points, the quality performance is aggravated in those algorithms. In this paper, We present a fast and efficient search algorithm for block motion estimation that produces better quality performance and less computational time compared with a three-step search (TSS). Previously the proposed Two Step Search Algorithm (TWSS) by Fang-Hsuan Cheng and San-Nan sun is based on the ideas of dithering pattern for pixel decimation using a part of a block pixels for BMA (Block Matching Algorithm) and multi-candidate to compensate quality performance with several locations. This method has good quality performance at slow moving images, but has bad quality performance at fast moving images. To resolve this problem, the proposed algorithm in this paper considers spatial and temporal correlation using neighbor and previous blocks to improve quality performance. This performance uses neighbor motion vectors and previous motion vectors in addition, thus it needs more searching points. To compensate this weakness, the proposed algorithm uses statistical character of dithering matrix. The proposed algorithm is superior to TWSS in quality performance and has similar computational complexity

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

Orthogonal frequency division multiplexing (OFDM) signals suffer from the problem of large peak-to-average power ratio (PAPR) which complicates the design of the analog front-end of the system. Companding is a well-known PAPR reduction technique that reduces the PAPR by transforming the signal amplitude using a deterministic function. In this paper, a novel piecewise linear companding transform is proposed. The design criteria for the proposed transform is developed by investigating the relationships between the compander and decompander's profile and parameters with the system's performance metrics. Using analysis and simulations, we relate the companding parameters with the bit error rate (BER), out-of-band interference (OBI), amount of companding noise, computational complexity and average power. Based on a set of criteria developed thereof, we formulate the design of the proposed transform. The main aim is to preserve the signal's attributes as much as possible for a predetermined amount of PAPR reduction. Simulations are carried out to evaluate and compare the proposed scheme with the existing companding transforms to demonstrate the enhancement in PAPR, BER and OBI performances.

• Journal of Advanced Marine Engineering and Technology
• /
• v.40 no.8
• /
• pp.726-732
• /
• 2016

Clustering analysis is widely used in data mining to classify data into categories on the basis of their similarity. Through the decades, many clustering techniques have been developed, including hierarchical and non-hierarchical algorithms. In gene profiling problems, because of the large number of genes and the complexity of biological networks, dimensionality reduction techniques are critical exploratory tools for clustering analysis of gene expression data. Recently, clustering analysis of applying dimensionality reduction techniques was also proposed. PCA (principal component analysis) is a popular methd of dimensionality reduction techniques for clustering problems. However, previous studies analyzed the performance of PCA for only full data sets. In this paper, to specifically and robustly evaluate the performance of PCA for clustering analysis, we exploit an improved FCBF (fast correlation-based filter) of feature selection methods for supervised clustering data sets, and employ two well-known clustering algorithms: k-means and k-medoids. Computational results from supervised data sets show that the performance of PCA is very poor for large-scale features.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11A
• /
• pp.1244-1252
• /
• 2004

In this paper, we derive some properties of linear detectors (zero forcing or minimum mean square error) at spatial multiplexing systems with alamouti's space-time block code. Based on the derived properies, this paper proposes low-complexity receivers. Implementing MMSE detector adaptively, the number of weight vectors to be calculated and updated is greatly reduced with the derived properties compared to the conventional methods. In the case of recursive least square algorithm, with the proposed approach computational complexity is reduced to less than the half. We also identify that sorted QR decomposition detector, which reduces the complexity of V-Blast detector, has the same properties for unitary matrix Q and upper triangular matrix R. A complexity reduction of about 50%, for sorted QR decomposition detector, can be achieved by using those properties without the loss of performance.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.7 no.8
• /
• pp.150-159
• /
• 1999

Exhaust system is composed of several parts. Among, them , design of muffler system strongly influences on engine efficiency and noise reduction. So , through comprehension of flow characteristics inside muffler is necessary . In this study , three-dimensional steady and unsteady compressible flow analysis was performed to understand the flow characteristics, pressure loss and amplitude variation of pulsating pressure. The computational grid generation was carried out using commercial preprocessor ICEM CFD/CAE. And the three-dimensional fluid motion inside the muffler was analyzed by STAR-CD, the computational fluid dynamics code. RNG k-$\varepsilon$ tubulence model was applied to consider the complexity of the geometry and fluid motion. The steady and unsteady flow field inside muffler such as velocity distribution, pulsating pressure and pressure loss was examined. In case of unsteady state analysis, velocity of inlet region was converted from measured pulsating pressure. Experimental measurement of pressure and temperature was carried out to provide the boundary and initial condition for computational study under three engine operating conditions. As a result of this study, we could identify the flow characteristics inside the muffler and obtain the pressure loss, amplitude variation of pulsating exhaust gas.

• International Journal of Control, Automation, and Systems
• /
• v.5 no.3
• /
• pp.295-306
• /
• 2007

It is well known that mathematical solutions for multi-agent planning problems are very difficult to obtain due to the complexity of mutual interactions among multi-agents. Most of the past research results are thus based on the probabilistic completeness. However, the practicality and effectiveness of the solution from the probabilistic completeness is significantly reduced by heavy computational burden. In this paper, we propose a practically applicable solution technique for multi-agent planning problems, which assures a reasonable computation time and a real world application for more than 3 multi-agents, for the case of general shaped paths in agent movement. First, to reduce the computation time, an extended collision map is developed and utilized for detecting potential collisions and obtaining collision-free solutions for multi-agents. Second, a priority for multi-agents is considered for successive and interactive modifications of the agent movements with lower priority. Various solutions using speed reduction and time delay of the relevant agents are investigated and compared in terms of the computation time. A practical implementation is finally provided for three different types of agents to emphasize the effectiveness of the proposed interactive approach to multi-agent planning problems.

• The Journal of the Acoustical Society of Korea
• /
• v.30 no.3
• /
• pp.129-135
• /
• 2011

An algorithm is presented for estimating the 3-D location (i.e., azimuth angle, elevation angle, and range) of multiple sources with a uniform circular array (UCA) consisting of an even number of sensors. Recently the rank reduction (RARE) algorithm for partly-calibrated sensor arrays was developed. This algorithm is applicable to sensor arrays consisting of several identically oriented and calibrated linear subarrays. Assuming that a UCA consists of M sensors, it can be divided into M/2 identical linear subarrays composed of two facing sensors. Based on the structure of the subarrays, the steering vectors are decomposed into two parts: range-independent 2-D direction-of-arrival (DOA) parameters, and range-relevant 3-D location parameters. Using this property we can estimate range-independent 2-D DOAs by using the RARE algorithm. Once the 2-D DOAs are available, range estimation can be obtained for each source by defining the 1-D MUSIC spectrum. Despite its low computational complexity, the proposed algorithm can provide an estimation performance almost comparable to that of the 3-D MUSIC benchmark estimator.

• The Journal of the Acoustical Society of Korea
• /
• v.36 no.2
• /
• pp.144-150
• /
• 2017

Musical genre is indispensible in constructing music information retrieval system, such as music search and classification. In general, the spectral characteristics of a music signal are obtained based on a subband decomposition to represent the relative distribution of the harmonic and the non-harmonic components. In this paper, we investigate the subband decomposition parameters in extracting features, which improves musical genre classification accuracy. In addition, the linear projection methods are studied to reduce the resulting feature dimension. Experiments on the widely used music datasets confirmed that the subband decomposition finer than the widely-adopted octave scale is conducive in improving genre-classification accuracy and showed that the feature-dimension reduction is effective reducing a classifier's computational complexity.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.20 no.3
• /
• pp.201-208
• /
• 2015

The effects of dead-time and offset error, which cause output current distortion in single-phase grid-connected inverters are investigated this paper. Offset error is typically generated by measuring phase current, including the voltage unbalance of analog devices and non-ideal characteristics in current measurement paths. Dead-time inevitably occurs during generation of the gate signal for controlling power semiconductor switches. Hence, the performance of the grid-connected inverter is significantly degraded because of the current ripples. The current and voltage, including ripple components on the synchronous reference frame and stationary reference frame, are analyzed in detail. An algorithm, which has the proportional resonant controller, is also proposed to reduce current ripple components in the synchronous PI current regulator. As a result, computational complexity of the proposed algorithm is greatly simplified, and the magnitude of the current ripples is significantly decreased. The simulation and experimental results are presented to verify the usefulness of the proposed current ripple reduction algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.7
• /
• pp.2464-2479
• /
• 2014

Multi-view video coding is an international encoding standard that attains good performance by fully utilizing temporal and inter-view correlations. However, it suffers from high computational complexity. This paper presents a fast encoder design to reduce the level of complexity. First, when the temporal correlation of a group of pictures is sufficiently strong, macroblock-based inter-view prediction is not employed for the non-anchor pictures of B-views. Second, when the disparity between two adjacent views is above some threshold, frame-based inter-view prediction is disabled. Third, inter-view prediction is not performed on boundary macroblocks in the auxiliary views, because the references for these blocks may not exist in neighboring views. Fourth, finer partitions of inter-view prediction are cancelled for macroblocks in static image areas. Finally, when estimating the disparity of a macroblock, the search range is adjusted according to the mode size distribution of the neighboring view. Compared with reference software, these techniques produce an average time reduction of 83.65%, while the bit-rate increase and peak signal-to-noise ratio loss are less than 0.54% and 0.05dB, respectively.