Contour method of compressing graphical files

FIELD: information technology.

SUBSTANCE: snap-shot of a graphic image is reduced by resising by 4 times. The snap-shot is compressed and stored as a compressed file, which can be decompressed and increased by 4 times. The initial snap-shot of the graphic image is then superimposed onto a decompressed increased snap-shot. Differences of pixel values between the initial snap-shot of the graphical image and the decompressed increased snap-shot are searched for, from a given contrast, based on contrast elements using arithmetical subtraction. After that a snap-shot with contour values is obtained, and contrast elements are compressed and stored as a compressed file.

EFFECT: increased efficiency of compressing files and reducing amount of memory required with retention of definition of the graphical image after decompression of files.

8 dwg

 

The invention relates to processing, compression and transmission of information, in particular contour method for compressing image files, and can be used in the systems of transmission and reception of compressed image files.

The prior art method for the production of the input file using. Meta image compression image data, comprising: (a) preparing an extensible text format MPEG-4 (HMT) scheme, which determines the site of compression (the BitWrapper node)that contains information about the data object, which is compressed by encoding the parameters for compression, including the format of the compressed bit stream, and AFXConfig type definition decoders available to decrypt the transmitted bit stream; (C) preparation XMT2BIFS, development tables that support the transformation of the input file HMT in the object file according to the scheme HMT, and object XMT2MUX that supports converting input file HMT file switch according the scheme HMT; (C) create a file object file switch; (d) determination of the content of the file object obtained as a result of parsing the uncompressed graphics object data; and (e) detecting the presence of the uncompressed graphics object data (US 2005131930, 16.06.2005).

The known method for efficient compression of the graphic content in complex PDF files containing combined complex graphics pages, each of to the which is composed of the base page and zero or more overlays and page PDF, however, pages and graphic elements on each page is stored in a static PDF files (US 7020837, 28.03.2006).

There is a method of lossless compression for an image file in which compressed image file according specifies various parameters length register compression and choose the optimal length parameter register compression. After that, the compressed image file according to the selected optimal length parameter, then the main information file (graphic information), information compression, and so forth together with the compressed data are written to the file, thereby forming a file compression (CN 1595452, 16.03.2005).

The disadvantages of these methods is that after the transfer the compressed files and decompress the graphic image output loses clarity, in addition, the slow transfer of compressed files.

The challenge which seeks the proposed invention, is to establish an outline of the method for compressing image files, which would rule out the disadvantages indicated above.

Technical result achieved in the implementation of this invention is to improve the efficiency of the compression/decompression of the file and reducing employment resource memory while maintaining the clarity of the graphic image after decompression of files.

This technical result is achieved in the contour method, the pressing of graphic files in which the frame of the graphic image is reduced by using resizing at least 4 times, compress and store it in a compressed file that decompression and increase at least 4 times, then the original frame of the graphic image placed on increased decompression frame and searches for the difference of the pixel values based on the set value of contrast on the basis of contrasting elements, using arithmetic subtraction, after the received frame with the values of the circuit contrasting elements compress and store in a compressed file.

The invention is illustrated by drawings, where figure 1-5 shows the first outline the method for compressing image files; 6, 7 - second contour method for compressing image files.

Figure 1 shows the original frame of the graphic image, reduced by resizing 4 times;

Figure 2 - reduced frame graphics, compressed by any standard methods: JPEG, Wavelet, DIKM-LOSSY. LZW, ZIP, RAR LOSSLESS;

Figure 3 is a compressed file reduced in 4 times frame, decompressional (reverse process of compression), and increased in 4 times;

Figure 4 - frame with the values of the circuit contrasting elements;

5 is a table of relations contrasting elements;

6 is a table groups the most contrasting elements;

Fig.7 - contour values for each of the groups ka is RA graphical image;

Fig received by the first or second contour method for compressing image files frame graphic image.

Outline the method for compressing image files STU (STU file is a compressed file with the extension *.stu - STU Technologies (Space Technology Universal - Cosmic Universal Technology)) contains steps:

a) the frame of the graphic image is reduced by using resizing at least 4 times, compress and store it in a compressed file STU;

b) a compressed file STU decompression and increase at least 4 times.

in) source frame graphic images placed on increased decompression frame and searches for the difference of the pixel values on the basis of contrasting elements, using arithmetic subtraction;

d) the frame with the values of the circuit contrasting elements compress and store in a compressed file STU.

Outline the method for compressing image files may be performed by another method, namely in the following stages:

a) recognize the contour shape of the contrasting elements of the graphical image with the maximum values of the difference of neighboring pixels in the frame images and break them into groups, from the maximum contrast values of pixels to a minimum;

b) neighboring pixels, which appear most contrasting elements of the graphical image, d is the TES group, write one bit to 1 and all other values are recorded as ' 0'.

in space with zero-fill the byte values of the pixels and calculate smooth transitions from the maximum contrast of elements to less contrasting elements;

g) retain each contrast element of the graphical image in a separate contour file, then compress it;

d) compressed contour files are combined into a single compressed output file after contouring STU why make consecutive arithmetic subtraction from each other contour files.

The procedure of processing and compression:

The frame of the graphic image of any resolution in pixels with color specifications 24-bit color, reduced by resizing at least 4 times (figure 1).

The frame of the graphic image is compressed by any standard methods: JPEG, Wavelet, DIKM-LOSSY. LZW, ZIP, RAR OSSLESS (figure 2).

Then the compressed file of the frame of the graphic image is stored, and in the future will be part of the compressed file STU Technologies - *.stu. (STU - Space Technologies Universal). The compressed file is reduced in 4 times the frame of the graphic image is uncompressed (the reverse process of compression, i.e. decomposition, extension) and increased in 4 times back (figure 3).

When using compression algorithms with errors - LOSSY, especially JPEG, the which fills the image spurious artifacts, is the averaging of the pixel values (2×2, 3×3 and so on).

Procedure resize (reduce) 4 times frame graphic images can not be used, and the image quality is improved, but the compression ratio is getting worse.

The original frame of the graphic image is superimposed on decompression, dernity (enhanced) frame graphics and search the difference of the pixel values on the basis of contrasting elements, using a simple arithmetic subtraction.

If the difference of pixel values between the original and decompression, deresined frame graphics are the same, or similar, are zeros. If the difference of pixel values between the original and decompression, deresined frame graphics - great, is the result of an arithmetic subtraction.

The frame of the graphic image with the values of the circuit contrasting elements very well compressed, because it is dominated by zero values (figure 4).

However, the need to compress only those algorithms whose recovery has 100% reliability, which is verified by a bitwise comparison is LOSSLESS.

The frame of the graphic image with the values of the contour of contrasting elements is compressed, and the compressed file is included with the compressed is Ayla STU Technologies - *.stu.

Component difference values of the pixels is determined by the appearance of the maximum values on the basis of contrast (figure 5). The range of difference contrasting elements can be narrowed or expanded.

When you narrow the search range of contrasting elements, the compression ratio is increased, and the quality is deteriorating. With a wide range of contrasting elements, the compression ratio is reduced and the image quality is increased.

The recovery process of the compressed file *.stu, is in the reverse order (Fig).

Graphic file in another embodiment, the considered contour shape of the contrasting elements of the pixel values.

First searched contour outlines contrasting elements with a maximum difference values of neighboring pixels. The relationship table contrasting elements can be divided into several groups, from the maximum contrast values of pixels to the minimum (6).

As defined zone of pixel values, there is no need to record their values.

Then, we examine the file of the first group tables the most contrasting elements. Those neighboring pixels that have appear maximally contrasting elements in this group are recorded as a bit 1. All other values are recorded as 0.

Knowing the values of the most contrast the x elements of the first group and less contrasting elements, space with zero values, easy to complete byte pixel values, and calculated smooth transitions from the maximum contrast of elements to less contrast.

In this case, the table definitions contrasting elements was divided into 7 groups (6).

Each file is very well compressed by any algorithm with a 100% accuracy recovery - LOSSLESS. All compressed files are merged into one, which is compressed target file after contouring STU. 1K+2K+3K+4K+5K+6K+7K=*.stu.

To obtain the maximum compression ratio, it is necessary to perform serial subtraction contour files.

Contour values for each of the 7 groups are subtracted sequentially from each other simple arithmetic operation (Fig.7).

1K-2K=2m, 2K-3K=3M, 3K-4K=4m, 4K-5K=5m, 5K-6K=6m, and 6K-7K=7m, 7K-Original_k=Okm

Compressed files are 1K+2m+3M+4m+5m+6m+7m+ACM=*.stu

Information (graphics, multimedia, image: surveillance of the object, film, etc. is recorded or immediately without delay is transmitted using a digital camera (video camera can be different at any resolution), that is, the flow of multimedia information in real time. The process of information transmission can occur via computer and telecommunication networks (e.g. the Internet) in real-time. When you do this) is generated (transmitted) information processed contour method for compressing image files. If the information is transmitted immediately (without an appointment), then the transfer process is faster (no time delay and the number of displayed frames in a specified period of time passes without delay) and the image quality is much higher than at other ways of handling compression of image files, as well as high bandwidth. Information may be received by any mobile means of communication radio channels on the display means, for various purposes, for example, a computer, a laptop, palmtop computer, etc.

After thorough testing were selected optimal compression ratio and image quality, in different variants.

Any graphics file format is transformed into the format of Microsoft - *RAW or *.bmp.

Contour compression method of image files, characterized in that the frame of the graphic image is reduced by using resizing at least 4 times, compress and store it in a compressed file that decompression and increase at least 4 times, then the original frame of the graphic image placed on decompression increased frame, searches for the difference of pixel values between the original frame images and decompression extended shot of the backside of the tion of the contrast values on the basis of contrasting elements using arithmetic subtraction from each other, after the received frame with the values of the circuit contrasting elements compress and store in a compressed file.



 

Same patents:

FIELD: physics, computation equipment.

SUBSTANCE: the invention claims method of image blur compensation involving: calculation of difference between measured image pixel brightness and brightness assessment obtained earlier on the basis of previous frame sequence; movement detection by comparison of obtained difference to threshold value; defining of movement direction for each pixel; combination of adjoining pixels with the same movement direction in a single object; outlining contours of moving objects by adding their initial B(k) and gradient ▿(B(k)) of images; and generation of output image where k1, k2 are weight factors. Device of image blur compensation includes: image sensor, controller, mode movement detection module, object detection module, correction module, first RAM device, second RAM device, third RAM device, counter, first comparator, second comparator, first multiplexor, second multiplexor, third multiplexor, fourth multiplexor, fifth multiplexor, sixth multiplexor, seventh multiplexor, first demultiplexor, second demultiplexor.

EFFECT: blur compensation for moving object image in real-time mode.

2 cl, 11 dwg

FIELD: physics, image processing.

SUBSTANCE: invention concerns digital image processing and can be applied in devices for automatic or personal identification by fingerprints. The method includes intensity gradient assessment calculation for each image pixel, including calculation of average intensity gradient magnitude for each pixel in arbitrary shaped local image areas with their size defined by parameters set in advance, calculation of average gradient magnitude for processed image, division of all pixels into two groups (background and image), object and background areas tagging and defining their size, forming of continuous areas by uniting tagged areas and defining their sizes, defining size limit values for continuous object areas, defining size limit values for continuous background areas, transition of object and background areas with sizes less than product of obtained limit values and given weighting factors to background and object areas respectively.

EFFECT: improved quality of object areas selection.

4 dwg

FIELD: video technology.

SUBSTANCE: invention refers to video compression, particularly to the image block compression systems. The method of image processing is suggested, which includes the definition of whether the two image blocks are adjacent or not, and whether the two blocks are subdivided or not. If the two blocks are adjacent, then the filtration of block smoothing at one or more border pixels of the two adjacent blocks occurs if it is defined that both of the adjacent blocks are not subdivided.

EFFECT: increase in the block smoothing efficiency with the use of border information.

33 cl, 24 dwg

FIELD: machine vision systems.

SUBSTANCE: gradient method of object contour extraction at a halftone raster image matrix is proposed. The substance of the method is as follows: for all raster image pixels, the pixel brightness gradient norm or norm square is calculated using the selected method; then all elements, for which the gradient norm or the norm square exceeds the threshold value, are highlighted black on white on a new black-and-white monochrome matrix; coherent configurations of black elements are considered as object contours on the monochrome matrix; the factor is determined for the selected gradient calculation method, then the gradient norm square threshold value is calculated as a product of this factor times the sum of mean adjacent pixel brightness change modulus value squares, by rows and columns, for pixels, the values for which exceed the grand mean non-zero change levels, by rows and columns accordingly; among coherent configurations of black elements on the monochrome matrix, configurations with less than 5-7 elements are rejected immediately; for the remaining configurations, the mean degree of adjacency is calculated as a quotient of the sum for all configuration elements adjacent to that element divided by the sum of elements in the configuration; configurations with a mean degree of adjacency less than 3 are rejected, and the remaining configurations are accepted as the required object contours.

EFFECT: increase in object contour extraction quality in raster images.

3 dwg

FIELD: video image processing.

SUBSTANCE: unit for pixel depth increasing is implemented with the possibility to scale colour pixel depth of video image frame, an area subdividing unit is implemented with the possibility to divide a video image frame producing areas of equal size for each colour and ensuring successive switching-over between areas and colours; at that, each conveyor is implemented with the possibility to delete false contours in two areas in four directions simultaneously, and an averaging unit is implemented with the possibility to calculate an average sum of data from outputs of four conveyors for each colour.

EFFECT: increase of image colour pixel depth along with deletion of false contours in real time.

16 cl, 3 dwg

FIELD: methods for removing noise in an image, possible use for improving quality of image.

SUBSTANCE: in accordance to the invention, effect is achieved due to conversion of brightness of image pixels with noise by means of solving the diffusion equation in non-divergent form, which ensures simultaneous suppression of noise and preservation of image edges.

EFFECT: simplified noise removal and increased quality of resulting digital image.

4 cl, 1 dwg

FIELD: digital processing of images, possible use for improving digital colored or halftone image.

SUBSTANCE: in accordance to invention, filtration of noises is performed, correction of global contrast is realized, brightness component is extracted from image as maximal one out of R, G, B components, local correction parameters are determined for light and dark tones, bilateral filtration of image brightness is performed, dark and light tones are corrected in brightness channel. Correction of dark image tones is performed due to addition to brightness channel of result of multiplication of difference between image of details in dark tones and brightness, inversion of result of bilateral filtration, raised to certain power, which determines width of tone spectrum, and amplification coefficient of dark tones, while image of details in dark tones is a function of ratio of brightness of original image and filtered image. Correction of light image tones is performed due to subtraction from brightness channel of difference between result of multiplication of brightness and image of details in light tones, result of bilateral filtration of brightness, raised to certain power which determines width of tone spectrum, and light tones weakening coefficient, while image of details in light tones is a function of ratio of filtered image and brightness of original image, image correction result is converted to RGB color system.

EFFECT: ensured correction of global contrast, local correction of light and dark tones, suppression of noises with a certain increase of image detail.

9 cl, 16 dwg

FIELD: physics, computation equipment.

SUBSTANCE: the invention claims method of image blur compensation involving: calculation of difference between measured image pixel brightness and brightness assessment obtained earlier on the basis of previous frame sequence; movement detection by comparison of obtained difference to threshold value; defining of movement direction for each pixel; combination of adjoining pixels with the same movement direction in a single object; outlining contours of moving objects by adding their initial B(k) and gradient ▿(B(k)) of images; and generation of output image where k1, k2 are weight factors. Device of image blur compensation includes: image sensor, controller, mode movement detection module, object detection module, correction module, first RAM device, second RAM device, third RAM device, counter, first comparator, second comparator, first multiplexor, second multiplexor, third multiplexor, fourth multiplexor, fifth multiplexor, sixth multiplexor, seventh multiplexor, first demultiplexor, second demultiplexor.

EFFECT: blur compensation for moving object image in real-time mode.

2 cl, 11 dwg

FIELD: physics, processing of images.

SUBSTANCE: invention is related to methods of television image processing, namely, to methods of detection and smoothing of stepped edges on image. Method consists in the fact that pixels intensity values (PIV) of image are recorded in memory; for every line: PIV of the current line is extracted; PIV of line that follows the current line is extracted; dependence of pixel intensity difference module dependence (PIDMD) is calculated for the mentioned lines that correspond to single column; PIDMD is processed with threshold function for prevention of noise; "hill" areas are determined in PIDMD; single steps are defined out of "hill" areas; PIV of line that is next nearest to the current line is extracted; for current line and line next nearest to the current line operations of "hill" areas definition are repeated; for every part of image line that is defined as single step, availability of stepped area is checked in image in higher line, if so, these two stepped areas are defined as double stepped area (DSA); parts of DSA lines are shifted in respect to each other, and DSA is divided into two single steps; values of line pixels intensity are extracted for the line that is located in two lines from the current line, and operations of "hill" areas definition are repeated; single steps are smoothened by averaging of pixel intensity values.

EFFECT: improvement of quality of image stepped edges correction.

2 dwg

FIELD: computer science, possible use for measuring coordinates of light objects and processing their movement trajectory.

SUBSTANCE: device containing transmitting television tube, blocks forming spiral scanning of television tube ray, and signals processing block, additionally has clock pulse counter and video pulse counter, and also analog-digital converter and visual observation block, constructed on basis of piezo-deflectors with optical reflectors at the end. It is possible to output information about 72000 light objects at 100 Hz frequency.

EFFECT: possible measurement of polar coordinates of light objects, simultaneously located within objective observation field, their brightness, transverse size of image and distance from axis within observation field of each frame (order number).

3 dwg, 1 tbl

The invention relates to automation and computer engineering and can be used for recognition of objects or groups of objects among a large number of templates

The invention relates to automatic control and computer engineering and can be used as part of specialized computational image processing systems, in particular images, the described offset rectangular rasters

The invention relates to a technique of perception and image processing

The invention relates to automation and computer engineering and can be used for pattern recognition, namely, to determine the area and perimeter of the image

The invention relates to automatic control and computer engineering and can be used for recognition, namely when defining the perimeter of the image

The invention relates to computing

FIELD: computer science, possible use for measuring coordinates of light objects and processing their movement trajectory.

SUBSTANCE: device containing transmitting television tube, blocks forming spiral scanning of television tube ray, and signals processing block, additionally has clock pulse counter and video pulse counter, and also analog-digital converter and visual observation block, constructed on basis of piezo-deflectors with optical reflectors at the end. It is possible to output information about 72000 light objects at 100 Hz frequency.

EFFECT: possible measurement of polar coordinates of light objects, simultaneously located within objective observation field, their brightness, transverse size of image and distance from axis within observation field of each frame (order number).

3 dwg, 1 tbl

FIELD: physics, processing of images.

SUBSTANCE: invention is related to methods of television image processing, namely, to methods of detection and smoothing of stepped edges on image. Method consists in the fact that pixels intensity values (PIV) of image are recorded in memory; for every line: PIV of the current line is extracted; PIV of line that follows the current line is extracted; dependence of pixel intensity difference module dependence (PIDMD) is calculated for the mentioned lines that correspond to single column; PIDMD is processed with threshold function for prevention of noise; "hill" areas are determined in PIDMD; single steps are defined out of "hill" areas; PIV of line that is next nearest to the current line is extracted; for current line and line next nearest to the current line operations of "hill" areas definition are repeated; for every part of image line that is defined as single step, availability of stepped area is checked in image in higher line, if so, these two stepped areas are defined as double stepped area (DSA); parts of DSA lines are shifted in respect to each other, and DSA is divided into two single steps; values of line pixels intensity are extracted for the line that is located in two lines from the current line, and operations of "hill" areas definition are repeated; single steps are smoothened by averaging of pixel intensity values.

EFFECT: improvement of quality of image stepped edges correction.

2 dwg

Up!