N. I. Glumov

A hierarchical compression method for space images

We consider an image compression method based on hierarchical grid interpolation and its application in two practical problems: storing space images in large databases and onboard data processing in remote sensing systems. We give a general description of the method, results of comparing this method with others in both efficiency and access time for space images stored in a database. We give algorithms of stabilizing the compressed data flow and increasing its error-resistance that are necessary to implement the method in onboard systems.

Detection of objects on the image using a sliding window mode

A procedure is proposed for processing images and detecting objects using a sliding window mode and allowing for an effective realization in terms of the computational complexity and the quality of detection. The main stages of data transformation are reported: preliminary image processing, recursive calculation of local features, the generation of the field of values for the discriminant function and object localization. The algorithm of the parametric set-up is developed and realized in the form of the learning of a linear classifier. An example is presented that shows the efficiency of the developed detection procedure.

Regional geographic information systems for gas network monitoring

This work considers the construction principles, architecture, and software of regional geographic information systems designed for monitoring gas networks.

The New Blockwise Algorithm for Large-Scale Images Robust Watermarking

A new algorithm for digital watermarking of large-scale digital images is proposed in the article. The proposed algorithm provides watermark robustness to a wide range of host image distortions and has a number of advantages compared to an existing algorithms of robust watermarking.

Parallel-recursive local image processing and polynomial bases

For image processing using sliding window mode, it is shown that the algorithms realizing the parallel-recursive calculation of the convolution with the approximation of the impulse response FIR-filter by polynomial bases are the best suited.

Algorithms for detection of plain copy-move regions in digital images

This paper presents two algorithms for detection of plain copy-move regions—fully matching fragments—in images. Both algorithms represent data of the fragment in the form of a hash value, where the hash function is constructed using different mathematical principles: probability-theoretical and numerical-theoretical. The paper presents a comparison of the proposed algorithms, as well as recommendations for their use.

Preparing a common raster coverage for a territory based on hierarchical compressed presentation of orthoimages

Technology for the quick viewing of georeferenced images has been developed. Principles of the organization and structure of hierarchical HGI format, which is intended to store compressed images with controlled maximal error, are presented. Additionally, a basic method of HGI format compression is described. The advantages of using the HGI format for covering a territory with orthoimages are described.

Software environment for simulating algorithms for image analysis and processing

We consider the purpose, functionality, configuration, and structure of a software environment designed for simulation and investigation of methods, algorithms, and information technology for digital images analysis and processing.

Stabilization of the compressed data formation rate in hierarchical image compression

A new method is proposed for stabilizing the rate of compressed data formation in the case of hierarchical image compression. The method is based on using various values of the control parameter (maximum error) for various scale levels of image representation and for error correction at the last level depending on the received compressed information content.

Analysis of images for local artificial changes with JPEG compression properties

The authors have solved the problem of detecting the local artificial changes (falsifications) with JPEG compression properties [1]. The known methods for detecting these changes [2–4] describe only the distinctive properties of JPEG compressed images from those without compression. The authors have also developed an algorithm for detecting local embeddings with compression properties on the images and for determining the shifts of embedded JPEG blocks in relation to the embedding coordinates, which are multiples of eight. The relationship between the period of peaks at the spectrum of the histogram of DCT coefficients and the quality factor of the JPEG compression algorithm is found. The paper presents the numerical results on the quality of the true and false embedding detections for the developed algorithm.