Browse > Article
http://dx.doi.org/10.9708/jksci.2011.16.7.149

Effectiveness of Edge Selection on Mobile Devices  

Kang, Seok-Hoon (Dept. of Emebedded System Engineering, University of Incheon)
Publication Information
Journal of the Korea Society of Computer and Information / v.16, no.7, 2011 , pp. 149-156 More about this Journal
Abstract
This paper proposes the effective edge selection algorithm for the rapid processing time and low memory usage of efficient graph-based image segmentation on mobile device. The graph-based image segmentation algorithm is to extract objects from a single image. The objects are consisting of graph edges, which are created by information of each image's pixel. The edge of graph is created by the difference of color intensity between the pixel and neighborhood pixels. The object regions are found by connecting the edges, based on color intensity and threshold value. Therefore, the number of edges decides on the processing time and amount of memory usage of graph-based image segmentation. Comparing to personal computer, the mobile device has many limitations such as processor speed and amount of memory. Additionally, the response time of application is an issue of mobile device programming. The image processing on mobile device should offer the reasonable response time, so that, the image segmentation processing on mobile should provide with the rapid processing time and low memory usage. In this paper, we demonstrate the performance of the effective edge selection algorithm, which effectively controls the edges of graph for the rapid processing time and low memory usage of graph-based image segmentation on mobile device.
Keywords
Mobile; Image Segmentation; Super Pixel;
Citations & Related Records
연도 인용수 순위
  • Reference
1 D. Comaniciu and P. Meer, "Mean shift analysis and applications", Proceedings of IEEE Conference
2 J. Shi and J. Malik, "Normalized cuts and Image Segmentation", Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 731-737, 1997
3 D. Comaniciu and P. Meer, "Robust analysis of feature spaces: color Image Segmentation", Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, pp. 750-755, 1997
4 Derek Hoiem, Alexei Efros, and Martial Hebert. "Recovering surface layout from an image", International Journal of Computer Vision, 75, pp. 151-172, 2007.   DOI   ScienceOn
5 T. Pavlidas, "Structural Pattern Recognition", Springer-Verlag, 1977
6 C.T. Zahn. "Graph-theoretic methods for detecting and describing gestalt clusters", IEEE Transactions on Computing, Vol 20, pp. 68-86, 1971
7 R. Urquhart. "Graph theoretical clustering based on limited neighborhood sets", Pattern Recognition, vol 15, pp. 173-187, 1982   DOI   ScienceOn
8 M.C. Cooper, "The tractability of segmentation and scene analysis", International Journal of Computer Vision, Vol 30, No 1, pp 27-42, October 1998.   DOI   ScienceOn
9 D. Hoiem, A. A. Efros, and M. Hebert, "Automatic photo pop-up,", ACM SIGGRAPH, 2005.
10 S. Arya and D. M. Mount. "Approximate nearest neighbor searching", Proc. 4th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 271-280, 1993.
11 FELZENSZWALB, P., AND HUTTENLOCHER, D. "Efficient graph-based Image Segmentation", Int. Journal of Computer Vision 59, pp. 167-181, 2004.   DOI