paper-with-me

홈 › Papers

Probabilistic U-Net with Kendall Shape Spaces for Geometry-Aware Segmentations of Images

2024-10-17 · Jiyoung Park, Günay Doğan

One of the fundamental problems in computer vision is image segmentation, the task of detecting distinct regions or objects in given images. Deep Neural Networks (DNN) have been shown to be very effective in segmenting challenging images, producing convincing segmentations. There is further need for probabilistic DNNs that can reflect the uncertainties from the input images and the models into the computed segmentations, in other words, new DNNs that can generate multiple plausible segmentations and their distributions depending on the input or the model uncertainties. While there are existing probabilistic segmentation models, many of them do not take into account the geometry or shape underlying the segmented regions. In this paper, we propose a probabilistic image segmentation model that can incorporate the geometry of a segmentation. Our proposed model builds on the Probabilistic U-Net of \cite{kohl2018probabilistic} to generate probabilistic segmentations, i.e.\! multiple likely segmentations for an input image. Our model also adopts the Kendall Shape Variational Auto-Encoder of \cite{vadgama2023kendall} to encode a Kendall shape space in the latent variable layers of the prior and posterior networks of the Probabilistic U-Net. Incorporating the shape space in this manner leads to a more robust segmentation with spatially coherent regions, respecting the underlying geometry in the input images.

📄 PDF Abstract BibTeX arXiv:2410.14017

Code (0)

등록된 구현이 없습니다.

Tasks

Image SegmentationSegmentationSemantic Segmentation

Methods 이 논문이 사용한 방법론

ReLU How Do I Communicate to Expedia? How Do I Communicate to Expedia? – Call ☎️ +1-(888) 829 (0881) or +1-805-330-4056 or +1-805-330-4056 for Live Support & Special Travel…
Concatenated Skip Connection A Concatenated Skip Connection is a type of skip connection that seeks to reuse features by concatenating them to new layers, allowing more information to be retained from…
Max Pooling Max Pooling is a pooling operation that calculates the maximum value for patches of a feature map, and uses it to create a downsampled (pooled) feature map. It is usually…
Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
U-Net 설명 없음

Similar Papers 제목 키워드 기반

A Framework for Shape Analysis via Hilbert Space Embedding

2014-12-13 · Sadeep Jayasumana, Mathieu Salzmann, Hongdong Li, Mehrtash Harandi

We propose a framework for 2D shape analysis using positive definite kernels defined on Kendall's shape manifold. Different representations of 2D shapes are known to generate different nonlinear spaces. Due to the nonlin…

ClusteringGeneral ClassificationRetrieval

Landmark shape spaces with induced metrics

2026-07-30 · Sarang Joshi, Peter W. Michor, Stefan Sommer arxiv

We present a unification of Kendall's landmark shape spaces, where rigid motions are factored out and scale fixed on landmark configurations equipped with Euclidean geometry, with landmark configuration spaces carrying R…

KShapeNet: Riemannian network on Kendall shape space for Skeleton based Action Recognition

2020-11-24 · Racha Friji, Hassen Drira, Faten Chaieb, Sebastian Kurtek 외

Deep Learning architectures, albeit successful in most computer vision tasks, were designed for data with an underlying Euclidean structure, which is not usually fulfilled since pre-processed data may lie on a non-linear…

Action RecognitionDeep LearningSkeleton Based Action Recognition

Wrapped Gaussian Process Regression on Riemannian Manifolds

2018-06-01 · CVPR 2018 6 · Anton Mallasto, Aasa Feragen

Gaussian process (GP) regression is a powerful tool in non-parametric regression providing uncertainty estimates. However, it is limited to data in vector spaces. In fields such as shape analysis and diffusion tensor ima…

Gaussian Processesregression

Dictionary Learning for Two-Dimensional Kendall Shapes

2020-01-11

We propose a novel sparse dictionary learning method for planar shapes in the sense of Kendall, namely configurations of landmarks in the plane considered up to similitudes. Our shape dictionary method provides a good tr…

Dictionary LearningVocal Bursts Valence Prediction