Show simple item record

dc.contributor.authorKaraman, M.en_US
dc.contributor.authorOnural, L.en_US
dc.date.accessioned2016-02-08T10:56:51Z
dc.date.available2016-02-08T10:56:51Z
dc.date.issued1989en_US
dc.identifier.issn0013-5194
dc.identifier.urihttp://hdl.handle.net/11693/26236
dc.description.abstractA fast radi-2-based median filtering algorithm is proposed. The median is determined bit-by-bit successively by eliminating the samples whose previous bits are different to that of the median. The intermediate computations of the algorithm do not involve any array computation, nor any memory. The worst-case computational complexity of the algorithm is O(w) for w samples.en_US
dc.language.isoEnglishen_US
dc.source.titleElectronics Lettersen_US
dc.relation.isversionofhttps://doi.org/10.1049/el:19890490en_US
dc.subjectComputer Programmingen_US
dc.subjectElectric Filtersen_US
dc.subjectSignal Filtering and Predictionen_US
dc.subjectFast Median Filteringen_US
dc.subjectMedian Filtering Algorithmen_US
dc.subjectNonlinear Smoothingen_US
dc.subjectRadix-2-Based Algorithmen_US
dc.subjectImage Processingen_US
dc.titleNew radix-2-based algorithm for fast median filteringen_US
dc.typeArticleen_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.citation.spage723en_US
dc.citation.epage724en_US
dc.citation.volumeNumber25en_US
dc.citation.issueNumber11en_US
dc.identifier.doi10.1049/el:19890490en_US
dc.publisherIEEEen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record