• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.12
• /
• pp.2798-2804
• /
• 2010

The audio and image signal are corrupted by various noises in signal processing, many studies are being accomplished to restore those signals. In this paper, the algorithm is proposed to remove additive Gaussian noise and impulse noise at one dimension signal like an speech signal. The algorithm is composed to remove Gaussian noise after removing impulse noise. And the method using wavelet coefficient accumulation is used to remove the Gaussian noise, and the median filter based on element deviation is applied to remove the impulse noise. Also we compare existing methods using SNR(signal-to-noise ratio) as the standard of judgement of improvemental effect.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.903-905
• /
• 2015

The need for digital devices is increasing in the digital age. In general, noise in images occurs during the process of compression, recognition and processing due to many reasons. Some of the filters used to remove salt and pepper noise include SMF, CWMF and AMF. In areas where the noise density is high, the removal of noise is undermined. This paper suggests an adjusted median filter algorithm that preserves the non-noise pixels while transforming the noise pixels to more effectively remove salt and pepper noise.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.268-270
• /
• 2013

According to the development and supply of Wibro technology digital technology is applied in several fields. Digital images are damaged by various noises in the process of transfer and storage; the image restoration is to reduce the influence of the noises on images by removing the noises. To make good image restoration several methods have been proposed but the noise removal property is not satisfactory. Therefore, to effectively remove noises noise decision is made and if it is decided as a noise, the size of mask is enlarged; this is adaptive median filter algorithm that is proposed in this paper. And through simulation the superiority of this algorithm to existing methods has been verified.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.312-314
• /
• 2015

With progress in information technology, demand for imaging devices such as display devices is increasing. But noise occurs due to various reasons during the process of acquiring, transmitting or processing the image data. Filters used to remove salt and pepper noise include SMF, CWMF and AWMF. In areas where the noise density is high, the removal of noise is undermined. This paper suggests an adjusted median filter algorithm that transforms the noise pixels to more effectively remove salt and pepper noise.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2016.07a
• /
• pp.289-291
• /
• 2016

본 논문에서는 VR의 발전과 함께 주목받고 있는 컴퓨터 비전 관련 기술들에 대하여 살펴보고, 가장 먼저 선행되어야 하는 이미지 필터링 알고리즘에 대하여 살펴 본다. 다양한 case에서의 여러 Image Filter를 구현, 성능을 비교 분석해 보고, 정확도를 향상 시킬 수 있는 방안에 대하여 연구한다.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.371-374
• /
• 2001

본 논문에서는 움직임 보상을 이용한 Motion-Adaptive De-interlacing Method를 제안 한다. 정확한 움직임 추정을 위해서 Pre-filter로서 EBMF(Edge Based Median Filter)를 사용하며 새로운 Block Matching Method를 제안한다. Temporal Filter로서 Motion Missing Error를 제거하기 위해 입력 영상의 움직임 영역에 따라 각각 다른 임계 값을 적용하는 AMPDF(Adaptive Minimum Pixel Difference Filter)를 적용하였으며 MMD(Maximum Motion Detection)와 SAD(Sum of Difference)를 이용하여 빠른 움직임 영역에서 화질을 향상시켰다. 최종적으로 잘못된 움직임 보상에 기인하는 화질의 열화를 방지하기 위한 Motion Correction Filter를 제안한다.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.8
• /
• pp.67-73
• /
• 2015

In a distribution of digital image, there is a serious problem that is the image alteration by a forger. For the problem solution, this paper proposes the forensic decision algorithm of a median filtering (MF) image using the feature vector based on a coefficient of variation (c.v.) of Fourier transform. In the proposed algorithm, we compute Fourier transform (FT) coefficients of row and column line respectively of an image first, then c.v. between neighboring lines is computed. Subsquently, 10 Dim. feature vector is defined for the MF detection. On the experiment of MF detection, the proposed scheme is compared to MFR (Median Filter Residual) and Rhee's MF detection schemes that have the same 10 Dim. feature vector both. As a result, the performance is excellent at Unaltered, JPEG (QF=90), Down scaling (0.9) and Up scaling (1.1) images, and it showed good performance at Gaussian filtering ($3{\times}3$) image. However, in the performance evaluation of all measured items of the proposed scheme, AUC (Area Under ROC (Receiver Operating Characteristic) Curve) by the sensitivity and 1-specificity approached to 1 thus, it is confirmed that the grade of the performance evaluation is rated as 'Excellent (A)'.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.40 no.4
• /
• pp.402-406
• /
• 1991

In this paper, we find a set of conditions on weights under which a recursive weighted median filter preserves monotone or localy monotone sequence and under which any input sequence converges to a locally monotone sequence after a finite number of passes.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2845-2854
• /
• 1998

Median filter can be implemented in the binary domain based on threshold decomposition, stacking property, and linear separability. In this paper, we develop one-dimensional and two-dimensional parallel algorithms for the median filter on a reconfigurable mesh with buses(RMESH) which is suitable for VLSI implementation. And we evaluate their performance by comparing the time complexities of RMESH algorithms with those of algorithms on mesh-connected computer. When the length of M-valued 1-D signal is N and w is the window width, the RMESH algorithm is done in O(Mw) time and mesh algorithm is done in $O(Mw^2)$ time. Beside, when the size of M-valued 2-D image is $N{\times}N$ and the window size is $w{\times}w$, our algorithm on $N{\times}N$ RMESH can be computed in O(Mw) time which is a significant improvement over the $O(Mw^2)$ complexity on $N{\times}N$ mesh.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.7
• /
• pp.9-16
• /
• 2014

Since the haze removal algorithm using dark channel prior was introduced, many researches for improving processing speed have been addressed even if it presented impressive results. Remarkable one is using median dark channel prior. Although it has been considered as a very attactive method, processing speed is as low as ever. So, a parallel memory model which is suitable for SIMD architecture processing haze removal on high-definition images in high-speed is introduced in this paper. The proposed parallel memory model allows to access n pixels simultaneously. It is also support stride 3, 5, 7, and 11 in order to execute convolution mask operations, e.g., median filter. The proposed parallel memory model can therefore support enough data bandwidth to process the algorithm using median dark channel prior in high-speed.