Direct Estimation of Appearance Models for Segmentation

• URL: http://arxiv.org/abs/2102.11121v1
• Date: Mon, 22 Feb 2021 15:50:39 GMT
• Title: Direct Estimation of Appearance Models for Segmentation
• Authors: Jeova F. S. Rocha Neto, Pedro Felzenszwalb, Marilyn Vazquez
• Abstract summary: We describe a novel approach for estimating appearance models directly from an image. Our approach is based on algebraic expressions that relate local image statistics to the appearance models of spatially coherent regions. We present experimental results that demonstrate the proposed methods work well in practice and lead to effective image segmentation algorithms.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Image segmentation algorithms often depend on appearance models that characterize the distribution of pixel values in different image regions. We describe a novel approach for estimating appearance models directly from an image, without explicit consideration of the pixels that make up each region. Our approach is based on algebraic expressions that relate local image statistics to the appearance models of spatially coherent regions. We describe two algorithms that can use the aforementioned algebraic expressions for estimating appearance models. The first algorithm is based on solving a system of linear and quadratic equations. The second algorithm is a spectral method based on an eigenvector computation. We present experimental results that demonstrate the proposed methods work well in practice and lead to effective image segmentation algorithms.

Related papers

• Efficient Fairness-Performance Pareto Front Computation [51.558848491038916]
  We show that optimal fair representations possess several useful structural properties. We then show that these approxing problems can be solved efficiently via concave programming methods.
  arXiv  Detail & Related papers  (2024-09-26T08:46:48Z)
• COBRA -- COnfidence score Based on shape Regression Analysis for method-independent quality assessment of object pose estimation from single images [1.6249398255272316]
  We present a generic algorithm for scoring pose estimation methods that rely on single image semantic analysis. The algorithm employs a lightweight putative shape representation using a combination of multiple Gaussian Processes. Our confidence measure comprises the average mixture probability of pixel back-projections onto the shape template.
  arXiv  Detail & Related papers  (2024-04-25T09:55:35Z)
• SAR image segmentation algorithms based on I-divergence-TV model [0.7458485930898191]
  We propose a novel variational active contour model based on I-divergence-TV model to segment Synthetic aperture radar (SAR) images with multiplicative gamma noise. The proposed model can efficiently stop the contours at weak or blurred edges, and can automatically detect the exterior and interior boundaries of images.
  arXiv  Detail & Related papers  (2023-12-09T04:14:46Z)
• Solving Linear Inverse Problems Provably via Posterior Sampling with Latent Diffusion Models [98.95988351420334]
  We present the first framework to solve linear inverse problems leveraging pre-trained latent diffusion models. We theoretically analyze our algorithm showing provable sample recovery in a linear model setting.
  arXiv  Detail & Related papers  (2023-07-02T17:21:30Z)
• Estimating Appearance Models for Image Segmentation via Tensor Factorization [0.0]
  We propose a new approach to directly estimate appearance models from the image without prior information on the underlying segmentation. Our method uses local high order color statistics from the image as an input to tensor factorization-based estimator for latent variable models. This approach is able to estimate models in multiregion images and automatically output the regions proportions without prior user interaction.
  arXiv  Detail & Related papers  (2022-08-16T17:21:00Z)
• Sampling from Arbitrary Functions via PSD Models [55.41644538483948]
  We take a two-step approach by first modeling the probability distribution and then sampling from that model. We show that these models can approximate a large class of densities concisely using few evaluations, and present a simple algorithm to effectively sample from these models.
  arXiv  Detail & Related papers  (2021-10-20T12:25:22Z)
• Model-free Representation Learning and Exploration in Low-rank MDPs [64.72023662543363]
  We present the first model-free representation learning algorithms for low rank MDPs. Key algorithmic contribution is a new minimax representation learning objective. Result can accommodate general function approximation to scale to complex environments.
  arXiv  Detail & Related papers  (2021-02-14T00:06:54Z)
• Joint Estimation of Image Representations and their Lie Invariants [57.3768308075675]
  Images encode both the state of the world and its content. The automatic extraction of this information is challenging because of the high-dimensionality and entangled encoding inherent to the image representation. This article introduces two theoretical approaches aimed at the resolution of these challenges.
  arXiv  Detail & Related papers  (2020-12-05T00:07:41Z)
• Iterative regularization algorithms for image denoising with the TV-Stokes model [4.09305676000817]
  We propose a set of iterative regularization algorithms for the TV-Stokes model to restore images from noisy images with Gaussian noise. We have experimental results that show improvement over the original method in the quality of the restored image.
  arXiv  Detail & Related papers  (2020-09-24T22:55:18Z)
• 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)
• Convex Shape Representation with Binary Labels for Image Segmentation: Models and Fast Algorithms [7.847719964338735]
  We present a novel and effective binary representation for convex shapes. We show the equivalence between the shape convexity and some properties of the associated indicator function.
  arXiv  Detail & Related papers  (2020-02-22T01:55: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.