Gaussian Fourier Pyramid for Local Laplacian Filter

• URL: http://arxiv.org/abs/2206.04681v1
• Date: Wed, 8 Jun 2022 20:50:42 GMT
• Title: Gaussian Fourier Pyramid for Local Laplacian Filter
• Authors: Yuto Sumiya, Tomoki Otsuka, Yoshihiro Maeda, Norishige Fukushima
• Abstract summary: Several edge-preserving decompositions resolve halos, e.g., local Laplacian filtering (LLF) An approximated acceleration of fast LLF was proposed to linearly interpolate multiple Laplacian pyramids. Our results showed that Fourier LLF has a higher accuracy for the same number of pyramids.
• Score: 0.6117371161379208
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Multi-scale processing is essential in image processing and computer graphics. Halos are a central issue in multi-scale processing. Several edge-preserving decompositions resolve halos, e.g., local Laplacian filtering (LLF), by extending the Laplacian pyramid to have an edge-preserving property. Its processing is costly; thus, an approximated acceleration of fast LLF was proposed to linearly interpolate multiple Laplacian pyramids. This paper further improves the accuracy by Fourier series expansion, named Fourier LLF. Our results showed that Fourier LLF has a higher accuracy for the same number of pyramids. Moreover, Fourier LLF exhibits parameter-adaptive property for content-adaptive filtering. The code is available at: https://norishigefukushima.github.io/GaussianFourierPyramid/.

Related papers

• FFTArray: A Python Library for the Implementation of Discretized Multi-Dimensional Fourier Transforms [0.0]
  We present FFTArray, a Python library that automates the general discretization of Fourier transforms.<n>Built on the Python Array API Standard, FFTArray integrates seamlessly with array backends like NumPy, JAX and PyTorch.
  arXiv  Detail & Related papers  (2025-07-17T17:05:39Z)
• Neural Gaussian Scale-Space Fields [60.668800252986976]
  We present an efficient method to learn the continuous, anisotropic Gaussian scale space of an arbitrary signal. Our approach is trained self-supervised, i.e., training does not require any manual filtering. Our neural Gaussian scale-space fields faithfully capture multiscale representations across a broad range of modalities.
  arXiv  Detail & Related papers  (2024-05-31T16:26:08Z)
• FourierMamba: Fourier Learning Integration with State Space Models for Image Deraining [71.46369218331215]
  Image deraining aims to remove rain streaks from rainy images and restore clear backgrounds. We propose a new framework termed FourierMamba, which performs image deraining with Mamba in the Fourier space.
  arXiv  Detail & Related papers  (2024-05-29T18:58:59Z)
• Parameter-Efficient Fine-Tuning with Discrete Fourier Transform [26.563344030824414]
  Low-rank adaptation(LoRA) has recently gained much interest in fine-tuning foundation models. We introduce FourierFT, which treats $Delta W$ as a matrix in the spatial domain and learns only a small fraction of its spectral coefficients. Our method shows comparable or better performance with fewer parameters than LoRA on various tasks.
  arXiv  Detail & Related papers  (2024-05-05T17:15:24Z)
• Data-Driven Filter Design in FBP: Transforming CT Reconstruction with Trainable Fourier Series [3.6508148866314163]
  We introduce a trainable filter for computed tomography (CT) reconstruction within the filtered backprojection (FBP) framework. This method overcomes the limitation in noise reduction by optimizing Fourier series coefficients to construct the filter. Our filter can be easily integrated into existing CT reconstruction models, making it an adaptable tool for a wide range of practical applications.
  arXiv  Detail & Related papers  (2024-01-29T10:47:37Z)
• Trigonometric Quadrature Fourier Features for Scalable Gaussian Process Regression [3.577968559443225]
  Quadrature Fourier Features (QFF) have gained popularity in recent years due to their improved approximation accuracy and better calibrated uncertainty estimates. A key limitation of QFF is that its performance can suffer from well-known pathologies related to highly oscillatory quadrature. We address this critical issue via a new Trigonometric Quadrature Fourier Feature (TQFF) method, which uses a novel non-Gaussian quadrature rule.
  arXiv  Detail & Related papers  (2023-10-23T03:53:09Z)
• FFPN: Fourier Feature Pyramid Network for Ultrasound Image Segmentation [15.011573950064424]
  Ultrasound (US) image segmentation is an active research area that requires real-time and highly accurate analysis in many scenarios. Existing approaches may suffer from inadequate contour encoding or fail to effectively leverage the encoded results. In this paper, we introduce a novel Fourier-anchor-based DTS framework called Fourier Feature Pyramid Network (FFPN) to address the aforementioned issues.
  arXiv  Detail & Related papers  (2023-08-26T07:28:09Z)
• Deep Fourier Up-Sampling [100.59885545206744]
  Up-sampling in the Fourier domain is more challenging as it does not follow such a local property. We propose a theoretically sound Deep Fourier Up-Sampling (FourierUp) to solve these issues.
  arXiv  Detail & Related papers  (2022-10-11T06:17:31Z)
• Fourier Series Expansion Based Filter Parametrization for Equivariant Convolutions [73.33133942934018]
  2D filter parametrization technique plays an important role when designing equivariant convolutions. New equivariant convolution method based on the proposed filter parametrization method, named F-Conv. F-Conv evidently outperforms previous filter parametrization based method in image super-resolution task.
  arXiv  Detail & Related papers  (2021-07-30T10:01:52Z)
• Learning Set Functions that are Sparse in Non-Orthogonal Fourier Bases [73.53227696624306]
  We present a new family of algorithms for learning Fourier-sparse set functions. In contrast to other work that focused on the Walsh-Hadamard transform, our novel algorithms operate with recently introduced non-orthogonal Fourier transforms. We demonstrate effectiveness on several real-world applications.
  arXiv  Detail & Related papers  (2020-10-01T14:31:59Z)
• Fourier Features Let Networks Learn High Frequency Functions in Low Dimensional Domains [69.62456877209304]
  We show that passing input points through a simple Fourier feature mapping enables a multilayer perceptron to learn high-frequency functions. Results shed light on advances in computer vision and graphics that achieve state-of-the-art results.
  arXiv  Detail & Related papers  (2020-06-18T17:59:11Z)

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.