# Method of compressing graphics files

FIELD: information technology.

SUBSTANCE: method of compressing graphics files involves predetermining the number of gradations of reducing geometric dimensions of a source frame of a graphic image. For each gradation, geometric dimensions of the source frame of the graphic image are reduced, compressed and stored in a compressed file, and then latter decompressed and enlarged to the initial size. Pixel values of the enlarged decompressed frame are then subtracted from pixel values of the source frame of the graphic image and the result with values of the contrast element loop is compressed in form of a file. All values of the reduced compressed files and corresponding values of the compressed contrast element loop are then summed. The least of the obtained sums is selected as the result.

EFFECT: high rate of data transmission.

6 cl, 5 dwg

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

The prior art method (US 7020837, 28.03.2006) compression of the graphic content in complex PDF files containing combined complex graphics pages, each of which is composed of a base page and a few overlays and PDF pages. When this page and graphical elements on each page, keep in static PDF files.

The known method (CN 1595452, 16.03.2005) lossless compression for an image file, which is compressed graphic file according to the specified parameters length register compression, which selects the optimal length parameter register compression. Then compress image file according to the selected optimal length parameter. Then create a file compression, which put the compressed information and the compressed data.

The disadvantages of these methods analogous is that after the transfer the compressed files and decompress the graphic image output loses clarity in what ways analogs provide a relatively low compression ratio, which does not allow compressed files to transfer from the high speed data channels.

The closest and is a dialogue on the technical nature of the claimed contour is a compression method for images (patent RU 2339998 on the application 2007108339/09, 06.03.2007,).

In the most immediate way-the equivalent of the initial frame graphics (ICGI) reduce using special functions (resize, described in patent RU 2339998 on the application 2007108339/09, 06.03.2007, or through Microsoft office picture manager, which is included with the software package "Microsoft Office Tools"), at least 4 times. Compress and save it in a compressed file that decompression and increase at least 4 times. Then ICHI impose on decompression increased frame, searches for the difference of pixel values between ICGI and decompression enlarged frame from the set value of contrast on the basis of contrasting elements using arithmetic subtraction from each other. After the received frame with the values of the circuit contrasting elements (CCE) compress lossless and save in a compressed file.

The disadvantage is the closest method-analogue is that for compressed using files of ICGI with a relatively low index contrast is provided by the relatively low data rate. This is due to the relatively low compression ratio corresponding to the specified ICHI frames with the values of the ESCC, because they contain a relatively small number of zero coefficients.

The purpose of the claimed technical solution is to develop takoh the method of compression of image files, which provides a higher data rate due to the maximum extent possible, the compression ICHI and its frame with the values of the ESCC for a predefined number of N gradations reduce the geometric dimensions of ICHI.

This objective is achieved in that in the method for compressing image files, namely, that reduce the geometrical dimensions of ICGI, compress it and store it in a compressed file, which is then decompression and decompressional frame to increase the geometric dimensions of ICGI, and then calculate the frame with the values of the ESCC by algebraic subtraction of the pixel values of ICHI and increased decompressional frame is then obtained by subtracting the frame in the form of ESCC compress and store in a compressed file. Pre-set the number of N gradations reduce the geometric dimensions of ICGI, and for each n-th gradation, where n=1, 2,..., N , consistently take actions to reduce the geometric dimensions of ICGI, its compression, saved in a compressed file, decompression, increase decompressional frame to the original geometric size ICHI, the subtraction of the pixel values of ICGI pixel values increased decompressional frame, the compression obtained by subtracting the frame in the form of ESCC and its conservation, then summarize PE is reduced compressed frame and compressed the ESCC, remember a calculated amount, then all the N values stored amounts emit the least, and additionally retain a compressed file of the ESCC and the compressed file with reduced geometrical dimensions of ICGI belonging to the n-th gradation, in which the amount of compressed file the ESCC and the compressed file with reduced geometrical dimensions of ICGI least.

Reduce the geometrical dimensions of ICGI using bicubic interpolation procedure. Compress ICHI using the algorithm of the discrete cosine transform. Decompression ICHI using the algorithm of the discrete cosine transform. Increase the geometrical dimensions decompressional reduced ICHI using bicubic interpolation procedure. Compress the frame with the values of the ESCC using the algorithm of lossless compression.

Thanks to the new essential features provides a higher data rate for a predefined number of N gradations reduce the geometric dimensions of ICGI due to the minimum size (in bytes) the total value of the reduced file compressed ICHI and it compressed the ESCC.

The claimed method is illustrated by drawings on which is shown:

figure 1. The principle of reduction of the geometric dimensions of ICGI for the number of gradations of N=5. Here L is the horizon of the local size ICHI, expressed in pixels, N is the vertical size ICHI, expressed in pixels.

Fig. 2. Short form ICHI (H×L) and its reduced copies: two times (H/2)×(L/2); three times (H/3)×(L/3); four times (H/4)×(L/4); five times (H/5)×(L/5), using the algorithm of the discrete cosine transform implemented in the standard JPEG (compression method image files (JPEG). Joint Photographic Experts Group, the name of the developer));

Fig. 3. Frames are copies of previously reduced at the same time H×L and two times (H/2)×(L/2), after surgical decompression and expansion to the geometric dimensions of ICHI (copy H×L was only decompression, its geometrical dimensions were not changed);

Fig. 4. Frames are copies of previously reduced three times (H/3)×(L/3) and four times (H/4)×(L/4), after surgical decompression and expansion to the geometric dimensions of ICHI;

Fig. 5. Frame copy, previously reduced five times (H/5)×(L/5), after decompression surgery and to increase the geometric dimensions of ICHI and the frame with the values of the ESCC, the resulting difference values of the pixels of ICHI and decompressional increased to the geometric dimensions of ICGI copies of previously reduced five times (H/5)×(L/5).

How to compress image files JPEG (JPEG - compressed file with the extension *.jpg". Joint Photographic Experts Group, the name of the developer)) contains the following steps.

1. Previously adut number N gradations reduce the geometric dimensions of ICHI. In the General case, consider the number of gradations can be arbitrary. However, appropriate selection of the number N at which the division of geometrical height H and length L ICHI will be no remainder, i.e. N/N is an integer and L/N is an integer.

As an example in Fig. 1 presents ICHI and its copy: reduced two times (H/2)×(L/2); three times (H/3)×(L/3); four times (H/4)×(L/4); five times (H/5)×(L/5) and at the same time, i.e. no change (H×L).

2. For each n-th gradation, where n=1, 2,..., N, consistently take actions to reduce the geometric dimensions of ICGI, its compression, saved in a compressed file. To reduce the geometrical dimensions of ICGI can be based on bicubic interpolation (see Garn, Tarn. Handbook of mathematics for scientific workers and engineers). M.: Nauka. - 1974, pages 675-683; see the link http://ru.wikipedia.org/wiki/ Becomefashionable). Compress ICHI and save it in a compressed file on the basis of algorithms that implement the discrete cosine transformation (see Sbernard. Digital communication. Theoretical basis and practical application. Ed. 2nd, Rev.: TRANS. from English. - M.: Publishing house "Williams". - 2003, pages 892 - 900; see the link http://ru.wikipedia.org/wiki/JPEG). To store a file on the hard disk or in RAM memory of the computer.

As an example in Fig. 2 presents a short form ICHI and its copies. JPEG is a compressed file with R is sirenian *.jpg (see link http://ru.wikipedia.org/wiki/JPEG).

3. Decompression increase decompressional frame to the original geometric size ICHI. Decompression is the opposite of compression. Its implementation is known (see Sbernard. Digital communication. Theoretical basis and practical application. Ed. 2nd, Rev.: TRANS. from English. - M.: Publishing house "Williams". - 2003, pp. 892-900; see the link http://ru.wikipedia.org/wiki/JPEG). To increase the geometrical dimensions decompressional file to the size of ICGI can be based on bicubic interpolation (see Garn, Tarn. Handbook of mathematics for scientific workers and engineers). M.: Nauka. - 1974, pages 675-683; see the link http://ru.wikipedia.org/wiki/Becomefashionable).

As an example in Fig. 3, Fig. 4 and Fig. 5 presents footage of copies previously reduced in two times (H/2)×(L/2), three times (H/3)×(L/3), four times (H/4)×(L/4), five times (H/5)×(L/5) and at the same time, i.e. no change (H×L) after surgical decompression and expansion to the geometric dimensions of ICHI.

4. Is subtracted from the pixel values of ICGI pixel values increased decompressional frame. In the result of subtracting the receive frame in the form of ESCC. This procedure can also be implemented by means of subtraction of the pixel values of the matrix ICHI pixel values of the matrix increased decompressional frame. The operation of calculating the difference of the TLD the matrix is known (see Handbook of higher mathematics / APC, Gmmusic, Ehabitat. - 2nd ed., the stereotype. Mn.: Terrasystems, 2000. Pp. 102).

As an example in Fig. 5 shows a frame copies, previously reduced five times (H/5)×(L/5), after its operations decompression and expansion to the geometric dimensions of ICHI and the frame of the ESCC, obtained by subtraction of the pixel values of ICGI pixel values increased decompressional frame (H/5)×(L/5). The frame in the form of the ESCC is a graphic file (BMP). Bitmap Picture format for storing bitmap images, developed by Microsoft). In this graphic format BMP save to a file (* .bmp), ICHI.

5. Compress obtained by subtracting the frame in the form of ESCC and save it as a file. Compress the frame with the values of the ESCC-based algorithms for lossless compression (see Compression and encryption processing, storage and transmission of information. Grigoriev V.A., Grigoriev S.V. edited by Grigoriev V.A. SPb.: The MAS. 2000. 74-97; see the link http://ru.wikipedia.org/wiki/Shadier). An example of a format that implements the algorithm for lossless data compression is the ARJ format that generates a file of compressed data with the extension (*.arj). To store a file on the hard disk or in RAM memory of the computer.

6. Summarize the n-th value of the reduced compressed frame and compressed the ESCC, remember a calculated amount. Value is the reduced file compressed frame and compressed the ESCC determine, in bytes, therefore, the calculated amount for each of the n-th values of the reduced compressed frame and compressed the ESCC also be expressed in bytes.

For example, the volume of ICGI BMP is 921654 bytes (see Fig. 1). After lossless compression algorithm ARJ final file size was 343302 bytes. The volume of files compressed copies of ECGI algorithm lossy JPEG for graduations reduce the geometric dimensions n=1, 2, 3, 4, 5 respectively,: 43943; 13071; 7026; 4589; 3331 of bytes. Volume compressed the ESCC algorithm ARJ for graduations n=1, 2, 3, 4, 5 respectively is: 304870; 285057; 287018; 293179; 288255 of bytes. Therefore, the amount for each of the n-th values of the reduced compressed frame with n gradations=1, 2, 3, 4, 5 and it compressed the ESCC, respectively: 348813; 298128; 294044; 297768; 291556 bytes.

An addition operation is known (see Garn, Tarn. Handbook of mathematics for scientific workers and engineers). M.: Nauka. - 1974, p.27).

7. Allocate the smallest of all N values stored amounts, and additionally retain a compressed file of the ESCC and the compressed file with reduced geometrical dimensions of ICGI belonging to the n-th gradation, in which the amount of compressed file the ESCC and the compressed file with reduced geometrical dimensions to CARRY the least. The smallest of the values stored amounts can be selected in the result of their comparison to each other, and to store files by recording them on the rigid disk or in the memory of the computer.

For all considered item 6 of example, the smallest of the stored amounts corresponds to the gradation decrease the geometric size n=5. This amount is less than the volume of ICGI after lossless compression algorithm ARJ.

Thus, thanks to the new essential features provides the highest data rate for a predefined number of N gradations reduce the geometric dimensions of ICGI due to the minimum size (in bytes) the total value of the reduced file compressed ICHI and it compressed the ESCC.

It should be noted that direct application of the prototype method for the considered example to get the total value of the file size is smaller compressed, ICHI and it compressed the ESCC file reduced compressed, ICHI and it compressed the ESCC equal 297768 bytes, which is 6212 bytes exceeds the amount provided by the proposed method.

1. How to compress image files, namely, that reduce the geometrical dimensions of the original frame graphics (ICGI), compress it and store it in a compressed file, which is then decompression and decompressional frame to increase the geometric dimensions of ICGI, and then calculate the frame with the values of the circuit contrasting elements (ESCC) by algebraic subtraction pixels the x values ICHI and increased decompressional frame, then obtained by subtracting the frame in the form of ESCC compress and store in a compressed file, wherein the pre-set number N gradations reduce the geometric dimensions of ICGI, and for each n-th gradation, where n=1, 2,..., N, consistently take actions to reduce the geometric dimensions of ICGI, its compression, saved in a compressed file, decompression, increase decompressional frame to the original geometric size ICHI, the subtraction of the pixel values of ICGI pixel values increased decompressional frame, the compression obtained by subtracting the frame in the form of ESCC and its conservation then summarize the n-th value of the reduced compressed frame and compressed the ESCC, remember a calculated amount, then all the N values stored amounts emit the least, and additionally retain a compressed file of the ESCC and the compressed file with reduced geometrical dimensions of ICGI belonging to the n-th gradation, in which the amount of compressed file the ESCC and the compressed file with reduced geometrical dimensions of ICGI least.

2. The method according to claim 1, characterized in that the reduced geometrical dimensions of ICGI using bicubic interpolation procedure.

3. The method according to claim 1, characterized in that compress ICHI using the algorithm of the discrete cosine Pres is obrazovaniya.

4. The method according to claim 1, characterized in that decompression ICHI using the algorithm of the discrete cosine transform.

5. The method according to claim 1, characterized in that the increase of the geometrical dimensions decompressional reduced ICHI using bicubic interpolation procedure.

6. The method according to claim 1, characterized in that the grip frame with the values of the ESCC using the algorithm of lossless compression.

**Same patents:**

FIELD: information technologies.

SUBSTANCE: in the method for identification of contours of a moving object, in a video sequence of low resolution, information is used from auxiliary photographs of the specified object, taken with high resolution, mutual identification of contours is carried out from a photograph and a video sequence at appropriate moments of time in the same sequence with correlation and modelling of high-resolution frames.

EFFECT: increased resolution and dynamic range of a video sequence.

5 cl, 1 dwg

FIELD: information technology.

SUBSTANCE: adaptive definition of the wavelet-basis for discrete wavelet transformation is possible through selection from a library or calculation. The wavelet-basis can be defined using: characteristics obtained using statistical, correlation and spectral analysis methods for blocks and sub-bands of blocks of the initial image; image block reconstruction error.

EFFECT: fewer transmitted or stored data through adaptive definition of the basis function for discrete wavelet transformation for initial image blocks.

12 cl, 5 dwg

FIELD: information technology.

SUBSTANCE: method of highlighting an object in an electronic document such that, the highlighted object retains colour and formatting properties to allow for maintenance of visual fidelity relative the pre-highlighted view of the highlighted object and which allows for a semi-transparent background underneath a highlighted object which allows a user to see and appreciate the colouring and any visual properties applied to the background underneath the highlighting applied to the selected object.

EFFECT: high efficiency of searching for objects in electronic documents.

20 cl, 6 dwg

FIELD: information technology.

SUBSTANCE: position of pulse noise on the image is evaluated first, after which four auxiliary masks are formed, as well as eight control vectors (two vectors based on each auxiliary mask), and coefficients of corresponding four differently aligned Prewitt masks are then changed using given vectors. Further, the given masks are used to calculated the approximate value of the modulus of the image gradient, and contours of the object on the image are obtained through its threshold conversion.

EFFECT: higher sensitivity of the noise-immune gradient method of detecting contours to useful contour features of the image.

5 dwg

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

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 k_{1}, k_{2} 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, 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 k_{1}, k_{2} 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: 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

FIELD: information technology.

SUBSTANCE: position of pulse noise on the image is evaluated first, after which four auxiliary masks are formed, as well as eight control vectors (two vectors based on each auxiliary mask), and coefficients of corresponding four differently aligned Prewitt masks are then changed using given vectors. Further, the given masks are used to calculated the approximate value of the modulus of the image gradient, and contours of the object on the image are obtained through its threshold conversion.

EFFECT: higher sensitivity of the noise-immune gradient method of detecting contours to useful contour features of the image.

5 dwg

FIELD: information technology.

SUBSTANCE: method of highlighting an object in an electronic document such that, the highlighted object retains colour and formatting properties to allow for maintenance of visual fidelity relative the pre-highlighted view of the highlighted object and which allows for a semi-transparent background underneath a highlighted object which allows a user to see and appreciate the colouring and any visual properties applied to the background underneath the highlighting applied to the selected object.

EFFECT: high efficiency of searching for objects in electronic documents.

20 cl, 6 dwg

FIELD: information technology.

SUBSTANCE: adaptive definition of the wavelet-basis for discrete wavelet transformation is possible through selection from a library or calculation. The wavelet-basis can be defined using: characteristics obtained using statistical, correlation and spectral analysis methods for blocks and sub-bands of blocks of the initial image; image block reconstruction error.

EFFECT: fewer transmitted or stored data through adaptive definition of the basis function for discrete wavelet transformation for initial image blocks.

12 cl, 5 dwg

FIELD: information technologies.

SUBSTANCE: in the method for identification of contours of a moving object, in a video sequence of low resolution, information is used from auxiliary photographs of the specified object, taken with high resolution, mutual identification of contours is carried out from a photograph and a video sequence at appropriate moments of time in the same sequence with correlation and modelling of high-resolution frames.

EFFECT: increased resolution and dynamic range of a video sequence.

5 cl, 1 dwg

FIELD: information technology.

SUBSTANCE: method of compressing graphics files involves predetermining the number of gradations of reducing geometric dimensions of a source frame of a graphic image. For each gradation, geometric dimensions of the source frame of the graphic image are reduced, compressed and stored in a compressed file, and then latter decompressed and enlarged to the initial size. Pixel values of the enlarged decompressed frame are then subtracted from pixel values of the source frame of the graphic image and the result with values of the contrast element loop is compressed in form of a file. All values of the reduced compressed files and corresponding values of the compressed contrast element loop are then summed. The least of the obtained sums is selected as the result.

EFFECT: high rate of data transmission.

6 cl, 5 dwg

FIELD: information technology.

SUBSTANCE: image decoding device comprises decoding aid of variable length and a loop filter. Decoding process of variable length is carried out with respect to the parameter for generating prediction signals and compressed differential image with respect to information associated with a plurality of blocks constituting the decoded image and indicating whether the filtering process must be carried out with respect to each of the blocks. The loop filter performs a filtering process with respect to the decoded image obtained by summarizing the prediction image and the differential image, determines a class for each pixel of the decoded image and performs the filtering process using the filter corresponding to the determined class. The filtering process is not performed for a block when the information indicates that the filtering process must not be performed for the block.

EFFECT: improved image quality.

2 cl, 18 dwg