Superpixel Generation by Agglomerative Clustering With Quadratic Error Minimization
| dc.contributor.author | Dong, Xiao | en_US |
| dc.contributor.author | Chen, Zhonggui | en_US |
| dc.contributor.author | Yao, Junfeng | en_US |
| dc.contributor.author | Guo, Xiaohu | en_US |
| dc.contributor.editor | Chen, Min and Benes, Bedrich | en_US |
| dc.date.accessioned | 2019-03-17T09:56:58Z | |
| dc.date.available | 2019-03-17T09:56:58Z | |
| dc.date.issued | 2019 | |
| dc.description.abstract | Superpixel segmentation is a popular image pre‐processing technique in many computer vision applications. In this paper, we present a novel superpixel generation algorithm by agglomerative clustering with quadratic error minimization. We use a quadratic error metric (QEM) to measure the difference of spatial compactness and colour homogeneity between superpixels. Based on the quadratic function, we propose a bottom‐up greedy clustering algorithm to obtain higher quality superpixel segmentation. There are two steps in our algorithm: merging and swapping. First, we calculate the merging cost of two superpixels and iteratively merge the pair with the minimum cost until the termination condition is satisfied. Then, we optimize the boundary of superpixels by swapping pixels according to their swapping cost to improve the compactness. Due to the quadratic nature of the energy function, each of these atomic operations has only (1) time complexity. We compare the new method with other state‐of‐the‐art superpixel generation algorithms on two datasets, and our algorithm demonstrates superior performance.Superpixel segmentation is a popular image pre‐processing technique in many computer vision applications. In this paper, we present a novel superpixel generation algorithm by agglomerative clustering with quadratic error minimization. We use a quadratic error metric (QEM) to measure the difference of spatial compactness and colour homogeneity between superpixels. Based on the quadratic function, we propose a bottom‐up greedy clustering algorithm to obtain higher quality superpixel segmentation. There are two steps in our algorithm: merging and swapping. First, we calculate the merging cost of two superpixels and iteratively merge the pair with the minimum cost until the termination condition is satisfied. Then, we optimize the boundary of superpixels by swapping pixels according to their swapping cost to improve the compactness. Due to the quadratic nature of the energy function, each of these atomic operations has only O(1) time complexity. We compare the new method with other state‐of‐the‐art superpixel generation algorithms on two datasets, and our algorithm demonstrates superior performance. | en_US |
| dc.description.number | 1 | |
| dc.description.sectionheaders | Articles | |
| dc.description.seriesinformation | Computer Graphics Forum | |
| dc.description.volume | 38 | |
| dc.identifier.doi | 10.1111/cgf.13538 | |
| dc.identifier.issn | 1467-8659 | |
| dc.identifier.pages | 405-416 | |
| dc.identifier.uri | https://doi.org/10.1111/cgf.13538 | |
| dc.identifier.uri | https://diglib.eg.org:443/handle/10.1111/cgf13538 | |
| dc.publisher | © 2019 The Eurographics Association and John Wiley & Sons Ltd. | en_US |
| dc.subject | image segmentation | |
| dc.subject | image and video processing | |
| dc.subject | Computing methodologies∼Image processing | |
| dc.title | Superpixel Generation by Agglomerative Clustering With Quadratic Error Minimization | en_US |