Iterative morphological filters and application in document restoration

The binary nature of document degradation decides the suitability of morphological methods for restoration. Although the computational burden in morphological filter design can be mitigated by imposing constraints on the filter and employing the morphological filter MAE theorem in an efficient search strategy, the design constraints on the filter limit the performance of single-pass filter. It has been shown that iterative morphological filters can outperform single-pass filters. The investigation of iterative morphological filter design for image restoration is the main contribution of the present thesis. The study of iterative morphological filter design provides the understanding in depth of how filters achieve a better restoration in an iterative way. Various image-noise processes have been used to examine the effect of iteration on window constraint. Through iteration we have increased the class of filters from which an increasing estimator may be designed, so that the window constraint can be compensated by employing iterative morphological filter. Practically, we arrive at the conclusion that smaller size observation windows can achieve very similar restoration result in a MAE sense as large size windows by employing iterative design. It provides us a better practical design of increasing operators for document restoration compared to the single-pass filter using large size window. Theoretically, we arrive at the conclusion that it is not important if two operators are quite different in logical structure, and they can achieve very similar restoration effect as long as they are statistically similar

Medical image enhancement using threshold decomposition driven adaptive morphological filter

One of the most common degradations in medical images is their poor contrast quality. This suggests the use of contrast enhancement methods as an attempt to modify the intensity distribution of the image. In this paper, a new edge detected morphological filter is proposed to sharpen digital medical images. This is done by detecting the positions of the edges and then applying a class of morphological filtering. Motivated by the success of threshold decomposition, gradientbased operators are used to detect the locations of the edges. A morphological filter is used to sharpen these detected edges. Experimental results demonstrate that the detected edge deblurring filter improved the visibility and perceptibility of various embedded structures in digital medical images. Moreover, the performance of the proposed filter is superior to that of other sharpener-type filters

Morphological filter mean-absolute-error representation theorems and their application to optimal morphological filter design

The present thesis derives error representations and develops design methodologies for optimal mean-absolute-error (MAE) morphological-based filters. Four related morphological-based filter-types are treated. Three are translation-invariant, monotonically increasing operators, and our analysis is based on the Matheron (1975) representation. In this class we analyze conventional binary, conventional gray-scale, and computational morphological filters. The fourth filter class examined is that of binary translation invariant operators. Our analysis is based on the Banon and Barrera (1991) representation and hit-or-miss operator of Serra (1982). A starting point will be the optimal morphological filter paradigm of Dougherty (1992a,b) whose analysis de scribes the optimal filter by a system of nonlinear inequalities with no known method of solution, and thus reduces filter design to minimal search strategies. Although the search analysis is definitive, practical filter design remained elu sive because the search space can be prohibitively large if it not mitigated in some way. The present thesis extends from Dougherty\u27s starting point in several ways. Central to the thesis is the MAE analysis for the various filter settings, where in each case, a theorem is derived that expresses overall filter MAE as a sum of MAE values of individual structuring-element filters and MAE of combinations of unions (maxima) of those elements. Recursive forms of the theorems can be employed in a computer algorithm to rapidly evaluate combinations of structuring elements and search for an optimal filter basis. Although the MAE theorems provide a rapid means for examining the filter design space, the combinatoric nature of this space is, in general, too large for a exhaustive search. Another key contribution of this thesis concerns mitigation of the computational burden via design constraints. The resulting constrained filter will be suboptimal, but, if the constraints are imposed in a suitable man ner, there is little loss of filter performance in return for design tractability. Three constraint approaches developed here are (1) limiting the number of terms in the filter expansion, (2) constraining the observation window, and (3) employing structuring element libraries from which to search for an optimal basis. Another contribution of this thesis concerns the application of optimal morphological filters to image restoration. Statistical and deterministic image and degradation models for binary and low-level gray images were developed here that relate to actual problems in the optical character recognition and electronic printing fields. In the filter design process, these models are employed to generate realizations, from which we extract single-erosion and single-hit-or-miss MAE statistics. These realization-based statistics are utilized in the search for the optimal combination of structuring elements

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

Navigation of mobile robots using artificial intelligence technique.

The ability to acquire a representation of the spatial environment and the ability to localize within it are essential for successful navigation in a-priori unknown environments. This document presents a computer vision method and related algorithms for the navigation of a robot in a static environment. Our environment is a simple white colored area with black obstacles and robot (with some identification mark-a circle and a rectangle of orange color which helps in giving it a direction) present over it. This environment is grabbed in a camera which sends image to the desktop using data cable. The image is then converted to the binary format from jpeg format using software which is then processed in the computer using MATLAB. The data acquired from the program is then used as an input for another program which controls the robot drive motors using wireless controls. Robot then tries to reach its destination avoiding obstacles in its path. The algorithm presented in this paper uses the distance transform methodology to generate paths for the robot to execute. This paper describes an algorithm for approximately finding the fastest route for a vehicle to travel one point to a destination point in a digital plain map, avoiding obstacles along the way. In our experimental setup the camera used is a SONY HANDYCAM. This camera grabs the image and specifies the location of the robot (starting point) in the plain and its destination point. The destination point used in our experimental setup is a table tennis ball, but it can be any other entity like a single person, a combat unit or a vehicle

Connected image processing with multivariate attributes: an unsupervised Markovian classification approach

International audienceThis article presents a new approach for constructing connected operators for image processing and analysis. It relies on a hierarchical Markovian unsupervised algorithm in order to classify the nodes of the traditional Max-Tree. This approach enables to naturally handle multivariate attributes in a robust non-local way. The technique is demonstrated on several image analysis tasks: filtering, segmentation, and source detection, on astronomical and biomedical images. The obtained results show that the method is competitive despite its general formulation. This article provides also a new insight in the field of hierarchical Markovian image processing showing that morphological trees can advantageously replace traditional quadtrees