Mapping images into ordinal networks
Arthur A. B. Pessa, Haroldo V. Ribeiro

TL;DR
This paper introduces a novel method to map images into ordinal networks, enabling the extraction of meaningful image properties and improving classification accuracy over traditional texture analysis techniques.
Contribution
It generalizes the ordinal network algorithm from one-dimensional data to two-dimensional images, allowing for new analysis of image complexity and texture.
Findings
Ordinal network measures correlate with image roughness and symmetry.
The method is robust against noise.
It outperforms traditional texture descriptors in classification tasks.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
