Image watermarking, steganography, and morphological processing

With the fast development of computer technology, research in the fields of multimedia security, image processing, and robot vision have recently become popular. Image watermarking, steganogrphic system, morphological processing and shortest path planning are important subjects among them. In this dissertation, the fundamental techniques are reviewed first followed by the presentation of novel algorithms and theorems for these three subjects. The research on multimedia security consists of two parts, image watermarking and steganographic system. In image watermarking, several algorithms are developed to achieve different goals as shown below. In order to embed more watermarks and to minimize distortion of watermarked images, a novel watermarking technique using combinational spatial and frequency domains is presented. In order to correct rounding errors, a novel technique based on the genetic algorithm (GA) is developed. By separating medical images into Region of Interest (ROI) and non-ROI parts, higher compression rates can be achieved where the ROI is compressed by lossless compression and the non-ROI by lossy compression. The GA-based watermarking technique can also be considered as a fundamental platform for other fragile watermarking techniques. In order to simplify the selection and integrate different watermarking techniques, a novel adjusted-purpose digital watermarking is developed. In order to enlarge the capacity of robust watermarking, a novel robust high-capacity watermarking is developed. In steganographic system, a novel steganographic algorithm is developed by using GA to break the inspection of steganalytic system. In morphological processing, the GA-based techniques are developed to decompose arbitrary shapes of big binary structuring elements and arbitrary values of big grayscale structuring elements into small ones. The decomposition is suited for a parallel-pipelined architecture. The techniques can speed up the morphological processing and allow full freedom for users to design any type and any size of binary and grayscale structuring elements. In applications such as shortest path planning, a novel method is first presented to obtaining Euclidean distance transformation (EDT) in just two scans of image. The shortest path can be extracted based on distance maps by tracking minimum values. In order to record the motion path, a new chain-code representation is developed to allow forward and backward movements. By placing the smooth turning-angle constraint, it is possible to mimic realistic motions of cars. By using dynamically rotational morphology, it is not only guarantee collision-free in the shortest path, but also reduce time complexity dramatically. As soon as the distance map of a destination and collision-free codes have been established off-line, shortest paths of cars given any starting location toward the destination can be promptly obtained on-line

Binary Structuring Elements Decomposition Based on an Improved Recursive Dilation-Union Model and RSAPSO Method

This paper proposed an improved approach to decompose structuring elements of an arbitrary shape. For the model of this method, we use an improved dilation-union model, adding a new termination criterion, as the sum of 3-by-3 matrix should be less than 5. Next for the algorithm of this method, we introduced in the restarted simulated annealing particle swarm optimization method. The experiments demonstrate that our method can find better results than Park's method, Anelli's method, Shih's SGA method, and Zhang's MFSGA method. Besides, our method gave the best decomposition tree of different SE shapes including “ship,” “car,” “heart,” “umbrella,” “vase,” “tree,” “cat,” “V,” “bomb,” and “cup.

Automatic Detection of Vasculature from the Images of Human Retina Using CLAHE and Bitplane Decomposition

Retinal blood vessel detection and extraction is an essential step in understanding several eye related pathologies. It is the key in automatic screening systems for retinal abnormalities. We present a novel yet simple approach to the detection and segmentation of vasculature from the fundus images of the human retina. For the detection and extraction of blood vessels, the green channel of the image is separated. The green channel is preprocessed for a better contrast by using contrast limited adaptive histogram equalization (CLAHE) and mathematical morphology. On applying bitplane decomposition, bitplane 2 is found to carry important information on the topology of retinal vasculature. A series of morphological operations on bitplane 2 segment the vasculature accurately. The proposed algorithm is computationally simple and does not require a prior knowledge of other retinal features like optic disc and macula. The algorithm has been evaluated on a subset of MESSIDOR and DRIVE image databases with various visual qualities. Robustness with respect to changes in the parameters of the algorithm has been examined.

Image Analysis of Pellet Size for a Control System in Industrial Feed Production

When producing aquaculture fish feed pellets, the size of the output product is of immense importance. As the production method cannot produce pellets of constant and uniform size using constant machine settings, there is a demand for size control. Fish fed with feed pellets of improper size are prone to not grow as expected, which is undesirable to the aquaculture industry. In this paper an image analysis method is proposed for automatic size-monitoring of pellets. This is called granulometry and the method used here is based on the mathematical morphological opening operation. In the proposed method, no image object segmentation is needed. The results show that it is possible to extract a general size distribution from an image of piled disordered pellets representing both length and diameter of the pellets in combination as an area

Genetic programming applied to morphological image processing

This thesis presents three approaches to the automatic design of algorithms for the processing of binary images based on the Genetic Programming (GP) paradigm. In the first approach the algorithms are designed using the basic Mathematical Morphology (MM) operators, i.e. erosion and dilation, with a variety of Structuring Elements (SEs). GP is used to design algorithms to convert a binary image into another containing just a particular characteristic of interest. In the study we have tested two similarity fitness functions, training sets with different numbers of elements and different sizes of the training images over three different objectives. The results of the first approach showed some success in the evolution of MM algorithms but also identifed problems with the amount of computational resources the method required. The second approach uses Sub-Machine-Code GP (SMCGP) and bitwise operators as an attempt to speed-up the evolution of the algorithms and to make them both feasible and effective. The SMCGP approach was successful in the speeding up of the computation but it was not successful in improving the quality of the obtained algorithms. The third approach presents the combination of logical and morphological operators in an attempt to improve the quality of the automatically designed algorithms. The results obtained provide empirical evidence showing that the evolution of high quality MM algorithms using GP is possible and that this technique has a broad potential that should be explored further. This thesis includes an analysis of the potential of GP and other Machine Learning techniques for solving the general problem of Signal Understanding by means of exploring Mathematical Morphology

Pattern recognition and image processing of infrared astronomical satellite images

The Infrared Astronomical Satellite (IRAS) images with wavelengths of 60 [mu] m and 100 [mu] m contain mainly information on both extra-galactic sources and low-temperature interstellar media. The low-temperature interstellar media in the Milky Way impose a cirrus screen of IRAS images, especially in images with 100 [mu] m wavelength. This dissertation deals with the techniques of removing the cirrus clouds from the 100 [mu] m band in order to achieve accurate determinations of point sources and their intensities (fluxes). We employ an image filtering process which utilizes mathematical morphology and wavelet analysis as the key tools in removing the cirrus foreground emission. The filtering process consists of extraction and classification of the size information, and then using the classification results in removal of the cirrus component from each pixel of the image. Extraction of size information is the most important step in this process. It is achieved by either mathematical morphology or wavelet analysis. In the mathematical morphological method, extraction of size information is done using the sieving process. In the wavelet method, multi-resolution techniques are employed instead;The classification of size information distinguishes extra-galactic sources from cirrus using their averaged size information. The cirrus component for each pixel is then removed by using the averaged cirrus size information. The filtered image contains much less cirrus. Intensity alteration for extra-galactic sources in the filtered image are discussed. It is possible to retain the fluxes of the point sources when we weigh the cirrus component differently pixel by pixel. The importance of the uni-directional size information extractions are addressed in this dissertation. Such uni-directional extractions are achieved by constraining the structuring elements, or by constraining the sieving process to be sequential;The generalizations of mathematical morphology operations based on the dynamic hit-or-miss transform are presented in this dissertation. The generalized erosion ([gamma]-erosion) bridges traditional erosion and dilation. It also enriches the morphological operators available in the field of signal and image processing. Traditional closing is generalized into [gamma]-closing, which bridges traditional closing and opening. Properties of [gamma]-erosion and [gamma]-closing are discussed. The sieving process is generalized based on [gamma]-closing, and is bi-directional, with the polarity directly related to the parameter [gamma]. The size information extractors of morphological methods and wavelet methods are justified quantitatively using a prototype peak with fixed slope. The non-linearity of the sieving process is analyzed. It is shown that the sieving process can approach an approximate linearity at positions where the input signal has sharp peaks (i.e., the slopes are large). The spatial discriminating properties of the size information extractors are also very important

Recognition of Electrical & Electronics Components

Recognition or more specifically Pattern or Object recognition is a typical characteristic of human beings and other living organisms. The term pattern or object means something that is set as an idea to be imitated. For example, in our childhood a shape ‘A’ is shown to us and we are asked to imitate that. So the shape is the ideal one. On the other hand, if what we produce or draw obeying that instruction is close to that shape, our teacher identifies that as ’A’. this identification is called recognition and the shapes we draw (that is object we made) may be termed as patterns. Thus, the pattern recognition means identification of the real object. Recognition should, therefore, be preceded by the development of the concept of the ideal or model or prototype. This process is called Learning. In most real life problems no ideal example is available. In that case, the concept of ideal is abstracted from many near perfect examples. Under this notion learning is of two types : supervised learning if appropriate label is attached to each of these examples ; and unsupervised learning if no labeling is available

Mathematical Methods for the Quantification of Actin-Filaments in Microscopic Images

In cell biology confocal laser scanning microscopic images of the actin filament of human osteoblasts are produced to assess the cell development. This thesis aims at an advanced approach for accurate quantitative measurements about the morphology of the bright-ridge set of these microscopic images and thus about the actin filament. Therefore automatic preprocessing, tagging and quantification interplay to approximate the capabilities of the human observer to intuitively recognize the filaments correctly. Numerical experiments with random models confirm the accuracy of this approach