슈퍼픽셀의 밀집도 및 텍스처정보를 이용한 DBSCAN기반 칼라영상분할
A Method of Color Image Segmentation Based on DBSCAN(Density Based Spatial Clustering of Applications with Noise) Using Compactness of Superpixels and Texture Information
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
In this paper, a method of color image segmentation based on DBSCAN(Density Based Spatial Clustering of Applications with Noise) using compactness of superpixels and texture information is presented. The DBSCAN algorithm can generate clusters in large data sets by looking at the local density of data samples, using only two input parameters which called minimum number of data and distance of neighborhood data. Superpixel algorithms group pixels into perceptually meaningful atomic regions, which can be used to replace the rigid structure of the pixel grid. Each superpixel is consist of pixels with similar features such as luminance, color, textures etc. Superpixels are more efficient than pixels in case of large scale image processing. In this paper, superpixels are generated by SLIC(simple linear iterative clustering) as known popular. Superpixel characteristics are described by compactness, uniformity, boundary precision and recall. The compactness is important features to depict superpixel characteristics. Each superpixel is represented by Lab color spaces, compactness and texture information. DBSCAN clustering method applied to these feature spaces to segment a color image. To evaluate the performance of the proposed method, computer simulation is carried out to several outdoor images. The experimental results show that the proposed algorithm can provide good segmentation results on various images.
Abstract
In this paper, a method of color image segmentation based on DBSCAN(Density Based Spatial Clustering of Applications with Noise) using compactness of superpixels and texture information is presented. The DBSCAN algorithm can generate clusters in large data sets by looking at the local density of data samples, using only two input parameters which called minimum number of data and distance of neighborhood data. Superpixel algorithms group pixels into perceptually meaningful atomic regions, which can be used to replace the rigid structure of the pixel grid. Each superpixel is consist of pixels with similar features such as luminance, color, textures etc. Superpixels are more efficient than pixels in case of large scale image processing. In this paper, superpixels are generated by SLIC(simple linear iterative clustering) as known popular. Superpixel characteristics are described by compactness, uniformity, boundary precision and recall. The compactness is important features to depict superpixel characteristics. Each superpixel is represented by Lab color spaces, compactness and texture information. DBSCAN clustering method applied to these feature spaces to segment a color image. To evaluate the performance of the proposed method, computer simulation is carried out to several outdoor images. The experimental results show that the proposed algorithm can provide good segmentation results on various images.
참고문헌 (21)
- Feng Ge, "New Benchmak Image Segmentation Evaluation", Journal of Electronic Imaging, 16(3) (2007)
- S. Makrogiannis, "A region dissimilarity relation that combines feature-space and spatial information for color image segmentation", IEEE Transactions on Systems, Man, and Cybernetics, Part B, 35(1), pp.44~53 (2005)
- W. Tao, "Color Image Segmentation Based on Mean Shift and Normalized Cuts", IEEE Transactions on Systems, Man, and Cybernetics, Part B, 37(5), pp.382~1389 (2007)
- Jong Hyun Park, "Color image segmentation using adaptive mean shift and statistical model-based methods", Computers and Mathematics with Applications, 57, pp.970~980 (2009)
- Zeng Liu, "Varied Density Based Spatial Clustering of Application with Noise", proceedings of IEEE Conference ICSSSM, pp.528~531 (2007)
- Hongfang Zhou, "Research on Adaptive Parameters Determination in DBSCAN Algorithm", Journal of Information & Computational Science, 9(7) (2012)
- Sheikholeslami G, "WaveCluster: A Multi-Resolution Clustering Approach for Very Large Spatial Databases", Proc. 24th Int. Conf. on Very Large DataBases, pp.428~439 (1998)
- Hattori K, "Effective algorithms for the nearest neighbor method in the clustering problem", Pattern Recognition, 26(5), pp.741~746 (1993)
- H. Tian, "Efficetive Image Noise Removal based on Difference Eigenval", Proc. IEEE Conf. on Image Processing, pp.3357~3360 (2011)
- Fan Yang, "Robust Superpixel Tracking", IEEE Transaction on Image Processing, 23(4), pp.1639~1651 (2014)
- Andrea Vedaldi, "Quick Shift and Kernel Methods for Mode Seeking", Lecture Notes in Computer Science, 5305, pp.705~718 (2008)
- SLIC Superpixels, "Radhakrishna Achanta", EPFL, ~, pp.EPFL Technical Report 149300 (2010)
- J. Shi, "Normalized Cuts and Image Segmentation", IEEE Trans. Pattern Anal. Mach. Intell, 22(8), pp.888~905 (2000)
- Nocedal, Jorge, "Numerical Optimization" (2000), Springer Verlag
- D. H. P. Felzenszwalb, "Efficient Graph-based Image Segmentation", Journal of Computer Vision, 59(2), pp.167~181 (2004)
- 이정환, "칼라특징공간별 SLIC기반 슈퍼픽셀의 특성비교", (사)디지털산업정보학회 논문지, 10(4), pp.151~160 (2014), (사)디지털산업정보학회
- "Image Segmentation using SLIC SuperPixels and DBSCAN Clustering"[URL]
- 이현구, "2DPCA와 영상분할을 이용한 얼굴인식", (사)디지털산업정보학회 논문지, 8(2), pp.31~40 (2012), (사)디지털산업정보학회[DOI]
- Jeong Hwan Lee, "Texture Characteristics with Eigenvalue and Superpixel Generation", Proceeding of Korea Multimedia Society, 1 (2015)
- R. Achanta, "SLIC Superpixel Compared to State-of-the-art Superpixel Method", IEEE Transaction on Pattern Analysis and Machine Intelligence, 34(11), pp.2274~2282 (2012)
- Jeong Hwan Lee, "Color Image Segmentation Using Compactness of Superpixels", Proceeding of Korea Multimedia Society, 2 (2015)