Hermite coordinate interpolation kernels: application to image zooming

• URL: http://arxiv.org/abs/2403.13195v1
• Date: Tue, 19 Mar 2024 23:06:10 GMT
• Title: Hermite coordinate interpolation kernels: application to image zooming
• Authors: Konstantinos K. Delibasis, Iro Oikonomou, Aristides I. Kechriniotis, Georgios N. Tsigaridas,
• Abstract summary: A number of basic image processing tasks, such as any geometric transformation require at subpixel image values. In this work we utilize the multidimensional Hermite spline defined on non-equal spaced rectilinear grids. We show that despite the increased complexity of the interpolant, once the kernels are constructed, the Hermite spline can be applied to images as efficiently as any other less complicated method.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: A number of basic image processing tasks, such as any geometric transformation require interpolation at subpixel image values. In this work we utilize the multidimensional coordinate Hermite spline interpolation defined on non-equal spaced, rectilinear grids and apply it to a very common image processing task, image zooming. Since Hermite interpolation utilizes function values, as well as partial derivative values, it is natural to apply it to image processing tasks as a special case of equi-spaced grid, using numerical approximations of the image partial derivatives at each pixel. Furthermore, the task of image interpolation requires the calculation of image values at positions with nono-zero fractional part. Thus, any spline interpolation can be written as convolution with an appropriate kernel. In this context we generate the Hermite kernels according to the derived $n-$dimensional interpolant of Theorem 2 in [1]. We show that despite the increased complexity of the interpolant, once the kernels are constructed, the Hermite spline interpolation can be applied to images as efficiently as any other less complicated method. Finally, we perform illustrative numerical examples to showcase the applicability and high accuracy of the proposed Hermite kernels for image zooming, compared to other interpolation methods, both traditional convolution-based, as well as employing deep learning, in terms of PSNR, as well as SSIM error metrics. The proposed Hermite spline kernels outperform all other methods in the majority of the test images, in experiments using many cascaded repetitions of the zoom operation. Interesting conclusions can be drawn considering all methods under comparison.

Related papers

• GlobalMamba: Global Image Serialization for Vision Mamba [73.50475621164037]
  Vision mambas have demonstrated strong performance with linear complexity to the number of vision tokens. Most existing methods employ patch-based image tokenization and then flatten them into 1D sequences for causal processing. We propose a global image serialization method to transform the image into a sequence of causal tokens.
  arXiv  Detail & Related papers  (2024-10-14T09:19:05Z)
• Video Frame Interpolation with Many-to-many Splatting and Spatial Selective Refinement [83.60486465697318]
  We propose a fully differentiable Many-to-Many (M2M) splatting framework to interpolate frames efficiently. For each input frame pair, M2M has a minuscule computational overhead when interpolating an arbitrary number of in-between frames. We extend an M2M++ framework by introducing a flexible Spatial Selective Refinement component, which allows for trading computational efficiency for quality and vice versa.
  arXiv  Detail & Related papers  (2023-10-29T09:09:32Z)
• 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)
• Dynamic Implicit Image Function for Efficient Arbitrary-Scale Image Representation [24.429100808481394]
  We propose Dynamic Implicit Image Function (DIIF), which is a fast and efficient method to represent images with arbitrary resolution. We propose a coordinate grouping and slicing strategy, which enables the neural network to perform decoding from coordinate slices to pixel value slices. With dynamic coordinate slicing, DIIF significantly reduces the computational cost when encountering arbitrary-scale SR.
  arXiv  Detail & Related papers  (2023-06-21T15:04:34Z)
• 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)
• Adaptive Local Implicit Image Function for Arbitrary-scale Super-resolution [61.95533972380704]
  Local implicit image function (LIIF) denotes images as a continuous function where pixel values are expansion by using the corresponding coordinates as inputs. LIIF can be adopted for arbitrary-scale image super-resolution tasks, resulting in a single effective and efficient model for various up-scaling factors. We propose a novel adaptive local image function (A-LIIF) to alleviate this problem.
  arXiv  Detail & Related papers  (2022-08-07T11:23:23Z)
• Two-Stream Graph Convolutional Network for Intra-oral Scanner Image Segmentation [133.02190910009384]
  We propose a two-stream graph convolutional network (i.e., TSGCN) to handle inter-view confusion between different raw attributes. Our TSGCN significantly outperforms state-of-the-art methods in 3D tooth (surface) segmentation.
  arXiv  Detail & Related papers  (2022-04-19T10:41:09Z)
• Many-to-many Splatting for Efficient Video Frame Interpolation [80.10804399840927]
  Motion-based video frame relies on optical flow to warp pixels from inputs to desired instant. Many-to-Many (M2M) splatting framework to interpolate frames efficiently. M2M has minuscule computational overhead when interpolating arbitrary number of in-between frames.
  arXiv  Detail & Related papers  (2022-04-07T15:29:42Z)
• Interpolating Points on a Non-Uniform Grid using a Mixture of Gaussians [0.0]
  We propose an approach to perform non-uniform image based on a Gaussian Mixture Model. Traditional image methods assume that the coordinates you want to interpolate from, are positioned on a uniform grid.
  arXiv  Detail & Related papers  (2020-12-24T13:59:39Z)
• Locally Masked Convolution for Autoregressive Models [107.4635841204146]
  LMConv is a simple modification to the standard 2D convolution that allows arbitrary masks to be applied to the weights at each location in the image. We learn an ensemble of distribution estimators that share parameters but differ in generation order, achieving improved performance on whole-image density estimation.
  arXiv  Detail & Related papers  (2020-06-22T17:59:07Z)
• The Semantic Mutex Watershed for Efficient Bottom-Up Semantic Instance Segmentation [15.768804877756384]
  We propose a greedy algorithm for joint graph partitioning and labeling. Due to the algorithm's efficiency it can operate directly on pixels without prior over-segmentation of the image into superpixels.
  arXiv  Detail & Related papers  (2019-12-29T19:48:39Z)

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.