• Communications for Statistical Applications and Methods
• /
• v.14 no.1
• /
• pp.255-266
• /
• 2007

A Bayesian estimation of the four-parameter gamma distribution is considered under the noninformative prior. The Bayesian estimators are obtained by the Gibbs sampling. The generation of the shape/power parameter and the power parameter in the Gibbs sampler is implemented using the adaptive rejection sampling algorithm of Gilks and Wild (1992). Also, the location parameter is generated using the adaptive rejection Metropolis sampling algorithm of Gilks, Best and Tan (1995). Finally, the simulation result is presented.

• The Journal of the Acoustical Society of Korea
• /
• v.21 no.4E
• /
• pp.178-182
• /
• 2002

In this paper, we propose an adaptive wavelet method for car interior noise cancellation. For this purpose, we use a node dependent threshold which minimizes the Bayesian risk. We propose a noise estimation method based on spectral entropy using histogram of intensity and a candidate best basis instead of Donoho's best bases. And we modify the hard threshold function. Experimental results show that the proposed algorithm is more efficient, especially to heavy noisy signal than conventional one.

• The Journal of the Acoustical Society of Korea
• /
• v.17 no.2E
• /
• pp.3-9
• /
• 1998

Since the introduction of hands-free phone set and teleconferencing system, acoustic echo cancellation has been a challenge for engineers. Recently many researches have shown that the best solution for the acoustic echo compensation problem is represented by an adaptive filter which iteratively tries to identify the unknown impulse response of the system from loudspeaker to microphone. In this paper, we apply the delayless subband adaptive filters and fast affine projection algorithm for the identification of room impulse response. Simulation results show 3∼8 dB more enhanced performance than conventional fullband adaptive filters or subband adaptive filters. In addition, fast affine projection algorithm shows better convergence speed at the expense of the low computational complexity than conventional LMS algorithm.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.157-160
• /
• 2001

This paper has been studied a Adaptive Mutation rate Genetic Algorithm Processor. Genetic Algorithm(GA) has some control parameters such as the probability of bit mutation or the probability of crossover. These value give a priori by the designer There exists a wide variety of values for for control parameters and it is difficult to find the best choice of these values in order to optimize the behavior of a particular GA. We proposed a Adaptive mutation rate GA within a steady-state genetic algorithm in order to provide a self-adapting mutation mechanism. In this paper, the proposed a adaptive mutation rate GAP is implemented on the FPGA board with a APEX EP20K600EBC652-3 devices. The proposed a adaptive mutation rate GAP increased the speed of finding optimal solution by about 10%, and increased probability of finding the optimal solution more than the conventional GAP

• Structural Engineering and Mechanics
• /
• v.3 no.4
• /
• pp.391-410
• /
• 1995

The application of adaptive finite element method to dynamic problems is investigated. Both the kinetic and strain energy errors induced by space and time discretization were estimated in a consistent manner and controlled by the simultaneous use of the adaptive mesh generation and the automatic time stepping. Also an optimal ratio of spatial discretization error to temporal discretization error was discussed. In this study it was found that the best performance can be obtained when the specified spatial and temporal discretization errors have the same value. Numerical examples are carried out to verify the performance of the procedure.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.2
• /
• pp.313-319
• /
• 2010

GNSS receiver which uses the weak satellite signal is very vulnerable to the intentional jamming or non-intentional electromagnetic interference. One of the best method to overcome this disadvantage is to use an adaptive array antenna which has the capability of beamforming or nulling to the certain direction. In this paper, the performance of spatial adaptive null pattern control algorithm of 5 element array antenna is analyzed. A control algorithm which is designed in the 5 element array antenna is OPM(Output Power Minimization) which is eliminating the correlation characteristics between a reference antenna and the others. This algorithm can be applied effectively to the satellite navigation's CRPA because the satellite direction is not considered and GNSS signal power is below the thermal noise. The feature of the OPM algorithm is analyzed and the performance is compared with other null pattern control algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.224-241
• /
• 2015

Multiview plus depth (MVD) videos are widely used in free-viewpoint TV systems. The best-known technique to determine depth information is based on stereo vision. In this paper, we propose a novel local stereo matching algorithm which is radiometric invariant. The key idea is to use a combined matching cost of intensity and gradient based similarity measure. In addition, we realize an adaptive cost aggregation scheme by constructing an adaptive support window for each pixel, which can solve the boundary and low texture problems. In the disparity refinement process, we propose a four-step post-processing technique to handle outliers and occlusions. Moreover, we conduct stereo reconstruction tests to verify the performance of the algorithm more intuitively. Experimental results show that the proposed method is effective and robust against local radiometric distortion. It has an average error of 5.93% on the Middlebury benchmark and is compatible to the state-of-art local methods.

• Journal of information and communication convergence engineering
• /
• v.7 no.3
• /
• pp.392-398
• /
• 2009

A novel approach is presented to improve the array performance of the alternate mainbeam nulling in a linearly constrained adaptive array processor in coherent environment. The convergence parameters in the linearly constrained LMS algorithm with a unit gain constraint and a null constraint in the direction of the desired signal are adaptively estimated to reduce the error power between the desired signal and the array output in the 2-dimensional convergence parameter space. It is shown that the case for estimating the convergence parameter for the unit gain constraint with that for null constraint fixed performs best. Also, it is observed that the proposed method performs significantly better than conventional methods as the number of coherent interferences increases.

• Structural Engineering and Mechanics
• /
• v.29 no.2
• /
• pp.117-134
• /
• 2008

A new adaptive dual reciprocity boundary element method for dynamic analysis of 3-D structures is presented in this paper. It is based on finding the best approximation function of a radial basis function (RBF) group $f=r^n+c$ which minimize the error of displacement field expansion. Also, the effects of some parameters such as the existence of internal points, number of RBF functions and position of collocation nodes in discontinuous elements are investigated in this adaptive procedure. Three numerical examples show improvement in dynamic response of structures with adaptive RBF in dual reciprocity with respect to ordinary BEM.

• Journal of Intelligence and Information Systems
• /
• v.8 no.2
• /
• pp.189-203
• /
• 2002

In this paper we compare the performances of adaptive operators in genetic algorithm. For the adaptive operators, the crossover and mutation operators of genetic algorithm are considered. One fuzzy logic controller is developed in this paper and two heuristics is presented from conventional works for constructing the operators. The fuzzy logic controller and two conventional heuristics adaptively regulate the rates of the operators during genetic search process. All the algorithms are tested and analyzed in numerical examples. Finally, the best algorithm is recommended.