Set Of Binary Images Research Articles

Fast computation of Hahn moments on gray images using block representation

The moments constitute a well-known tool for image analysis and recognition tasks. The family of moments that has the most advantages is the discrete orthogonal moments. A set of these moments is the Hahn moments, as they have a great number of advantages in comparison with other sets of moments. The main disadvantage of moments, including Hahn moments, is the high computational cost, which is increased as higher order moments are involved in the computations, so the real-time analysis is hard to be done. We propose an effective approach for the computation of Hahn moments. The gray image is decomposed in a set of binary images that are named as bitplanes. The most significant bitplanes are represented using image block representation and their moments are computed fast using block techniques. The least significant binary images are substituted by a constant ideal image called “half-intensity” image, which has known Hahn moment values. The proposed method has low computational error, low computational complexity, and under certain conditions is able to achieve real-time processing rates.

Script Identification of Camera Based Bilingual Document Images Using SFTA Features

In this article, the exhaustive experiment is carried out to test the performance of the Segmentation based Fractal Texture Analysis (SFTA) features with nt = 4 pairs, and nt = 8 pairs, geometric features and their combinations. A unified algorithm is designed to identify the scripts of the camera captured bi-lingual document image containing International language English with each one of Hindi, Kannada, Telugu, Malayalam, Bengali, Oriya, Punjabi, and Urdu scripts. The SFTA algorithm decomposes the input image into a set of binary images from which the fractal dimension of the resulting regions are computed in order to describe the segmented texture patterns. This motivates use of the SFTA features as the texture features to identify the scripts of the camera-based document image, which has an effect of non-homogeneous illumination (Resolution). An experiment is carried on eleven scripts each with 1000 sample images of block sizes 128 × 128, 256 × 256, 512 × 512 and 1024 × 1024. It is observed that the block size 512 × 512 gives the maximum accuracy of 86.45% for Gujarathi and English script combination and is the optimal size. The novelty of this article is that unified algorithm is developed for the script identification of bilingual document images.

Dynamic multiple-image encryption based on chirp z-transform

A dynamic encryption scheme is demonstrated based on chirp z-transform (CZT). The novel design of this setup allows us to protect multiple images in a multiplexed format and fully recover them without the influence of crosstalk and sample noise. The encoding stage is implemented using the 2D CZT and a Fourier lens. The CZT works with proper frequency parameters to control the position and size of the input frequency spectrum. The accurate positioning leads to an efficient packing of the multiplexed images and a remarkable improvement of the signal-to-noise ratio of the decrypted pictures. The introduction of the CZT in the field of encryption is significant, since it can expand the functionality to a dynamic regime of optical and digital architectures for static encoding. We validated the feasibility of our proposal with the encryption and decryption of a color image sequence and a set of binary images.

Patch-based classification of thyroid nodules in ultrasound images using direction independent features extracted by two-threshold binary decomposition

Ultrasound imaging of the thyroid gland is considered to be the best diagnostic choice for evaluating thyroid nodules in early stages, since it has been marked as cost-effective, non-invasive and risk-free. Computer aided diagnosis (CAD) systems can offer a second opinion to radiologists, thereby increasing the overall diagnostic accuracy of ultrasound imaging. Although current CAD systems exhibit promising results, their use in clinical practice is limited. Some of the main limitations are that the majority use direction dependent features so, they are only compatible with static images in just one plane (axial or longitudinal), requiring precise segmentation of a nodule. Our intention has been to design a CAD system which will use only direction independent features i.e., not dependent upon the orientation or inclination angle of the ultrasound probe when acquiring the image. In this study, 60 thyroid nodules (20 malignant, 40 benign) were divided into small patches of 17 × 17 pixels, which were then used to extract several direction independent features by employing Two-Threshold Binary Decomposition, a method that decomposes an image into the set of binary images. The features were then used in Random Forests (RF) and Support Vector Machine (SVM) classifiers to categorize nodules into malignant and benign classes. Classification was evaluated using group 10-fold cross-validation method. Performance on individual patches was then averaged to classify whole nodules with the following results: overall accuracy, sensitivity, specificity and area under receiver operating characteristics (ROC) curve: 95%, 95%, 95%, 0.971 for RF and; 91.6%, 95%, 90%, 0.965 for SVM respectively. The patch-based CAD system we present can provide support to radiologists in their current diagnosis of thyroid nodules, whereby it can increase the overall accuracy of ultrasound imaging.

Surroundedness based multiscale saliency detection

In this paper, a surroundedness-based multiscale saliency method is proposed based on the Gestalt principles for figure-ground segregation, which states that (1) surrounded regions are more likely to be perceived as figures, (2) the humans understand the external stimuli as whole rather than the sum of their parts. First, an image is characterized by a set of binary images, which is generated by a simple and effective homogeneous region extraction method with well contour preservation. And the contour confidence map is obtained by a fast contour detection method. Then for each connect homogeneous region in a binary map, surroundedness is defined by the average outer contour confidence. Finally, integrating the background priors, multiscale saliency maps are generated and combined to the final saliency map. The proposed method is evaluated on two widely used public datasets with pixel accurate salient region annotations using both precision and recall analysis and ROC analysis. And the experimental results show that the proposed method outperforms 14 alternative methods.

Exploiting Surroundedness for Saliency Detection: A Boolean Map Approach.

We demonstrate the usefulness of surroundedness for eye fixation prediction by proposing a Boolean Map based Saliency model (BMS). In our formulation, an image is characterized by a set of binary images, which are generated by randomly thresholding the image's feature maps in a whitened feature space. Based on a Gestalt principle of figure-ground segregation, BMS computes a saliency map by discovering surrounded regions via topological analysis of Boolean maps. Furthermore, we draw a connection between BMS and the Minimum Barrier Distance to provide insight into why and how BMS can properly captures the surroundedness cue via Boolean maps. The strength of BMS is verified by its simplicity, efficiency and superior performance compared with 10 state-of-the-art methods on seven eye tracking benchmark datasets.

A Hybrid Lossless-Lossy Binary Image Compression Scheme

In this paper, the authors present a binary image compression scheme that can be used either for lossless or lossy compression requirements. This scheme contains five new contributions. The lossless component of the scheme partitions the input image into a number of non-overlapping rectangles using a new line-by-line method. The upper-left and the lower-right vertices of each rectangle are identified and the coordinates of which are efficiently encoded using three methods of representation and compression. The lossy component, on the other hand, provides higher compression through two techniques. 1) It reduces the number of rectangles from the input image using our mathematical regression models. These mathematical models guarantees image quality so that rectangular reduction should not produce visual distortion in the image. The mathematical models have been obtained through subjective tests and regression analysis on a large set of binary images. 2) Further compression gain is achieved through discarding isolated pixels and 1-pixel rectangles from the image. Simulation results show that the proposed schemes provide significant improvements over previously published work for both the lossy and the lossless components.

Parameterized real-time moment computation on gray images using block techniques

Moments constitute a well-known tool in the field of image analysis and pattern recognition, but they suffer from the drawback of high computational cost. Efforts for the reduction of the required computational complexity have been reported, mainly focused on binary images, but recently some approaches for gray images have been also presented. In this study, we propose a simple but effective approach for the computation of gray image moments. The gray image is decomposed in a set of binary images. Some of these binary images are substituted by an ideal image, which is called "half-intensity" image. The remaining binary images are represented using the image block representation concept and their moments are computed fast using block techniques. The proposed method computes approximated moment values with an error of 2---3% from the exact values and operates in real time (i.e., video rate). The procedure is parameterized by the number m of "half-intensity" images used, which controls the approximation error and the speed gain of the method. The computational complexity is O(kL 2), where k is the number of blocks and L is the moment order.

Shape from inconsistent silhouette

Shape from silhouette (SfS) is the general term used to refer to the techniques that obtain a volume estimate from a set of binary images. In a first step, a number of images are taken from different positions around the scene of interest. Later, each image is segmented to produce binary masks, also called silhouettes, to delimit the objects of interest. Finally, the volume estimate is obtained as the maximal one which yields the silhouettes. The set of silhouettes is usually considered to be consistent which means that there exists at least one volume which completely explains them. However, silhouettes are normally inconsistent due to inaccurate calibration or erroneous silhouette extraction techniques. In spite of that, SfS techniques reconstruct only that part of the volume which projects consistently in all the silhouettes, leaving the rest unreconstructed. In this paper, we extend the idea of SfS to be used with sets of inconsistent silhouettes. We propose a fast technique for estimating that part of the volume which projects inconsistently and propose a criteria for classifying it by minimizing the probability of miss-classification taking into account the 2D error detection probabilities of the silhouettes. A number of theoretical and empirical results are given, showing that the proposed method reduces the reconstruction error.

An evolutionary algorithm for fractal coding of binary images

An evolutionary algorithm is used to search for iterated function systems (IFS) that can encode black and white images. As the number of maps of the IFS that encodes an image cannot be known in advance, a variable-length genotype is used to represent candidate solutions, Accordingly, feasibility conditions of the maps are introduced, and special genetic operators that maintain and control their feasibility are defined, In addition, several similarity measures are used to define different fitness functions for experimentation. The performance of the proposed methods is tested on a set of binary images, and experimental results are reported.