• No results found

The Fast One-Dimensional Median Filtering Algorithm

Median Filtering in Constant Time

Median Filtering in Constant Time

... Weiss’ algorithm makes the implementation fairly convoluted and generally unsuitable for custom ...each one han- dling a portion of the radius ...proposed algorithm, including optimization, totals ...

6

A Novel Algorithm for Efficient Channel Estimation using MMSE Kalman Estimator and Median Filtering

A Novel Algorithm for Efficient Channel Estimation using MMSE Kalman Estimator and Median Filtering

... from one place to another ...with median filtering to enhance the performance of the ...of median filter with MMSE-Kalman estimator is ...

5

Clustering High Dimensional Data Using Fast Algorithm

Clustering High Dimensional Data Using Fast Algorithm

... selection algorithm may be evaluated from both the efficiency and effectiveness points of ...into one cluster and dissimilar object into other ...a fast clustering-based feature selection ...

7

AMF-IDBSCAN: Incremental Density Based Clustering Algorithm Using Adaptive Median Filtering Technique

AMF-IDBSCAN: Incremental Density Based Clustering Algorithm Using Adaptive Median Filtering Technique

... FI-DBSCAN [20] is a Frequent Itemset Ultrametric Trees with Density Based Spatial Clustering of Applications with Noise (DBSCAN) on MapReduce framework is used in the proposed system to solve the evolution and efficiency ...

12

A Fast Algorithm for Computing High dimensional Risk Parity Portfolios

A Fast Algorithm for Computing High dimensional Risk Parity Portfolios

... the algorithm by noticing that the objective function is ...case, one can use the tools developed by Nesterov ...Newton algorithm was until now the best algorithm to solve ...

10

The xyz algorithm for fast interaction search in high-dimensional data

The xyz algorithm for fast interaction search in high-dimensional data

... As alluded to earlier, the pure interaction search problem (3) is related to close pairs of points problems, and more specifically the close bichromatic pairs problem in computa- tional geometry (Agarwal et al., 1991). ...

42

Harmonic/Percussive Separation Using Median Filtering

Harmonic/Percussive Separation Using Median Filtering

... spectrogram, one each for H and P. This means that the median filter based algorithm is faster, which is of considerable benefit when used as preprocessing for other ...proposed algorithm ...

7

Noise free Speech Enhancement based on Fast Adaptive Kalman Filtering Algorithm

Noise free Speech Enhancement based on Fast Adaptive Kalman Filtering Algorithm

... and Fast Adaptive Kalman Filtering Algorithm are done using ...simulations. One is the female speech corrupted with a background noise, and the other is the male speech signal corrupted with a ...

5

Detection Moving Object Combination Median Algorithm and Three Temporal Differences and Filtering in Image Processing Techniques

Detection Moving Object Combination Median Algorithm and Three Temporal Differences and Filtering in Image Processing Techniques

... ABSTRACT: Video Background extraction is a key step in numerous automatic applications. In this article, we recommend a new approach by using three sequential images in limited period and giving the precise threshold. ...

7

Title: Adaptive Median Filtering with Modified BDND Algorithm for the Removal of High-Density Impulse and Random Noise

Title: Adaptive Median Filtering with Modified BDND Algorithm for the Removal of High-Density Impulse and Random Noise

... Switching median filters outperform standard median filters in the removal of impulse noise due to their capability of filtering candidate noisy pixels and leaving other pixels ...the ...

6

A novel algorithm for fast and scalable subspace clustering of high-dimensional data

A novel algorithm for fast and scalable subspace clustering of high-dimensional data

... We randomly generate a set K of n large integers and use a one-to-one mapping M : DB → K to assign a unique label to each point in the database. The signa- ture H of a dense unit U is given by the sum of ...

24

On Fast Decoding of High-Dimensional Signals from One-Bit Measurements

On Fast Decoding of High-Dimensional Signals from One-Bit Measurements

... In the noiseless case, we use techniques and schemes developed in the context of two-stage group testing. More specifically, we show that if we take a (k, k)-disjunct matrix A and replace each non-zero entry with a ...

14

A New Switching-Based Median Filtering Scheme and Algorithm for Removal of High-Density Salt and Pepper Noise in Images

A New Switching-Based Median Filtering Scheme and Algorithm for Removal of High-Density Salt and Pepper Noise in Images

... than median filter with reduced streaking and computational ...pixels. One strategy, which is the simplest, is to replace the corrupted pixel by an immediate uncorrupted ...switching-based median ...

11

FAST Clustering Based Feature Subset Selection Algorithm for High Dimensional Data

FAST Clustering Based Feature Subset Selection Algorithm for High Dimensional Data

... learning algorithm to determine the goodness of the selected subsets, the accuracy of the learning algorithms is generally ...previous one, but the accuracy of the learning algorithms is not ...

5

A Recursive Least M-Estimate Algorithm for Robust Adaptive Filtering in Impulsive Noise: Fast Algorithm and Convergence Performance Analysis

A Recursive Least M-Estimate Algorithm for Robust Adaptive Filtering in Impulsive Noise: Fast Algorithm and Convergence Performance Analysis

... signal, one impulse is added to the input at ...RLS algorithm is not robust to any of the impulses, and the N-RLS algorithm is sensitive to impulses in the desired ...

18

A Comparative of Analysis of Image Restoration Using Mean and Median Filtering

A Comparative of Analysis of Image Restoration Using Mean and Median Filtering

... decision-based algorithm for the restoration of gray-scale and color images that are highly corrupted by Salt-and-Pepper noise, is proposed in this paper which efficiently removes the salt and pepper noise while ...

7

A one-way linear array algorithm for the median filter

A one-way linear array algorithm for the median filter

... Two-way fixed-throughput algorithms are known for the IIR filter [1] and the median filter [4] [t hese algorithms assume that cell I does both input and output but can easily be modified[r] ...

10

A Fast Converging, Low Complexity Adaptive Filtering Algorithm

A Fast Converging, Low Complexity Adaptive Filtering Algorithm

... This includes an additional memory requirement of N(LN). Alternately, the additional memory usage may be avoided with an increase in complexity to 2L+12N. FNTF revem to [r] ...

5

An Algorithm of Suppressing Image Noise Based on Wavelet Threshold Function and Improved Median Filtering

An Algorithm of Suppressing Image Noise Based on Wavelet Threshold Function and Improved Median Filtering

... Improved median filter, Wavelet threshold, ...an algorithm of suppressing image noise based on the wavelet threshold function and improved median filter is ...this algorithm, salt-and-pepper ...

5

Median filtering simulation of bursty traffic

Median filtering simulation of bursty traffic

... on median filter algorithm is proposed and analyzed in this ...paper. Median filter is a useful filter due to its preserving characteristic for image processing ...result, median filter can ...

5

Show all 10000 documents...

Related subjects