Introduction - If you have any usage issues, please Google them yourself
Shot into a weighted undirected graph, including super pixels as the vertices in the graph, and the adjacent pixels by boundary between Is linked together, calculated the degree of similarity between super pixels corresponding edge weights, sort through combined weights of the smallest two at a time A pixel.