MinimalSurfaceParti​tioning

버전 1.0 (86.8 KB) 작성자: Dominique Zosso
A minimal surface criterion and its linearized version (Dirichlet criterion) for graph partitioning
다운로드 수: 263
업데이트 날짜: 2016/11/7

라이선스 보기

We consider a geometric approach to graph partitioning based on the graph Beltrami energy, a discrete version of a functional that appears in classical minimal surface problems. More specifically, the optimality criterion is given by the sum of the minimal Beltrami energies of the partition components. We adapt primal-dual convex optimization methods to solve for the minimal Beltrami energy for each component of a given partition. A rearrangement algorithm is proposed to find the graph partition to minimize a relaxed version of the objective.
We also provide efficient code to solve the much faster, linearized minimal surface criterion instead (Dirichlet energy).

The toolbox includes a simple five-moons test data set (dbmoon.mat) and example code to reproduce the five-moons example.

The code is immediately based on the following two papers (to referred to as documentation and to be cited as reference):

[1] Dominique Zosso, Braxton Osting, "A minimal surface criterion for graph partitioning", Inverse Problems and Imaging 10(4):1149-1180, 2016. http://dx.doi.org/10.3934/ipi.2016036

and its linearized, faster version :

[2] Dominique Zosso, Braxton Osting, Stanley J. Osher, "A Dirichlet Energy Criterion for Graph-Based Image Segmentation", 2015 IEEE ICDM Workshop. http://dx.doi.org/10.1109/ICDMW.2015.112

인용 양식

Dominique Zosso (2024). MinimalSurfacePartitioning (https://www.mathworks.com/matlabcentral/fileexchange/60142-minimalsurfacepartitioning), MATLAB Central File Exchange. 검색됨 .

MATLAB 릴리스 호환 정보
개발 환경: R2016a
모든 릴리스와 호환
플랫폼 호환성
Windows macOS Linux
카테고리
Help CenterMATLAB Answers에서 Particle Swarm에 대해 자세히 알아보기

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
버전 게시됨 릴리스 정보
1.0