• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.6
• /
• pp.195-208
• /
• 2004

Histogram is a very useful method on various practical aspect. With increasing importance of simple calculation method and convenience, it became the basic method in digital image processing nowadays. However, basic limit of using histogram is losing spatial position information of pixels on image. This paper reanalyzes image by presenting histogram with spatial position information(spatial histogram). Also using that result, level order recursive median filter is realized. Presented recursive median filter showed much improved results on edge maintenance aspect compared to existing recursive median filter.

• Journal of the Korean Institute of Navigation
• /
• v.20 no.4
• /
• pp.99-109
• /
• 1996

Though median filter is used for removing noise and smoothing image. But, the result of it has distortion around edge. And then, this paper proposes new noise removing algorithm by recursive morphological processing. Basic operation is same each other, but there is some different processing method between recursive morphology and general morphology theory. This recursive morphological filter can be viewed as the weighted order static filter, and then it has a weighted SE(structuring element). Especially using this algorithm to remove the 10% gaussian noise, this paper confirmed that PSNR is improved about 0.642~1.5757 db reserving edge well better than the results of the traditional median filter.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.176-179
• /
• 2010

In this paper, we propose a fast implementation of Bilateral filter for tone mapping algorithm. Bilateral filter is able to preserve detail while at the same time prevent halo-ing artifacts because of improper scale selection by ensuring image smoothed that not only depend on pixel closeness, but also similarity. We accelerate Bilateral filter by using a piecewise linear approximation and recursive Gaussian filter as its domain filter. Recursive Gaussian filter is scale independent filter that combines low cost 1D filter which makes this filter much faster than conventional convolution filter and filtering in frequency domain. The experiment results show that proposed method is simpler and faster than previous method without mortgaging the quality.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.2
• /
• pp.61-65
• /
• 1999

This paper derives a sufficient condition on the stability of recursive third-order Volterra filters based on their filter coefficients. A Volterra filter is very effective in modeling nonlinear systems with memory. However, it is well-known that the nonrecursive Volterra filter requires a large number of filter coefficients to describe a nonlinear system. For this reason, recursive Volterra filters are usually considered because the recursive implementation requires a smaller number of coefficients compared to the nonrecursive one. Unfortunately, the main problem of the recursive Volterra filters is their inherent instablility. In this paper. we present a simple condition for the output of a recursive discrete-time third-order Volterra filter to be bounded whenever the input signal to the recursive Volterra filter is bounded by a finite constant.

• Journal of Positioning, Navigation, and Timing
• /
• v.3 no.3
• /
• pp.117-122
• /
• 2014

In CDGPS, ambiguity resolution is determined by the performance of a floating solution, and thus, the performance needs to be improved. In the case of precise positioning at a stationary position, the batch method using multiple measurements is used for the accuracy improvement of a position. The position accuracy performance of a floating solution is outstanding, but it has a problem of high computation cost because all measurements are used. In this study, to improve the floating solution performance of the initial static user in CDGPS, a floating solution method using a recursive filter was implemented. A recursive filter estimates the position solution of the current epoch using the position solution of up to the previous epoch and the pseudorange measurement of the current epoch. The computation cost of the floating solution method using a recursive filter was found to be similar to that of the epoch-by-epoch method. Also, based on actual GPS signals, the floating solution performance was found to be similar to that of the batch method. The floating solution using a recursive filter could significantly improve the performance of the prompt initial position and ambiguity resolution of the initial static user.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6C
• /
• pp.874-882
• /
• 2004

MPEG Audio compression algorithm is the international standard for the digital compression of high quality audio using mechanism of the perceptual coding based on psychoacoustic masking. It is necessary to discuss the constraints on designing of common filter banks for MPEG-2 BC and MPEG-2 AAC decoder system, which is not Down yet, mapping audio signals from the time domain into the frequency domain. In this paper, we present an architecture of common synthesis filter whcih can be used for MPEG-2 BC and MPEG-2 AAC decoder using recursive structure. The proposed algorithm is based on recursive architecture that effectively performs common compulsion.

• Journal of Communications and Networks
• /
• v.9 no.3
• /
• pp.219-228
• /
• 2007

In this paper, we present a novel blind adaptive multiuser detector structure and three robust recursive filters to improve the performance in CDMA environments: Sigma point kalman filter (SPKF), particle filter (PF), and Gaussian mixture sigma point particle filter (GMSPPF). Our proposed robust recursive filters have superior performance over a conventional extended Kalman filter (EKF). The proposed multiuser detector algorithms initially use Kalman prediction form to estimated channel parameters, and unknown data symbol be predicted. Second, based on this predicted data symbol, the robust recursive filters (e.g., GMSPPF) is a refined estimation of joint multipaths and time delays. With these estimated multipaths and time delays, data symbol detection is carried out (Kalman correction form). Computer simulations show that the proposed algorithms outperform the conventional blind multiuser detector with the EKF. Also we can see it provides a more viable means for tracking time-varying amplitudes and time delays in CDMA communication systems, compared to that of the EKF for near-far ratio of 20 dB. For this reason, it is believed that the proposed channel estimators can replace well-known filter such as the EKF.

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.2
• /
• pp.143-150
• /
• 2004

In this paper, a recursive digital filter realization for an ionospheric channel model is proposed. This realization is in the form of a cascade of identical second-order all-pass filters, and is determined by only three parameters; two coefficients of an all-pass section, and the number of sections. The values of these parameters are optimized by a nonlinear optimization algorithm called the "downhill simplex method", so that the resulting time delay function closely approximates that of the ionospheric channel model. Comparing with the nonrecursive digital filter realization, it can be shown that the proposed recursive-digital-filter-realization is advantageous in points of view for the numbers of filter coefficients and the realization.

• Proceedings of the KIEE Conference
• /
• 1979.08a
• /
• pp.166-167
• /
• 1979

Performances of three computational algorithms for one-dimensional frequency filtering are compared and tradeoffs are studied. If the size of the filter impulse response is small, it is well-known that the conventional convolution is superior than the FFT convolution. If the size of the impulse response is large, it was suggested that the recursive filter might be competitive in terms of speed to the FFT convolution. We, therefore, have developed an computational, algorithm for the recursive filter to compare the speed advantages over the FFT convolution and the results are presented.

• Speech Sciences
• /
• v.9 no.4
• /
• pp.275-287
• /
• 2002

In man-machine communication by speech under the noisy environment, the quality of speech may be degraded severely for the machine to recognize correctly. Especially when the corrupting noise occupies the same band as the speech, the conventional fixed filters cannot filter out the noise effectively. In recent, to resolve such a problem adaptive noise canceller (ANC) is frequently used, which is based upon adaptive filters. The Adaptive recursive filters perform better than adaptive nonrecursive filters due to the added poles, but the stability may be severely threatened. In this paper an ANC system employing the adaptive recursive filter is proposed to enhance the speech corrupted by noise. And the stability of the adaptive recursive filter is guaranteed by employing the adaptive compensator.