Open Access Open Access  Restricted Access Subscription or Fee Access

Image Watershed Segmentation using Super Pixels Morphology

K. Veeramanikandan, D. Mahalakshmi, P. Manjamadevi

Abstract


Dynamic Detection and division of rocks is a vital first errand in numerous applications, for example, land examination, planetary science and mining procedures. Rocks are generally portioned utilizing an assortment of components, for example, composition, shading, shape and edges. It is less demanding to register these elements for rock super pixels as opposed to each pixel in the picture. A superpixel is a gathering of spatially lucid pixels that shape an important homogeneous area, generally fitting in with the same item. In this paper, we perform a relative investigation of a percentage of the current superpi.xel calculations on rock pictures as to their capacity to hold fast to picture limits, their pace, and their effect on rock division execution. Additionally, we propose another and exceptionally basic superpixel calculation, Super pixels Using Morphology (SUM), which permutes a watershed change way to deal with effectively produce super pixels. We demonstrate that SUM accomplishes an execution tantamount to the late superpixel calculations on the stone pictures.

Keywords


Morphology, Watershed Segmentation, Area Closing, Super Pixels, Rock Particles.

Full Text:

PDF

References


S. Wang, H. Lu, L. Yang, and M-H. Yang, "Superpixel tracking", in Proc. IEEE Int. Con! Computer Vision, pp. 1323-1330, 2011.

B. Fulkerson, A. Vedaldi, and S. Soatto, “Class segmentation and objectlocalization with superpixel neighborhoods." In Proc. IEEE Int. COIll Computer Vision, pp. 670-677, 2009.

P. Mehrani and O. Veksler, “Saliency segmentation based on leamingand graph cut refinement." in Proc. British Machine Vision COIif., pp.110.1-110.12, 2010.

B. Micusfk and J. Kosecka, “Multi-view superpixel stereo in urbanenvironments," Int. J. Computer Vision vol. 89, no. I,pp. 106-119, Aug.2010.

J. Shi and J. Malik, “Normalized Cuts and [mage Segmentation,” IEEETrans. Pattern. Anal. and Mach. buell., vol. 22, no. 8, pp. 888-905, Aug.2000.

P. F. Felzenszwalb and D. P. Huttenlocher, “Efficient graph-based image segmentation;' Int'l. J. Computer Vision vol. 59, no. 2, pp. 167-181, Sep. 2004.

D. Comaniciu and P. Meer, "Mean shift: A robust approach toward feature space analysis;’ IEEE Trans. Pattern. Anal. Mach. buell, vol. 24, no. 5, pp. 603-619, May 2002.

A. Vedaldi and S. Soatto, “Quick shift and kernel methods for mode seeking;’ in Proc. European COIif. Computer Vision, pp. 705-718, 2008

L.Vincent and P.Soille"Watersheds in digital spaces: an efficient algorithm based on immersion simulations," IEEE Trans. Pattern. Anal. Mach. Intell., vol. 13,1991

O. Veksler, Y. Boykov, and P. Mehrani, “Superpixels and supervoxels inan energy optimization framework,” in Proc. European COlif. Computer Vision, pp. 211-224, 2010.

M. Van den Bergh, X. Boix, G. Roig, B. de Capitani, and L. Van Gool, "SEEDS: superpixels extracted via energy-driven sampling, in Proc. European COIll Computer Vision, pp. 213-26,2012.

A. Levinshtein, A. Stere, K. N. Kutulakos, D. J. Dickinson, and K. Siddiqi, “Turbopixels: Fast superpixels using geometric flows,” IEEE Trans. Pattern. Anal. Mach. buell., vol. 31,2009

R. Achanta, A. Shaji, A. Lucchi, P. Fua, and S. Susstrunk, “SLICsuperpixels compared to state-of-the-art superpixel methods," IEEE Trans. Pattern. Anal. Mach. buell. vol. 34, no. 11,2012

M. Y. Liu, O. Tuzel, S. Ramalingam, and R. Chellappa, “Entropy-rate clustering: cluster analysis via maximizing a submodular function subjectto a matroid constraint,” IEEE Trans. Pattern. Anal. Mach. buell., vol.Jan. 2014.

C. Conrad, M. Mertz, and R. Mester, “Contour-related superpixels;’ inProc. Int. COIll on Energy Minimzation Methods in Computer Vision and Pattern Recognition, pp. 280-293, 2013

P. Neubert and P. Protzel, “Evaluating super pixels in video: metricsbeyond figure-ground segmentation,” in Proc. British Machine Vision Conference, pp. 1-11,2013.

L. Vincent, "Grayscale area openings and closings: their applications and efficient implementation," in EURASIP Workshop on Mathematical Morphology and its Applications to Signal Processing, pp. 22-27,1993

A. Meijster and M. H. F. Wilkinson, “A comparison of algorithms for connected set openings and closings;’ IEEE Trans. Pattern. Anal. Mach. 2002.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.