Computational Speed and Matching Quality using an Upper Bound on the Normalized Mutual Information

2017 ◽  
Author(s):  
Kalyan S. Perumalla ◽  
Maksudul Alam ◽  
Devin A. White
Keyword(s):  
Mutual Information ◽  
Upper Bound ◽  
Normalized Mutual Information ◽  
Computational Speed

scholarly journals Mutual information decay for factors of i.i.d.

2018 ◽  
Vol 39 (11) ◽  
pp. 3015-3030
Author(s):  
BALÁZS GERENCSÉR ◽  
VIKTOR HARANGI
Keyword(s):  
Mutual Information ◽  
Upper Bound ◽  
Upper Bounds ◽  
Interesting Phenomenon ◽  
Regular Tree ◽  
Normalized Mutual Information ◽  
Distributed Processes ◽  
Independent And Identically Distributed

This paper is concerned with factors of independent and identically distributed processes on the $d$ -regular tree for $d\geq 3$ . We study the mutual information of values on two given vertices. If the vertices are neighbors (i.e. their distance is $1$ ), then a known inequality between the entropy of a vertex and the entropy of an edge provides an upper bound for the (normalized) mutual information. In this paper we obtain upper bounds for vertices at an arbitrary distance $k$ , of order $(d-1)^{-k/2}$ . Although these bounds are sharp, we also show that an interesting phenomenon occurs here: for any fixed process, the rate of mutual information decay is much faster, essentially of order $(d-1)^{-k}$ .

Research on Digital Forensics Based on Uyghur Web Text Classification

2020 ◽  
pp. 1586-1597
Author(s):  
Yasen Aizezi ◽  
Anwar Jamal ◽  
Ruxianguli Abudurexiti ◽  
Mutalipu Muming
Keyword(s):  
Mutual Information ◽  
Text Classification ◽  
Text Categorization ◽  
Digital Forensics ◽  
Feature Space ◽  
Experimental Result ◽  
Support Vector ◽  
Web Documents ◽  
Normalized Mutual Information ◽  
Plain Text

This paper mainly discusses the use of mutual information (MI) and Support Vector Machines (SVMs) for Uyghur Web text classification and digital forensics process of web text categorization: automatic classification and identification, conversion and pretreatment of plain text based on encoding features of various existing Uyghur Web documents etc., introduces the pre-paratory work for Uyghur Web text encoding. Focusing on the non-Uyghur characters and stop words in the web texts filtering, we put forward a Multi-feature Space Normalized Mutual Information (M-FNMI) algorithm and replace MI between single feature and category with mutual information (MI) between input feature combination and category so as to extract more accurate feature words; finally, we classify features with support vector machine (SVM) algorithm. The experimental result shows that this scheme has a high precision of classification and can provide criterion for digital forensics with specific purpose.

Research on Digital Forensics Based on Uyghur Web Text Classification

2020 ◽  
pp. 485-496
Author(s):  
Yasen Aizezi ◽  
Anwar Jamal ◽  
Ruxianguli Abudurexiti ◽  
Mutalipu Muming
Keyword(s):  
Mutual Information ◽  
Text Classification ◽  
Text Categorization ◽  
Digital Forensics ◽  
Feature Space ◽  
Experimental Result ◽  
Support Vector ◽  
Web Documents ◽  
Normalized Mutual Information ◽  
Plain Text

This paper mainly discusses the use of mutual information (MI) and Support Vector Machines (SVMs) for Uyghur Web text classification and digital forensics process of web text categorization: automatic classification and identification, conversion and pretreatment of plain text based on encoding features of various existing Uyghur Web documents etc., introduces the pre-paratory work for Uyghur Web text encoding. Focusing on the non-Uyghur characters and stop words in the web texts filtering, we put forward a Multi-feature Space Normalized Mutual Information (M-FNMI) algorithm and replace MI between single feature and category with mutual information (MI) between input feature combination and category so as to extract more accurate feature words; finally, we classify features with support vector machine (SVM) algorithm. The experimental result shows that this scheme has a high precision of classification and can provide criterion for digital forensics with specific purpose.

scholarly journals Firefly-Based Approaches of Image Recognition

Symmetry ◽  
2020 ◽  
Vol 12 (6) ◽  
pp. 881
Author(s):  
Catalina-Lucia Cocianu ◽  
Alexandru Daniel Stan ◽  
Mihai Avramescu
Keyword(s):  
Mutual Information ◽  
Firefly Algorithm ◽  
Fitness Function ◽  
Population Based ◽  
Evolutionary Strategy ◽  
Normalized Mutual Information ◽  
Principal Axes ◽  
The One ◽  
Computation Algorithms ◽  
Population Based Search

The main aim of the reported work is to solve the registration problem for recognition purposes. We introduce two new evolutionary algorithms (EA) consisting of population-based search methods, followed by or combined with a local search scheme. We used a variant of the Firefly algorithm to conduct the population-based search, while the local exploration was implemented by the Two-Membered Evolutionary Strategy (2M-ES). Both algorithms use fitness function based on mutual information (MI) to direct the exploration toward an appropriate candidate solution. A good similarity measure is the one that enables us to predict well, and with the symmetric MI we tie similarity between two objects A and B directly to how well A predicts B, and vice versa. Since the search landscape of normalized mutual information proved more amenable for evolutionary computation algorithms than simple MI, we use normalized mutual information (NMI) defined as symmetric uncertainty. The proposed algorithms are tested against the well-known Principal Axes Transformation technique (PAT), a standard evolutionary strategy and a version of the Firefly algorithm developed to align images. The accuracy and the efficiency of the proposed algorithms are experimentally confirmed by our tests, both methods being excellently fitted to registering images.

Sign in / Sign up

Export Citation Format

Share Document