New approach for image matching using morphological operations

This paper proposes a content-based authentication scheme for tampering detection and localization of binary images. The watermark is generated by the feature vector of the original binary image, and embedded back into the image by a structural method. The feature vector we used is Zernike moments. It can tell the degree of the tamper in the binary image. A distance between two feature vectors is defined. We authenticate image by the distance between the extracted watermark and the feature vector of the test image. Once the tampering is detected, we can locate the tampered areas by comparing different components of the distance. The experimental results show that the algorithm can locate the tamper effectively.

An overview of SKIPSM (eparated-Kemel Jinage rocessing using Finite state Machines), a powerful new way to implement many standard image processing operations, is presented in a two companion ape2 This paper describes the application of SKJPSM to grey-level morphology, which involves . in some cases, the reformulation of the grey-level morphology problem as a set of binary morphology operations, . the separation of 2-D morphological operations into a row operation followed by a column operation, . the formulation of these row and column operations in a form compatible with pipelined operation, S the implementation of the resulting operations as simple finite-state machines, and S theautomated generation of the finite-state machine configuration data. Grey-level morphology presents some difficulties to the SKJPSM paradigm having to do with word length. In spite of this, some very useful results can be obtained. Some key features of SKIPSM, as applied to grey-level morphology, are S There is a tradeoffbetween structuring element (SE) size and number of grey levels. . The SEs can be arbitrary . With currently-available components, SEa up to 5x5 and larger can be obtained. S Jfl certain special cases, SEs up to 9x9 and larger can be obtained. . Multiple SEs can be applied simultaneously in a single pipeline pass. S The user specifies the SE or SEs. All other steps can be automated. This paper includes some simple examples of the results and gives implementation feasibility guidelines based on SE size and number of grey levels. The limitations of SKIPSM in this application all relate to the capabilities of the available RAM microchips. As chip capabilities expand, larger SE sizes and greater numbers of grey levels will become feasible. KEYWORDS: image processing, separability, real time, implementations, finite-state machines, grey-level morphology

Scene analysis for robotic watercraft

In this paper, a novel image denoising method with a morphological opening is proposed. In many image recovery, the regularization has been introduced to prevent overfitting between a recovered image and a noisy observation. In the regularization of an image, the smoothness of the image is assumed. The cost function, which is minimized during the regularization, is defined as a sum of the approximation error term and the smoothness penalty of the image. In morphological image processing, an image is approximated as a union of structuring elements (SEs) by the morphological image opening. In the approximation with the opening, the SE represents the local intensity surface of the image. We hence impose the smoothness penalty on the SE, instead of the recovered image itself, and propose an image opening method with the regularization penalty for the SE. In denoising, the approximation error is minimized under the constraint of the penalty for the SE. In experiments, we show that the proposed filtering method has ability to remove impulsive noises from degraded texture images.

With the development of science and technology, there has been growing the grid size, the growing demand for electricity and the extent of increasing the electricity market.In this paper, a mathematical morphology and genetic algorithm based dynamic reactive power optimization method for distribution network is proposed.By means of constructing mathematical morphology filter, the binary image composed by allelic genes of chromosome is filtered and the problem that deals with the action times of voltage regulating devices for compensation is turned into filtering problem of discrete binary image.With further automate scheduling, distribution automation and unmanned substation reactive power optimization of distribution line running made an urgent request.Reactive power optimization can improve the voltage passing rate, increasing the reliability of the system, the power quality, and the system runs the security and economy of the perfect combination, very broad application prospects.

Fast parallel processing of gray-scale images and exact hard-clip thresholding are two important functionalities necessary in optoelectronic implementations of structural processors. The parallel nature of processing stems from optical implementation of local operations with arrays of active smart pixels. We have demonstrated a morphological image processor composed of arrays of bistable optoelectronic transceivers which are connected in differential pairs and work as comparators. The use of differential pairs of optical thyristors fabricated in GaAs technology allows to realize a dual rail architecture for this photonic morphological image processor. The processor consists of a thresholding module and a binary morphological processing module. The thresholding module decomposes gray level images into series of binary slices. In the binary morphological processing module operations are performed within a neighborhood defined by a structuring element implemented as a diffractive fan-out element. In the prototype set-up we demonstrate median filtering, dilation and erosion operations performed for an image of 8x8 pixels and threshold decomposition of 6 gray level images. In principle all rank order as well as morphological filters can be optically calculated in the set-up. Additional functionality of the processor is achieved with use of the electronic layer with digital cellular processors. The electronic layer, designed as an array of simple digital processors, realizes a set of operations on binary images using 4 bit programmable weights. Simulation results for 0.8 µm CMOS technology are presented. We discuss the limitations of the photonic morphological image processing with respect to bandwidth, parallelism and architecture of the processor.

Mathematical morphology provides an efficient tool for image analysis. We study the problem of flaw detection in materials which are represented by very poor contrast digital images. An algorithm for flaw detection in the case of glass matte surfaces has been developed. The object skeletons within the binary images are obtained and directional connectivity information in the skeletons is used to discriminate noise patterns from flaws according to a specified criteria. After the discrimination process, the remaining skeletons correspond to flaws and can be employed to recover the shape of flaws. An alarm flag may be turned on if the sizes of the detected flaws are found to exceed industrial standards. In the case of a grayscale image, the image is converted to a binary version by using an adaptive threshold algorithm, then the algorithm for binary images is applied. Experimental results have been obtained for both binary and grayscale digital image data.

Morphology is a common technique used in image processing because it is a powerful tool with relatively low complexity. Albeit simple, morphological operations are typically time consuming due to the fact that the same operations are repeated on every pixel of an image. Since the processing of the pixels of an image is an embarrassingly-parallel process, the morphological operations can be carried out in parallel on Nvidia graphic cards using Compute Unified Device Architecture (CUDA). However, most of the existing CUDA work focuses on the morphological operations on grayscale images. For binary image, it can be represented in the form of a bitmap so that a 32-bit processor will be able to process 32 binary pixels concurrently. With the combination of the bitmap representation and van Herk/Gil-Werman (vHGW) algorithm, the performance of the proposed implementation in term of computation time improves significantly compared to the existing implementations.

Mathematical morphology is a fundamental tool based on order statistics for image processing, such as noise reduction, image enhancement and feature extraction, and is well-established for binary and grayscale images, whose pixels can be sorted by their pixel values, i.e., each pixel has a single number. On the other hand, each pixel in a color image has three numbers corresponding to three color channels, e.g., red (R), green (G) and blue (B) channels in an RGB color image. Therefore, it is difficult to sort color pixels uniquely. In this paper, we propose a method for unifying the orders of pixels sorted in each color channel separately, where we consider that a pixel exists in a three-dimensional space called order space, and derive a single order by a monotonically nondecreasing function defined on the order space. We also fuzzify the proposed order space-based morphological operations, and demonstrate the effectiveness of the proposed method by comparing with a state-of-the-art method based on hypergraph theory. The proposed method treats three orders of pixels sorted in respective color channels equally. Therefore, the proposed method is consistent with the conventional morphological operations for binary and grayscale images.

Mathematical morphology on l-images

A morphological image enhancement method based on the GAN (General Adaptive Neighborhood) structuring elements is proposed for some problems such as low overall contrast, noise and inter-target edge of some remote sensing images. Firstly, a pixel to be processed is selected as a seed point, and an adaptive neighborhood is defined according to the image pixel characteristic and the neighborhood constraint relation to obtain the self-adaptive structuring elements set. A corresponding self-adaptive morphological operation based on the self-adaptive structuring elements set is constructed with reference to the classical morphological operation definition, and the self-adaptive alternative filter is constructed by using the adaptive morphological operation combination so as to realize the enhancement of the remote sensing image. The experimental results show that the method can preserve the accurate positioning of the objects edge while enhancing the image, avoid the loss of information, has better noise removing performance. Compared with the classical morphological filter operator, the single-scale Retinex algorithm and bi-histogram equalization (BHE) algorithm, the contrast ratio and the signal-to-noise ratio of the enhanced image are improved.

Machine learning and pattern recognition recently become a hot topic in computing world. This is due to the fast-growing of resources as well as techniques that make it easier to solve machine learning and pattern recognition problems. Problems that require machine learning solutions may be very simple for humans but actually can be very complex for machines to solve them. Face recognition is amongst those problems. Almost all human can easily recognize others without require specific knowledge to do it, different from machines which require its. This paper discussed face recognition task using machine learning strategies which involved Kernel Principal Component Analysis (KPCA) and Support Vector Machine (SVM) to identify person. KPCA extracted features from 2D image input and produced the important features of an image input. The extracted face features are recognized by SVM by classifying human face according to their stored identity in a database. SVM, which was basically a binary classifier worked by using one-against-one strategy to compare the face feature vector of a single test image to the stored face image in a face image database. Experiment results on grayscale images with size 92x112 pixels gave 96.25% of accuracy rate. Hence, KPCA and SVM for face recognition is a robust machine learning method.

Mathematical morphology is a powerful tool for image processing and analysis of binary, greyscale and colour images. In the paper, an efficient new fuzzy model for morphological colour image processing is introduced. A new vector-ordering scheme that uses fuzzy if–then rules is proposed, and then the basic morphological operations of erosion and dilation are defined. The morphological operators presented, which are vector preserving, are less sensitive to image distortion and perform significantly better in noise removal problems than other reported morphological operators. Experimental results demonstrate these advantageous characteristics on real images. Additionally, illustrative examples that exhibit the applicability of the proposed framework to edge-detection problems are given.

This paper describes that under certain operations, the parallel pulse transmission behavior of unit-linking PCNN (pulse coupled neural network) for image processing, which we have developed from PCNN based on biological experimental results, is equal to the open operation of mathematic morphology. The open operation of unit-linking PCNN based on its parallel pulse transmission behavior can be efficiently used for image processing, such as reducing the pulse noise of binary images. A new pulse-noise-reducing approach based on the open operation of unit-linking PCNN is proposed in this paper. The results of computer simulations show that the visual effects of retrieval images of binary pulse-noise images based on the open operation of unit-linking PCNN are better than those based on the median filter, a tradition approach for reducing image pulse noise. For binary images polluted by any other kinds of noise, such as white Guassian noise, after having turned the original noisy images into binary noisy images, using the approach proposed in this paper also can reduce the noise. This paper bridges the gap between image processing based on mathematical morphology and image processing based on unit-linking PCNN.

Though traditional classification methods show well performance in classification tasks, most of them mainly lay emphasis on ‘classification’ rather than ‘cognition’. When a new object that has never been seen is encountered, the traditional methods falsely default the image as a certain category that has been studied, however, humans can first identify the image as new. In this paper, we present a memory model for visual images classification based on residual neural network and Bayesian decision (VICRB). First, the feature vectors of the visual images for each category are extracted with residual neural network and each feature component may be correctly copied or randomly produced. Then the processes about how the visual images represent, store and retrieve are modeled. The feature vector of test images is matched with the feature vectors of learned images and the likelihood ratio is computed according to probabilistic inference theory. Finally, the odds value in favor of an old over a new image is computed by all likelihood values. According to the odd value, the Bayesian decision rule is applied to the image classification. Experimental results on two benchmark images datasets show that the presented memory model performs well in images classification tasks.