Skip to content
Minimal Partition (Chan-Vese) with Minimal Proximal splitting scheme. Application to image segmentation and depth map disparity.
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
article
build
images
include
Licence_CeCILL-B_V1-en.txt
Licence_CeCILL-B_V1-fr.txt
README.md
demo_disparitymap.m
demo_disparitymap_comp.m
demo_segmentation.m
demo_segmentation_comp.m

README.md

MPMS

Minimal Partition (Chan-Vese) with Minimal Proximal splitting scheme. Application to image segmentation and depth map disparity.



  • RECOMMENDATIONS:
  • This toolbox is designed to work with Matlab 2017.b

DESCRIPTION: Proximal splitting algorithms for convex optimization are largely used in signal and image processing. They make possible to call the individual proximity operators of an arbitrary number of functions, whose sum is to be minimized. But the larger this number, the slower the convergence. In this work, we show how to compute the proximity operator of a sum of two functions, for a certain type of functions operating on objects having a graph structure. The gain provided by avoiding unnecessary splitting is illustrated by an application to image segmentation and depth map estimation.


HOW TO RUN:

  1. compile the mex files : cd include/ mex proj_decreasing_mex.c

  2. run the demo files :

  • segmentation: "demo_segmentation.m" or "demo_segmentation_comp.m"
  • disparity map: "demo_disparitymap.m" or "demo_disparitymap_comp.m"

The main function is "algo_MPMS".


RELATED PUBLICATION:

N. Pustelnik, L. Condat, Proximity operator of a sum of functions; Application to depth map estimation, IEEE Signal Processing Letters, vol. 24, no. 12, Dec. 2017


You can’t perform that action at this time.