1999
DOI: 10.1049/ip-vis:19990444
|View full text |Cite
|
Sign up to set email alerts
|

Design and implementation of a new efficient median filtering algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
12
0

Year Published

2007
2007
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 21 publications
(12 citation statements)
references
References 7 publications
0
12
0
Order By: Relevance
“…Being narrow, the filter ends up filtering part of the signal. Some work was been done to improve numerical differentiation in signals [6,10,11] including the angular velocity [10]. Our goal is to propose an alternative method that allows the implementation to be simple and that can be implemented in real-time.…”
Section: Measurement Using An Encodermentioning
confidence: 99%
“…Being narrow, the filter ends up filtering part of the signal. Some work was been done to improve numerical differentiation in signals [6,10,11] including the angular velocity [10]. Our goal is to propose an alternative method that allows the implementation to be simple and that can be implemented in real-time.…”
Section: Measurement Using An Encodermentioning
confidence: 99%
“…A compact majority voting circuit using an adder array to count the number of 1s and a threshold comparator to determine an individual bit of the median is described by Benkrid et al [7]. Variations on this approach have been described in the literature [107][108][109]. Systolic array architectures for bit-level sorting networks have been shown to improve concurrency of the bit-serial sorting designs [102,103,[110][111][112][113].…”
Section: Multiobjective Optimizationmentioning
confidence: 99%
“…Many approaches for hardware implementation of rank-order filtering have been presented in the past decades [8,[10][11][12][13][14][15][16][17][18][19][20][21][22][23][24]. Many of them are based on sorting algorithm [11,22,23,[25][26][27][28].…”
Section: Introductionmentioning
confidence: 99%
“…The proposed approach significantly reduce the area complexity from exponential to linear. Papers [10,13,[16][17][18]21,33,34] employ the bit-sliced majority algorithm for median filtering, the most popular type of rank-order filtering. The bit-sliced algorithm [36,37] bitwisely selects the ranked candidates and generates the ranked result one bit at a time.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation