Unsupervised deep learning meets Chan-Vese model
From MaRDI portal
Cites work
- A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
- A fast marching level set method for monotonically advancing fronts.
- A geometric model for active contours in image processing
- A multiphase level set framework for image segmentation using the Mumford and Shah model
- A two-stage image segmentation method using a convex variant of the Mumford-Shah model and thresholding
- A variational level set approach to multiphase motion
- Active contours without edges
- Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Fast Global Minimization of the Active Contour/Snake Model
- scientific article; zbMATH DE number 3076589 (Why is no real title available?)
- Minimization of Region-Scalable Fitting Energy for Image Segmentation
- Optimal approximations by piecewise smooth functions and associated variational problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- The Monte Carlo Method
- Unsupervised deep learning meets Chan-Vese model
This page was built for publication: Unsupervised deep learning meets Chan-Vese model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6929079)