scholarly journals Otsu’s Image Segmentation Algorithm with Memory-Based Fruit Fly Optimization Algorithm

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Ruishuai Chai
Keyword(s):  
Genetic Algorithm ◽  
Median Filter ◽  
Image Interpolation ◽  
Good Effect ◽  
Fruit Fly Optimization Algorithm ◽  
Median Filtering ◽  
Grayscale Image ◽  
Interpolation Algorithm ◽  
Filtering Algorithm ◽  
Grayscale Images

In this paper, the most common pepper noise in grayscale image noise is investigated in depth in the median filtering algorithm, and the improved median filtering algorithm, adaptive switching median filtering algorithm, and adaptive polar median filtering algorithm are applied to the OTSU algorithm. Two improved OTSU algorithms such as the adaptive switched median filter-based OTSU algorithm and the polar adaptive median filter-based OTSU algorithm are obtained. The experimental results show that the algorithm can better cope with grayscale images contaminated by pretzel noise, and the segmented grayscale images are not only clear but also can better retain the detailed features of grayscale images. A genetic algorithm is a kind of search algorithm with high adaptive, fast operation speed, and good global space finding ability, and it will have a good effect when applied to the threshold finding of the OTSU algorithm. However, the traditional genetic algorithm will fall into the local optimal solution in different degrees when finding the optimal threshold. The advantages of the two interpolation methods proposed in this paper are that one is the edge grayscale image interpolation algorithm using OTSU threshold adaptive segmentation and the other is the edge grayscale image interpolation algorithm using local adaptive threshold segmentation, which can accurately divide the grayscale image region according to the characteristics of different grayscale images and effectively improve the loss of grayscale image edge detail information and jagged blur caused by the classical interpolation algorithm. The visual effect of grayscale images is enhanced by selecting grayscale images from the standard grayscale image test set and interpolating them with bilinear interpolation, bucolic interpolation, NEDI interpolation, and FEOI interpolation for interpolation simulation validation. The subjective evaluation and objective evaluation, as well as the running time, are compared, respectively, showing that the method of this paper can effectively improve the quality of grayscale image interpolation.

Study on an Improved Median Filtering Algorithm

2014 ◽  
Vol 989-994 ◽  
pp. 2273-2277
Author(s):  
Heng Zhang ◽  
Min Gao ◽  
Hai Long Ren
Keyword(s):  
Image Processing ◽  
Processing Speed ◽  
Median Filter ◽  
Median Filtering ◽  
Matlab Simulation ◽  
Filtering Algorithm ◽  
Noise Point ◽  
Real Time Image ◽  
Linear Smoothing ◽  
Time Image

Median filter is a very effective method of non-linear smoothing filtering. However, the data ordering for traditional median filtering (TMF) is very time-consuming and hardly satisfy real-time image processing. This article proposes a kind of fast median filtering algorithm based on grey histogram, the filter seeks the median through the grey histogram of mask window, not the numeric sort, which decreases the comparison times. Moreover, the update of histogram by using the overlap of mask window increases the arithmetic processing speed. Meanwhile, in the proposed algorithm, the two-level self-adapting threshold comparison, with a higher precision of detection, is used to implement the inspection of noise point and improve the image quality and increase the signal-noise ratio by processing the noise point and non-noise point respectively. The experiments by matlab simulation can prove the availability of this algorithm.

scholarly journals A Biased Median Filtering Algorithm for Segmentation of Intestinal Cell Gland Images

2006 ◽  
Vol 6 ◽  
pp. 200-220 ◽  
Author(s):  
Hai-Shan Wu ◽  
Joan Gil
Keyword(s):  
Median Filter ◽  
Goblet Cells ◽  
Segmentation Algorithm ◽  
Intestinal Cell ◽  
Median Filtering ◽  
Median Filters ◽  
Filtering Algorithm ◽  
Identical Dimension ◽  
Intestine Cell ◽  
Image Segmentation Algorithm

In this paper, we introduce a biased median filtering image segmentation algorithm for intestinal cell glands consisting of goblet cells. While segmentation of individual cells are generally based on the dissimilarities in intensities, textures, and shapes between cell regions and background, the proposed segmentation algorithm of intestine cell glands is based on the differences in cell distributions. The intestine cell glands consist of goblet cells that are distributed in the chain-organized patterns in contrast to the more randomly distributed nongoblet cells scattered in the bright background. Four biased median filters with long rectangular windows of identical dimension, but different orientations, are designed based on the shapes and distributions of cells. Each biased median filter identifies a part of gland segments in a particular direction. The complete gland regions are the combined responses of the four biased median filters. A postprocessing procedure is designed to reduce the defects that may occur when glands are located very close together and to narrow the gapping areas because of the thin distribution of goblet cells. Segmentation results of real intestinal cell gland images are provided to show the effectiveness of the proposed algorithm.

Application of Improved Median Filtering Algorithm to Image De-Noising

2014 ◽  
Vol 998-999 ◽  
pp. 838-841
Author(s):  
Wen Long Jiang ◽  
Guang Lin Li ◽  
Wei Bing Luo
Keyword(s):  
Impulse Noise ◽  
Median Filter ◽  
Median Filtering ◽  
Real Time Processing ◽  
Time Processing ◽  
Filtering Algorithm ◽  
Weighted Median ◽  
The Mean ◽  
Weighted Median Filter ◽  
Mean Filtering

Based on the shortcomings of standard median filtering and combined with the mean filtering, this paper puts forward two improved median filtering algorithms referred as the weighted fast median filtering algorithm and the weighted adaptive median filtering algorithm. The experiment results with MATLAB show that weighted fast median filtering algorithm has a significant effect on low-density impulse noise, and accelerates the speed of real-time processing. The weighted median filter could effectively eliminate the high-density impulse noise from polluted images, and better maintains the details of the original image.

scholarly journals Reconstruction of Corrupted Image From Salt And Pepper Noise From Median Filter

2012 ◽  
pp. 4-6
Author(s):  
Vishal Gautam ◽  
Tarun Varma
Keyword(s):  
Median Filter ◽  
Median Filtering ◽  
Salt And Pepper Noise ◽  
Filtering Algorithm ◽  
Noise Density ◽  
Mean Filter ◽  
Salt And Pepper ◽  
Image Details ◽  
Lower Noise ◽  
Better Than

- Inthis paper,we propose an improved median filtering algorithm. Here, we introduced salt and pepper noise for the image corruption and reconstruct original image using different filters i.e. mean, median and improved median filter. The performance of improved median filter is good at lower noise density levels.The mean filter suppresses little noise and gets the worst results.The experimental resultsshow that our improved median filter is better than previousmedian filterfor lower noise density (upto 60%). It removes most of the noises effectively while preserving image details very well.

Impulse Noise Filtering Algorithm Based on Dual Threshold Criterion

2013 ◽  
Vol 437 ◽  
pp. 849-852 ◽  
Author(s):  
Yu Lan Wei ◽  
Bing Li ◽  
Jian Dong Li ◽  
Ying Ying Fan
Keyword(s):  
Impulse Noise ◽  
Surface Defect ◽  
Median Filter ◽  
Noise Filtering ◽  
Median Filtering ◽  
Filtering Algorithm ◽  
Obvious Advantage ◽  
Noise Point ◽  
Threshold Criterion ◽  
Good For

In order to filter the impulse noise existing in the weld surface defect images, the traditional median filtering will dim image, even destroy some details in the image, We put forward a new filtering algorithm based on dual threshold Criterion. This way distinguishes the noise point and signal location in the first, and it only doing median filter to the noise point. Lastly, it solves the image’s boundary. We can find it when compared to the traditional median filtering and modified extremum median filtering, the way in this article can be good for filtration, and can keep the image’s details, which have obvious advantage.

An Improved Hybrid Median-Mean Filter Algorithm

2014 ◽  
Vol 701-702 ◽  
pp. 288-292
Author(s):  
Fang Jia ◽  
De Cheng Xu ◽  
Xin Fu
Keyword(s):  
Gaussian Noise ◽  
Median Filter ◽  
Experimental Results ◽  
Median Filtering ◽  
Filtering Algorithm ◽  
Mean Filter ◽  
Image Details ◽  
Mean Filtering

In the process of imaging, digitalization and transmission, images are generally contaminated by Gaussian noise and salt & pepper noise, which cannot be eliminated completely at the same time only by Mean filter or Median filter. Aiming at solving this problem, an improved hybrid median-mean filter algorithm based on the Improved Median Filtering (IMF) algorithm is proposed in this paper. The experimental results show that the new algorithm shows better performance than either Median filtering algorithm or Mean filtering algorithm, which can not only get rid of Gaussian noise and salt & pepper noise simultaneously, but also minimize the contradictions between noise erasing and image details protecting effectively.

The Median Filtering Algorithm’s Fast Implementation in FPGA

2011 ◽  
Vol 230-232 ◽  
pp. 1054-1057
Author(s):  
Dao De Zhang ◽  
Yu Rong Pan ◽  
Xin Yu Hu ◽  
Guang You Yang ◽  
Cheng Xu
Keyword(s):  
Image Processing ◽  
Processing Speed ◽  
Median Filter ◽  
Clock Cycle ◽  
Median Filtering ◽  
Filtering Algorithm ◽  
Fast Implementation ◽  
Exchange Principle

Based on FPGA’S Balance and exchange principle of area and speed, Using the FPGA internal rich logic resources and powerful hardware characteristics , the traditional median filtering algorithm is reduced to 2 clock cycle , Greatly improving the image processing speed . And by using threshold, in a certain extent, reducing the image fuzzy phenomena brought by the median filter . The results of test show that the system runs stability, the time of achieving the median filtering algorithm are narrowed to the shortest clock cycle.

scholarly journals Ameliorated mean adaptive median filtering algorithm

2019 ◽  
Vol 118 ◽  
pp. 02069
Author(s):  
Hongming Zhang ◽  
Yongping Wang ◽  
Chuang Peng
Keyword(s):  
Median Filter ◽  
Random Noise ◽  
Infrared Image ◽  
Electrical Equipment ◽  
Median Filtering ◽  
Salt And Pepper Noise ◽  
Filtering Algorithm ◽  
Average Value ◽  
Adaptive Median Filter ◽  
Salt And Pepper

Aiming at the problem that the quality of infrared image decreases due to the large amount of random noise in the process of collection and transmission of infrared image of electrical equipment, and the accuracy of automatic detection of electrical equipment decreases, based on the traditional adaptive median filter algorithm, the adaptive median filter is analyzed, which can filter only the salt and pepper noise below 25%. An improved mean adaptive median filtering algorithm is proposed to overcome the shortcomings of wave effect. Firstly, the filtering window is selected according to the decision setting condition, and then it is judged whether the K-mean value near the center point is a noise point, and if so, the window is increased, otherwise the average value is output. Finally, it is judged whether the value of the current pixel point is noise, and if so, the average value is output, otherwise, the current pixel value is output. The experimental results show that the algorithm can effectively filter salt and pepper noise and Gauss noise, while maintaining the image sharpness, and has good filtering performance on PSNR and MSE indicators.

Filtering Algorithm for Removing Image Impulse Noise

2014 ◽  
Vol 543-547 ◽  
pp. 2817-2820
Author(s):  
Li Hua Sun ◽  
En Liang Zhao ◽  
Bao Yang Yu
Keyword(s):  
Numerical Experiments ◽  
Small Area ◽  
Impulse Noise ◽  
Median Filter ◽  
Median Filtering ◽  
Effective Algorithm ◽  
Signal To Noise ◽  
Edge Information ◽  
Filtering Algorithm ◽  
Pixel Value

The paper is devoted to put forward an effective algorithm for removing image impulse noise by improving the traditional median filter. The following approaches are developed in this paper. First, in a small area all the pixels are separated into signal pixels and suspicious noise pixels making use of the extremum and median filtering algorithm .Then suspicious noise pixels are further identified the signal pixels and noise pixels around pixels. If a pixel value is a noise pixel, it will be processed by median filter. A signal pixel will retain the original pixel value. The numerical experiments show that compared with traditional median filter , the details and edge information of the original image are retained when the new algorithm is used , Comparing with extremum median filter algorithm, the ratio of peak signal to noise can increase up to 2.94 at most. As a result, it is an effective algorithm for image denoising that can eliminate impulse noise in the image effectively.

An Alternate Algorithm for (3x3) Median Filtering of Digital Images

2012 ◽  
Vol 2 (1) ◽  
pp. 7-9 ◽  
Author(s):  
Satinderjit Singh
Keyword(s):  
Median Filter ◽  
Computational Cost ◽  
Spatial Coherence ◽  
General Purpose ◽  
Median Filtering ◽  
Basic Algorithm ◽  
Temporal Complexity ◽  
Filter Kernel ◽  
One Step ◽  
High Computational Cost

Median filtering is a commonly used technique in image processing. The main problem of the median filter is its high computational cost (for sorting N pixels, the temporal complexity is O(N·log N), even with the most efficient sorting algorithms). When the median filter must be carried out in real time, the software implementation in general-purpose processorsdoes not usually give good results. This Paper presents an efficient algorithm for median filtering with a 3x3 filter kernel with only about 9 comparisons per pixel using spatial coherence between neighboring filter computations. The basic algorithm calculates two medians in one step and reuses sorted slices of three vertical neighboring pixels. An extension of this algorithm for 2D spatial coherence is also examined, which calculates four medians per step.

Sign in / Sign up

Export Citation Format

Share Document