Steganography in binary image by checking data-carrying eligibility of boundary pixels

We present a novel scheme for embedding secret data into a binary image without introducing noticeable artifacts. Unlike some block-based methods, the proposed scheme encodes the secret bits directly into boundary pixels by checking each pixel of the cover image in a pseudo-random order for embedding eligibility. A set of rules ensures correct identification of data-carrying pixels in blind extraction. The proposed scheme does not generate isolated dots, and can incorporate various coding methods such as matrix encoding to further improve the embedding performance. It is shown that up to one fourth of the boundary pixels may be used to carry secret data. Experimental results indicate that the method can achieve good visual quality with fairly large data capacity.

Binary Image Steganalysis Based on Distortion Level Co-Occurrence Matrix

In recent years,binary image steganography has developed so rapidly that the research of binary image steganalysis becomes more important for information security.In most state-of-the-art binary image steganographic schemes,they always find out the flippable pixels to minimize the embedding distortions.For this reason,the stego images generated by the previous schemes maintain visual quality and it is hard for steganalyzer to capture the embedding trace in spacial domain.However,the distortion maps can be calculated for cover and stego images and the difference between them is significant.In this paper,a novel binary image steganalytic scheme is proposed,which is based on distortion level co-occurrence matrix.The proposed scheme first generates the corresponding distortion maps for cover and stego images.Then the co-occurrence matrix is constructed on the distortion level maps to represent the features of cover and stego images.Finally,support vector machine,based on the gaussian kernel,is used to classify the features.Compared with the prior steganalytic methods,experimental results demonstrate that the proposed scheme can effectively detect stego images.

A fast connected components labeling algorithm for binary images

A fast label-equivalence-based connected components labeling algorithm is proposed in this paper.It is a combination of two existing efficient methods,which are pivotal operations in two-pass connected components labeling algorithms.One is a fast pixel scan method,and the other is an array-based Union-Find data structure.The scan procedure assigns each foreground pixel a provisional label according to the location of the pixel.That is to say,it labels the foreground pixels following background pixels and foreground pixels in different ways,which greatly reduces the number of neighbor pixel checks.The array-based Union-Find data structure resolves the label equivalences between provisional labels by using only a single array with path compression,and it improves the efficiency of the resolving procedure which is very time-consuming in general label-equivalence-based algorithms.The experiments on various types of images with different sizes show that the proposed algorithm is superior to other labeling approaches for huge images containing many big connected components.

A Binary Images Watermarking Algorithm Based on Adaptable Matrix

A watermarking algorithm of binary images using adaptable matrix is presented. An adaptable matrix is designed to evaluate the smoothness and the connectivity of binary images. The watermark is embedded according to the adaptable matrix in this algorithm. In the proposed watermarking algorithm, each image block implements a XOR operation with the binary adaptable matrix, which has the same size with the image block, and in order to embed the watermark data, a multiplication operation are also implemented with the weight matrix. The experimental results show that proposed scheme has a good performance.

A NAM Representation Method for Data Compression of Binary Images

A representation method using the non-symmetry and anti-packing model （NAM） for data compression of binary images is presented. The NAM representation algorithm is compared with the popular linear quadtree and run length encoding algorithms. Theoretical and experimental results show that the algorithm has a higher compression ratio for both Iossy and Iossless cases of binary images and better reconstructed quality for the Iossy case.

A novel binary image representation algorithm by using NAM and coordinate encoding procedure and its application to area calculation

We propose a novel binary image representation algorithm using the non-symmetry and anti-packing model and the coordinate encoding procedure （NAMCEP）. By tak- ing some idiomatic standard binary images in the field of image processing as typical test objects, and by comparing our proposed NAMCEP representation with linear quadtree （LQT）, binary tree （Bintree）, non-symmetry and anti-packing model （NAM） with K-lines （NAMK）, and NAM representa- tions, we show that NAMCEP can not only reduce the aver- age node, but also simultaneously improve the average com- pression. We also present a novel NAMCEP-based algorithm for area calculation and show experimentally that our algo- rithm offers significant improvements.

Binary Image Reconstruction Based on Prescribed Numerical Information

The problem of reconstruction of a binary image in the field of discrete tomography is a classic instance of seeking solution applying mathematical techniques. Here two such binary image reconstruction problems are considered given some numerical information on the image. Algorithms are developed for solving these problems and correctness of the algorithms are discussed.

New Algorithm for Binary Connected-Component Labeling Based on Run-Length Encoding and Union-Find Sets

Based on detailed analysis of advantages and disadvantages of the existing connected-component labeling （CCL） algorithm,a new algorithm for binary connected components labeling based on run-length encoding （RLE） and union-find sets has been put forward.The new algorithm uses RLE as the basic processing unit,converts the label merging of connected RLE into sets grouping in accordance with equivalence relation,and uses the union-find sets which is the realization method of sets grouping to solve the label merging of connected RLE.And the label merging procedure has been optimized：the union operation has been modified by adding the ＂weighted rule＂ to avoid getting a degenerated-tree,and the ＂path compression＂ has been adopted when implementing the find operation,then the time complexity of label merging is O（nα（n））.The experiments show that the new algorithm can label the connected components of any shapes very quickly and exactly,save more memory,and facilitate the subsequent image analysis.

Retrieval of High Resolution Satellite Images Using Texture Features

In this research, a content-based image retrieval （CBIR） system for high resolution satellite images has been developed by using texture features. The proposed approach uses the local binary pattern （LBP） texture feature and a block based scheme. The query and database images are divided into equally sized blocks, from which LBP histograms are extracted. The block histograms are then compared by using the Chi-square distance. Experimental results show that the LBP representation provides a powerful tool for high resolution satellite images （HRSI） retrieval.

Three-Dimensional Reconstructed Finite Element Model for C/C Composites by Micro-CT

The precise microscopic feature of carbon-carbon(C/C)composites is essential for an accurate prediction of their mechanical behavior.After fabrication,actual microscopic feature differs from simple ideal spatial model.Micro-computed-tomography(CT)scan can well describe internal microstructures of composites.Therefore,a reconstructed model is developed based on mirco-CT,by a series of prodcedures including extracting components,generating new binary images and establishing a finite element(FE)model.Compared with the model designed by reconstructed commercial software MIMICS,the presented reconstructed FE model is superior in terms of high mesh quality and controllable mesh quantity.The precision of the model is verified by experiment.

A novel particle tracking algorithm using polar coordinate system similarity

A new algorithm using polar coordinate system similarity （PCSS） for tracking particle in particle tracking velocimetry （PTV） is proposed. The essence of the algorithm is to consider simultaneously the changes of the distance and angle of surrounding particles relative to the object particle. Monte Carlo simulations of a solid body rotational flow and a parallel shearing flow are used to investigate flows measurable by PCSS and the influences of experimental parameters on the implementation of the new algorithm. The results indicate that the PCSS algorithm can be applied to flows subjected to strong rotation and is not sensitive to experimental parameters in comparison with the conventional binary image cross-correlation （BICC） algorithm. Finally, PCSS is applied to images of a real experiment.

A Hybrid-Binarization Approach for Degraded Document Enhancement

Images get degraded because of unbalanced enlightenment including text-smearing, ink-bleeding, degradation of ink over time, manuscript characters from background coming out and blended with the characters of the main side etc. So, degraded-document enhancement is a challenging issue. In recent years, several binarization approaches are proposed to enhance these images. These techniques have focused on finding a suitable global threshold value or a local threshold value for every region to eliminate the degradations. A hybrid approach can be a good solution to deal with all these matters together. This paper proposes a hybrid approach of binarization for degraded documents to produce better quality result. Then, the performance of the proposed technique is evaluated using DIBCO 2010 to DIBCO 2018 databases and compared with the existing methods which confirmed that the proposed method is robust, efficient. Finally, a direction towards future works and challenges is stated.

Use of Sentinel-1 imagery for flood management in a reservoir-regulated river basin

Flood hazard monitoring and mapping is of great importance because it represents a significant contribution to risk management. The present study investigated the flood event that occurred downstream from the transboundary Strymon River basin, more specifically at Serres basin-a reservoir-regulated basin, in the beginning of 2015. The focus of this study was to better understand the spatio-temporal dynamic of the flood and the causes that initiated the hazard. Within the Serres basin, the Strymon transboundary river outflows to Lake Kerkini, which regulates water flow downstream for irrigation purposes and flood protection. For this research, a dataset of Sentinel-1 SAR GRD images was collected and processed covering the period of October 2014-October 2015 to investigate the water level changes in Lake Kerkini. Based on SAR images, binary water/non-water products and multitemporal RGB amplitude images were generated and interpreted. Sentinel-1 products have proved to be an effective tool on flood hazard dynamic extension mapping and estimation of water extent bodies retained by small reservoirs. In agreement with hydro-meteorological data and the high-resolution DEM, it was conceived that the flood event occurred due to the water volume flowing from upstream in the reservoir and the large amount of water draining from the tributaries into nearby sub-basins. Moreover, inefficient water management of the overwhelming water flow through the dam could further strengthen the flood event. The proposed approach, which is entirely based on open access remotely sensed data and processing tools, could be implemented in the same area for past flood events to produce archive retrospective data, as well as in other similar reservoir-regulated river basins in terms of water management and flood risk management.

A proof of image Euler Number formula

Euler Number is one of the most important characteristics in topology. In twodimension digital images, the Euler characteristic is locally computable. The form of Euler Number formula is different under 4-connected and 8-connected conditions. Based on the definition of the Foreground Segment and Neighbor Number, a formula of the Euler Number computing is proposed and is proved in this paper. It is a new idea to locally compute Euler Number of 2D image.

RB-SLAM:visual SLAM based on rotated BEBLID feature point description

The extraction and description of image features are very important for visual simultaneous localization and mapping(V-SLAM).A rotated boosted efficient binary local image descriptor(BEBLID)SLAM(RB-SLAM)algorithm based on improved oriented fast and rotated brief(ORB)feature description is proposed in this paper,which can solve the problems of low localization accuracy and time efficiency of the current ORB-SLAM3 algorithm.Firstly,it uses the BEBLID to replace the feature point description algorithm of the original ORB to enhance the expressiveness and description efficiency of the image.Secondly,it adds rotational invariance to the BEBLID using the orientation information of the feature points.It also selects the rotationally stable bits in the BEBLID to further enhance the rotational invariance of the BEBLID.Finally,it retrains the binary visual dictionary based on the BEBLID to reduce the cumulative error of V-SLAM and improve the loading speed of the visual dictionary.Experiments show that the dictionary loading efficiency is improved by more than 10 times.The RB-SLAM algorithm improves the trajectory accuracy by 24.75%on the TUM dataset and 26.25%on the EuRoC dataset compared to the ORB-SLAM3 algorithm.