Content-based Image Retrieval by Information Theoretic Measure

Content-based image retrieval focuses on intuitive and efficient methods for retrieving images from databases based on the content of the images. A new entropy function that serves as a measure of information content in an image termed as 'an information theoretic measure' is devised in this paper. Among the various query paradigms, 'query by example' (QBE) is adopted to set a query image for retrieval from a large image database. In this paper, colour and texture features are extracted using the new entropy function and the dominant colour is considered as a visual feature for a particular set of images. Thus colour and texture features constitute the two-dimensional feature vector for indexing the images. The low dimensionality of the feature vector speeds up the atomic query. Indices in a large database system help retrieve the images relevant to the query image without looking at every image in the database. The entropy values of colour and texture and the dominant colour are considered for measuring the similarity. The utility of the proposed image retrieval system based on the information theoretic measures is demonstrated on a benchmark dataset.Defence Science Journal, 2011, 61(5), pp.415-430, DOI:http://dx.doi.org/10.14429/dsj.61.117

Cancer diagnosis using deep learning: A bibliographic review

In this paper, we first describe the basics of the field of cancer diagnosis, which includes steps of cancer diagnosis followed by the typical classification methods used by doctors, providing a historical idea of cancer classification techniques to the readers. These methods include Asymmetry, Border, Color and Diameter (ABCD) method, seven-point detection method, Menzies method, and pattern analysis. They are used regularly by doctors for cancer diagnosis, although they are not considered very efficient for obtaining better performance. Moreover, considering all types of audience, the basic evaluation criteria are also discussed. The criteria include the receiver operating characteristic curve (ROC curve), Area under the ROC curve (AUC), F1 score, accuracy, specificity, sensitivity, precision, dice-coefficient, average accuracy, and Jaccard index. Previously used methods are considered inefficient, asking for better and smarter methods for cancer diagnosis. Artificial intelligence and cancer diagnosis are gaining attention as a way to define better diagnostic tools. In particular, deep neural networks can be successfully used for intelligent image analysis. The basic framework of how this machine learning works on medical imaging is provided in this study, i.e., pre-processing, image segmentation and post-processing. The second part of this manuscript describes the different deep learning techniques, such as convolutional neural networks (CNNs), generative adversarial models (GANs), deep autoencoders (DANs), restricted Boltzmann’s machine (RBM), stacked autoencoders (SAE), convolutional autoencoders (CAE), recurrent neural networks (RNNs), long short-term memory (LTSM), multi-scale convolutional neural network (M-CNN), multi-instance learning convolutional neural network (MIL-CNN). For each technique, we provide Python codes, to allow interested readers to experiment with the cited algorithms on their own diagnostic problems. The third part of this manuscript compiles the successfully applied deep learning models for different types of cancers. Considering the length of the manuscript, we restrict ourselves to the discussion of breast cancer, lung cancer, brain cancer, and skin cancer. The purpose of this bibliographic review is to provide researchers opting to work in implementing deep learning and artificial neural networks for cancer diagnosis a knowledge from scratch of the state-of-the-art achievements

Quantifying the robustness of interconnected systems from their collective dynamics

Complex networks are powerful models to investigate real-world physical, biophysical and socio-technical systems. However, in some cases, the underlying structure cannot be observed directly and connections have to be statistically inferred by observing, on nodes, the time course of relevant physical quantities. This is a well-known inverse problem which to date has not been satisfactorily solved, yet, although it is a very common scenario when modelling interconnected systems. Solving this problem would allow to characterize the macroscopic features of a networked system, from mesoscale organization to critical behaviour. To this aim, a thesis work is here proposed to use the observation of collective dynamics, in terms of multivariate time series, to gain insights about the structural and functional robustness of the underlying complex network to external perturbations. Specifically, we will explore the limits of the fuzzy network approach, recently introduced, where uncertainty about the existence of edges results in an ensemble network reconstruction. Besides being a new approach for network inference, it has not been used to date to investigate the critical behaviour of a complex network, both from a theoretical and computational viewpoint. Our theoretical analysis aims at extending the well-known generating function formalism, widely used in statistical mechanics, to this framework. In parallel, the computational approach considers synthetic networks and Kuramoto dynamics on top of them to characterize robustness through the time course of oscillator phases far from equilibrium. By assuming no knowledge about the network behind the Kuramoto dynamics, the analysis focuses on proving, under the right conditions, whether the network ensemble allows one to recover the robustness properties of the synthetic network underneath

Automated early plant disease detection and grading system: Development and implementation

As the agriculture industry grows, many attempts have been made to ensure high quality of produce. Diseases and defects found in plants and crops, affect the agriculture industry greatly. Hence, many techniques and technologies have been developed to help solving or reducing the impact of plant diseases. Imagining analysis tools, and gas sensors are becoming more frequently integrated into smart systems for plant disease detection. Many disease detection systems incorporate imaging analysis tools and Volatile Organic Compound (VOC) profiling techniques to detect early symptoms of diseases and defects of plants, fruits and vegetative produce. These disease detection techniques can be further categorized into two main groups; preharvest disease detection and postharvest disease detection techniques. This thesis aims to introduce the available disease detection techniques and to compare it with the latest innovative smart systems that feature visible imaging, hyperspectral imaging, and VOC profiling. In addition, this thesis incorporates the use of image analysis tools and k-means segmentation to implement a preharvest Offline and Online disease detection system. The Offline system to be used by pathologists and agriculturists to measure plant leaf disease severity levels. K-means segmentation and triangle thresholding techniques are used together to achieve good background segmentation of leaf images. Moreover, a Mamdani-Type Fuzzy Logic classification technique is used to accurately categorize leaf disease severity level. Leaf images taken from a real field with varying resolutions were tested using the implemented system to observe its effect on disease grade classification. Background segmentation using k-means clustering and triangle thresholding proved to be effective, even in non-uniform lighting conditions. Integration of a Fuzzy Logic system for leaf disease severity level classification yielded in classification accuracies of 98%. Furthermore, a robot is designed and implemented as a robotized Online system to provide field based analysis of plant health using visible and near infrared spectroscopy. Fusion of visible and near infrared images are used to calculate the Normalized Deference Vegetative Index (NDVI) to measure and monitor plant health. The robot is designed to have the functionality of moving across a specified path within an agriculture field and provide health information of leaves as well as position data. The system was tested in a tomato greenhouse under real field conditions. The developed system proved effective in accurately classifying plant health into one of 3 classes; underdeveloped, unhealthy, and healthy with an accuracy of 83%. A map with plant health and locations is produced for farmers and agriculturists to monitor the plant health across different areas. This system has the capability of providing early vital health analysis of plants for immediate action and possible selective pesticide spraying

Verification of Smoke Detection in Video Sequences Based on Spatio-temporal Local Binary Patterns

AbstractThe early smoke detection in outdoor scenes using video sequences is one of the crucial tasks of modern surveillance systems. Real scenes may include objects that are similar to smoke with dynamic behavior due to low resolution cameras, blurring, or weather conditions. Therefore, verification of smoke detection is a necessary stage in such systems. Verification confirms the true smoke regions, when the regions similar to smoke are already detected in a video sequence. The contributions are two-fold. First, many types of Local Binary Patterns (LBPs) in 2D and 3D variants were investigated during experiments according to changing properties of smoke during fire gain. Second, map of brightness differences, edge map, and Laplacian map were studied in Spatio-Temporal LBP (STLBP) specification. The descriptors are based on histograms, and a classification into three classes such as dense smoke, transparent smoke, and non-smoke was implemented using Kullback-Leibler divergence. The recognition results achieved 96–99% and 86–94% of accuracy for dense smoke in dependence of various types of LPBs and shooting artifacts including noise

Color Image Segmentation Using Fuzzy C-Regression Model

Image segmentation is one important process in image analysis and computer vision and is a valuable tool that can be applied in fields of image processing, health care, remote sensing, and traffic image detection. Given the lack of prior knowledge of the ground truth, unsupervised learning techniques like clustering have been largely adopted. Fuzzy clustering has been widely studied and successfully applied in image segmentation. In situations such as limited spatial resolution, poor contrast, overlapping intensities, and noise and intensity inhomogeneities, fuzzy clustering can retain much more information than the hard clustering technique. Most fuzzy clustering algorithms have originated from fuzzy c-means (FCM) and have been successfully applied in image segmentation. However, the cluster prototype of the FCM method is hyperspherical or hyperellipsoidal. FCM may not provide the accurate partition in situations where data consists of arbitrary shapes. Therefore, a Fuzzy C-Regression Model (FCRM) using spatial information has been proposed whose prototype is hyperplaned and can be either linear or nonlinear allowing for better cluster partitioning. Thus, this paper implements FCRM and applies the algorithm to color segmentation using Berkeley’s segmentation database. The results show that FCRM obtains more accurate results compared to other fuzzy clustering algorithms

A precise bare simulation approach to the minimization of some distances. Foundations

In information theory -- as well as in the adjacent fields of statistics, machine learning, artificial intelligence, signal processing and pattern recognition -- many flexibilizations of the omnipresent Kullback-Leibler information distance (relative entropy) and of the closely related Shannon entropy have become frequently used tools. To tackle corresponding constrained minimization (respectively maximization) problems by a newly developed dimension-free bare (pure) simulation method, is the main goal of this paper. Almost no assumptions (like convexity) on the set of constraints are needed, within our discrete setup of arbitrary dimension, and our method is precise (i.e., converges in the limit). As a side effect, we also derive an innovative way of constructing new useful distances/divergences. To illustrate the core of our approach, we present numerous examples. The potential for widespread applicability is indicated, too; in particular, we deliver many recent references for uses of the involved distances/divergences and entropies in various different research fields (which may also serve as an interdisciplinary interface)