Connected-component labeling based on hypercubes for memory constrained scenarios

作者：

Highlights：

• The methods are derived from independent spanning tree over the hypercube graph.

• The proposed algorithms do not require any data structure on the labeling process.

• Several test images used to demonstrate the effectiveness of the proposed approaches.

摘要

•The methods are derived from independent spanning tree over the hypercube graph.•The proposed algorithms do not require any data structure on the labeling process.•Several test images used to demonstrate the effectiveness of the proposed approaches.

论文关键词：Connected components,Image analysis,Hypercube graph,Independent spanning trees

论文评审过程：Received 1 February 2016, Revised 31 May 2016, Accepted 1 June 2016, Available online 3 June 2016, Version of Record 6 June 2016.

论文官网地址：https://doi.org/10.1016/j.eswa.2016.06.002