Summary
Texture analysis represents one of the main areas in image processing and computer vision. The current article describes how complex networks have been used in order to represent and characterized textures. More speci?cally, networks are derived from the texture images by expressing pixels as network nodes and similarities between pixels as network edges. Then, measurements such as the node degree, strengths and clustering coe?cient are used in order to quantify properties of the connectivity and topology of the analyzed networks. Because such properties are directly related to the structure of the respective texture images, they can be used as features for characterizing and classifying textures. The latter possibility is illustrated with respect to images of textures, DNA chaos game, and faces. The possibility of using the network representations as a subsidy for DNA characterization is also discussed in this work.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Mark E. J. Newman, “The structure and function of complex networks,” condmat/ 0303516, 2003.
Luciano da Fontoura Costa, Francisco A. Rodrigues, Gonzalo Travieso, and P. R. Villas Boas, “Characterization of complex networks: A survey of measurements,” cond-mat/0505185, 2005.
Reka Albert and Albert-Laszlo Barabasi, “Statistical mechanics of complex networks,” cond-mat/0106096, 2001.
Luciano da Fontoura Costa, “Complex networks, simple vision,” condmat/ 0403346, 2004.
Luciano da Fontoura Costa, “Hub-based community finding,” condmat/ 0405022, 2004.
Luciano da Fontoura Costa, “Hierarchical characterization of complex networks,” cond-mat/0412761, 2005.
T. Chalumeau, L. da F. Costa, O. Laligant, and F. Meriaudeau, “Optimized texture classification by using hierarchical complex networks measurements,” Machine Vision Applications in Industrial Inspection XIV, vol. 6070, 2006.
J. S. Almeida, J. A. Carriçco, A. Maretzek, P. A. Noble, and M Fletcher, “Analysis of genomic sequences by chaos game representation,” BIOINFORMATICS, vol. 17, pp. 429–437, 2001.
Reinhard Diestel, Graph Theory, Springer, 2nd electronic edition edition, 2000.
H. Joel Jeffrey, “Chaos game representation of gene structure,” Nucleic Acids Research, vol. 18 (8), pp. 2163–2170, 1990.
R. O. Duda, P. E. Hart, , and D. G. Stork, “Pattern classification,” Wiley Interscience, 2001.
Luciano da Fontoura Costa and Roberto M. Cesar Junior, Shape Analysis and Classification: Theory and Practice, CRC Press, Inc, 2000.
Ricco Rakotomalala, “Tanagra : un logiciel gratuit pour l’enseignement et la recherche,” in Actes de EGC’2005, RNTI-E-3, vol. 2, pp. 697–702, 2005.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Chalumeau, T., Costa, L.F., Laligant, O., Meriaudeau, F. (2008). Texture Discrimination Using Hierarchical Complex Networks. In: Damiani, E., Yétongnon, K., Schelkens, P., Dipanda, A., Legrand, L., Chbeir, R. (eds) Signal Processing for Image Enhancement and Multimedia Processing. Multimedia Systems and Applications Series, vol 31. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-72500-0_9
Download citation
DOI: https://doi.org/10.1007/978-0-387-72500-0_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-72499-7
Online ISBN: 978-0-387-72500-0
eBook Packages: Computer ScienceComputer Science (R0)