什么是分水岭算法:定义在灰度图的变换。为什么叫分水岭?将水流格挡开。在地质学中,分水岭是分隔相邻集水盆地的分水岭。
五种定义
(1)洪水分水岭(Serge Beucher and Christian Lantuéj workshop on image processing, real-time edge and motion detection (1979)/Priority-flood: An optimal depression-filling and watershed-labeling algorithm for digital elevation models.)
(2) 拓扑距离分水岭
(3)水滴下落原则分水岭(Watershed Cuts: Minimum Spanning Forests and the Drop of Water Principle)
(4)像素内部分水岭( The morphological approach to segmentation: the watershed transformation)(简单的形态学分水岭算法http://cmm.ensmp.fr/~beucher/wtshed.html)
(5)拓扑分水岭(Topological gray-scale watershed transform,. Quasi-linear algorithms for the topological watershed, On topological watersheds)(https://perso.esiee.fr/~coupriem/tw/)
两种算法:
Meyer洪水分水岭(Meyer’s flooding algorithm)
最佳生成森林算法(Optimal spanning forest algorithms (watershed cuts)
与其他图像存在的三大关联:
与图割之间的关系:Some links between min-cuts, optimal spanning forests and watersheds
最短路径深林:The image foresting transform: theory, algorithms, and applications
Random walker
- 随机漫步算法(存在狄利克雷问题):Random walks for image segmentation
- 证明: A New Image Segmentation Framework Extending Graph Cuts, Random Walker and Optimal Spanning Forest
3D分水岭算法不太了解。