Mapping images into ordinal networks

Abstract

An increasing abstraction has marked some recent investigations in network science. Examples include the development of algorithms that map time series data into networks whose vertices and edges can have different interpretations, beyond the classical idea of parts and interactions of a complex system. These approaches have proven useful for dealing with the growing complexity and volume of diverse data sets. However, the use of such algorithms is mostly limited to one-dimension data, and there has been little effort towards extending these methods to higher-dimensional data such as images. Here we propose a generalization for the ordinal network algorithm for mapping images into networks. We investigate the emergence of connectivity constraints inherited from the symbolization process used for defining the network nodes and links, which in turn allows us to derive the exact structure of ordinal networks obtained from random images. We illustrate the use of this new algorithm in a series of applications involving randomization of periodic ornaments, images generated by two-dimensional fractional Brownian motion and the Ising model, and a data set of natural textures. These examples show that measures obtained from ordinal networks (such as average shortest path and global node entropy) extract important image properties related to roughness and symmetry, are robust against noise, and can achieve higher accuracy than traditional texture descriptors extracted from gray-level co-occurrence matrices in simple image classification tasks.

arXiv comment15 two-column pages, 6 figures; accepted for publication in Physical Review E

References in corpus (20)

• Scikit-learn: Machine Learning in Python
• Statistical mechanics of complex networks
• scikit-image: Image processing in Python
• From time series to complex networks: the visibility graph
• Complex network approaches to nonlinear time series analysis
• Complex Network Approach for Recurrence Analysis of Time Series
• Nonlinear time-series analysis revisited
• Time series irreversibility: a visibility graph approach
• Combining complex networks and data mining: why and how
• History of art paintings through the lens of entropy and complexity
• Time lagged ordinal partition networks for capturing dynamics of continuous dynamical systems
• Complexity-Entropy Causality Plane as a Complexity Measure for Two-dimensional Patterns
• Structural Information in Two-Dimensional Patterns: Entropy Convergence and Excess Entropy
• From the time series to the complex networks: the parametric (dynamical) natural visibility graph
• Discriminating image textures with the multiscale two-dimensional complexity-entropy causality plane
• Visibility graphs for image processing
• Estimating physical properties from liquid crystal textures via machine learning and complexity-entropy methods
• Characterizing stochastic time series with ordinal networks
• Visibility graphs of random scalar fields and spatial data
• Multiplex visibility graphs to investigate recurrent neural networks dynamics

Cited by in corpus (8)

• ordpy: A Python package for data analysis with permutation entropy and ordinal network methods
• Determining liquid crystal properties with ordinal networks and machine learning
• Two new parameters for the ordinal analysis of images
• Characterizing unstructured data with the nearest neighbor permutation entropy
• Comparative analysis of the original and amplitude permutations
• Comparative analysis of time irreversibility and amplitude irreversibility based on joint permutation
• Interpretable liquid crystal phase classification via two-by-two ordinal patterns
• Similarity networks of ordinal-pattern transitions classify falling paper trajectories