OSA's Digital Library

Applied Optics

Applied Optics

APPLICATIONS-CENTERED RESEARCH IN OPTICS

  • Editor: Joseph N. Mait
  • Vol. 50, Iss. 21 — Jul. 20, 2011
  • pp: 3947–3957

Subspace learning for Mumford–Shah-model-based texture segmentation through texture patches

Yan Nei Law, Hwee Kuan Lee, and Andy M. Yip  »View Author Affiliations


Applied Optics, Vol. 50, Issue 21, pp. 3947-3957 (2011)
http://dx.doi.org/10.1364/AO.50.003947


View Full Text Article

Enhanced HTML    Acrobat PDF (1244 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

Abstract

In this paper, we develop a robust and effective algorithm for texture segmentation and feature selection. The approach is to incorporate a patch-based subspace learning technique into the subspace Mumford–Shah (SMS) model to make the minimization of the SMS model robust and accurate. The proposed method is fully unsupervised in that it removes the need to specify training data, which is required by existing methods for the same model. We further propose a novel (to our knowledge) pairwise dissimilarity measure for pixels. Its novelty lies in the use of the relevance scores of the features of each pixel to improve its discriminating power. Some superior results are obtained compared to existing unsupervised algorithms, which do not use a subspace approach. This confirms the usefulness of the subspace approach and the proposed unsupervised algorithm.

© 2011 Optical Society of America

OCIS Codes
(100.0100) Image processing : Image processing
(100.2000) Image processing : Digital image processing
(100.5010) Image processing : Pattern recognition
(100.4994) Image processing : Pattern recognition, image transforms

ToC Category:
Image Processing

History
Original Manuscript: December 9, 2010
Revised Manuscript: April 25, 2011
Manuscript Accepted: April 30, 2011
Published: July 13, 2011

Citation
Yan Nei Law, Hwee Kuan Lee, and Andy M. Yip, "Subspace learning for Mumford–Shah-model-based texture segmentation through texture patches," Appl. Opt. 50, 3947-3957 (2011)
http://www.opticsinfobase.org/ao/abstract.cfm?URI=ao-50-21-3947


Sort:  Author  |  Year  |  Journal  |  Reset  

References

  1. P. Petrou and P. G. Sevilla, Dealing with Texture (Wiley, 2006). [CrossRef]
  2. Y. Law, H. Lee, and A. Yip, “Supervised texture segmentation using the subspace Mumford-Shah model,” in Proceedings of the 2009 International Conference on Image Processing, Computer Vision and Pattern Recognition (IPCV ’09) (CSREA Press, 2009), pp. 554–560.
  3. B. Sandberg, T. Chan, and L. Vese, “A level-set and Gabor-based active contour algorithm for segmenting textured images,” CAM report (UCLA, 2002), ftp://ftp.math.ucla.edu/pub/camreport/cam02-39.ps.gz.
  4. L. Jing, M. Ng, and J. Huang, “An entropy weighting k-means algorithm for subspace clustering of high-dimensional sparse data,” IEEE Trans. Knowl. Data Eng. 19, 1026–1041(2007). [CrossRef]
  5. Y. Law, H. Lee, and A. Yip, “Semi-supervised subspace learning for Mumford-Shah model based texture segmentation,” Opt. Express 18, 4434–4448 (2010). [CrossRef] [PubMed]
  6. D. Gabor, “Theory of communication,” J. Inst. Electr. Eng., Part 3 93, 429–459 (1946). [CrossRef]
  7. B. Manjunath and W. Ma, “Texture features for browsing and retrieval of image data,” IEEE Trans. Pattern Anal. Machine Intell. 18, 837–842 (1996). [CrossRef]
  8. N. Paragios and R. Deriche, “Geodesic active regions and level set methods for supervised texture segmentation,” Int. J. Comput. Vis. 46, 223–247 (2002). [CrossRef]
  9. C. Sagiv, N. Sochen, and Y. Zeevi, “Texture segmentation via a diffusion-segmentation scheme in the Gabor feature space,” in Proceedings of the 2nd International Workshop on Texture Analysis and Synthesis (Texture02) (Heriot-Watt University, 2002), pp. 123–128.
  10. B. Sharif, A. Ahmadian, M. Oghabian, and N. Izadi, “Texture segmentation of endometrial images for aiding diagnosis of hyperplasia,” in Proceedings of the International Conference on Computer as a Tool, 2005, Vol.  2 (IEEE, 2005), pp. 983–986. [CrossRef]
  11. B.-W. Hong, S. Soatto, K. Ni, and T. Chan, “The scale of a texture and its application to segmentation,” in IEEE Conference on Computer Vision and Pattern Recognition, 2008 (IEEE, 2008), pp. 1–8. [CrossRef]
  12. L. Szumilas, B. Mičušík, and A. Hanbury, “Texture segmentation through salient texture patches,” in Proceedings of the Computer Vision Winter Workshop 2006 (Czech Pattern Recognition Society, 2006), pp. 111–116.
  13. J. Ward, “Hierarchical grouping to optimize an objective function,” J. Am. Stat. Assoc. 58, 236–244 (1963). [CrossRef]
  14. P. Brodatz, Textures: A Photographic Album for Artists and Designers (Dover, 1996).
  15. L. Roberts, J. Redan, and H. Reich, “Extraperitoneal endometriosis with catamenial pneumothoraces: a review of the literature,” JSLS 7, 371–375 (2003). [PubMed]
  16. E. Gelasca, B. Obara, D. Fedorov, K. Kvilekval, and B. Manjunath, “A biosegmentation benchmark for evaluation of bioimage analysis methods,” BMC Bioinf. 10, 368(2009). [CrossRef]
  17. K. Laws, “Texture energy measures,” in Proceedings of the Image Understanding Workshop (Defense Advanced Research Projects Agency, 1979), pp. 47–51.
  18. The Brodatz texture similarity measures are defined as follows. Let u be a given image and {vk} be the set of all images in the Brodatz database. The kth feature value fk(x,y) at pixel (x,y)∈Ω is defined by fk(x,y)=d(u(·,·|x,y),vk), where d(·,·) is defined by Eq.  and u(·,·|x,y) is a local patch in u around (x,y).
  19. T. Brox, M. Rousson, R. Deriche, and J. Weickert, “Unsupervised segmentation incorporating color, texture, and motion,” in Proceedings of the International Conference on Computer Analysis of Images and Patterns (Springer, 2003), pp. 353–360. [CrossRef]
  20. Y. Rubner, J. Puzicha, C. Tomasi, and J. Buhmann, “Empirical evalutation of dissimilarity measures for color and texture,” Comput. Vis. Image Understand. 84, 25–43 (2001). [CrossRef]
  21. R. Dobrushin, “Prescribing a system of random variables by conditional distributions,” Theory Probab. Appl. 15, 458–486 (1970). [CrossRef]
  22. M. Ng, G. Qiu, and A. Yip, “Numerical methods for interactive multiple-class image segmentation problems,” Int. J. Imag. Syst. Technol. 20, 191–201 (2010). [CrossRef]
  23. T. F. Chan, S. Esedoglu, and M. Nikolova, “Algorithms for finding global minimizers of denoising and segmentation models,” SIAM J. Appl. Math. 66, 1632–1648 (2006). [CrossRef]
  24. A. Chambolle, “An algorithm for total variation minimization and applications,” J. Math. Imag. Vis. 20, 89–97(2004). [CrossRef]
  25. J.-F. Aujol, G. Gilboa, T. Chan, and S. Osher, “Structure-texture image decomposition—modeling, algorithms, and parameter selection,” Int. J. Comput. Vis. 67, 111–136(2006). [CrossRef]
  26. X. Bresson, S. Esedoglu, P. Vandergheynst, J.-P. Thiran, and S. Osher, “Fast global minimization of the active contour/snake model,” J. Math. Imaging Vision 28, 151–167 (2007). [CrossRef]
  27. Y. Law, H. Lee, and A. Yip, “A multiresolution stochastic level set method for Mumford-Shah image segmentation,” IEEE Trans. Image Process. 17, 2289–2300 (2008). [CrossRef] [PubMed]

Cited By

Alert me when this paper is cited

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.


« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited