scholarly journals Proposal for roughness evaluation using median filter and investigation of the optimum filter width

2021 ◽  
Vol 18 ◽  
pp. 100099
Author(s):  
Yuki Kondo ◽  
Ichiro Yoshida ◽  
Yudai Yamaguchi ◽  
Hirokazu Machida ◽  
Munetoshi Numada ◽  
...  
Keyword(s):  
Median Filter ◽  
Filter Width ◽  
Roughness Evaluation ◽  
Optimum Filter

PIV Technique for the Simultaneous Measurement of Dilute Two-Phase Flows

2000 ◽  
Vol 122 (4) ◽  
pp. 811-818 ◽  
Author(s):  
K. T. Kiger ◽  
C. Pan
Keyword(s):  
Turbulent Flows ◽  
Particle Image ◽  
Median Filter ◽  
Processing Technique ◽  
Image Processing Technique ◽  
Image Size ◽  
Two Phase ◽  
Filter Width ◽  
Tracer Particles ◽  
Phase Images

A Particle Image Velocimetry (PIV) image processing technique has been developed which can be applied to solid-liquid two-phase turbulent flows. The main principle of the technique is to utilize a two-dimensional median filter to generate separate images of the two phases, thus eliminating the errors induced by the distinct motion of the dispersed component. The accuracy and validity of the technique have been studied in the present research for different filter widths, f, and for 4 groups of different sized dispersed particles ranging from an effective image diameter of dp=2.9 pixels to 13 pixels in combination with tracer particles with an effective image size of dt∼2.4 pixels. The results have shown that the errors introduced by the filter are negligible, and mainly arise in regions of large velocity gradients that are sensitive to the slight loss of information incurred by the processing. The filter width f also affects the algorithm’s ability to correctly separate and identify the dispersed phase particles from the two-phase images, with the main result that above a critical particle image size ratio, dp/dt≈3.0, the particle size had no significant influence on the number of particles identified, or the accuracy of the displacement calculation. Sample results of particle-fluid interaction and cross-correlation terms which can be obtained from the method are also presented. [S0098-2202(00)01104-4]

An investigation on scalability of SMA composite by roughness evaluation of SMA wires

2004 ◽  
Vol 115 ◽  
pp. 343-349 ◽  
Author(s):  
L. F. Campanile ◽  
J. Mircea ◽  
S. Homann
Keyword(s):  
Roughness Evaluation

A Novel Algorithm based on UBTMF for Colour Pictures

2018 ◽  
Vol 8 (4) ◽  
pp. 84
Author(s):  
Himanshu Rehani ◽  
Anuradha Saini
Keyword(s):  
Driving Forces ◽  
Median Filter ◽  
Main Stream ◽  
Points Of Interest ◽  
Novel Algorithm

The issue of picture denoising is one of the most established in the field, is as yet getting extensive focus from the exploration zone due to consistently expanding interest for sensibly valued great media and in additament its part as a pre-preparing venture for picture division, pressure, and so on, because of high spatial being without a vocation of mundane pictures, nearby averaging of the pixels impressively abate the commotion while bulwark the first structure of the picture. To enhance the execution of the essential channels, more compelling sifting calculations including the exchanging vector channels and the amalgamation vector. In spite of the fact that there are different sifting calculations to cull, the more preponderant part of them is not outfit predicated. Multifarious Median Filter (AMF) performs well at low commotion densities. Be that as it may, at high filter densities the window measure must be expanded which may prompt obscuring the picture. In exchanging middle channel the cull depends on Re-characterized limit esteem. The paramount downside of this technique is that characterizing a vigorous cull is onerous. Supplementally these channels won't consider the nearby highlights because of which points of interest and edges may not be recouped severely, concretely when the filter level is high. To vanquish the above downside, Decision Predicated Algorithm (DBA) is proposed. In this, the picture is denoised by utilizing a 3x3 window. On the off chance that the preparing pixel esteem is 0 or 255 it is handled or else it is left unaltered. At high commotion thickness the middle esteem will be 0 or 255 which is boisterous. The goal of disuniting is to expel the driving forces so the commotion free picture is planarity recouped with least flag bending. Filter (Clamor) expulsion can be accomplished by utilizing sundry subsisting direct dissevering procedures which are main stream as a result of their numerical straightforwardness and the presence of the assembling direct framework hypothesis. In spite of the fact that middle channels expel motivation clamor without harming the edges, the prodigious majority of them work consistently over the picture and in this way have a propensity to alter both commotion and clamor free pixels. Preferably, the disuniting ought to be connected just to debased pixels while leaving uncorrupted pixels in place. We propose a novel calculation for clamor diminishment in light of UBTMF for Colour pictures.

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.

Determination of the optimum filter for 99mTc SPECT breast imaging using a wire mesh collimator

2017 ◽  
pp. 9-15
Author(s):  
Xianling Dong ◽  
M.I. Saripan ◽  
R. Mahmud ◽  
S. Mashohor ◽  
Aihui Wang
Keyword(s):  
Breast Imaging ◽  
Wire Mesh ◽  
Optimum Filter

Enhancing the Performance of One Dimensional Median Filter

2019 ◽  
Vol 118 (7) ◽  
pp. 73-76
Author(s):  
Sharanabasappa ◽  
P Ravibabu
Keyword(s):  
Impulse Noise ◽  
Rank Order ◽  
Median Filter ◽  
Filter Method ◽  
Salt And Pepper Noise ◽  
Edge Preservation ◽  
Word Level ◽  
Look Ahead ◽  
Filter Architecture ◽  
Salt And Pepper

Nowadays, during the process of Image acquisition and transmission, image information data can be corrupted by impulse noise. That noise is classified as salt and pepper noise and random impulse noise depending on the noise values. A median filter is widely used digital nonlinear filter  in edge preservation, removing of impulse noise and smoothing of signals. Median filter is the widely used to remove salt and pepper noise than rank order filter, morphological filter, and unsharp masking filter. The median filter replaces a sample with the middle value among all the samples present inside the sample window. A median filter will be of two types depending on the number of samples processed at the same cycle i.e, bit level architecture and word level architecture.. In this paper, Carry Look-ahead Adder median filter method will be introduced to improve the hardware resources used in median filter architecture for 5 window and 9 window for 8 bit and 16 bit median filter architecture.

Dual Ascent Based Median Filter for Image Restoration

2019 ◽  
Author(s):  
Narendra Kumar ◽  
H. S. Shukla ◽  
Arvind Kumar Tiwari ◽  
Anil Kumar Dahiya
Keyword(s):  
Image Restoration ◽  
Median Filter ◽  
Dual Ascent

Double Line Clustering based Colour Image Segmentation Technique for Plant Disease Detection

2019 ◽  
Vol 15 (8) ◽  
pp. 769-776
Author(s):  
Kalaivani Subramani ◽  
Shantharajah Periyasamy ◽  
Padma Theagarajan
Keyword(s):  
Pattern Matching ◽  
Error Rate ◽  
Median Filter ◽  
Identification System ◽  
Double Line ◽  
Cultivation System ◽  
Matching Algorithm ◽  
Non Local ◽  
Mining Methods ◽  
Blight Disease

Background: Agriculture is one of the most essential industry that fullfills people’s need and also plays an important role in economic evolution of the nation. However, there is a gap between the agriculture sector and the technological industry and the agriculture plants are mostly affected by diseases, such as the bacterial, fungus and viral diseases that lead to loss in crop yield. The affected parts of the plants need to be identified at the beginning stage to eliminate the huge loss in productivity. Methods: In the present scenario, crop cultivation system depend on the farmers experience and the man power, but it consumes more time and increases error rate. To overcome this issue, the proposed system introduces the Double Line Clustering technique based disease identification system using the image processing and data mining methods. The introduced method analyze the Anthracnose, blight disease in grapes, tomato and cucumber. The leaf images are captured and the noise has been removed by non-local median filter and the segmentation is done by double line clustering method. The segmented part compared with diseased leaf using pattern matching algorithm. Methods: In the present scenario, crop cultivation system depend on the farmers experience and the man power, but it consumes more time and increases error rate. To overcome this issue, the proposed system introduces the Double Line Clustering technique based disease identification system using the image processing and data mining methods. The introduced method analyze the Anthracnose, blight disease in grapes, tomato and cucumber. The leaf images are captured and the noise has been removed by non-local median filter and the segmentation is done by double line clustering method. The segmented part compared with diseased leaf using pattern matching algorithm. Conclusion: The result of the clustering algorithm achieved high accuracy, sensitivity, and specificity. The feature extraction is applied after the clustering process which produces minimum error rate.

Sign in / Sign up

Export Citation Format

Share Document