Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Cubical homology-based Image Classification - A Comparative Study

View through CrossRef
Persistent homology is a powerful tool in topological data analysis (TDA) to compute, study and encode efficiently multi-scale topological features and is being increasingly used in digital image classification. The topological features represent number of connected components, cycles, and voids that describe the shape of data. Persistent homology extracts the birth and death of these topological features through a filtration process. The lifespan of these features can represented using persistent diagrams (topological signatures). Cubical homology is a more efficient method for extracting topological features from a 2D image and uses a collection of cubes to compute the homology, which fits the digital image structure of grids. In this research, we propose a cubical homology-based algorithm for extracting topological features from 2D images to generate their topological signatures. Additionally, we propose a score, which measures the significance of each of the sub-simplices in terms of persistence. Also, gray level co-occurrence matrix (GLCM) and contrast limited adapting histogram equalization (CLAHE) are used as a supplementary method for extracting features. Machine learning techniques are then employed to classify images using the topological signatures. Among the eight tested algorithms with six published image datasets with varying pixel sizes, classes, and distributions, our experiments demonstrate that cubical homology-based machine learning with deep residual network (ResNet 1D) and Light Gradient Boosting Machine (lightGBM) shows promise with the extracted topological features.
University of Winnipeg
Title: Cubical homology-based Image Classification - A Comparative Study
Description:
Persistent homology is a powerful tool in topological data analysis (TDA) to compute, study and encode efficiently multi-scale topological features and is being increasingly used in digital image classification.
The topological features represent number of connected components, cycles, and voids that describe the shape of data.
Persistent homology extracts the birth and death of these topological features through a filtration process.
The lifespan of these features can represented using persistent diagrams (topological signatures).
Cubical homology is a more efficient method for extracting topological features from a 2D image and uses a collection of cubes to compute the homology, which fits the digital image structure of grids.
In this research, we propose a cubical homology-based algorithm for extracting topological features from 2D images to generate their topological signatures.
Additionally, we propose a score, which measures the significance of each of the sub-simplices in terms of persistence.
Also, gray level co-occurrence matrix (GLCM) and contrast limited adapting histogram equalization (CLAHE) are used as a supplementary method for extracting features.
Machine learning techniques are then employed to classify images using the topological signatures.
Among the eight tested algorithms with six published image datasets with varying pixel sizes, classes, and distributions, our experiments demonstrate that cubical homology-based machine learning with deep residual network (ResNet 1D) and Light Gradient Boosting Machine (lightGBM) shows promise with the extracted topological features.

Related Results

Primerjalna književnost na prelomu tisočletja
Primerjalna književnost na prelomu tisočletja
In a comprehensive and at times critical manner, this volume seeks to shed light on the development of events in Western (i.e., European and North American) comparative literature ...
Reflexive homology
Reflexive homology
Reflexive homology is the homology theory associated to the reflexive crossed simplicial group; one of the fundamental crossed simplicial groups. It is the most general way to exte...
Simpler and Faster Pairings from the Montgomery Ladder
Simpler and Faster Pairings from the Montgomery Ladder
We show that Montgomery ladders compute pairings as a by-product, and explain how a small adjustment to the ladder results in simple and efficient algorithms for the Weil a...
Non-Homology-Based Prediction of Gene Functions
Non-Homology-Based Prediction of Gene Functions
Abstract Advances in genome sequencing and annotation have eased the difficulty of identifying new gene sequences. Predicting the functions of these newly identifie...
Double Exposure
Double Exposure
I. Happy Endings Chaplin’s Modern Times features one of the most subtly strange endings in Hollywood history. It concludes with the Tramp (Chaplin) and the Gamin (Paulette Godda...
A note on Khovanov–Rozansky sl2-homology and ordinary Khovanov homology
A note on Khovanov–Rozansky sl2-homology and ordinary Khovanov homology
In this paper we present an explicit isomorphism between Khovanov–Rozansky sl2-homology and ordinary Khovanov homology. This result was originally claimed in Khovanov and Rozansky'...
Latest advancement in image processing techniques
Latest advancement in image processing techniques
Image processing is method of performing some operations on an image, for enhancing the image or for getting some information from that image, or for some other applications is not...
Cohomology of Tanabe algebras
Cohomology of Tanabe algebras
In this paper we study the (co)homology of Tanabe algebras, which are a family of subalgebras of the partition algebras exhibiting a Schur–Weyl duality with certain complex reflect...

Back to Top