The official code of the paper: Explored Normalized Cut with Random Walk Refining Term for Image Segmentation (IEEE TIP)
Our demo code provides in "demo" (corresponding source code are given in "source"):
- the bipartition-based segmentation
- the cluster-based segmentation
- the contour-based hierarchical segmentation
To test the performance of our ENCut, Please run the demo.m:
- the parameter "k" is the number of partition for the first two method.
- the parameter "thr" is the threshold for the UCM (the third method).
- you can use any image to replace the parameter "img".
We also pre-generate the segmentation result for this test image and save it in the document "segresult":
- the file with suffix '_cluster' is result of the cluster-based segmentation for the ENCut
- the file with suffix '_fcluster' is the result of the cluster-based segmentation for the f-ENCut (ENCut with fast exploring method discussesd in Sec.4 in our paper)
- the file with suffix '_bipart' is the result of the bipartition-based segmentation for the ENCut.
- the file with suffix '_ucm' is the result of the contour-based hierarchical segmentation for the ENCut (with the gPB-OWT-UCM framework).
If you find our work useful in your research, please cite:
@article{ENCut,
title={Explored Normalized Cut With Random Walk Refining Term for Image Segmentation},
author={Zhu, Lei and Kang, Xuejing and Ye, Lizhu and Ming, Anlong},
journal={IEEE Transactions on Image Processing},
volume={31},
pages={2893--2906},
year={2022},
publisher={IEEE}
}