Simpler editing of graph-based segmentation hierarchies using zipping algorithms
作者：
Highlights：
• We present reusable algorithms to simplify segmentation hierarchy editing.
• They allow hierarchical segmentation techniques to make better use of user input.
• We show the use of our algorithms for non-sibling node merging and parent switching.
• Non-sibling node merging hugely reduces input requirements for >55% of merges.
• Parent switching allows 4× more switches than the state-of-the-art relinking method.
摘要
•We present reusable algorithms to simplify segmentation hierarchy editing.•They allow hierarchical segmentation techniques to make better use of user input.•We show the use of our algorithms for non-sibling node merging and parent switching.•Non-sibling node merging hugely reduces input requirements for >55% of merges.•Parent switching allows 4× more switches than the state-of-the-art relinking method.
论文关键词：Graph-based,Segmentation hierarchy,User interaction
论文评审过程：Received 17 July 2016, Revised 11 February 2017, Accepted 6 April 2017, Available online 20 April 2017, Version of Record 10 May 2017.
论文官网地址：https://doi.org/10.1016/j.patcog.2017.04.007
