Anisotropic Mesh Adaptation for Image Segmentation Based on Mumford-Shah Functional

• URL: http://arxiv.org/abs/2007.08696v1
• Date: Fri, 17 Jul 2020 00:00:31 GMT
• Title: Anisotropic Mesh Adaptation for Image Segmentation Based on Mumford-Shah Functional
• Authors: Karrar Abbas and Xianping Li
• Abstract summary: We consider image segmentation by solving a partial differentiation equation (PDE) model based on the Mumford-Shah functional. We develop a new algorithm by combining anisotropic mesh adaptation for image representation and finite element method for solving the PDE model.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: As the resolution of digital images increase significantly, the processing of images becomes more challenging in terms of accuracy and efficiency. In this paper, we consider image segmentation by solving a partial differentiation equation (PDE) model based on the Mumford-Shah functional. We develop a new algorithm by combining anisotropic mesh adaptation for image representation and finite element method for solving the PDE model. Comparing to traditional algorithms solved by finite difference method, our algorithm provides faster and better results without the need to resizing the images to lower quality. We also extend the algorithm to segment images with multiple regions.

Related papers

• Parameter-Inverted Image Pyramid Networks [49.35689698870247]
  We propose a novel network architecture known as the Inverted Image Pyramid Networks (PIIP) Our core idea is to use models with different parameter sizes to process different resolution levels of the image pyramid. PIIP achieves superior performance in tasks such as object detection, segmentation, and image classification.
  arXiv  Detail & Related papers  (2024-06-06T17:59:10Z)
• Deep Convolutional Neural Networks Meet Variational Shape Compactness Priors for Image Segmentation [7.314877483509877]
  Shape compactness is a key geometrical property to describe interesting regions in many image segmentation tasks. We propose two novel algorithms to solve the introduced image segmentation problem that incorporates a shape-compactness prior. The proposed algorithms significantly improve IoU by 20% training on a highly noisy image dataset.
  arXiv  Detail & Related papers  (2024-05-23T11:05:35Z)
• Optimize and Reduce: A Top-Down Approach for Image Vectorization [12.998637003026273]
  We propose Optimize & Reduce (O&R), a top-down approach to vectorization that is both fast and domain-agnostic. O&R aims to attain a compact representation of input images by iteratively optimizing B'ezier curve parameters. We demonstrate that our method is domain agnostic and outperforms existing works in both reconstruction and perceptual quality for a fixed number of shapes.
  arXiv  Detail & Related papers  (2023-12-18T16:41:03Z)
• Difference of Anisotropic and Isotropic TV for Segmentation under Blur and Poisson Noise [2.6381163133447836]
  We adopt a smoothing-and-thresholding (SaT) segmentation framework that finds awise-smooth solution, followed by $k-means to segment the image. Specifically for the image smoothing step, we replace the maximum noise in the MumfordShah model with a maximum variation of anisotropic total variation (AITV) as a regularization. Convergence analysis is provided to validate the efficacy of the scheme.
  arXiv  Detail & Related papers  (2023-01-06T01:14:56Z)
• Learning Discriminative Shrinkage Deep Networks for Image Deconvolution [122.79108159874426]
  We propose an effective non-blind deconvolution approach by learning discriminative shrinkage functions to implicitly model these terms. Experimental results show that the proposed method performs favorably against the state-of-the-art ones in terms of efficiency and accuracy.
  arXiv  Detail & Related papers  (2021-11-27T12:12:57Z)
• Deep Variational Network Toward Blind Image Restoration [60.45350399661175]
  Blind image restoration is a common yet challenging problem in computer vision. We propose a novel blind image restoration method, aiming to integrate both the advantages of them. Experiments on two typical blind IR tasks, namely image denoising and super-resolution, demonstrate that the proposed method achieves superior performance over current state-of-the-arts.
  arXiv  Detail & Related papers  (2020-08-25T03:30:53Z)
• Depth image denoising using nuclear norm and learning graph model [107.51199787840066]
  Group-based image restoration methods are more effective in gathering the similarity among patches. For each patch, we find and group the most similar patches within a searching window. The proposed method is superior to other current state-of-the-art denoising methods in both subjective and objective criterion.
  arXiv  Detail & Related papers  (2020-08-09T15:12:16Z)
• The Power of Triply Complementary Priors for Image Compressive Sensing [89.14144796591685]
  We propose a joint low-rank deep (LRD) image model, which contains a pair of complementaryly trip priors. We then propose a novel hybrid plug-and-play framework based on the LRD model for image CS. To make the optimization tractable, a simple yet effective algorithm is proposed to solve the proposed H-based image CS problem.
  arXiv  Detail & Related papers  (2020-05-16T08:17:44Z)
• A Weighted Difference of Anisotropic and Isotropic Total Variation for Relaxed Mumford-Shah Color and Multiphase Image Segmentation [2.6381163133447836]
  We present a class of piecewise-constant image segmentation models that incorporate a difference of anisotropic and isotropic total variation. In addition, a generalization to color image segmentation is discussed.
  arXiv  Detail & Related papers  (2020-05-09T09:35:44Z)
• Image Denoising Using Sparsifying Transform Learning and Weighted Singular Values Minimization [7.472473280743767]
  In image denoising (IDN) processing, the low-rank property is usually considered as an important image prior. As a convex relaxation approximation of low rank, nuclear norm based algorithms and their variants have attracted significant attention. By taking both advantages of image domain minimization and transform domain in a general framework, we propose a sparsity learning transform method.
  arXiv  Detail & Related papers  (2020-04-02T00:30:29Z)
• GACEM: Generalized Autoregressive Cross Entropy Method for Multi-Modal Black Box Constraint Satisfaction [69.94831587339539]
  We present a modified Cross-Entropy Method (CEM) that uses a masked auto-regressive neural network for modeling uniform distributions over the solution space. Our algorithm is able to express complicated solution spaces, thus allowing it to track a variety of different solution regions.
  arXiv  Detail & Related papers  (2020-02-17T20:21:20Z)

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.