• ETRI Journal
• /
• v.28 no.1
• /
• pp.51-58
• /
• 2006

In this paper, we propose a method of applying a lifting-based wavelet domain e-median filter (LBWDEMF) for image restoration. LBWDEMF helps in reducing the number of computations. An e-median filter is a type of modified median filter that processes each pixel of the output of a standard median filter in a binary manner, keeping the output of the median filter unchanged or replacing it with the original pixel value. Binary decision-making is controlled by comparing the absolute difference of the median filter output and the original image to a preset threshold. In addition, the advantage of LBWDEMF is that probabilities of encountering root images are spread over sub-band images, and therefore the e-median filter is unlikely to encounter root images at an early stage of iterations and generates a better result as iteration increases. The proposed method transforms an image into the wavelet domain using lifting-based wavelet filters, then applies an e-median filter in the wavelet domain, transforms the result into the spatial domain, and finally goes through one spatial domain e-median filter to produce the final restored image. Moreover, in order to validate the effectiveness of the proposed method we compare the result obtained using the proposed method to those using a spatial domain median filter (SDMF), spatial domain e-median filter (SDEMF), and wavelet thresholding method. Experimental results show that the proposed method is superior to SDMF, SDEMF, and wavelet thresholding in terms of image restoration.

• The Journal of Engineering Research
• /
• v.3 no.1
• /
• pp.57-64
• /
• 1998

This paper presents an architecture of a real-time two-dimensional median filter. The architecture has appropriate characteristics for the VLSI implementation such as small memory requirements, regular computations, and local data transfers. For the efficient two-dimensional median filter, a separable two-dimensional median filtering structure and a bit-sliced pipelined median searching algorithm are used. A behavioral simulator is implemented with C language and used for the analysis of the presented architecture.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10c
• /
• pp.467-468
• /
• 1998

Impulsive noise appears as black and/or white spots in an image. It is usually caused by errors during the image acquisition or transmission through communication channels. This paper presents a study on the impulsive noise reduction filter of digital image. A much more effective method for removing impulse noise is weighted median filtering. But it loses some information by changing center value with no condition. We propose some new technique to change center value with some conditions. In this paper, the performance of conditional weighted median filter is compared to the commonly used median filter, mean filter, max/min filter, and weighted median filter. A quantitative comparison is performed on MSE (Mean Square Error), RMSE (Root Mean Square Error), and SNR (Signal to Noise Ratio). Proposed conditional weighted median filter can yield better performance than regular filters.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2830-2837
• /
• 1999

Image processing steps are consist of image acquisition, preprocessing, region, segmentation and recognition. But image corrupted commonly by noise reduction methods, many filters were proposed like mean filter, median filter, weighted median filter, Cheikh filter, and Kyu-cheol lee filter as spatial noise reduction filtering. We propose a new edge detection algorithm so that we find out edge existence and nonexistence. In non-edge area, we selectively apply weighted median filter based upon using information of difference value between weighted median filter's value and center pixel's value. As a result, we finally prove a better performance of noise reduction by applying adaptive weighted median filter and improvement of processing time through using simple algorithm.

• Korean Journal of Remote Sensing
• /
• v.23 no.4
• /
• pp.273-285
• /
• 2007

Most stereo matching methods use intensity values in small image patches to measure the correspondence between two points. If the noisy pixels are used in computing the corresponding point, the matching performance becomes low. For this reason, the noise plays a critical role in determining the matching performance. In this paper, we propose a method for combining intensity and edge filters robust to the noise in order to improve the performance of stereo matching using high resolution satellite imagery. We used intensity filters such as Mean, Median, Midpoint and Gaussian filter and edge filters such as Gradient, Roberts, Prewitt, Sobel and Laplacian filter. To evaluate the performance of intensity and edge filters, experiments were carried out on both synthetic images and satellite images with uniform or gaussian noise. Then each filter was ranked based on its performance. Among the intensity and edge filters, Median and Sobel filter showed best performance while Midpoint and Laplacian filter showed worst result. We used Ikonos satellite stereo imagery in the experiments and the matching method using Median and Sobel filter showed better matching results than other filter combinations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.2
• /
• pp.202-207
• /
• 2021

One of the most important tasks in image processing is noise filtering. Noise removal in image is a difficult task due to many reasons such as nonstationary sequences and corrupted by various types of noise. Human's visual perception is heavily based on the edge information. Thus, noise filtering must preserve edges. To remove the noise, we usually use the square-shaped median filter. They possess mathematical simplicity but have the disadvantages that blur the edges. In this paper we consider a new technique for image restoration using a weighted octagonal median filter. The technique consists of simple hypothesis test for edge detection, and we use the weighted octagonal-shaped moving window. The new technique is applied to noise corrupted image and experimental results are compared to the results of the square-shaped median filter and the cross-shaped median filter.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.7
• /
• pp.1464-1468
• /
• 2004

The color conversion and color enhancement on gray image is presented in this paper. The pseudocoloring for RCB color components extraction from gray image is used the 2D U(Fast Wavelet Transform) for fille. bank and re-array. The each post processing is used the median filtering for noise reduction and the discrete color histogram equalization for CIT(Color Intensity Transformation). The experiment result has enhanced pseudocoloring image as PSNR 30dB over compared the processing of normal wavelet transform.

• Journal of the Semiconductor & Display Technology
• /
• v.10 no.1
• /
• pp.113-118
• /
• 2011

This paper proposes computer visual inspection algorithms for PCB defects which are found in a manufacturing process. The proposed method can detect open circuit and short circuit on bare PCB without using any reference images. It performs adaptive threshold processing for the ROI (Region of Interest) of a target image, median filtering to remove noises, and then analyzes connected components of the binary image. In this paper, the connected components of circuit pattern are defined as 6 types. The proposed method classifies the connected components of the target image into 6 types, and determines an unclassified component as a defect of the circuit. The analysis of the original target image detects open circuits, while the analysis of the complement image finds short circuits. The machine vision inspection system is implemented using C language in an embedded Linux system for a high-speed real-time image processing. Experiment results show that the proposed algorithms are quite successful.

• Journal of Astronomy and Space Sciences
• /
• v.15 no.1
• /
• pp.175-182
• /
• 1998

Any classification process using SAR images presupposes the reduction of multiplicative speckle noise, since the variations caused by speckle make it extremely difficult to distinguish between neighboring classes within the feature space. Therefore, several adaptive filter algorithms have been developed in order to distinguish between them. These algorithms aim at the preservation of edges and single scattering peaks, and smooths homogeneous areas as much as possible. This task is rendered more difficult by the multiplicative nature of the speckle noise the signal variation depends on the signal itself. In this paper, LEE(Lee 1908) and R-LEE(Lee 1981) filters using local statistics, local mean and variance, are applied to RADARSAT SAR images. Also, a new method of speckle filtering, EPOS(Edge Preserving Optimal Speckle)(Hagg & Sties 1994) filter based on the statistical properties of speckle noise is described and applied. And then, the results of filtering SAR images with LEE, R-LEE and EPOS filters are compared with mean and median filters.

• Genomics & Informatics
• /
• v.7 no.2
• /
• pp.136-140
• /
• 2009

Genome-wide association (GWA) studies may benefit from the inclusion of imputed SNPs into their dataset. Due to its predictive nature, the imputation process is typically not perfect. Thus, it would be desirable to develop a scheme for filtering out the imputed SNPs by maximizing the concordance with the observed genotypes. We report such a scheme, which is based on the combination of several parameters that are calculated by PLINK, a popular GWA analysis software program. We imputed the genotypes of 8,842 Korean individuals, based on approximately 2 million SNP genotypes of the CHB＋JPT panel in the International HapMap Project Phase II data, complementing the 352k SNPs in the original Affymetrix 5.0 dataset. A total of 333,418 SNPs were found in both datasets, with a median concordance rate of 98.7%. The concordance rates were calculated at different ranges of parameters, such as the number of proxy SNPs (NPRX), the fraction of successfully imputed individuals (IMPUTED), and the information content (INFO). The poor concordance that was observed at the lower values of the parameters allowed us to develop an optimal combination of the cutoffs (IMPUTED${\geq}$0.9 and INFO${\geq}$0.9). A total of 1,026,596 SNPs passed the cutoff, of which 94,364 were found in both datasets and had 99.4% median concordance. This study illustrates a conservative scheme for filtering imputed SNPs that would be useful in GWA studies.