Fast Isotropic Median Filtering

• URL: http://arxiv.org/abs/2505.22938v1
• Date: Wed, 28 May 2025 23:38:21 GMT
• Title: Fast Isotropic Median Filtering
• Authors: Ben Weiss,
• Abstract summary: Median filtering is a cornerstone of computational image processing.<n>Our method operates efficiently on arbitrary bit-depth data, arbitrary kernel sizes, and arbitrary convex kernel shapes.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Median filtering is a cornerstone of computational image processing. It provides an effective means of image smoothing, with minimal blurring or softening of edges, invariance to monotonic transformations such as gamma adjustment, and robustness to noise and outliers. However, known algorithms have all suffered from practical limitations: the bit depth of the image data, the size of the filter kernel, or the kernel shape itself. Square-kernel implementations tend to produce streaky cross-hatching artifacts, and nearly all known efficient algorithms are in practice limited to square kernels. We present for the first time a method that overcomes all of these limitations. Our method operates efficiently on arbitrary bit-depth data, arbitrary kernel sizes, and arbitrary convex kernel shapes, including circular shapes.

Related papers

• Efficient Spatially-Variant Convolution via Differentiable Sparse Kernel Complex [15.919010246189709]
  Image with complex kernels is a fundamental operation in photography, scientific imaging, animation effects, yet direct dense convolution is on on.<n>Our approach provides a solution for mobile imaging for real-time.
  arXiv  Detail & Related papers  (2025-12-04T08:20:07Z)
• A Fast Parallel Median Filtering Algorithm Using Hierarchical Tiling [0.0]
  Median filtering is widely used in digital image processing to remove noise while retaining sharp edges.<n> Sorting-based algorithms excel with small kernels but scale poorly with increasing kernel diameter.<n>This paper introduces a novel algorithm, leveraging the separability of the sorting problem through hierarchical tiling to minimize redundant computations.
  arXiv  Detail & Related papers  (2025-07-26T12:06:05Z)
• Locally Orderless Images for Optimization in Differentiable Rendering [80.09571356394574]
  We introduce a method that uses locally orderless images, where each pixel maps to a histogram of intensities that preserves local variations in appearance.<n>We validate our method on various inverse problems using both synthetic and real data.
  arXiv  Detail & Related papers  (2025-03-27T19:17:58Z)
• EDCSSM: Edge Detection with Convolutional State Space Model [3.649463841174485]
  Edge detection in images is the foundation of many complex tasks in computer graphics. Due to the feature loss caused by multi-layer convolution and pooling architectures, learning-based edge detection models often produce thick edges. This paper presents an edge detection algorithm which effectively addresses the aforementioned issues.
  arXiv  Detail & Related papers  (2024-09-03T05:13:25Z)
• Padding-free Convolution based on Preservation of Differential Characteristics of Kernels [1.3597551064547502]
  We present a non-padding-based method for size-keeping convolution based on the preservation of differential characteristics of kernels. The main idea is to make convolution over an incomplete sliding window "collapse" to a linear differential operator evaluated locally at its central pixel.
  arXiv  Detail & Related papers  (2023-09-12T16:36:12Z)
• Efficient Dataset Distillation Using Random Feature Approximation [109.07737733329019]
  We propose a novel algorithm that uses a random feature approximation (RFA) of the Neural Network Gaussian Process (NNGP) kernel. Our algorithm provides at least a 100-fold speedup over KIP and can run on a single GPU. Our new method, termed an RFA Distillation (RFAD), performs competitively with KIP and other dataset condensation algorithms in accuracy over a range of large-scale datasets.
  arXiv  Detail & Related papers  (2022-10-21T15:56:13Z)
• Efficient Image Denoising by Low-Rank Singular Vector Approximations of Geodesics' Gramian Matrix [2.3499129784547654]
  Noise contamination of images results in substandard expectations among the people. Image denoising is an essential pre-processing step. We present a manifold-based noise filtering method that mainly exploits a few prominent singular vectors of the geodesics' Gramian matrix.
  arXiv  Detail & Related papers  (2022-09-27T01:03:36Z)
• Deep Model-Based Super-Resolution with Non-uniform Blur [1.7188280334580197]
  We propose a state-of-the-art method for super-resolution with non-uniform blur. We first propose a fast deep plug-and-play algorithm, based on linearized ADMM splitting techniques. We unfold our iterative algorithm into a single network and train it end-to-end.
  arXiv  Detail & Related papers  (2022-04-21T13:57:21Z)
• Explore Image Deblurring via Blur Kernel Space [17.67255729783263]
  We propose an alternating optimization algorithm for blind image deblurring. It approximates an unseen blur operator by a kernel in the encoded space and searches for the corresponding sharp image. Our method can be used for blur synthesis by transferring existing blur operators from a given dataset into a new domain.
  arXiv  Detail & Related papers  (2021-04-01T07:52:53Z)
• Learned Block Iterative Shrinkage Thresholding Algorithm for Photothermal Super Resolution Imaging [52.42007686600479]
  We propose a learned block-sparse optimization approach using an iterative algorithm unfolded into a deep neural network. We show the benefits of using a learned block iterative shrinkage thresholding algorithm that is able to learn the choice of regularization parameters.
  arXiv  Detail & Related papers  (2020-12-07T09:27:16Z)
• End-to-end Interpretable Learning of Non-blind Image Deblurring [102.75982704671029]
  Non-blind image deblurring is typically formulated as a linear least-squares problem regularized by natural priors on the corresponding sharp picture's gradients. We propose to precondition the Richardson solver using approximate inverse filters of the (known) blur and natural image prior kernels.
  arXiv  Detail & Related papers  (2020-07-03T15:45:01Z)
• Multiple Video Frame Interpolation via Enhanced Deformable Separable Convolution [67.83074893311218]
  Kernel-based methods predict pixels with a single convolution process that convolves source frames with spatially adaptive local kernels. We propose enhanced deformable separable convolution (EDSC) to estimate not only adaptive kernels, but also offsets, masks and biases. We show that our method performs favorably against the state-of-the-art methods across a broad range of datasets.
  arXiv  Detail & Related papers  (2020-06-15T01:10:59Z)
• GeoDA: a geometric framework for black-box adversarial attacks [79.52980486689287]
  We propose a framework to generate adversarial examples in one of the most challenging black-box settings. Our framework is based on the observation that the decision boundary of deep networks usually has a small mean curvature in the vicinity of data samples.
  arXiv  Detail & Related papers  (2020-03-13T20:03:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.