An Iterative Superpixel Algorithm based on Color Variances and Cross Seams
| Autor: | Ching-Chi Huang, 黃敬棋 |
|---|---|
| Rok vydání: | 2016 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 104 In recent years, superpixel algorithms have various applications and have been widely studied. It is commonly used on many applications such as image segmentation and obstacles detections since superpixels can reduce the resolution of images and maintain image structure at the same time. This means that superpixels can accelerate the processing speed of images. Moreover, some of applications even requires real-time execution performance in superpixel generation. Many researches have tried to preserve the accuracy as high as possible while reducing the computation time and complexity in the superpixel generation. In this thesis, we propose a seam-carving based refinement method to refine and produce superpixels. The proposed method can refine existing superpixels with two major steps. First is to choose a superpixel candidate by analyzing color variances of each superpixel. Second is to split a superpixel by a cross seam which is obtained by dynamic programming. The experimental results show that the proposed method can obviously improve existing superpixel label map’s accuracy. By comparing to other superpixel algorithms, the proposed method can reach similar accuracy as the known best SLIC superpixel when refining an image from only a single label. The complexity of the proposed system is O(n log n) where n is the number of superpixel. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|