论文信息 - Image Segmentation by Relaxed Deep Extreme Cut with Connected Extreme Points - 字舞流文

Image Segmentation by Relaxed Deep Extreme Cut with Connected Extreme Points

Paulo André Vechiatto Miranda | Caio L. Demario | Débora E. C. Oliveira

[1] Vladimir Kolmogorov,et al. "GrabCut": interactive foreground extraction using iterated graph cuts , 2004, ACM Trans. Graph..

[2] Olga Veksler,et al. Fast Approximate Energy Minimization via Graph Cuts , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[3] Alexandre X. Falcão,et al. Graph-Based Image Segmentation Using Dynamic Trees , 2018, CIARP.

[4] Jayaram K. Udupa,et al. Synergistic arc-weight estimation for interactive image segmentation using graphs , 2010, Comput. Vis. Image Underst..

[5] Alexandre X. Falcão,et al. Riverbed: A Novel User-Steered Image Segmentation Method Based on Optimum Boundary Tracking , 2012, IEEE Transactions on Image Processing.

[6] Jorge Stolfi,et al. The image foresting transform: theory, algorithms, and applications , 2004 .

[7] Krzysztof Ciesielski,et al. Path-Value Functions for Which Dijkstra’s Algorithm Returns Optimal Mapping , 2018, Journal of Mathematical Imaging and Vision.

[8] L. R. Dice. Measures of the Amount of Ecologic Association Between Species , 1945 .

[9] Lucy A. C. Mansilla,et al. Oriented Image Foresting Transform Segmentation by Seed Competition , 2014, IEEE Transactions on Image Processing.

[10] Leo Grady,et al. Random Walks for Image Segmentation , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.