.png){kind=icon}
返回
Fast Median Filters using Separable Sorting Networks
.png){kind=icon}
PRE
AI
DOI：10.1145/3450626.3459773.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Median filters are a widely-used tool in graphics, imaging, machine learning, visual effects, and even audio processing. Currently, very-small-support median filters are performed using sorting networks, and large-support median filters are handled by O(1) histogram-based methods. However, the constant factor on these O(1) algorithms is large, and they scale poorly to data types above 8-bit integers. On the other hand, good sorting networks have not been described above the 7 x 7 case, leaving us with no fast way to compute integer median filters of modest size, and no fast way to compute floating point median filters for any size above 7 x 7. This paper describes new sorting networks that efficiently compute median filters of arbitrary size. The key idea is that these networks can be factored to exploit the separability of the sorting problem - they share common work across scanlines, and within small tiles of output. We also describe new ways to run sorting networks efficiently, using a sorting-specific instruction set, compiler, and interpreter. The speed-up over prior work is more than an order of magnitude for a wide range of data types and filter sizes. For 8-bit integers, we describe the fastest median filters for all sizes up to 25 x 25 on CPU, and up to 33 x 33 on GPU. For higher-precision types, we describe the fastest median filters at all sizes tested on both CPU and GPU.
Keyword:
Median filters
sorting networks
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.5
论文数:
4.8K
被引数:
3.6W
机构
引用论文
Expression of S-adenosyl methionine decarboxylase gene for polyamine accumulation in Egyptian cotton Giza 88 and Giza 90.png)
GM Crops
GM CropsIF0
PREAI
分享收藏
查看更多内容