Character-based Automated Human Perception Quality Assessment In Document Images

Large degradations in document images impede their readability and deteriorate the performance of automated document processing systems. Document image quality (IQ) metrics have been defined through optical character recognition (OCR) accuracy. Such metrics, however, do not always correlate with human perception of IQ. When enhancing document images with the goal of improving readability, e.g., in historical documents where OCR performance is low and/or where it is necessary to preserve the original context, it is important to understand human perception of quality. The goal of this paper is to design a system that enables the learning and estimation of human perception of document IQ. Such a metric can be used to compare existing document enhancement methods and guide automated document enhancement. Moreover, the proposed methodology is designed as a general framework that can be applied in a wide range of applications. © 2012 IEEE

Noise Optimizes Super-Turing Computation In Recurrent Neural Networks

This paper explores the benefit of added noise in increasing the computational complexity of digital recurrent neural networks (RNNs). The physically accepted model of the universe imposes rational number, stochastic limits on all calculations. An analog RNN with those limits calculates at the super-Turing complexity level BPP/log∗. In this paper, we demonstrate how noise aids digital RNNs in attaining super-Turing operation similar to analog RNNs. We investigate moving limited-precision systems from not being chaotic at small amounts of noise, through consistency with chaos, to overwhelming it at large amounts of noise. A Kolmogorov-complexity-based proof shows that an infinite computational class hierarchy exists between P, the Turing class, and BPP/log∗. The hierarchy offers a possibility that the noise-enhanced digital RNNs could operate at a super-Turing level less complex than BPP/log∗. As the uniform noise increases, the digital RNNs develop positive Lyapunov exponents intimating that chaos is mimicked. The exponents maximize to the accepted values for the logistic and Hénon maps when the noise equals eight times the least significant bit of the noisy recurrent signals for the logistic digital RNN and four times the Hénon digital RNN

Efficient MRF approach to document image enhancement

Markov random field (MRF) based approaches have been shown to perform well in a wide range of applications. Due to the iterative nature of the algorithm, the computational cost of such applications is normally high. In the context of document image analysis, where numerous documents have to be processed, this computational cost may become prohibitive. We describe a novel approach to document image enhancement using MRF. We show that by using domain specific knowledge, we are able to substantially improve computational performance by an order of magnitude. Moreover, in contrast to known techniques where patch initialization is arbitrary, in the proposed approach patch initialization is data consistent and so results in improved effectiveness. Experimental results comparing the proposed approach to known techniques using historical documents from the Frieder Collection are provided. © 2008 IEEE

Historical Document Enhancement Using LUT Classification

The fast evolution of scanning and computing technologies in recent years has led to the creation of large collections of scanned historical documents. It is almost always the case that these scanned documents suffer from some form of degradation. Large degradations make documents hard to read and substantially deteriorate the performance of automated document processing systems. Enhancement of degraded document images is normally performed assuming global degradation models. When the degradation is large, global degradation models do not perform well. In contrast, we propose to learn local degradation models and use them in enhancing degraded document images. Using a semi-automated enhancement system, we have labeled a subset of the Frieder diaries collection (The diaries of Rabbi Dr. Avraham Abba Frieder. http://ir.iit.edu/collections/). This labeled subset was then used to train classifiers based on lookup tables in conjunction with the approximated nearest neighbor algorithm. The resulting algorithm is highly efficient and effective. Experimental evaluation results are provided using the Frieder diaries collection (The diaries of Rabbi Dr. Avraham Abba Frieder. http://ir.iit.edu/collections/). © Springer-Verlag 2009

An Explainable Deep Learning Model For Prediction Of Severity Of Alzheimer\u27s Disease

Deep Convolutional Neural Networks (CNNs) have become the go-To method for medical imaging classification on various imaging modalities for binary and multiclass problems. Deep CNNs extract spatial features from image data hierarchically, with deeper layers learning more relevant features for the classification application. Despite the high predictive accuracy, usability lags in practical applications due to the black-box model perception. Model explainability and interpretability are essential for successfully integrating artificial intelligence into healthcare practice. This work addresses the challenge of an explainable deep learning model for the prediction of the severity of Alzheimer\u27s disease (AD). AD diagnosis and prognosis heavily rely on neuroimaging information, particularly magnetic resonance imaging (MRI). We present a deep learning model framework that integrates a local data-driven interpretation method that explains the relationship between the predicted AD severity from the CNN and the input MR brain image. The deep explainer uses SHapley Additive exPlanation values to quantity the contribution of different brain regions utilized by the CNN to predict outcomes. We conduct a comparative analysis of three high-performing CNN models: DenseNet121, DenseNet169, and Inception-ResNet-v2. The framework shows high sensitivity and specificity in the test sample of subjects with varying levels of AD severity. We also correlated five key AD neurocognitive assessment outcome measures and the APOE genotype biomarker with model misclassifications to facilitate a better understanding of model performance

NBT (No-Boundary Thinking): Needed To Attend To Ethical Implications Of Data And AI

In this era of Big Data and AI, expertise in multiple aspects of data, computing, and the domains of application is needed. This calls for teams of experts with different training and perspectives. Because data analysis can have serious ethical implications, it is important that these teams are well and deeply integrated. No-Boundary Thinking (NBT) teams can provide support for team formation and maintenance, thereby attending to the many dimensions of the ethics of data and analysis. In this NBT workshop session, we discuss the ethical concerns that arise from the use of data and AI, and the implications for team building; and provide and brainstorm suggestions for ethical data enabled science and AI

Team Building Without Boundaries

Team building can be challenging when participants are from the same discipline or sub-discipline, but needs special attention when participants use a different vocabulary and have different cultural views on what constitutes viable problems and solutions. Essential to No Boundary Thinking (NBT) teams is proper formulation of the problem to be solved, and a basic tenant is that the NBT team must come together with diverse perspectives to decide the problem before solutions can be considered. Given that participants come with different views on problem formulation and solution, it is important to consider a robust process for team formation and maintenance. This takes extra effort and time, but scholars studying teams of experts with diverse training have found that they are better positioned to be successful in solving even deep and difficult problems especially if they have learned to work well with each other. At this workshop we will discuss principles that scholars who have worked in NBT teams have discovered as effective. We will then engage with the workshop participants to consider discuss these principles and brainstorm to consider other approaches

Meta-Learning Related Tasks With Recurrent Networks: Optimization And Generalization

There have been recent interest in meta-learning systems: I.e., networks that are trained to learn across multiple tasks. This paper focuses on optimization and generalization of a meta-learning system based on recurrent networks. The optimization investigates the influence of diverse structures and parameters on its performance. We demonstrate the generalization (robustness) of our meta-learning system to learn across multiple tasks including tasks unseen during the meta training phase. We introduce a meta-cost function (Mean Squared Fair Error) that enhances the performance of the system by not penalizing it during transitions to learning a new task. Evaluation results are presented for Boolean and quadratic functions datasets. The best performance is obtained using a Long Short-Term Memory (LSTM) topology without a forget gate and with a clipped memory cell. The results demonstrate i) the impact of different LSTM architectures, parameters, and error functions on the meta-learning process; ii) that the mean squared fair error function does improve performance for best learning; and iii) the robustness of our meta-learning framework as it generalizes well when tested on tasks unseen during meta-training. Comparison between No-Forget-Gate LSTM and Gated Recurrent Unit also suggest that absence of a memory cell tends to degrade performance

Features For Automated Tongue Image Shape Classification

Inspection of the tongue is a key component in Traditional Chinese Medicine. Chinese medical practitioners diagnose the health status of a patient based on observation of the color, shape, and texture characteristics of the tongue. The condition of the tongue can objectively reflect the presence of certain diseases and aid in the differentiation of syndromes, prognosis of disease and establishment of treatment methods. Tongue shape is a very important feature in tongue diagnosis. A different tongue shape other than ellipse could indicate presence of certain pathologies. In this paper, we propose a novel set of features, based on shape geometry and polynomial equations, for automated recognition and classification of the shape of a tongue image using supervised machine learning techniques. We also present a novel method to correct the orientation/deflection of the tongue based on the symmetry of axis detection method. Experimental results obtained on a set of 303 tongue images demonstrate that the proposed method improves the current state of the art method. © 2012 IEEE

ZHENG Classification In Traditional Chinese Medicine Based On Modified Specular-free Tongue Images

Traditional Chinese Medicine practitioners usually observe the color and coating of a patient\u27s tongue to determine ZHENG (such as Cold or Hot ZHENG) and to diagnose different stomach disorders including gastritis. In our previous work, we explored new modalities for clinical characterization of ZHENG in gastritis patients via tongue image analysis using various supervised machine-learning algorithms. We proposed a system that learns from the clinical practitioner\u27s subjective data how to classify a patients health status by extracting meaningful features from tongue images based on color-space models. In this paper, we propose an enhancement to the ZHENG classification system: a coating separation technique using the MSF images such that feature extraction is applied only to the coated region on the tongue surface. The results obtained over a set of 263 gastritis patients (most of whom are either Cold Zheng or Hot ZHENG), and a control group of 48 healthy volunteers demonstrate an improved performance for most of the classification types considered. © 2012 IEEE