CODING OF IMAGES USING GENERALIZED TREE STRUCTURE SUPPORTING MULTIPLE PATTERN TYPES

CROSS-REFERENCE TO RELATED APPLICATIONS

[1001] This application claims the benefit of priority under 35 U.S.C. § 1 19(e) of U.S. Provisional Patent Application No. 62/579,732, entitled CODING OF EVIAGES USING GENERALIZED TREE STRUCTURE SUPPORTING MULTIPLE PATTERN TYPES, filed on October 31, 2017. The present application is related to U.S. Patent No. 8,374,446, entitled ENCODING AND DECODING OF DIGITAL SIGNALS BASED ON COMPRESSION OF HIERARCHICAL PYRAMID, issued February 12, 2013, and to U.S. Provisional Application No. 62/506,792, entitled IMPROVED ENCODING AND DECODING OF DIGITAL SIGNALS BASED ON COMPRESSION OF HIERARCHICAL PYRAMID, filed on May 16, 2017, the content of each of which is hereby incorporated by reference in its entirety for all purposes.

FIELD

[1002] The disclosure relates to data transfer and is intended for digital signal processing, above all, for compressing digitized analog two-dimensional signals such as images and video sequences for the purpose of obtaining a compact data file, which can be saved on, for example, digital data carriers or transmitted via digital communication channels, with the original digital signal to be subsequently decoded and restored.

BACKGROUND

[1003] At present, there exist two main directions in data compression, i.e. lossless compression and lossy compression. In the former case, the restored signal matches the input one precisely, yet its shortcoming is that the compression ratio is rather low and does not generally exceed 2-3. In the latter case, much higher compression ratios may be achieved owing to the fact that the restored signal is nothing but an approximation to the original signal. In lossy compression systems, the required compression ratio may be set in a wide range, yet its shortcoming is that the restored signal distortion level would grow along with increasing the compression ratio. One of the known methods of lossy image compression, known as SIF compression and described in the above-referenced U.S. Patent No. 8,374,446, effects compression by using a structure comprised of hierarchical pyramids (Laplacian pyramid). FIG. 1 presents a method of forming a Laplacian pyramid with three decimation levels. Low-pass filter (101) mitigates the aliasing effect on a reduced image. A traditional method of image compression by means of a Laplacian pyramid is successive interpolation of reduced copies of the original image down to the original size. In other words, (106) is used for obtaining (105), then (104), and finally (103). The difference between the interpolated image and the original is quantized and recorded in a file, or transmitted via a communication channel to be subsequently restored.

[1004] With such an approach, the original image compression efficiency is directly determined by quality of interpolated filters applied, as well as by quality of low-pass filters used prior to the decimation procedure in forming a Laplacian pyramid, as aliasing would lower the quality of operation of interpolators. To raise the compression efficiency, there have been suggested adaptive interpolation methods, as well as combining interpolation with two-dimensional adaptive prediction of values of the image elements.

SUMMARY

[1005] The disclosure is directed to creation of efficient methods of encoding and decoding digital signals, devices for implementation thereof, devices for processing digital signals and systems for efficient transmission of digital signals via limited throughput communication channels, as well as expansion of the arsenal of methods for encoding and decoding digital signals, encoding and decoding devices, as well as systems for transmission of digital signals via limited throughput communication channels.

[1006] In one aspect, the disclosure relates to a method and system for encoding a digital image using a generalized embedded tree pattern. The method may include determining a generalized tree pattern associated with a target region of the digital image, wherein the generalized tree pattern includes multiple sub-nodes of different type and multiple leaves of different shape. The generalized tree pattern may be formed by selecting among multiple splitting patterns when splitting a node into multiple sub-nodes. Sub-nodes and leaf patterns of the generalized tree pattern may be determined based upon data associated with the splitting of nodes. Once pattern data for one or more tree patterns associated with all regions of the image have been determined, compressed image data may be generated by encoding the pattern data using, for example, an improved SIF transform described hereinafter. [1007] During a decoding process, the original image data is restored through a process that uses pre-defined rules to pass-through node-related and leaf-related information through the decoder. The pre-defined rules are unified for decoder and encoder. The values of the subsamples defining the generalized tree patterns may then be interpolated using the reverse SIF transformation to determine the edges of objects within the digital image.

[1008] In a further aspect, the disclosure relates to an apparatus for compressing digital signals representing images or video sequences. The apparatus includes a memory and a processor operative to execute instructions stored in the memory. The processor is configured by the instructions to receive input pixel data corresponding to target regions of an image, the input pixel data defining objects having edges. The processor is further configured by the instructions to determine a plurality of generalized tree patterns associated with a corresponding plurality of the target regions of the image wherein ones of the plurality of generalized tree patterns are defined by at least (i) multiple pattern levels, and (ii) sub- nodes and leaves associated with ones of the multiple pattern levels. A plurality of node splitting alternatives define relationships between ones of the sub-nodes and other of the sub- nodes and ones of the leaves associated with different ones of the multiple pattern levels. The processor is also configured by the instructions to determine that pixel data from all the target regions of the image has been processed. The processor generates compressed image data by encoding, using arrangements of hierarchical pyramids, pattern data corresponding to the generalized tree patterns. The compressed image data represents at least the edges of the objects.

[1009] The disclosure is also directed to a method for compressing digital signals representing images or video sequences. The method includes receiving input pixel data corresponding to target regions of an image, the input pixel data defining objects having edges. The method also includes determining a plurality of generalized tree patterns associated with a corresponding plurality of the target regions of the image wherein ones of the plurality of generalized tree patterns are defined by at least (i) multiple pattern levels, and (ii) sub-nodes and leaves associated with ones of the multiple pattern levels. A plurality of node splitting alternatives define relationships between ones of the sub-nodes and other of the sub-nodes and ones of the leaves associated with different ones of the multiple pattern levels. Upon determining that pixel data from all the target regions of the image has been processed, compressed image data is generated. This generation of compressed image data involves encoding, using arrangements of hierarchical pyramids, pattern data corresponding to the generalized tree patterns. The compressed image data represents at least the edges of the objects.

BRIEF DESCRIPTION OF THE DRAWINGS

[1010] The skilled artisan will understand that the drawings primarily are for illustrative purposes and are not intended to limit the scope of the inventive subject matter described herein. The drawings are not necessarily to scale; in some instances, various aspects of the inventive subject matter disclosed herein may be shown exaggerated or enlarged in the drawings to facilitate an understanding of different features. In the drawings, like reference characters generally refer to like features (e.g., functionally similar and/or structurally similar elements).

[1011] FIG. 1 presents an example of a known scheme of forming a hierarchical pyramid (Laplacian pyramid).

[1012] FIG. 2 is a general diagram of variants for implementation of a system comprising an encoding device and a decoding device and intended for transmission of images or video sequences through a limited throughput communication channel.

[1013] FIG. 3 is a general diagram of a device, which implements the presented method of encoding.

[1014] FIG. 4 is a sequence of operations with an operating unit for preliminary classification of data sections.

[1015] FIG. 5 is a general diagram of a device, which implements a variant of the presented method of data encoding, provided that reference data arrays are used.

[1016] FIG. 6 is modified sequence of operations with an operating unit for preliminary classification of data sections for a variant of the presented encoding method, in case reference data arrays are used.

[1017] FIG.7 is a method of implementation of composite cascade interpolation filters.

[1018] FIG. 8 is an example of practical implementation of a composite cascade interpolation filter.

[1019] FIG. 9 are examples of resampling patterns, with the 4x4 size of a data section being processed. [1020] FIG. 10 is a sequence of operations, with an operating unit of final classification, filtration and resampling.

[1021] FIG. 11 is an example of constructing an embedded quadtree.

[1022] FIG. 12 is an example of implementation of a unit for lossy compression.

[1023] FIG. 13 is a general diagram of a device implementing the above method of decoding compressed data.

[1024] FIG. 14 is a general diagram of a device implementing the above method of decoding, provided reference data arrays are used.

[1025] FIG. 15 is a sequence of operations with an operating unit of restoring transmitted data sections, which is performed by means of non-overlapping parts of interpolation filters set in resampling patterns.

[1026] FIG. 16 is a sequence of operations with an operating unit of interpolation of missed sections, for which there are restored similarly located sections on levels with a lower spatial resolution.

[1027] FIG. 17 is a sequence of operations with an operating unit of restoring missed sections, for which there are restored similarly located sections on levels with a higher spatial resolution.

[1028] FIG. 18 is a sequence of operations with an operating unit of final filtration and interpolation of transmitted data.

[1029] FIG. 19 is a sequence of operations with an operating unit of final filtration and interpolation of transmitted data, if the current data section was restored by means of a reference hierarchical pyramid.

[1030] FIG. 20 is an example of restoration of an original hierarchical pyramid for ordinary and accelerated restoration methods.

[1031] FIG. 21 is a flowchart of calculations performed during intermediate interpolation, provided a reference hierarchical pyramid is used.

[1032] FIG. 22 is a flowchart of calculations performed in the process of final interpolation, provided a reference hierarchical pyramid is used. [1033] FIG. 23 is a schematic presentation of an example of implementation of a system comprising an encoding device, or just a component thereof, and/or comprising a decoding device, as well as a component thereof.

[1034] FIG. 24 is a flowchart illustrating an exemplary method for interframe-difference reconstruction using a Laplacian differential pyramid.

[1035] FIGS. 25-26 are flowcharts illustrating an exemplary use of subsample predictors during encoding and decoding.

[1036] FIG. 27 illustratively represents the prediction of subsamples of patterns by means of restored signal geometry, according to an embodiment.

[1037] FIG. 28 is a high-level flow chart describing an exemplary process for encoding a digital image in accordance with the disclosure

[1038] FIG. 29 is a more detailed flowchart describing an exemplary process for encoding a digital image in accordance with the disclosure

[1039] FIG. 30A shows an exemplary set of node splitting alternatives capable of being used in a generalized tree structure.

[1040] FIG. 30B depicts an exemplary generalized tree structure through three levels of image coding.

[1041] FIG. 30C depicts a one dimensional projection of the tree structure of FIG. 30B.

[1042] FIG. 30D illustrates the particular node splitting alternatives and leaf shapes selected for use in the tree structure of FIG. 30B.

[1043] FIG. 31 illustrates a one-dimensional cut (A-A) of an interpolated image generated from a set of pattern values using a two dimensional interpolation process.

[1044] Corresponding reference characters indicate corresponding components throughout the several views of the drawings. Skilled artisans will appreciate that elements in the figures are illustrated for simplicity and clarity and have not necessarily been drawn to scale. For example, the dimensions of some of the elements in the figures may be exaggerated relative to other elements to help to improve understanding of various embodiments . Also, common but well-understood elements that are useful or necessary in a commercially feasible embodiment are often not depicted in order to facilitate a less obstructed view of these various embodiments. DETAILED DESCRIPTION

[1045] Following below are more detailed descriptions of various concepts related to, and embodiments of, inventive systems, methods, and apparatus for encoding digital images using generalized embedded tree structures. It should be appreciated that various concepts introduced above and discussed in greater detail below may be implemented in any of numerous ways, as the disclosed concepts are not limited to any particular manner of implementation. Examples of specific implementations and applications are provided primarily for illustrative purposes.

[1046] Disclosed herein are systems and methods for compressing digital signals representing images or video sequences using an encoding process that leverages generalized tree patterns. The encoding process includes receiving input pixel data corresponding to target regions of an image, where the input pixel data defines objects having edges. A plurality of generalized tree patterns associated with a corresponding plurality of the target regions of the image are determined. The generalized tree patterns are defined by at least (i) multiple pattern levels, and (ii) sub-nodes and leaves associated with ones of the multiple pattern levels. A plurality of node splitting alternatives define relationships between ones of the sub-nodes and other of the sub-nodes and ones of the leaves associated with different ones of the multiple pattern levels. For example, a sub-node associated with one pattern level could be related to multiple other sub-nodes and/or leaves associated with a different pattern level through a particular one of the node splitting alternatives. Certain of the node splitting alternatives may define relationships only between a sub-node associated with one pattern level and other sub-nodes associated with a different pattern level, while other of the node splitting alternatives may define relationships only between a sub-node and one or more leaves on a different pattern level. Still other of the node splitting alternatives may define relationships between a sub-node and other sub-nodes and leaves on a different pattern level.

[1047] Once it has been determined that pixel data from all the target regions of the image have been processed, compressed image data is generated by encoding, using arrangements of hierarchical pyramids, pattern data corresponding to the generalized tree patterns wherein the compressed image data represents at least the edges of the objects.

[1048] In one embodiment the pattern data corresponding to the generalized tree patterns is encoded using an improved SIF transformation. This improved SIF transformation and an inverse SIF transformation are first described with reference to FIGS. 2-27. The improved encoding process using generalized tree patterns is then discussed with reference to FIGS. 28- 31.

Overview of Improved SIF Transformation and Inverse SIF Transformation

[1049] Presented herein are methods of data encoding and decoding, which allow raising compression efficiency and/or raising quality of the image being restored owing to a more efficient method of interpolating subsamples being restored and using an adaptively applied set of resampling patterns, which makes it possible to raise interpolation accuracy, with the number of subsamples required for correct interpolation concurrently reduced.

[1050] The disclosed method includes forming, by means of computing facilities, as well as adaptive and/or linear overlapping low-pass filters, a hierarchical pyramid based on encoded data, and calculating signal differences between this pyramid's levels to be used in the course of preliminary classification of the aforesaid hierarchical pyramid, which is carried out successively, from the level of a section with the lowest spatial resolution to the level of a section with the highest spatial resolution, and the aforesaid hierarchical pyramid is finally classified with a predetermined set of resampling patterns, whereupon each section of the aforesaid hierarchical pyramid selected at the stage of preliminary classification is converted into an array of subsamples, which is achieved by means of adaptive and/or linear filters set in the resampling pattern put in line with the aforesaid section at the final classification, and the obtained array is converted into a one-dimensional data array, with information on location of obtained subsamples and resampling patterns used for obtaining thereof saved, whereupon the aforesaid array is encoded through lossy compression, and information on location of subsamples is encoded through lossless compression.

[1051] In specific cases, this method is characterized that:

[1052] The calculated signal difference between the levels of the aforesaid hierarchical pyramid is used to change the compression threshold at different sections of data being encoded.

[1053] If no pattern can be selected from the predetermined set of patterns for a section of the aforesaid hierarchical pyramid chosen in the course of preliminary classification, samples contained in such a section are directly added to the array of subsamples to be created, whereas information is saved stating that none of the patterns was used on the section in question. [1054] Information on location of obtained subsamples and the type of resampling patterns used for obtaining thereof, which is saved in the course of encoding, is presented in the form of a hierarchical tree structure.

[1055] Signal differences between the levels of the aforesaid hierarchical pyramid are calculated by means of adaptive and/or linear overlapping low-pass interpolation filters.

[1056] The process of compression of the one-dimensional array of subsamples is optimized by means of statistical data collected at the stages of preliminary and final classification.

[1057] Preliminary and final classifications are optimized, with a criterion of minimization of the common distortion level used for a predetermined data level.

[1058] The process of converting an array of subsamples into a one-dimensional array is carried out as an adaptive process, its parameters changing depending on statistics of signals being processed.

[1059] A hierarchical pyramid is formed based on encoded data with at least three decimation levels.

[1060] In the course of preliminary classification of sections of the aforesaid hierarchical pyramid, sections of different fixed size are used, whereas in the course of final classification by means of a predetermined set of resampling patterns, several resampling patterns are used, each of them intended for its own size of section being processed.

[1061] Contents, or a part of contents, of the used set of resampling patterns is encoded through the lossless method and saved together with encoded data.

[1062] Encoded data constitute a full-color image presented as a number of color planes, each of which is encoded separately.

[1063] The process of encoding a one-dimensional data array is carried out through discrete cosine transform and linear and/or non-linear adaptive quantization, with subsequent encoding of data obtained after quantization, together with quantization parameters, through a method of encoding with variable-length codes.

[1064] The process of encoding a one-dimensional data array is carried out through stationary and/or adaptive wavelet transform, as well as linear and/or non-linear adaptive quantization, with subsequent encoding of data obtained after quantization, together with quantization parameters, through a method of encoding with variable- length codes.

[1065] The process of encoding a one-dimensional data array is carried out through stationary and/or adaptive sub-band transform, as well as linear and/or non-linear adaptive quantization, with subsequent encoding of data obtained after quantization, together with quantization parameters, through a method of encoding with variable- length codes.

[1066] In the aforesaid processes of encoding one-dimensional data arrays, instead of the method of encoding with variable-length codes, the arithmetic encoding method is used, jointly with a predetermined and/or adaptive statistical model.

[1067] Before being encoded, a one-dimensional data array undergoes preliminary segmentation, whereas encoding is carried out through several various lossy compression methods to be selected individually for each obtained segment.

[1068] The method of encoding with variable-length codes is used for encoding information on location of subsamples and the type of resampling patterns applied.

[1069] The method of arithmetic encoding jointly with a predetermined and/or adaptive statistical model is used for encoding information on location of subsamples and the type of resampling patterns applied.

[1070] Operations are performed for an entire array of data being encoded.

[1071] The array of data being encoded is preliminarily divided into overlapping blocks, with operations performed for each block independently from the others.

[1072] One innovation in the part of decoding encoded digital signals presented as a one- dimensional array of data obtained from subsamples taken from sections of a hierarchical pyramid formed from digital signals being encoded (the aforesaid array compressed through the lossy compression method) and information on location of these subsamples in the aforesaid pyramid encoded through the lossless compression method, lies in the fact that there is performed restoration of the array of subsamples through the lossy decoding method, decoding information on location of transmitted subsamples through the lossless method, restoration of transmitted sections of the hierarchical pyramid with the restored array of subsamples and decoded information on their location, restoration of missed sections of the hierarchical pyramid, for which there are restored similarly located sections on levels with a higher spatial resolution, performed by means of non-overlapping filters with subsequent decimation, whereupon the process of, final interpolation of transmitted data is performed with adaptive and/or linear composite cascade overlapping interpolation filters, which is carried out successively, from the level of a section with the lowest spatial resolution to the level of a section with the highest spatial resolution, whereupon restored digital signals are read from the hierarchical pyramid level with the highest spatial resolution.

[1073] In the preferred embodiment variants, an encoded one-dimensional data array is formed of subsamples obtained from sections of the aforesaid hierarchical pyramid by means of adaptive and/or linear filters set in the resampling pattern used in encoding, the above pattern selected out of a predetermined set of resampling patterns, where information on the type of resampling patterns applied is encoded together with information on location of transmitted subsamples; here, in the course of restoration of transmitted sections of the hierarchical pyramid, non-overlapping parts of adaptive and/or linear composite cascade interpolation filters are used, which are determined for each sample belonging to a section being restored of the hierarchical pyramid in a predetermined set of resampling patterns, whereas, concurrently with the process of final interpolation, there is performed final filtration of transmitted data sections with overlapping compensating parts of adaptive and/or linear composite cascade interpolation filters determined for each sample belonging to a section being restored of the hierarchical pyramid in a predetermined set of resampling patterns.

[1074] Besides, in specific cases, this method is characterized that:

[1075] The process of restoration of missed sections of the hierarchical pyramid, for which there are restored similarly located sections on levels with a higher spatial resolution, is performed without using non-overlapping low-pass filters; instead, direct decimation is performed for sections with a higher spatial resolution.

[1076] The transmitted data sections having been restored, the process of restoration is performed for the hierarchical pyramid sections missed in the course of restoration, for which there are restored similarly located sections on the pyramid levels with a lower spatial resolution, which is performed by means of non-overlapping interpolation filters, whereas the subsequent restoration of the missed sections of the hierarchical pyramid, for which there are restored similarly located sections on the levels with a higher spatial resolution, is performed by means of overlapping adaptive and/or linear filters with subsequent decimation.

[1077] An additional stage of restoration of missed sections and the corresponding stage of restoration by means of overlapping adaptive and/or linear filters with subsequent decimation are only performed for parts of the levels of the hierarchical pyramid being restored, which have low spatial resolution.

[1078] The aforesaid subsamples are obtained from sections of the above hierarchical pyramid, which have different fixed sizes, whereas the processes of restoration of transmitted data sections and final filtration are performed by means of several sets of resampling patterns, each of them intended for its own fixed section size.

[1079] Encoded data contain information encoded through the lossless method, which comprises resampling patterns used in the course of encoding, or just parts of these patterns; here, restoration of encoded data is preceded by decoding of the aforesaid information, whereupon decoded patterns, or parts thereof, are added to the set of resampling patterns used in the process of restoration of encoded data.

[1080] Encoded data constitute a number of separately encoded color planes belonging to a full-color image, where the process of decoding is performed independently for each of the encoded color planes.

[1081] Operations are performed for an entire array of data being restored.

[1082] The array of data being restored is preliminarily divided into overlapping blocks, with operations performed for each block independently from the others.

[1083] One innovation in the part of another variant of encoding digital signals lies in the fact that, by means of computing facilities, as well as adaptive and/or linear overlapping low- pass filters, a hierarchical pyramid is formed based on encoded data, as well as reference hierarchical pyramids of the same size based on reference data arrays, whereupon, based on the reference hierarchical pyramids and the original hierarchical pyramid, differential hierarchical pyramids are calculated, whereupon signal differences are calculated between the levels of the hierarchical pyramid created based on encoded data and the levels of the aforesaid differential pyramids, with the resulting interlevel difference to be used in the process of preliminary classification of the aforesaid hierarchical pyramid and obtained differential hierarchical pyramids, which is performed successively, from the level of a section with the lowest spatial resolution to the level of a section with the highest spatial resolution, where the aforesaid hierarchical pyramid and the obtained differential hierarchical pyramids are finally classified with a predetermined set of resampling patterns, whereupon each section of the aforesaid hierarchical pyramid and the section of the differential pyramids selected at the stage of preliminary classification is converted into an array of subsamples, which is achieved by means of adaptive and/or linear filters set in the resampling pattern put in line with the aforesaid section at the final classification, and the obtained subsamples are converted into at least two data arrays, for subsamples obtained from the aforesaid pyramid, and for subsamples obtained from differential pyramids, with information on location of obtained subsamples and resampling patterns used for obtaining thereof saved, whereupon the aforesaid arrays are encoded through lossy compression, and information on location of subsamples is encoded through lossless compression.

[1084] In specific cases, this method is characterized that:

[1085] The calculated signal difference between the levels of the aforesaid hierarchical pyramid and the levels of the differential pyramids is used to change the compression threshold at different sections of data being encoded.

[1086] If no pattern can be selected from the predetermined set of patterns for a section of the aforesaid hierarchical pyramid and the differential pyramids chosen in the course of preliminary classification, samples contained in such a section are directly added to the array of subsamples to be created, whereas information is saved stating that none of the patterns was used on the section in question.

[1087] Information on location of obtained subsamples and the type of resampling patterns used for obtaining thereof, which is saved in the course of encoding, is presented in the form of a hierarchical tree structure.

[1088] Signal differences between the levels of the aforesaid hierarchical pyramid and between the levels of the differential pyramids are calculated by means of adaptive and/or linear overlapping interpolation filters.

[1089] The process of compression of one-dimensional arrays of subsamples is optimized by means of statistical data collected at the stages of preliminary and final classification.

[1090] Preliminary and final classifications are optimized, with a criterion of minimization of the common distortion level used for a predetermined data level. [1091] The process of converting an array of subsamples into one-dimensional arrays is carried out as an adaptive process, its parameters changing depending on statistics of signals being processed.

[1092] A hierarchical pyramid is formed based on data being encoded, and reference pyramids are formed based on reference data, with at least three decimation levels.

[1093] In the course of preliminary classification of sections of the aforesaid hierarchical pyramid and differential hierarchical pyramids, sections of different fixed size are used, whereas in the course of final classification by means of a predetermined set of resampling patterns, several resampling patterns are used, each of them intended for its own size of section being processed.

[1094] Contents, or a part of contents, of the used set of resampling patterns is encoded through the lossless method and saved together with encoded data.

[1095] Encoded data constitute a full-color image presented as a number of color planes, each of which is encoded separately.

[1096] The process of encoding one-dimensional data arrays is carried out through discrete cosine transform and linear and/or non-linear adaptive quantization, with subsequent encoding of data obtained after quantization, together with quantization parameters, through a method of, encoding with variable-length codes.

[1097] The process of encoding one-dimensional data arrays is carried out through stationary and/or adaptive wavelet transform, as well as linear and/or non-linear adaptive quantization, with subsequent encoding of data obtained after quantization, together with quantization parameters, through a method of encoding with variable- length codes.

[1098] The process of encoding one-dimensional data arrays is carried out through stationary and/or adaptive sub-band transform, as well as linear and/or non-linear adaptive quantization, with subsequent encoding of data obtained after quantization, together with quantization parameters, through a method of encoding with variable- length codes.

[1099] In the aforesaid processes of encoding one-dimensional data arrays, instead of the method of encoding with variable-length codes, the arithmetic encoding method is used, jointly with a predetermined and/or adaptive statistical model. [1100] Before being encoded, one-dimensional data arrays undergo preliminary segmentation, whereas encoding is carried out through several various lossy compression methods to be selected individually for each obtained segment.

[1101] The method of encoding with variable-length codes is used for encoding information on location of subsamples and the type of resampling patterns applied.

[1102] The method of arithmetic encoding jointly with a predetermined and/or adaptive statistical model is used for encoding information on location of subsamples and the type of resampling patterns applied.

[1103] Operations are performed for an entire array of data being encoded.

[1104] The array of data being encoded is preliminarily divided into overlapping blocks, with operations performed for each block independently from the others.

[1105] One innovation in the part of decoding encoded digital signals presented as one- dimensional arrays of data obtained from subsamples taken from sections of a hierarchical pyramid formed from digital signals being encoded and sections of the differential pyramids obtained from the aforesaid pyramid and from reference hierarchical pyramids of the same size obtained from reference data arrays (the aforesaid one-dimensional arrays compressed through the lossy compression method), and information on location of these subsamples in the aforesaid pyramid and in the differential pyramids encoded through the lossless compression method, lies in the fact that there is performed formation of reference hierarchical pyramids based on reference data arrays, decoding of information describing location of transmitted subsamples in the hierarchical pyramid based on encoded data, as well in differential pyramids, which is performed through a lossless decompression method, restoration of the arrays of subsamples through the lossy decoding method, whereupon there is performed restoration of transmitted sections of the aforesaid hierarchical pyramid with the restored arrays of subsamples and decoded information on their location, as well as with reference hierarchical pyramids for sections being restored from subsamples obtained from differential pyramids, whereupon there is performed restoration of missed sections of the hierarchical pyramid, for which there are restored similarly located sections on levels with a higher spatial resolution, performed by means of non-overlapping filters with subsequent decimation, whereupon the process of final interpolation of transmitted data is performed with adaptive and/or linear composite cascade overlapping interpolation filters, which is carried out successively, from the level of a section with the lowest spatial resolution to the level of a section with the highest spatial resolution, where for sections of the aforesaid pyramid restored from subsamples obtained from differential pyramids, and for sections obtained from those sections by means of interpolation, the processes of final filtration and interpolation are performed with using the relevant sections of reference hierarchical pyramids, whereupon restored digital signals are read from the hierarchical pyramid level with the highest spatial resolution.

[1106] Preferably, the encoded one-dimensional data arrays are formed of subsamples obtained from sections of the aforesaid hierarchical pyramid and sections of the differential pyramids by means of adaptive and/or linear filters set in the resampling pattern used in encoding, the above pattern selected out of a predetermined set of resampling patterns, where information on the type of resampling patterns applied is encoded together with information on location of transmitted subsamples; here, in the course of restoration of transmitted sections of the hierarchical pyramid, non-overlapping parts of adaptive and/or linear composite cascade interpolation filters are used, which are determined for each sample belonging to a section being restored of the hierarchical pyramid in a predetermined set of resampling patterns, whereas, concurrently with the process of final interpolation, there is performed final filtration of transmitted data sections with overlapping compensating parts of adaptive and/or linear composite cascade interpolation filters determined for each sample belonging to a section being restored of the hierarchical pyramid in a predetermined set of resampling patterns, where, for sections of the aforesaid pyramid restored from subsamples obtained from differential pyramids, all the above-mentioned processes of filtration and interpolation are performed with using the relevant sections of the reference hierarchical pyramids.

[1107] Besides, in specific cases, this method is characterized that:

[1108] The process of restoration of missed sections of the hierarchical pyramid, for which there are restored similarly located sections on levels with a higher spatial resolution, is performed without using non-overlapping low-pass filters; instead, direct decimation is performed for sections with a higher spatial resolution.

[1109] The transmitted data sections having been restored, the process of restoration is performed for the hierarchical pyramid sections missed in the course of restoration, provided that there are restored similarly located sections on the pyramid levels with a lower spatial resolution, which is performed by means of non-overlapping interpolation filters, where, for sections of the aforesaid pyramid restored from subsamples obtained from differential pyramids, the aforesaid interpolation is performed with using the relevant sections of the reference hierarchical pyramids; besides, subsequent restoration of the missed sections of the hierarchical pyramid, for which there are restored similarly located sections on levels with a higher spatial resolution, is performed by means of overlapping adaptive and/or linear filters with subsequent decimation.

[1110] An additional stage of restoration of missed sections and the corresponding stage of restoration by means of overlapping adaptive and/or linear filters with subsequent decimation are only performed for the part of the levels of the hierarchical pyramid being restored, which have low spatial resolution.

[1111] The aforesaid subsamples are obtained from sections of the above hierarchical pyramid, which have different fixed sizes, whereas the processes of restoration of transmitted data sections and final filtration are performed by means of several sets of resampling patterns, each of them intended for its own fixed section size.

[1112] Encoded data contain information encoded through the lossless method, which comprises resampling patterns used in the course of encoding, or just parts of these patterns; here, restoration of encoded data is preceded by decoding of the aforesaid information, whereupon decoded patterns, or parts thereof, are added to the set of resampling patterns used in the process of restoration of encoded data.

[1113] Encoded data constitute a number of separately encoded color planes belonging to a full-color image, where the process of decoding is performed independently for each of the encoded color planes.

[1114] Operations are performed for an entire array of data being restored.

[1115] The array of data being restored is preliminarily divided into overlapping blocks, with operations performed for each block independently from the others.

[1116] One innovation in the part of device for implementation of the method of encoding digital signals lies in the fact that it comprises a unit of forming and storing hierarchical pyramid from input data, a unit of calculating interlevel difference, a unit of preliminary classification of data sections, a unit of final classification, filtration and resampling, a unit of converting filtered subsamples into a one-dimensional array, a unit of encoding location of subsamples and lossless compression, a unit of lossy compression of one-dimensional array, an output driver unit, and a storage of a set of predetermined resampling patterns, where the unit of forming and storing hierarchical pyramid from input data is connected to the unit of calculating interlevel difference and the unit of final classification, filtration and resampling, whereas the unit of calculating interlevel difference is connected to the unit of preliminary classification of data sections, where the latter one is connected to the unit of final classification, filtration and resampling, which, in its turn, is connected to the storage of a set of predetermined resampling patterns and to the unit of converting filtered subsamples into a one-dimensional array, which is connected to the unit of encoding location of subsamples and lossless compression, and to the unit of lossy compression of one-dimensional array, their outputs connected to the output driver unit.

[1117] In specific cases, it is characterized by:

[1118] availability of a unit of calculating local compression thresholds connected to the unit of calculating interlevel difference and to the unit of preliminary classification of data sections;

[1119] the fact that the unit of preliminary classification of data section classifies the data into sections of different fixed size, while the unit of final classification, filtration and resampling processes sections of different fixed size;

[1120] availability of a unit of lossless encoding of resampling patterns, which is connected to the storage of a set of predetermined resampling patterns, and to the output driver unit;

[1121] the fact that the process of encoding a full-color image comprising a number of color planes is performed independently for each of the aforesaid planes;

[1122] the fact that the output driver unit adds more information to encoded data.

[1123] One innovation in the part of device for implementation of the method for decoding digital signals lies in the fact that it contains a unit of receiving input encoded data and demultiplexing, a unit of lossless decompression and decoding of information on location of subsamples, a unit of decoding a one-dimensional array of subsamples encoded by means of a lossy compression algorithm, a unit of restoration of transmitted data sections, a unit of restoration of missed sections, for which there are similar restored sections on the pyramid levels with a higher spatial resolution, a unit of final filtration and interpolation, a unit of storing and output of hierarchical pyramid, a storage of a set of predetermined resampling patterns; where the unit of receiving input encoded data and demultiplexing is connected to the unit of lossless decompression and decoding of information on location of subsamples, and to the unit of restoration of a one-dimensional array of subsamples encoded by means of a lossy compression, their outputs connected to the unit of restoration of transmitted data sections, which is connected to the unit of storing and output of hierarchical pyramid, the storage of a set of predetermined resampling patterns and the unit of restoration of missed sections, for which there are similar restored sections on the pyramid levels with a higher spatial resolution, the latter being connected to the unit of storing and output of hierarchical pyramid and the unit of final filtration and interpolation, which is connected to the unit of storing and output of hierarchical pyramid and the storage of a set of predetermined resampling patterns.

[1124] In specific cases, it is characterized by:

[1125] availability of a unit of interpolation of missed sections, for which there are restored similarly located sections on levels with a lower spatial resolution, which is connected to the opening of the link between the unit of restoration of transmitted data sections and the unit of restoration of missed sections, for which there are similar restored sections on the pyramid levels with a higher spatial resolution, and also connected to the unit of storing and output of hierarchical pyramid;

[1126] the fact that the unit of restoration of transmitted data sections and the unit of final filtration and interpolation work with data sections of different fixed sizes, while using several sets of resampling patterns stored in the storage of a set of resampling patterns, where each of the aforesaid sets is intended for its own fixed size of the section being processed;

[1127] availability of a unit of lossless decoding of transmitted patterns, which is connected to the unit of receiving input encoded data and demultiplexing, and to the storage of a set of predetermined resampling patterns;

[1128] the fact that decoding of an encoded full-color image comprising a number of color planes is performed independently for each of the aforesaid planes;

[1129] the fact that the unit of receiving encoded data and demultiplexing singles out additional information from of encoded data.

[1130] One innovation in the part of another variant of the device for implementation of the method of encoding digital signals lies in the fact that it comprises a unit of forming and storing a hierarchical pyramid from input data, a unit of forming reference hierarchical pyramids from reference data, a unit of calculating and storing differential hierarchical pyramids, a unit of calculating interlevel difference, a unit of preliminary classification of data sections, as well as a unit of final classification, filtration and resampling, a unit of converting filtered subsamples into one-dimensional arrays, a unit of encoding location of sub samples and lossless compression, a unit of lossy compression of one-dimensional data arrays, a unit of output driver and a storage of a set of predetermined resampling patterns, where the unit of forming and storing hierarchical pyramid from input data is connected to the unit of calculating and storing differential hierarchical pyramids, as well as to the unit of calculating interlevel difference and the unit of final classification, filtration and resampling, while the unit of forming reference hierarchical pyramids from reference data is connected to the unit of calculating and storing differential hierarchical pyramids, whereas the latter one is connected to the unit of final classification, filtration and resampling, and to the unit of calculating interlevel difference, where the latter one is connected to the unit of preliminary classification of data sections, which is connected to the unit of final classification, filtration and resampling, which, in its turn, is connected to the storage of a set of predetermined resampling patterns, and to the unit of converting filtered subsamples into one-dimensional arrays, which is connected to the unit of encoding location of subsamples and lossless compression, and to the unit of lossy compression of data arrays, their outputs connected to the output driver unit.

[1131] In specific cases, it is characterized by:

[1132] availability of a unit of calculating local compression thresholds, which is connected to the unit of calculating interlevel difference, and to the unit of preliminary classification of data sections;

[1133] the fact that the unit of preliminary classification of data sections classifies the data into sections of different fixed size, while the unit of final classification, filtration and resampling processes sections of different fixed size;

[1134] availability of a unit of lossless encoding of resampling patterns, which is connected to the storage of a set of predetermined resampling patterns, and to the output driver unit;

[1135] the fact that the process of encoding a full-color image comprising a number of color planes is performed independently for each of the aforesaid planes.

[1136] the fact that the output driver unit adds more information to encoded data. [1137] One innovation in the part of device for implementation of another variant of the method for decoding digital signals lies in the fact that it comprises a unit of receiving input encoded data and demultiplexing, a unit of lossless decompression and decoding of information on location of subsamples, a unit of decoding one-dimensional arrays of subsamples encoded by means of a lossy compression algorithm, a unit of restoration of transmitted data sections, a unit of restoration of missed sections, for which there are similar restored sections on the pyramid levels with a higher spatial resolution, a unit of final filtration and interpolation, a unit of storing and output of hierarchical pyramid, a unit of forming and storing reference hierarchical pyramids from reference data, a storage of a set of predetermined resampling patterns, where the unit of receiving input encoded data and demultiplexing is connected to the unit of lossless decompression and decoding of information on location of subsamples, and to the unit of restoration of one-dimensional arrays of subsamples encoded by means of a lossy compression, their outputs connected to the unit of restoration of transmitted data sections, which is connected to the unit of storing and output of hierarchical pyramid, to the unit of forming and storing reference hierarchical pyramids from reference data, to the storage of a set of predetermined resampling patterns and the unit of restoration of missed sections, for which there are similar restored sections on the pyramid levels with a higher spatial resolution, the latter being connected to the unit of storing and output of hierarchical pyramid and to the unit of final filtration and interpolation, which is connected to the unit of storing and output of hierarchical pyramid, to the unit of forming and storing reference hierarchical pyramids from reference data, and to the storage of a set of predetermined resampling patterns.

[1138] In specific cases, it is characterized by:

[1139] availability of a unit of interpolation of missed sections, for which there are restored similarly located sections on the levels with a lower spatial resolution, which is connected to the opening of the link between the unit of restoration of transmitted data sections and the unit of restoration of missed sections, for which there are similar restored sections on the pyramid levels with a higher spatial resolution, and also connected to the unit of storing and output of hierarchical pyramid, and to the unit of forming and storing reference hierarchical pyramids from reference data;

[1140] the fact that the unit of restoration of transmitted data sections and the unit of final filtration and interpolation work with data sections of different fixed sizes, while using several sets of resampling patterns stored in the storage of a set of resampling patterns, where each of the aforesaid sets is intended for its own fixed size of the section being processed;

[1141] the fact that the device contains a unit of lossless decoding of transmitted patterns, which is connected to the unit of receiving input encoded data and demultiplexing, and to the storage of a set of predetermined resampling patterns;

[1142] the fact that decoding of encoded full-color image comprising a number of color planes is performed independently for each of the aforesaid planes;

[1143] the fact that the unit of receiving encoded data and demultiplexing singles out additional information from encoded data.

[1144] One innovation in the part of the system for image transmission via limited throughput communication channels lies in the fact that it comprises a device for image registration, a unit for data format conversion, a data encoding device executed subject to the aforesaid, a low throughput communication channel, a decoding device executed subject to the aforesaid, a unit for inverse transformation of data format and a device for displaying images, where the device for image registration is connected to the unit for data format conversion connected to the data encoding device executed subject to the aforesaid connected to the limited throughput communication channel connected to the decoding device executed subject to the aforesaid connected to the unit for inverse transformation of data format connected to the device for displaying images.

[1145] One innovation in the part of another variant of a system for image transmission via limited throughput communication channels lies in the fact that it comprises a device for registration of video sequences, a unit for data format conversion, a unit for forming reference data arrays at encoding, a data encoding device executed subject to the aforesaid, a limited throughput communication channel, a decoding device executed subject to the aforesaid, a unit for forming reference data arrays at decoding, a unit for inverse transformation of data format and a device for displaying video sequences, where the device for registration of video sequences is connected to the unit for data format conversion connected to the data encoding device executed subject to the aforesaid, and to the unit for forming reference data arrays at encoding, with the latter connected to the data encoding device executed subject to the aforesaid, which is connected to the limited throughput communication channel connected to the decoding device executed subject to the aforesaid, which is connected to the unit for forming reference data arrays at decoding, and to the unit for inverse transformation of data format connected to the device for displaying video sequences.

[1146] It should be appreciated that all combinations of the foregoing concepts and additional concepts discussed in greater detail below (provided such concepts are not mutually inconsistent) are contemplated as being part of the inventive subject matter disclosed herein. In particular, all combinations of claimed subject matter appearing at the end of this disclosure are contemplated as being part of the inventive subject matter disclosed herein. It should also be appreciated that terminology explicitly employed herein that also may appear in any disclosure incorporated by reference should be accorded a meaning most consistent with the particular concepts disclosed herein.

Exemplary Implementations of Improved SIF Transformation and Inverse SIF

Transformation

[1147] List of identifiers presented in FIG. 1-23.

[1148] 101— Two-dimensional low-pass filter.

[1149] 102— Thinning (decimation) by 2 horizontally and vertically.

[1150] 103— Zero decimation level in building a hierarchical pyramid

[1151] 104— First decimation level.

[1152] 105— Second decimation level.

[1153] 106— Third decimation level.

[1154] 201— Device for image registration.

[1155] 202, 209— Unit for converting the data format.

[1156] 203, 210— Encoding device.

[1157] 204, 212— Limited throughput communication channel.

[1158] 205, 213— Decoding device.

[1159] 206, 215— Unit for inverse transformation of data format.

[1160] 207— Device for displaying images.

[1161] 208— Device for registration of video sequences.

[1162] 211— Unit for forming reference arrays at encoding. [1163] 214— Unit for forming reference arrays at decoding.

[1164] 216— Device for displaying video sequences.

[1165] 301, 302, 303, 304— Units of adaptive and/or linear filtration and decimation combined into a unit of forming and storing hierarchical pyramid from input data.

[1166] 305, 306, 307, 308— Decimation levels stored in the unit of forming and storing hierarchical pyramid from input data.

[1167] 309, 310, 311, 312— Adaptive and linear interpolator combined in a unit of calculating interlevel difference.

[1168] 313, 314, 315, 316— Calculators of the square of interlevel signal difference combined in a unit of calculating interlevel difference.

[1169] 317, 503— Source general parameters of compression.

[1170] 318, 504— Unit of calculating local compression thresholds.

[1171] 319, 534— Local compression thresholds.

[1172] 320, 535— Unit of preliminary classification of data sections.

[1173] 321, 536— List of sections processed by the unit of final classification, which comprises additional statistical information.

[1174] 322, 538— Unit of final classification, filtration and resampling.

[1175] 323, 537— Storage of a set of predetermined resampling patterns.

[1176] 324— Unit of converting filtered subsamples into a one-dimensional array.

[1177] 325, 542— Array of subsamples.

[1178] 326, 543— Statistical and control data.

[1179] 327, 544, 547— One-dimensional data array.

[1180] 328, 545, 548— Additional statistical and control data.

[1181] 329— Unit of lossy compression of one-dimensional array.

[1182] 330, 550— Unit of encoding location of subsamples and lossless compression

[1183] 331, 552— Additional data.

[1184] 332, 551— Output driver unit. [1185] 400, 600, 1000, 1500, 1600, 1700, 1800, 1900— Start of operation.

[1186] 401— Creation of a full list of non-overlapping data sections located at a level of hierarchical pyramid with the lowest spatial resolution.

[1187] 402, 602— Check: are there remaining elements on the list?

[1188] 403— Reading location of the next data section from the list and calculation of accumulative metric value for the aforesaid section.

[1189] 404— Check: is the metric value smaller than the local threshold?

[1190] 405— Removing the current data section off the list of sections and addition of its location and calculated metric value to the list of sections processed in the unit of final classification.

[1191] 406— Removing the current section off the list. Passing to a level of hierarchical pyramid having a higher spatial resolution than the removed section. Singling out a data section located equivalently to the removed one and dividing it into four sub-sections.

[1192] 407— Check: are new sections located at the level of the highest spatial resolution?

[1193] 408— Adding new sections to the list of sections processed in the unit of final classification.

[1194] 409— Adding new sections to the list of sections created at the first step of the algorithm.

[1195] 410, 610, 1013, 1510, 1613, 1710, 1815, 1909— End of operation. [1196] 501— Reference data arrays. [1197] 502— Array of encoded input data.

[1198] 505, 507, 509— Units of adaptive and/or linear filtration and decimation combined in a unit of forming reference hierarchical pyramids from reference data.

[1199] 506, 508, 510— Decimation levels belonging to a reference hierarchical pyramid and stored in the unit of forming reference hierarchical pyramids from reference data.

[1200] 511, 513, 515— Units of adaptive and/or linear filtration and decimation combined in a unit of forming and storing hierarchical pyramid from input data. [1201] 512, 514, 516— Decimation levels belonging to the original hierarchical pyramid and stored in the unit of forming and storing hierarchical pyramid from input data.

[1202] 517, 519, 521, 523, 526, 529— Adaptive and/or linear interpolators combined in a unit of calculating interlevel difference.

[1203] 518, 520, 522, 524, 527, 530— Calculators of the square of interlevel signal difference combined in a unit of calculating interlevel difference.

[1204] 522, 525, 528, 531— Calculators of difference combined in a unit of calculating and storing differential hierarchical pyramids.

[1205] 532— Interlevel signal energy for input data.

[1206] 533— Interlevel signal energy for input data from differential hierarchical pyramids.

[1207] 539— Data from differential hierarchical pyramids.

[1208] 540— Data from the original hierarchical pyramid.

[1209] 541— Unit of converting filtered subsamples into one-dimensional arrays.

[1210] 546, 549— Units of lossy compression combined in a unit of lossy compression of one-dimensional data arrays.

[1211] 601— Creation of a full list of non-overlapping data sections located at levels with the lowest spatial resolution belonging to the main and differential hierarchical pyramids. Each group comprises a data section from the main pyramid and sections from differential pyramids from sections equivalent thereto.

[1212] 603— Reading location of the next group of data section from the list and calculating a value of accumulative metric for each of the section belonging to the group. Selecting a section with the smallest metric value out of sections belonging to the group.

[1213] 604— Check: is the metric value smaller than the local threshold?

[1214] 605— Removing the current group of sections off the list of groups. Adding location of the selected section together with the calculated metric value to the list of sections processed in the unit of final classification.

[1215] 606— Removing the current group of sections off the list of groups. Passing to neighboring levels of hierarchical pyramids having a higher spatial resolution than levels of location of the removed group. Singling out data sections located equivalently to sections of the removed group. Dividing the sections into four sub-groups.

[1216] 607— Check: are new groups located at levels having the highest spatial resolution?

[1217] 608— Adding sections belonging to new groups, yet located in the hierarchical pyramid, which comprised a section selected at stage 603, to the list of sections processed in the unit of final classification.

[1218] 609— Adding new groups of sections to the list created at the first step of the algorithm.

[1219] 701— Original interpolation filter with overlapping.

[1220] 702— Simplified interpolation filter without overlapping.

[1221] 703— Compensating filter with overlapping.

[1222] 704— Amplitude-frequency function of original interpolation filter.

[1223] 705— Amplitude-frequency function of simplified interpolation filter.

[1224] 706— Amplitude-frequency function of compensating filter.

[1225] 801— Original interpolation filter with overlapping.

[1226] 802— Filter without overlapping.

[1227] 803, 804— Compensating filters.

[1228] 900— Original data section.

[1229] 901, 902, 903, 904, 905, 906, 907, 908— Examples of configuration of resampling patterns.

[1230] 909— Center of filtered subsample.

[1231] 910, 911— Borders of non-overlapping parts of composite interpolation filters.

[1232] 1001— Reading a list of data sections made at the stage of preliminary classification.

[1233] 1002— Check: are there remaining unprocessed sections? [1234] 1003— Reading location of the next data section out of the list of sections. Selecting a group of resampling patterns, in which the input data section is divided into the smallest number of subsamples.

[1235] 1004— Calculating the values of subsamples for each of the patterns belonging to the group, by means of overlapping adaptive and/or linear low-pass filters.

[1236] 1005— Restoring a value of the original data section for each pattern belonging to the group, by means of non-overlapping parts of adaptive and/or linear composite cascade interpolation filters set for each subsample in the bank of patterns.

[1237] 1006— Final interpolation for each pattern belonging to the group, with using overlapping compensating parts of adaptive and/or linear composite cascade interpolation filters.

[1238] 1007— Calculating the total metric for each pattern belonging to the group. Selecting a pattern with the smallest total metric value.

[1239] 1008— Check: is the total metric value smaller than the local compression threshold?

[1240] 1009— Storing the values of subsamples, their locations and information on the type of selected resampling pattern.

[1241] 1010— Check: are all the available groups of patterns checked?

[1242] 1011— Selecting a group of patterns having the smallest number of subsamples out of the groups, which have not been checked yet.

[1243] 1012— Storing the values of samples of the data section being processed and information on their location, with a statement that no resampling pattern was used for this particular section.

[1244] 1101— Data section located at the level of hierarchical pyramid with the lowest spatial resolution, for which there are filial sections.

[1245] 1102, 1103— Data sections located at the level of hierarchical pyramid with the lowest spatial resolution, for which various resampling patterns were used.

[1246] 1104, 1105— Filial data sections located at levels of hierarchical pyramid with a higher spatial resolution.

[1247] 1200— Input data array. [1248] 1201— Discrete cosine transform.

[1249] 1202— Adaptive quantizer.

[1250] 1203— Statistical data.

[1251] 1204— Arithmetic encoder.

[1252] 1205— Adaptive and/or stationary statistical model.

[1253] 1301, 1401— Unit of receiving input encoded data and demultiplexing.

[1254] 1302, 1402— Unit of lossless decompression and decoding of information on location of subsamples.

[1255] 1303, 1403— Additional data.

[1256] 1304— Unit of decoding one-dimensional array of subsamples encoded with a lossy compression algorithm.

[1257] 1305, 1405— Unit of restoring transmitted data sections, which is performed by means of using non-overlapping parts of interpolation filters set in resampling patterns.

[1258] 1306, 1406— Storage of a set of predetermined resampling patterns.

[1259] 1307, 1407— Unit of storing and output of hierarchical pyramid.

[1260] 1308, 1408— Decoded information on location of subsamples and type of used resampling patterns.

[1261] 1309— Restored array of subsamples.

[1262] 1310, 1412— Restored data sections.

[1263] 1311, 1313, 1315, 1413, 1415, 1417— Support data array.

[1264] 1312, 1414— Unit of interpolation of missed sections, for which there are restored similarly located sections on levels with a lower spatial resolution.

[1265] 1314, 1416— Unit of restoring missed sections, for which there are restored similarly located sections on levels with a higher spatial resolution.

[1266] 1316, 1418— Unit of final filtration and interpolation.

[1267] 1317, 1419— Restored data.

[1268] 1404— Unit of decoding one-dimensional arrays of subsamples encoded with a lossy compression algorithm. [1269] 1409— Restored arrays of subsamples.

[1270] 1410— Unit of forming and storing reference hierarchical pyramids from reference data.

[1271] 1411— Reference data.

[1272] 1501— Making a list of transmitted data sections. Reading information on location and type of applied resampling pattern for the first data section on the list.

[1273] 1502— Check: was a resampling pattern used in encoding the current section?

[1274] 1503— Restoring the current data section with values from the one-dimensional array of subsamples.

[1275] 1504— Reading values of subsamples from the one-dimensional array and restoring the current data section by means of non-overlapping parts of adaptive and/or linear composite cascade interpolation filters determined for each sample belonging to a section being restored in the resampling pattern in use.

[1276] 1505— Check: does the current section belong to a differential hierarchical pyramid?

[1277] 1506— Adding values of a similarly located section taken from the relevant reference hierarchical pyramid to the current data section.

[1278] 1507— Recording the current data section values in the relevant place of the hierarchical pyramid being restored and restoring parameters of the current section in the support array of control data.

[1279] 1508— Reading information on location and type of applied resampling pattern for the next data section out of the list of transmitted sections.

[1280] 1509— Check: are all the transmitted data sections processed?

[1281] 1601— Creating a full list of non-overlapping data sections located at a level of hierarchical pyramid with the lowest spatial resolution and selecting the first section out of the list.

[1282] 1602— Check: does the current section contain restored data?

[1283] 1603— Check: is the current section restored by means of a reference pyramid? [1284] 1604— Interpolation of the current data section by means of non-overlapping interpolation filters.

[1285] 1605— Deducting values of a similarly located section of a reference pyramid from the current section values.

[1286] 1606— Interpolation of obtained data by means of non-overlapping interpolation filters.

[1287] 1607— Adding values of a similarly located section on the next level of reference pyramid with a higher spatial resolution to the obtained data.

[1288] 1608— Recording interpolated data to a similar section located on a neighboring level of pyramid with a higher spatial resolution.

[1289] 1609— Check: are all the sections on this pyramid level processed?

[1290] 1610— Selecting the next section out of the list.

[1291] 1611— Check: is the next level of the highest spatial resolution?

[1292] 1612— Passing to the next level of hierarchical pyramid with a higher spatial resolution. Making a list of sections and selecting the first data section out of the list.

[1293] 1701— Making a full list of non-overlapping data sections located on a level of hierarchical pyramid with the highest spatial resolution, and selecting the first section out of the list.

[1294] 1702— Check: is there a non-restored section located similarly to the current section, yet located on the nearest level of hierarchical pyramid with a lower spatial resolution?

[1295] 1703— Filtration of values of the current data section by means of adaptive and/or linear overlapping low-pass filters.

[1296] 1704— Decimation of filtered values for obtaining a reduced copy of the section being processed.

[1297] 1705— Recording a reduced copy of the data section being processed into a relevant non-restored section belonging to the nearest level of hierarchical pyramid with a lower spatial resolution than the level being processed.

[1298] 1706— Check: are all the sections on this pyramid level processed? [1299] 1707— Selecting the next section out of the list.

[1300] 1708— Check: is the next level of the lowest spatial resolution?

[1301] 1709— Passing to the next level of hierarchical pyramid with a lower spatial resolution. Making a list of sections and selecting the first data section out of the list.

[1302] 1801— Making a full list of non-overlapping data sections located on a level of hierarchical pyramid with the lowest spatial resolution, and selecting the first section out of the list.

[1303] 1802— Check: Is the current section restored, and does it contain data restored in the course of restoration of missed sections of hierarchical pyramid, for which there are restored similarly located sections on levels with a higher spatial resolution?

[1304] 1803— Check: is the current section restored by means of a reference pyramid?

[1305] 1804— Final interpolation by means of a reference hierarchical pyramid.

[1306] 1805, 1902— Check: is the current pattern restored by means of a resampling pattern?

[1307] 1806, 1904— Check: is the current section interpolated by means of non- overlapping parts of adaptive and/or linear composite cascade interpolation filters?

[1308] 1807— Filtration of the current data section with overlapping compensating parts of adaptive and/or linear composite cascade interpolation filters determined for each sample belonging to the current data section in the predetermined set of resampling patterns.

[1309] 1808— Filtration of the current section by means of overlapping compensating parts of adaptive and/or linear composite cascade interpolation filters.

[1310] 1809, 1906— Check: is the current level not of the maximum possible resolution?

[1311] 1810— Interpolating values of the current section by means of non-overlapping parts of adaptive and/or linear composite cascade interpolation filters and recording interpolated data into a similar section located on a neighboring level of hierarchical pyramid with a higher spatial resolution.

[1312] 1811— Check: are all the sections on this pyramid level processed? [1313] 1812— Selecting the next section out of the list. [1314] 1813— Check: are all the levels processed yet? [1315] 1814— Passing to the next level of hierarchical pyramid with a higher spatial resolution. Making a list of sections and selecting the first data section out of the list.

[1316] 1901— Calculating the difference between values of the current data section and values of a similarly located section of the reference hierarchical pyramid, as well as between the data adjacent to the section being processed and the relevant data of the reference hierarchical pyramid.

[1317] 1903— Filtration of obtained data by means of overlapping compensating parts of adaptive and/or linear composite cascade interpolation filters determined for each sample belonging to the current data section in the predetermined set of resampling patterns.

[1318] 1905— Filtration of obtained data by means of overlapping compensating parts of adaptive and/or linear composite cascade interpolation filters.

[1319] 1907— Adding values of a similarly located section of the reference pyramid to obtained data and recording obtained values back into the current section of the pyramid being processed.

[1320] 1908— Interpolation of values of obtained data by means of non-overlapping parts of adaptive and/or linear composite cascade interpolation filters. Adding values of a similarly located section on a neighboring level of the reference pyramid with a higher spatial resolution to obtained data and recording obtained data into the relevant section of the pyramid being processed.

[1321] 2001, 2006— Initial state of the pyramid being restored after operation of the unit of restoration of transmitted sections by means of non-overlapping parts of interpolation filters predetermined in resampling patterns.

[1322] 2002, 2003— Stages of operation of the unit of interpolation of missed sections, for which there are restored similarly located sections on levels with a lower spatial resolution.

[1323] 2004, 2005— Stages of operation of the unit of restoring missed sections, for which there are similar restored sections on the levels of pyramid with a higher spatial resolution.

[1324] 2007, 2008— Stages of operation of the unit of restoring missed sections, for which there are similar restored sections on the levels of pyramid with a higher spatial resolution, if this unit implements an accelerated restoration scheme. [1325] 2100, 2200— Original hierarchical pyramid being restored. [1326] 2101, 2201— Reference hierarchical pyramid.

[1327] 2102, 2202— Zero decimation level belonging to the original hierarchical pyramid being restored.

[1328] 2103, 2203— First decimation level belonging to the original hierarchical pyramid being restored.

[1329] 2104, 2204— Zero decimation level belonging to the reference hierarchical pyramid.

[1330] 2105, 2105— First decimation level belonging to the reference hierarchical pyramid.

[1331] 2106, 2206, 2209— Calculating the difference. [1332] 2107— Interpolator using non-overlapping filters. [1333] 2108, 2209, 2212— Calculating the total.

[1334] 2207, 2211— Filtration by means of overlapping compensating parts of adaptive and/or linear composite cascade interpolation filters.

[1335] 2208— Interpolation by means of non-overlapping parts of adaptive and/or linear composite cascade interpolation filters.

[1336] 2300— System comprising the device of the present disclosure, or just a component thereof, and/or comprising a decoding device of the present disclosure, as well as a component thereof.

[1337] 2301— Central processing unit; 2302— Nonvolatile (permanent) memory; 2303— Main memory; 2304— System bus; 2305— Hard disk; 2306— Graphics processor; 2307— Displaying device (display); 2308— Communication interface; 2309— Data network; 2310— Peripheral interface; 2311— Camcorder; 2312— Scanner; 2313— Memory card reader; 2314— Memory card; 2315— Removable disk drive; 2316— Removable disk; 2317— Pointing device interface; 2318— Pointing device; 2319— Keyboard interface; 2320— Keyboard; 2321— Printer.

[1338] FIG. 2 presents examples of implementation of systems, which use the disclosed innovations and intended for transfer of images and/or video sequences via limited throughput communication channels. [1339] Images, upon being converted into an electric signal by means of registration device (201), come to unit (202) of format data conversion, where the format of input data is coordinated with the format used by encoding device (203). For example, a method of color representation of data being compressed, or their spatial resolution may vary. Then data encoded by means of encoding device (203) are transmitted via limited throughput communication channel (204) to the input of decoding device (205), whereupon the format of decoded data is inversely transformed in unit of inverse transformation (206), which communicates the restored images to displaying device (207).

[1340] Video sequences, upon being converted into an electric signal by means of registration device (208), come to the unit (209) of format data conversion, where the format of input data is coordinated with the format used by encoding device (210). For example, a method of color representation of data being compressed, or their spatial resolution may vary. Then the converted data come to the input of unit (211) of forming reference data arrays at encoding, and to the input of encoding device (210). Unit (211) of forming reference data arrays may form reference arrays by means of sections of video sequences, which were already encoded before, and transmit rules of formation of the aforesaid reference arrays through encoding device (210) via communication channel (212). Data encoded by means of encoding device (210) and reference data arrays are transmitted via limited throughput communication channel (212) to the input of decoding device (213). Decoding device uses reference data arrays formed by unit (214) of forming reference arrays at decoding, which may use in its operation previously transmitted sections, of video sequences and rules of formation of reference data arrays, which were transmitted via communication channel. Upon encoding, the format of encoded data is inversely transformed in unit of inverse transformation (215), which communicates the restored video sequences to displaying device (216).

[1341] In the disclosed group of innovations, composite cascade interpolation filters are used (FIG. 7). Original interpolation, filter with overlapping (701) is replaced with an equivalent cascade of two filters in series interpolation filter without overlapping (702) and compensating filter (703) with overlapping. With filters (705,706) connected as a cascade, their amplitude-frequency functions are multiplied, with the result of operation of such a cascade becoming equal to the result of operation of original interpolation filter (704) with overlapping. FIG. 8 presents an example of transforming weight ratios of original interpolation filter (801). At the first stage, the signal is interpolated by filter (802) without overlapping. At the second stage, each sample obtained after interpolation is filtered by compensating filter (803,804) with overlapping. The final result of operation of the cascade is numerically equal to operation of the original interpolation filter with overlapping.

[1342] The disclosed group of innovations involves using resampling patterns. A separate resampling pattern is an informational structure comprising unambiguous description of the process of converting original samples contained in the data section being processed into an array of subsamples, as well as comprising unambiguous description of the process of restoring original samples contained in the data section being processed out of an array of subsamples. The process of obtaining an array of subsamples may involve using adaptive and/or linear filters, whereas the process of restoring original samples may involve using adaptive and/or linear composite cascade interpolation filters. Patterns are kept in the storage of a set of patterns.

[1343] FIG. 9 presents examples of resampling patterns, with section being processed (900) being 4x4 in size. Centers of filtered subsamples are shown as circles (909), whereas borders of non-overlapping parts of composite interpolation filters are highlighted in bold lines (910).

[1344] Configuration of resampling patterns may virtually be arbitrary. For example, configuration may be linear with resampling by horizontal (902) or vertical axes (901), nonlinear with maintaining horizontal or vertical orientation of interpolating filters (903), directional with diagonal orientation of interpolating filters (904, 905), or mixed with arbitrary orientation of interpolating filters and arbitrary arrangement of subsamples in the pattern (906,907,908). If the border of non-overlapping parts of composite interpolation filters (91 1) passes across the area occupied by one sample of the data section being restored, at the first stage of interpolation, the value of this sample is determined through the equation below:

[1345] where Ph and Ph are relative areas occupied by non-overlapping parts of interpolation filters, for the first (Sampi) and second (Samp ₂ ) subsample, respectively,

[1346] Ots is obtained value of the data sample being restored. [1347] The disclosed group of innovations may involve using adaptive filters, i.e. filters changing their transfer characteristics depending on current statistical properties of the signal being processed. In particular, adaptive filters may be used as compensating filters within composite cascade interpolators, in units of two-dimensional adaptive and/or linear filtration and decimation, as well as in resampling patterns.

[1348] FIG. 3 is a schematic presentation of a device implementing a variant of the claimed encoding method.

[1349] At the first stage of this method, the input digital signal is presented as a hierarchical pyramid (Laplacian pyramid) with an arbitrary, predetermined number of levels. For example, FIG. 3 presents division into four levels. To this effect, original data are successively fed through units (301,302,303,304) of adaptive and/or linear filtration and decimation combined in a unit of forming and storing a hierarchical pyramid out of input data. Here, reduced copies of input data are created, which are kept at levels (305,306,307,308) of decimation in the unit of forming and storing hierarchical pyramid out of input data.

[1350] Thereafter, calculation is made of differential signal drive between hierarchical levels of the Laplacian pyramid created at the preliminary stage. Reduced copies (305,306,307,308) of original data are fed through units (309,310,311,312) of adaptive and/or linear interpolation, which, together with calculators (313,314,315,316) of the square of interlevel signal difference, are combined in a unit of calculating interlevel difference. Calculators (313,314,315,316) of the square of interlevel signal difference calculate the square of difference between the corresponding elements of the interpolated level and the level of the original hierarchical pyramid with a higher resolution, i.e. interlevel differential signal energy.

[1351] For data sections located on levels of a hierarchical pyramid with a low spatial resolution (high decimation level), calculation is made of accumulative metric characterizing statistical properties of a particular section of the input signal. The accumulative metric is characterized in that calculation thereof involves using the differential signal energy determined by means of calculators (313,314,315,316). Generally, in calculating accumulative metric Sen for a data section located at the decimation level with number M>0 and containing the number of value of differential signal enemy NM>0, the equation below is applied:

[1352] where N/ at i<M is the number of values of differential signal energy for a data section located similarly to the one being processed, but of a lower decimation level,

En/ is the value of differential signal energy with serial number n and located at decimation level i in the hierarchical pyramid being processed,

2 ^2(,_1) is compensating factor.

[1353] A metric determined in the above-described way may be applied to calculating local compression thresholds of input image (319), with global compression parameters (317) used in unit (318) of calculating local compression thresholds. For example, for each section of the hierarchical pyramid being compressed, it is possible to calculate the local compression threshold through a simple equation presented below:

[1354] where Tlok is calculated local compression threshold,

Tgl is original general compression threshold,

Kdet is factor set for each decimation level,

Sen is value of the above metric.

[1355] Using pre-calculated values of differential signal energy makes it possible to raise the operating speed of unit (318) substantially. For data sections located at the zero level of the hierarchical pyramid being compressed, for which the value of Sen is not determined, one may use the value of Sen calculated for similarly located sections of a higher decimation level.

[1356] Local compression thresholds obtained in the aforesaid way are used during operation of unit (320) of preliminary classification of data sections. This unit would determine the sections of hierarchical levels of the Laplacian pyramid, to which predetermined non-linear resampling patterns will be applied.

[1357] FIG. 4 presents a sequence of operations with operating unit (320) of preliminary classification of data sections. At the first stage (401), a list is made containing location of all the non-overlapping data sections, which are at a level of the hierarchical pyramid with the lowest spatial resolution. The size of these sections is set as equal to the size of a section being processed by unit (322) of final classification, filtration and resampling. Then the principal cycle (402) of processing is performed. Information is extracted (403) out of the list of elements being processed on location of the current data section in the hierarchical pyramid, with the above accumulative metric (2) calculated for this section. If the metric value is smaller (404) than the local compression threshold calculated in unit (318) of calculating local compression thresholds, information on location of the data section being processed is removed (405) off the processing list and put on the list of data sections being processed by unit (322) of final classification, filtration and resampling, together with calculated values of the accumulative metric. Otherwise (406), the section being processed is also removed off the processing list, yet transition occurs to a similarly located data section being on a neighboring level of the hierarchical pyramid with a higher spatial resolution. The new section is divided into four sub-sections, so that the amount of data contained in each sub-sections would match the amount of data in the original section removed off the processing list. Thereafter a check is performed (407) of location of new sections. If these sections are on the level of the hierarchical pyramid, which is of the highest spatial resolution, information on location of new sections is added (408) to the list of sections being processed by unit (322) of final classification, filtration and resampling, whereas zero values are recorded instead of the accumulative metric values. Otherwise (409), data on location of new sections are added to the processing list created at the first (401) stage of the algorithm. At the beginning of each new processing cycle, a check is performed for availability of elements on the list being processed (402), and with all the elements having been processed, the process of preliminary classification is completed (410). This method of preliminary classification makes it possible to achieve multiple acceleration of the compression process, as, in most of the cases, it is sufficient to process only the data sections located on levels of the original hierarchical pyramid, which have a low spatial resolution.

[1358] The size of each data section, which is being processed in unit (322) of final classification, filtration and resampling, must be equal to the size of resampling patterns recorded in the storage (323) of a set of predetermined resampling patterns.

[1359] FIG. 10 is a schematic presentation of the sequence of operations with operating unit (322) of final classification, filtration and resampling. In storage (323) of a set of predetermined resampling patterns, all the patterns are grouped. Each group has patterns having the same number of subsamples, yet of different configuration thereof. At the first stage of operation (1001), reading is performed (321) of the list of sections selected by the unit of preliminary classification, by means of the process detailed above. For each section, the list specifies its location and additional statistical information, including the calculated value of accumulative metric. The list of sections having been read (321), the principal cycle of processing is performed (1002). Location of the next data section out of the processing list is read (1003), and a group of resampling patterns is selected, in which the original data section is divided into the smallest number of subsamples. Thereafter, calculation is performed (1004) of the value of subsamples for each of the patterns belonging to the group. Calculation (1004) is performed by means of overlapping adaptive and/or linear low-pass filters predetermined for each subsample in storage (323) of a set of predetermined resampling patterns, and with using the values of data located near the data section being processed in the main and differential hierarchical pyramids. It is followed by the first stage of restoring the original data section from obtained subsamples, which is performed (1005) for each of the resampling patterns belonging to the group. This stage involves using non- overlapping parts of adaptive and/or linear composite cascade interpolation filters determined for each subsample in storage (323) of a set of predetermined resampling patterns. Thereafter, for each pattern belonging to the group, the final stage of restoration is performed (1006), which involves using overlapping compensating parts of adaptive and/or linear composite cascade interpolation filters determined, for each sample of the data section being processed, in storage (323) of a set of predetermined resampling patterns, as well as using values of the data located near the section being processed in the original hierarchical pyramid. Thereafter, for each pattern belonging to the group, calculation is made (1007) of the total metric (Msym), which is performed through the following equation:

[1360] where Sen is the value of accumulative metric calculated for the data section being processed,

M is the number of decimation level of the hierarchical pyramid, on which the unit being processed is located,

N is the number of data samples in the unit being processed,

K« is the original value of a data sample numbered as n, K'« is restored value of a data sample numbered as n.

[1361] It is followed by selecting (1007) a pattern of the smallest Msym value and belonging to the group of patterns being processed. The minimum value of total metric calculated in the aforesaid way is compared (1008) to the local threshold calculated by unit (318) of calculating local compression thresholds. Should the value of the total metric be smaller than the local compression threshold, there is performed storing (1009) of values of subsamples calculated at stage (1004), their location and information on the type of the resampling pattern selected at stage (1007). Thereafter, transition (1002) is performed to processing the next section of the image. Otherwise (1010), it is checked, whether there are still unchecked groups of resampling patterns and, if such groups are available, there is selected (1011) a group of patterns with the smallest number of subsamples out of those, which have not been checked yet, which is followed by proceeding to step (1004). If all the available configurations of resampling patterns have been checked, with no positive results given by the aforesaid check, the values of samples of the data section being processed is stored (1012), along with information on their location, with a statement that no resampling pattern was used for this particular section.

[1362] Then the subsamples obtained at the previous compression stage are converted into a one-dimensional data array. Unit (324) of converting obtained subsamples into a one- dimensional array may use both the elementary method of conversion based on copying input subsamples into output arrays according to the order, in which they were processed by unit (322) of final classification, filtration and resampling, and more complex adaptive methods of conversion. More complex conversion methods may use statistical and control data (326) obtained from the previous unit, and/or analyze values of subsamples (325) for creating a one-dimensional data array (327), in which subsamples of similar values and statistical properties would occupy close positions.

[1363] Data, which characterize arrangement of subsamples in original hierarchical pyramids, type of applied resampling patterns and procedure of selecting subsamples out of one-dimensional data array (327), are transmitted to unit (330) of encoding location of subsamples and lossless compression. This unit may use compact presentation of information on location of subsamples in the form of a hierarchical tree structure. Binary trees, quadtrees, or more complex structures, e.g. embedded quadtrees, octo-trees, etc. may be used as such structure. The final form of the tree structure is determined by the set of resampling patterns, which is used in compression. For example, FIG. 11 presents the principle of constructing an embedded quadtree. For each data section located at a level of hierarchical pyramid with the lowest spatial resolution (1101), the serial number of resampling pattern is saved (1102,1103), which was used for calculating subsamples on this section, and which is stored in storage (323) of a set of predetermined resampling patterns, and information is also saved, which characterizes unambiguously the process of restoring these subsamples from a one- dimensional data array. If this section were not selected in the process of operation of unit (320) of preliminary classification of data sections, zero value is stored for it, and transition is made to four filial data sections (1104) located on a neighboring level of hierarchical pyramid with a higher spatial resolution. If, however, the level in question of the hierarchical pyramid also contains unselected sections, the process of transition is repeated (1105). Information on location of subsamples presented in the form of a compact data structure may be additionally encoded by means of lossless compression algorithms, such as arithmetic encoding, or encoding with variable-length codes.

[1364] One-dimensional array of subsamples obtained as a result of operation of conversion unit (324) is compressed in unit (329) of lossy compression of one-dimensional array. Any of currently common algorithms of lossy compression may be used in this unit. In particular, this may be adaptive differential pulse-code modulation (ADPCM), discrete cosine transform (DCT), wavelet transform, sub-band transform, overlapped block transform, transform based on wavelet packet or Matching Pursuit. The transform data may be applied jointly with scalar or vector quantization of obtained factors. Vector quantization without preliminary conversion may also be used. The original one-dimensional array may be divided into uneven sections, and different lossy compression algorithms may be applied to different sections. Unit (329) of lossy compression of one-dimensional array may use additional statistical and control data (328) for optimization of the compression process: for example, for selecting the quantization threshold, type of conversion applied, code book of vector quantization. FIG. 12 presents an example of implementation of lossy compression unit (329). An input one-dimensional array of subsamples (1200) is converted by means of discrete cosine transform (1201), whereupon obtained values are quantized by adaptive (1202) quantizer and compressed by arithmetic encoder (1204). Adaptive quantizer (1202) uses statistical data (1203) transmitted from unit (324) of converting filtered subsamples into a one-dimensional array, for optimization of the quantization process. Arithmetic encoder (1204) uses adaptive and/or stationary statistical model (1205) for raising encoding efficiency. [1365] Data obtained as a result of operation of unit (330) of encoding location of subsamples and lossless compression, as a result of operation of unit (329) of lossy compression of one-dimensional array, are transmitted to output driver unit (332), where they are multiplexed and prepared for being transmitted via a communication channel. Output driver unit (332) may enter additional data (331) to the output flow, such as information on original size of the image being compressed, information on color format of data being compressed, rules of forming reference data arrays, etc.

[1366] In addition, the claimed method and device of encoding may be characterized as comprising the following essential features:

[1367] Unit (320) of preliminary classification of data sections may classify the original hierarchical pyramid into data sections of different fixed size, whereas unit (322) of final classification, filtration and resampling may use several sets of resampling patterns, each intended for its own size of data sections being processed.

[1368] Information, or a part thereof, comprising unambiguously described process of restoring encoded data sections from a restored array of subsamples, i.e. content, or a part of content of storage of resampling patterns may be encoded in the unit of lossless encoding of resampling patterns by means of the lossless method and be transmitted together with encoded data.

[1369] If data being encoded constitute a full-color image presented in the form of several color planes, for example, a luminance plane and color-difference planes, each of the aforesaid planes is encoded separately in the above-described way.

[1370] Processes of preliminary and final classification may be optimized by means of using a criterion of minimization of the general distortion rate, for a predetermined data level.

[1371] The encoding process may be performed for the entire input data array, or else this array may be divided into overlapping units, and for each unit the above- enumerated operations may be performed independently from the others.

[1372] FIG. 5 is a schematic presentation of a device implementing a variant of the claimed encoding method, for a case, when reference data arrays are used.

[1373] At the first stage of this method, the original digital signal, as well as reference data arrays are presented in the form of hierarchical pyramids (Laplacian pyramids) with an arbitrary predetermined number of levels. For example, FIG. 5 presents division of data into three decimation levels, with just one reference array used. To this effect, original data (502) are successively fed through units of adaptive and/or linear filtration and decimation

(511.513.515) combined in a unit of forming and storing hierarchical pyramids from input data. Here, reduced copies of original data are created, which are stored on decimation levels

(512.514.516) in the unit of forming and storing a hierarchical pyramid from input data. Reference data arrays (501) are also successively fed through units (505,507,509) of adaptive and/or linear filtration and decimation combined in a unit of forming reference hierarchical pyramids from reference data. Here, reduced copies of original reference data arrays are created, which are stored on decimation levels (506,508,510) in the unit of forming reference hierarchical pyramids from reference data.

[1374] Thereafter, differential hierarchical pyramids are created by means of calculators of difference (522,525,528,531) combined in a unit of calculating and storing differential hierarchical pyramids. Here, differences are calculated between corresponding levels of the original hierarchical pyramid and reference hierarchical pyramids. In other words, (510) is deducted from (516), (508) is deducted from (514), (506) is deducted from (512), and (501) is deducted from (502).

[1375] Thereafter, calculation is performed of interlevel differential signal energy for differential hierarchical pyramids and for the reference hierarchical pyramid. Decimation levels obtained in the course of creating the aforesaid pyramids are fed through units

(517.519.521.523.526.529) of adaptive and/or linear interpolation, which, together with calculators (518,520,522,524,527,530) of the square of interlevel signal difference, are combined in a unit of calculating interlevel difference. Calculators

(518.520.522.524.527.530) of the square of interlevel signal difference calculate the square of the difference between the corresponding elements of the interpolated level and the level belonging to the same hierarchical pyramid, but of a higher spatial resolution, i.e. determine interlevel differential signal energy.

[1376] The values of interlevel signal energy for original data (532) and data being in differential pyramid (533), which were obtained in the aforesaid way, are used for calculation of accumulative metric (2) used in the process of operation of the unit of calculating local compression thresholds (504) and in the process of operation of the unit of preliminary classification of data sections (535). [1377] Thus, accumulative metric (2) may be used for operation of the unit of calculating local compression thresholds. Here, similarly located sections of the original and differential hierarchical pyramids are grouped. Thereafter, it is possible to calculate the local compression threshold for each group, which is performed through the simple equation given below:

[1378] Tlok=Tgl+Kdet*SenM (5),

[1379] where Tlok is calculated local compression threshold, [1380] Tgl is original general compression threshold, [1381] Kdet is factor set for every decimation level,

[1382] SenM is the minimum value of accumulative metric out of the values, which were calculated for each of the sections in the group.

[1383] Here, a single local compression threshold is set for all the sections belonging to the group. Using pre-calculated values of differential signal energy allows a significant increase in operating speed of unit (504) of calculating local compression thresholds. For data sections located on the zero level of the hierarchical pyramid being compressed, for which the value of Sen was not determined, it is possible to use the value of Sen calculated for similarly located sections of a higher decimation level.

[1384] Obtained local compression thresholds (534) are used during operation of unit (535) of preliminary classification of the image sections. FIG. 6 presents a modified sequence of operations with operating unit of preliminary classification for a variant of the claimed encoding method, where reference data arrays are used. At the first stage (601), a full list is created of non-overlapping data sections located on levels with the lowest spatial resolution and belonging to the main and differential hierarchical pyramids. The size of these sections is set equal to the size of the section being processed by unit (538) of final classification, filtration and resampling. It is followed by grouping of data sections. Each group is to include a data section from the main pyramid and sections equivalent thereto from differential pyramids. This is followed by the principal cycle (602) of processing. Location of each of the sections belonging to the current group is read from the list of groups being processed (603). For each of the aforesaid sections, a value of accumulative metric (2) is calculated, and a section is selected, for which the calculated metric value is minimum. If the metric value is smaller (604) than the local compression threshold calculated in unit (504) of calculating local compression thresholds, the current group of sections is removed (605) off the processing list, whereas location of the section selected at the stage (603), together with the calculated value of accumulative metric, is put on the list of sections meant for being processed by unit (538) of final classification, filtration and resampling. Otherwise (606), the current group is also removed off the processing list, but with transition to a similarly located group of sections being on neighboring levels of the original and differential hierarchical pyramids with a higher spatial resolution. The new group is divided into four sub-groups, so that the amount of data in each sub-group would match the amount of data in the removed original group. It is followed by check (607) of location of new groups. If data sections belonging to these groups are on levels of the original and differential hierarchical pyramids of the highest spatial resolution, information on location of the new sections belonging to the new groups, and at the same time belonging to the same hierarchical pyramid as the section selected at stage (603), is added (608) to the list of sections meant for being processed by unit (538) of final classification, filtration and resampling. Zero values are recorded instead of the accumulative metric value for sections to be stored. If, however, condition (607) is not met, new groups are added (609) to the processing list created at the first stage of algorithm (601). At the beginning of each new processing cycle, a check is performed for availability of groups on the list being processed (602) and, with all the elements processed, the process of preliminary classification is completed (610). This method of preliminary classification allows multiple acceleration of the compression process and, at the same time, rational use of correlation between the data being compressed and the reference data.

[1385] The size of each data section, which is processed in unit (538) of final classification, filtration and resampling, must be equal to the size of resampling patterns recorded in storage (537) of a set of predetermined resampling patterns.

[1386] FIG. 10 is schematic representation of sequence of operations with operating unit (538) of final classification, filtration and resampling. In storage (537) of a set of predetermined resampling patterns, all the patterns are grouped. In each group, there are patterns having the same number of subsamples, but different configuration thereof. At the first stage of operation (1001), reading is performed of list (536) of sections selected by the unit of preliminary classification in the reference and differential hierarchical pyramids, by means of the process detailed above. For each section, the list comprises its location and additional statistical information, in particular, calculated value of accumulative metric. List (536) of sections having been read, the principal processing cycle (1002) is performed. Location of the next data section from the processing list is read (1003), and a group of resampling patterns is selected, in which the original data section is divided into the smallest number of subsamples. Thereafter, values of subsamples for each of the patterns belonging to the group are calculated (1004). Calculation (1004) is performed by means of overlapping adaptive and/or linear low-pass filters determined for each subsample in storage (537) of a set of predetermined resampling patterns, and with using values of the data being close to the data section being processed in the main and differential hierarchical pyramid. It is followed by the first stage of restoring the original data section from obtained subsamples, which is performed for each of resampling patterns belonging to the group. This stage is performed

(1005) by means of non-overlapping parts of adaptive and/or linear composite cascade interpolation filters determined for each subsample in storage (537) of a set of predetermined resampling patterns. Thereafter, for each pattern belonging to the group, there is performed

(1006) the final stage of restoration by means of overlapping compensating parts of adaptive and/or linear composite cascade interpolation filters determined for each sample of the data section being processed in the bank of patterns, and with using values of the data being close to the section being, processed in the original hierarchical pyramid and in differential hierarchical pyramids. Thereafter, for each pattern belonging to the group, the total metric (Msym) is calculated (1007), which is performed through the following equation:

[1387] Msym=Sen+22 M (Kn-Kn')2,(6)

[1388] where Sen is the value of accumulative metric calculated for the data section being processed,

[1389] M is the number of decimation level of the hierarchical pyramid, where the unit being processed is located,

[1390] N is the number of data samples in the unit being processed, [1391] Kn, is the original value of data sample with number n, [1392] K'n is restored value of data sample with number n.

[1393] Then a pattern is selected (1007), which has the minimum value of Msym and belongs to the group of patterns being processed. The minimum value of the total metric calculated in the aforesaid way is compared (1008) to the local threshold calculated by unit (504) of calculating local compression thresholds. If the total metric value is smaller than the local compression threshold, values of subsamples calculated at stage (1004), their location and information on the type of resampling pattern selected at stage (1007) are saved (1009). Thereafter, transition is performed (1002) to processing the next section of image. Otherwise, a check is made (1010) on whether there are still unchecked groups of resampling patterns, and, if such groups are available, a group of patterns is selected (1011) with the smallest number of subsamples out of those unchecked, whereupon transition is performed to step (1004). If, however, all the available configurations of resampling patterns were checked, with no positive results brought by the check, the values of samples of the data section being processed and information on location thereof are saved (1012), with a statement that no resampling pattern was used for this particular section.

[1394] Then subsamples obtained at the previous compression stage are converted into a number of one-dimensional data arrays. One array is used for storing subsamples obtained from data sections located in the original hierarchical pyramid, and the rest of them are formed of subsamples obtained from sections of differential pyramids. Unit (541) of converting obtained subsamples into one-dimensional arrays may use both the elementary method of conversion based on copying input subsamples into output arrays according to the order, in which they were processed by unit (538) of final classification, filtration and resampling, and more complex adaptive methods of conversion. More complex conversion methods may use statistical and control data (543) obtained from the previous unit, and/or analyze values of subsamples (542) for creating one-dimensional data arrays (544,547), in which subsamples of similar values and statistical properties would occupy close positions.

[1395] Data (544,547), which characterize arrangement of subsamples in original hierarchical pyramids, type of applied resampling patterns and procedure of selecting subsamples out of one-dimensional data arrays are transmitted to unit (550) of encoding location of subsamples and lossless compression. This unit may use compact presentation of information on location of subsamples in the form of a hierarchical tree structure. Binary trees, quadtrees, or more complex structures, e.g. embedded quadtrees, octo-trees, etc. may be used as such structure. The final form of the tree structure is determined by the set of resampling patterns, which is used in compression. For example, FIG. 11 presents the principle of constructing an embedded quadtree. For each group (601) of data sections located at levels of hierarchical pyramids with the lowest spatial resolution (1101), the serial number of the hierarchical pyramid is saved, in which there is a section selected in the process of preliminary classification, as is the serial number of resampling pattern (1102,1103), which was used for calculating subsamples on this section, and which is stored in storage (537) of a set of predetermined resampling patterns, and information is also saved, which characterizes unambiguously the process of restoring these subsamples from a one- dimensional data array. If, however, in the group being processed, no section was selected in the process of operation of unit (535) of preliminary classification, zero value is stored for it, and transition is made to four filial groups of data sections (1104) located on neighboring levels of hierarchical pyramids with a higher spatial resolution. If, however, these levels of hierarchical pyramids also have groups with unselected sections, the transition process is repeated (1105).

[1396] Information on location of subsamples presented in the form of a compact data structure may be additionally encoded by means of lossless compression algorithms, such as arithmetic encoding, or encoding with variable-length codes.

[1397] One-dimensional arrays of subsamples obtained as a result of operation of unit (541) of converting filtered subsamples into one-dimensional arrays are compressed in units (546,549) of lossy compression combined in a unit of lossy compression of one-dimensional data arrays. Any of currently common algorithms of lossy compression may be used in these units. In particular, this may be adaptive differential pulse-code modulation (ADPCM), discrete cosine transform (DCT), wavelet transform, sub-band transform, overlapped block transform, transform based on wavelet packet or Matching Pursuit. The transform data may be applied jointly with scalar or vector quantization of obtained factors. Vector quantization without preliminary conversion may also be used. The original one-dimensional array may be divided into uneven sections, and different lossy compression algorithms may be applied to different sections. Units (546, 549) of lossy compression may use additional statistical and control data (545,548) for optimization of the compression process: for example, for selecting the quantization threshold, type of conversion applied, code book of vector quantization. FIG. 12 presents an example of implementation of lossy compression unit (546,549). An input one-dimensional array of subsamples (1200) is converted by means of discrete cosine transform (1201), whereupon obtained values are quantized by adaptive quantizer (1202) and compressed by arithmetic encoder (1204). Adaptive quantizer uses statistical data transmitted from unit (541) of converting filtered subsamples into a one-dimensional array, for optimization of the quantization process. Arithmetic encoder uses adaptive and/or stationary statistical model (1205) for raising encoding efficiency.

[1398] Data obtained as a result of operation of unit (550) of encoding location of subsamples and lossless compression, as a result of operation of the unit of lossy compression of one-dimensional arrays, are transmitted to output driver unit (551), where they are multiplexed and prepared for being transmitted via a communication channel. Output driver unit (551) may enter additional data (552) to the output flow, such as information on original size of the image being compressed, information on color format of data being compressed, rules of forming reference data arrays, etc.

[1399] In addition, the claimed method and device of encoding may be characterized as comprising the following essential features:

[1400] Unit (535) of preliminary classification of data sections may classify the original hierarchical pyramid and differential hierarchical pyramids into data sections of different fixed size, whereas the unit of final classification, filtration and resampling may use several sets of resampling patterns, each intended for its own size of data sections being processed.

[1401] Information, or a part thereof, comprising unambiguously described process of restoring encoded data sections from a restored array of subsamples, i.e. content, or a part of content, of storage of resampling patterns, may be encoded in the unit of lossless encoding of resampling patterns by means of the lossless method and be transmitted together with encoded data.

[1402] If data being encoded constitute a full-color image presented in the form of several color planes, for example, a luminance plane and color-difference planes, each of the aforesaid planes is encoded separately in the above-described way.

[1403] Processes of preliminary and final classification may be optimized by means of using a criterion of minimization of the general distortion rate, for a predetermined data level.

[1404] The encoding process may be performed for the entire input data array, or else this array may be divided into overlapping units, and for each unit the above- enumerated operations may be performed independently from the others.

[1405] FIG. 13 is schematic presentation of a device implementing a variant of the claimed method of decoding data, where encoded data are presented in the form of a one- dimensional data array compressed by means of the lossy compression method, and information encoded by the lossless method, where the aforesaid one-dimensional data array is obtained from subsamples obtained by means of adaptive and/or linear filters from sections of a hierarchical pyramid formed from digital signals being encoded, whereas the aforesaid adaptive and/or linear filters are set in a resampling pattern used in encoding and selected out of a predetermined set of resampling patterns, where the aforesaid information contains data on location of these subsamples in the aforesaid pyramid and data on the type of resampling patterns used for obtaining these subsamples.

[1406] At the first stage of this method, compressed data are divided in unit (1301) of receiving input encoded data and demultiplexing. Here, additional data (1303) are singled out, which may contain, e.g., information on the number of decimation levels used in compression, or on the size of the original data array. A compressed array of subsamples is restored in unit (1304) of decoding one-dimensional array of subsamples encoded by means of an algorithm of lossy compression. In particular, this unit may successively use algorithms of arithmetic decoding, inverse quantization and inverse DCT transform. Compressed data on location of subsamples in the original hierarchical pyramid are decoded in unit (1302) of lossless decompression and decoding information on location of subsamples in the image. In particular, this unit may use the algorithm of arithmetic decoding and the algorithm of decoding information from a compact hierarchical tree structure of data. Besides, this unit decodes information on types of resampling patterns used in encoding.

[1407] Thereafter, in unit (1305) of restoring transmitted data sections, there is performed restoration of transmitted sections of the original hierarchical pyramid and storing them (1310) to unit (1307) of storing and output of hierarchical pyramid.

[1408] FIG. 15 presents an example of sequence of operations with operating unit (1305) of restoring transmitted data sections, which is performed by means of non-overlapping parts of interpolation filters set in resampling patterns. At the first stage (1501), based on decoded information (1308) on location of subsamples and the type of applied resampling patterns, a list is created of all the data sections transmitted by the encoding device, and information is read on location and type of the used resampling pattern for the first data section on the list. If (1502) the current section is encoded with a resampling pattern, reading is performed (1504) of the values of the restored array of subsamples (1309), and the current data section is restored by means of non-overlapping parts of adaptive and/or linear composite cascade interpolation filters determined for each sample of the data section being restored in the applied resampling pattern. Here, the applied resampling pattern is read from storage (1306) of a set of resampling patterns. Otherwise, direct restoration is performed (1503) of the current data section by means of values from the restored array of subsamples (1309). Data (1310) obtained in the aforesaid way are recorded (1507) on a relevant place in the unit of storing and output of hierarchical pyramid (1307). Additionally, information on parameters of restoration of the current data section is saved to support data array (1311). If (1509) there are still data sections, which are not processed yet, information is read (1508) on the next section on the list, and processing is repeated (1510).

[1409] Thereafter, restoration is performed of sections missed at the previous stage, and these sections are saved to unit (1307) of storing and output of hierarchical pyramid. This process is performed by unit (1312) of interpolation of missed sections, for which there are restored similarly located sections on levels with a lower spatial resolution.

[1410] FIG. 16 presents an example of sequence of operations with the aforesaid unit (1312) operating. At the first stage, there is performed (1601) creation of a full list of non- overlapping data sections located on the level of hierarchical pyramid with the lowest spatial resolution, and selection of the first section out of the list. Thereafter, by means of support data array (1311), a check is made (1602) on whether the current section contains restored data. If there are no such data on the section, the section is not processed. Otherwise, interpolation (1604) is performed of the current data section by means of non-overlapping interpolation filters. Obtained values are recorded (1608) on a similar section located on a neighboring level of the pyramid being restored with a higher spatial resolution. Additionally, for the recorded section, information is renewed in support data array (1311), and apart from that, all the accumulated support data are copied to output support data array (1313). Therefore, at processing of the next levels of the hierarchical pyramid, the recorded section is accounted for as a restored one. If (1609) on the level being processed of hierarchical pyramid there remain unprocessed sections, the next section is selected out of the list (1610), and the cycle is repeated. Otherwise, a check is performed (161 1) on whether the next unprocessed level of hierarchical pyramid is of the highest spatial resolution, and if it is not, transition is performed (1612) to the next level of the hierarchical pyramid with a higher spatial resolution. Here, a full list of data sections is created on the new level of hierarchical pyramid, and the first section is selected out of the list, whereupon the processing cycle is repeated. If, however, there is the only unprocessed level of hierarchical pyramid with the highest spatial resolution, processing is completed (1613).

[1411] It is followed by restoration of the missed sections of the hierarchical pyramid located on the levels of the hierarchical pyramid being processed with a low spatial resolution, and saving these sections to unit (1307) of storing and output of hierarchical pyramid. This process is performed by means of unit (1314) of restoring missed sections, for which there are restored similarly located sections on levels with a higher spatial resolution. [1412] FIG. 17 presents an example of sequence of operations with the aforesaid unit (1314) operating. At the first stage (1701), there is performed creation of a full list of non- overlapping data sections located on the level of hierarchical pyramid with the highest spatial resolution, as well as selection of the first section out of the list. Therefore, by means of support data array (1313), a check is performed (1702) for availability of an unrestored data section located similarly to the current restored data section, at the same time located on the nearest level of hierarchical pyramid with a lower spatial resolution. If there is no such section, or the current section is not restored, no processing is performed. Otherwise, filtration is performed (1703) of values of the current data section by means of adaptive and/or linear overlapping low-pass filters (1703), with subsequent decimation of obtained values (1704). A reduced copy of the data section being restored obtained in the aforesaid way is recorded (1705) to a relevant unrestored section belonging to the nearest level of hierarchical pyramid with a lower spatial resolution than the level being processed. Here, for the recorded data section, information is renewed in support data array (1313), and apart from that, all the accumulated support data are copied to output support data array (1315). Therefore, at processing of the next levels of the hierarchical pyramid, the recorded section is accounted for as a restored one. If (1706) on the section being processed of the hierarchical pyramid there remain unprocessed sections, the next section is selected (1707) out of the list, and the cycle is repeated. Otherwise, a check is made (1708) on whether the next unprocessed level of the hierarchical pyramid is of the lowest spatial resolution, and if it is not, transition is performed (1709) to the next level of hierarchical pyramid with a lower spatial resolution. Here, a full list of data sections is created on the new level of hierarchical pyramid, and the first section is selected out of the list, whereupon the processing cycle is repeated. If, however, there is the only unprocessed level of hierarchical pyramid with the lowest spatial resolution, processing is completed (1710).

[1413] FIG. 20 presents an example of restoring sections of hierarchical pyramid missed by the unit of restoring transmitted data sections (1305). Operation of this unit leaves a lot of unrestored (2001) data sections (white squares in FIG. 20). Unit (1312) of interpolation of missed sections, for which there are restored similarly located sections on levels with a lower spatial resolution, successively interpolates restored units of the image, beginning with the lowest level of hierarchical pyramid (2002, 2003), by using information (1311) on location of restored units of the image. As a result, the highest level of the hierarchical pyramid becomes filled completely. Interpolation is performed by means of non-overlapping interpolation filters. Thereafter, unit (1314) of restoring missed sections, for which there are restored similarly located sections on levels with a higher spatial resolution, restores, by means of information on missed samples (1313), the data section remaining unrestored, while using filtration of values of the current data section, by means of adaptive and/or linear overlapping low-pass filters, with subsequent decimation of obtained values. This process is performed successively, beginning with a level of the hierarchical pyramid being restored with the highest spatial resolution (2004) towards the level of the aforesaid pyramid with the lowest spatial resolution (2005). At the end of restoration process, all the sections of the hierarchical pyramid stored in unit (1307) of storing and output of hierarchical pyramid become filled completely (2005).

[1414] It is followed by processes of final interpolation and filtration of data section stored in unit (1307) of storing and output of hierarchical pyramid. This process is performed by unit (1316) of final filtration and interpolation.

[1415] FIG. 18 presents an example of sequence of operations with the aforesaid unit (1316) operating. At the first stage (1801), there is performed creation of a full list of non- overlapping data sections located on the level of hierarchical pyramid with the lowest spatial resolution, and selection of the first section out of the list. It is followed by checking (1802) the type of the current section by means of support data array (1315). If the current section were not restored (1803), or contains data obtained in unit (1314) of restoring missed sections, for which there are, restored similarly located sections on levels with a higher spatial resolution, the section in question is missed. Otherwise, by means of support data array (1315), it is checked (1805), whether the current data section is restored by means of a resampling pattern. If a resampling pattern was used, filtration of the current data section is performed (1807) by means of overlapping compensating parts of adaptive and/or linear composite cascade interpolation filters determined for each sample belonging to the current data section in storage (1306) of a predetermined set of resampling patterns. It is followed by recording obtained values to the current data section. Otherwise, by means of support data array (1315), it is checked (1806), whether the values of the current data section are obtained by means of non-overlapping parts of adaptive and/or linear composite cascade interpolation filters. If they are, there is performed (1808) filtration of the current section by means of overlapping compensating parts of adaptive and/or linear composite cascade interpolation filters with consequent recording of obtained values to the current data section. Thereafter it is checked (1809), whether the level being processed of the hierarchical pyramid is of the highest spatial resolution, and if it is not, interpolation is performed (1810) of the values of the current section by means of non-overlapping parts of adaptive and/or linear composite cascade interpolation filters, with subsequent recording of interpolated data to a similar section located on a neighboring level of the pyramid with a higher spatial resolution. Additionally, information is renewed in support data array (1315) for the section being recorded. Therefore, at processing the next level of hierarchical pyramid, the recorded section is accounted for as a restored one.

[1416] After processing current data section, a check is performed (1811) for availability of unprocessed sections on the current level of the pyramid being restored. If there are such sections, the next section is selected out of the list (1812), and the processing cycle is repeated. Otherwise, it is checked, whether all the levels of the hierarchical pyramid being restored are processed, and if it is not the case, transition is performed (1814) to the next level of hierarchical pyramid with a higher spatial resolution. Meanwhile, a full list is created of data sections on the new level of the hierarchical pyramid, and the first section is selected out of the list, whereupon the processing cycle is repeated. If, however, all the levels of the hierarchical pyramid being processed, the process is completed (1815). At the end of the process of final interpolation, restored data are read (1317) from the level of hierarchical pyramid, which is of the highest spatial resolution.

[1417] It is also possible to use an accelerated process of restoring transmitted data. In the accelerated process of restoring, the intermediate stage of restoration performed by unit (1312) of interpolation of missed sections, for which there are restored similarly located sections on levels with a lower spatial resolution, is eliminated, and in the process of operation of unit (1314) of restoring missed sections, for which there are restored similarly located sections on levels with a higher spatial resolution, filtration (1703) of values of the current data section by means of adaptive and/or linear overlapping low-pass filters is replaced with filtration of non-overlapping low-pass filters. An example of such an accelerated process is presented in FIG. 20. At the first stage (2006), operation of unit (1305) of restoring transmitted data sections is followed by successive filling (2007) levels of hierarchical pyramid, which have low spatial resolution, by means of modified unit (1314) of restoring missed sections, for which there are restored similarly located sections on levels with a higher spatial resolution. As a result, the level of the pyramid being restored, which has the lowest spatial resolution, is completely filled (2008), which is immediately followed by the process (1316) of final filtration and interpolation. Here, it is possible to combine the fast and slow methods of restoring transmitted data. For example, it is possible to use the fast method of restoration for levels of the pyramid being restored, which are of high spatial resolution, and the slow method for the rest of the levels.

[1418] It is also possible to use another, yet more accelerated method of restoring transmitted data, where no low-pass filtration is performed in the unit of restoring missed sections, for which there are restored similarly located sections on levels with a higher spatial resolution, with the decimation process immediately performed instead. Here, it is also possible to combine the fast and slow methods of restoration for different levels of the hierarchical pyramid being restored.

[1419] Additionally, it is possible to use a variant of the claimed method of decoding data, where a one-dimensional data array encoded through a lossy compression method is obtained from subsamples obtained from sections of the hierarchical pyramid formed of encoded digital signals without using resampling patterns, whereas information encoded through a lossless method contains no data on the type of applied resampling patterns, as the aforesaid patterns were not used in encoding. Then the process of restoring transmitted data sections is performed without using resampling patterns, and the process of final filtration is not performed altogether, with only the process of final interpolation implemented.

[1420] Additionally, the claimed method and device for decoding may include the following essential features:

[1421] Encoded data may be obtained from sections of different fixed size, whereas a number of sets of resampling patterns are used in the process of restoring transmitted data sections, each of them intended for its own fixed size of section.

[1422] If encoded data constitute a full-color image presented in the form of several independently encoded color planes, each of the aforesaid planes is decoded independently from the others.

[1423] Together with encoded data, information may be encoded through a lossless method, which contains unambiguous description of the process of restoring encoded data sections from a restored array of subsamples, that is, resampling patterns used in encoding, or just parts of these patterns. Here, the process of restoring transmitted data in the unit of lossless encoding of transmitted patterns is preceded by lossless decoding of information containing transmitted resampling patterns, or just parts thereof, whereupon this decoded information is added to storage (1306) of a predetermined set of resampling patterns and is used later in the process of restoring transmitted data sections.

[1424] The encoding process may be performed for the entire input data array, or else this array may be divided into overlapping units, and for each unit the above- enumerated operations may be performed independently from the others.

[1425] FIG. 14 is schematic presentation of a device implementing a variant of the claimed method of decoding data, where decoded data are presented in the form of a one- dimensional data arrays compressed through a lossy compression method, and information encoded through a lossless method, where the aforesaid one-dimensional data arrays is obtained from subsamples obtained by means of adaptive and/or linear filters from sections of the hierarchical pyramid formed of digital signals being encoded, and from sections of differential pyramids obtained from the aforesaid pyramid, as well as from reference hierarchical pyramids of the same size as the aforesaid pyramid and obtained from reference data arrays, whereas the aforesaid adaptive and/or linear filters are set in the resampling patterns selected from a predetermined set of resampling patterns and used at encoding, whereas the aforesaid information contains data encoded through the lossless method on location of the aforesaid subsamples in the aforesaid pyramid and in differential pyramids, as well as data encoded through the lossless method on the type of resampling patterns used for obtaining these subsamples.

[1426] At the first stage of this method, compressed data are divided in unit (1401) of receiving input encoded data and demultiplexing. Here, additional data are singled out (1403), which may contain, e.g., information on the number of decimation levels used in compression, or on the size of the original data array. Additional information may also be used for setting rules to be used for forming reference data arrays. Compressed arrays of subsamples are restored in units of the one-dimensional data array, which are combined in unit (1404) of decoding one-dimensional arrays of subsamples encoded by means of an algorithm of lossy compression. In particular, each unit of decoding one-dimensional data array may successively use algorithms of arithmetic decoding, inverse quantization and inverse DCT transform. Compressed data on location of subsamples in the original hierarchical pyramid and in differential hierarchical pyramids are decoded in unit (1402) of lossless decompression and decoding of information on location of subsamples. In particular, this unit may use the algorithm of arithmetic decoding and the algorithm of decoding information from a compact hierarchical tree structure of data. Besides, this unit decodes information on types of resampling patterns used in encoding.

[1427] Thereafter, unit (1410) of forming and storing reference hierarchical pyramids from reference data, by means of adaptive and/or linear low-pass filters, forms reference hierarchical pyramids from reference data (1411). Then, in unit (1405) of restoring transmitted data sections, restoration is performed of transmitted sections of the original hierarchical pyramid and saving them (1412) to unit (1407) of storing and output of hierarchical pyramid.

[1428] FIG. 15 presents an example of sequence of operations with operating unit (1405) of restoring transmitted data sections performed by means of non-overlapping parts of interpolation filters determined in resampling patterns. At the first stage (1501), based on decoded information (1408) on location of subsamples and type of applied resampling patterns, a list is created of all data sections transmitted by the encoding device, and information is read on location and type of the applied resampling pattern for the first data section on the list. If the current section is encoded with a resampling pattern (1502), values of the restored array of subsamples are read (1409), and the current data section is restored by means of non-overlapping parts of adaptive and/or linear composite cascade interpolation filters determined for each sample of the data section being restored in the resampling pattern being used (1504). Here, the resampling pattern being used is read from storage (1406) of a set of resampling patterns. Otherwise (1503), direct restoration is performed (1409) of the current data section by means of values from the restored values from the restored array of subsamples. Then, if (1505) the current section is encoded by means of a reference hierarchical pyramid, values of a similarly located section taken from the relevant reference hierarchical pyramid stored in unit (1410) of forming and storing of reference hierarchical pyramids from reference data are added (1506) to values of the current data section. Data obtained in the aforesaid way (1412) are recorded (1507) to a relevant place in unit (1407) of storing and output of hierarchical pyramid. Additionally, information on parameters of restoration of the current data section is saved to support data array (1413). If (1509) not all the transmitted data sections are processed, information is read (1508) on the next section on the list, and processing is repeated. Otherwise, the process is completed (1510).

[1429] It is followed by restoration of sections missed at the previous stage and saving thereof to unit (1407) of storing and output of hierarchical pyramid. This process is performed by unit (1414) of interpolation of missed sections, for which there are restored similarly located sections on levels with a lower spatial resolution.

[1430] FIG. 16 presents an example of sequence of operations with this unit (1414) operating. At the first stage (1601), a full list is created of non-overlapping data sections located on the level of hierarchical pyramid with the lowest spatial resolution, and the first section from the list is selected. Then, by means of support data array (1413), it is checked (1602), whether the current section contains restored data. If there are no such data on the section, the section is not processed. Otherwise, by means of support data array (1413), it is checked (1603), whether a reference pyramid of data was used in restoring the current section. If no reference pyramid was used, interpolation is performed (1604) of the current data section by means of non-overlapping interpolation filters. Otherwise, values of a similarly located section of the reference hierarchical pyramid are deducted (1605) from values of the current data section. It is followed by interpolation (1606) of obtained data by means of non-overlapping interpolation filters. Thereafter, values of a similarly located section located on the next level of reference pyramid with a higher spatial resolution is added (1607) to obtained data.

[1431] FIG. 21 presents a flow chart of these stages (1605,1606, 1607) for two levels of original (2100) and reference (2101) hierarchical pyramids. Data of the reference hierarchical pyramid (2105) located in the relevant way are deducted (2106) from values of restored data located on the first level of the pyramid being processed (2103). Obtained differential values are interpolated by non-overlapping interpolator (2107), whereupon they are added (2108) with values of the zero level of reference hierarchical pyramid (2104) located in the relevant way, and obtained data are saved to the zero level of the pyramid being processed (2102). In the general sequence of operations presented in FIG. 16, the process of recording (1608) of obtained data is also performed for sections restored without using the reference hierarchical pyramid. Obtained values are recorded (1608) to a similar section located on a neighboring level of the pyramid being restored with a higher spatial resolution. In addition, information is renewed for the section being recorded in support data array (1413); apart from that, all the accumulated support data are copied to output support data array (1415). Therefore, in processing the next levels of hierarchical pyramid, the recorded section is accounted for as a restored one. If (1609) there are still unprocessed sections on the level being processed of the hierarchical pyramid, the next section is selected from the list (1610), and the cycle is repeated. Otherwise, it is checked (1611), whether the next unprocessed level of hierarchical pyramid is of the highest spatial resolution, and if it is not, transition is performed (1612) to the next level of hierarchical pyramid with a higher spatial resolution. Here, a full list is created of data sections on the new level of the hierarchical pyramid, and the first section is selected from the list, whereupon processing is repeated. If, however, only the level of hierarchical pyramid with the highest spatial resolution remains unprocessed, processing is completed (1613).

[1432] It is followed by restoration of missed sections of the hierarchical pyramid located on levels of the hierarchical pyramid being processed with low spatial resolution and saving these sections to unit (1407) of storing and output of hierarchical pyramid. This process is performed by means of unit (1416) of restoring of missed sections, for which there are restored similarly located sections on levels with a higher spatial resolution.

[1433] FIG. 17 presents an example of sequence of operations with this unit (1416) operating. At the first stage (1701), a full list is created of non-overlapping data sections located on the level of hierarchical pyramid with the highest spatial resolution, and the first section is selected from the list. Then, by means of support data array (1415), check is performed (1702) for availability of unrestored section located similarly to the current restored data section, yet being on the nearest level of hierarchical pyramid with a lower spatial resolution. If there is no such section, or the current section is not restored, no processing is performed. Otherwise, filtration is performed (1703) of values of the current data section, by means of adaptive and/or linear overlapping low-pass filters, with subsequent decimation (1704) of obtained values. A reduced copy obtained in the aforesaid way of the data section being processed is recorded (1705) to the relevant unrestored section belonging to the nearest level of hierarchical pyramid with a lower spatial resolution than the level being processed. Here, information is renewed in support data array (1415) for the recorded data section; apart from this, all the accumulated support data are copied to output support array (1417). Therefore, in processing of the next levels of the pyramid being restored, the recorded section is accounted for as a restored one. If (1706) there are still unprocessed sections on the level being processed of the hierarchical pyramid, the next section is selected from the list (1707), and the cycle is repeated. Otherwise, it is checked (1708), whether the next unprocessed level of the hierarchical pyramid is of the lowest spatial resolution, and if it is not, transition is performed (1709) to the next level of hierarchical pyramid with a lower spatial resolution. Here, a full list is created of data sections on the new level of hierarchical pyramid, and the first section is selected from the list, whereupon the processing cycle is repeated. If, however, only the level of hierarchical pyramid with the lowest spatial resolution remains unprocessed, processing is completed (1710).

[1434] It is followed by processes of final interpolation and filtration of data sections stored in unit (1407) of storing and output of hierarchical pyramid. This process is performed by unit (1418) of final filtration and interpolation.

[1435] FIG. 18 presents an example of sequence of operations, with this unit (1418) operating. At the first stage (1801), a full list is created of non-overlapping data sections located on the level of hierarchical pyramid with the lowest spatial resolution, and the first section is selected from the list. It is followed by checking (1802) the type of the current section by means of support data array (1417). If (1803) the current section were not restored or contains data obtained in unit (1416) of restoring missed sections, for which there are restored similarly located sections on levels with a higher spatial resolution, the section in question is missed. Otherwise, by means of support data array (1417), it is checked (1803), whether a reference hierarchical pyramid was used in restoring the current section. If no reference pyramid was used, it is checked (1805), by means of support data array (1417), whether the current data section is restored by means of a resampling pattern. If a resampling pattern was used, the current data section is filtered (1807) by means of overlapping compensating parts of adaptive and/or linear composite cascade interpolation filters determined for each sample belonging to the current data section in storage (1406) of a predetermined set of resampling patterns. It is followed by recording obtained values to the current data section. Otherwise, by means of support data array (1417), it is checked (1806), whether values of the current data section are obtained by means of non-overlapping parts of adaptive and/or linear composite cascade interpolation filters. If it is the case, filtration of the current section is performed (1808) by means of overlapping compensating parts of adaptive and/or linear composite cascade interpolation filters, with subsequent recording of obtained values to the current data section. Thereafter, it is checked (1809), whether the level being processed of the hierarchical pyramid is of the highest spatial resolution, and if it is not, interpolation is performed (1810) of values of the current section by means of non- overlapping parts of adaptive and/or linear composite cascade interpolation filters, with subsequent recording of interpolated data to a similar section located on a neighboring level of the pyramid with a higher spatial resolution. Additionally, information is renewed in support data array (1417) for the section being recorded. Therefore, in processing of the next level of the hierarchical pyramid, the recorded section is accounted for as a restored one. If, however, the current data section was restored by means of a reference hierarchical pyramid, there is performed process (1804) of final interpolation, with using a reference hierarchical pyramid. An example of sequence of operations in implementation of this process (1804) in unit (1418) of final filtration and interpolation is presented in FIG. 19.

[1436] At the first stage (1901), the difference is calculated between values of the current data section and values of a similarly located section of the reference hierarchical pyramid, as well as between the data adjacent to the section being processed and corresponding data of the reference hierarchical pyramid. Thereafter, by means of support data array (1417), it is checked (1902), whether the current section is restored by means of a resampling pattern. If a resampling pattern was used, filtration of data obtained at the first stage (1901) is performed (1903) by means of overlapping compensating parts of adaptive and/or linear composite cascade interpolation filters determined for each sample belonging to the current data section in storage (1406) of a predetermined set of resampling patterns. Otherwise, by means of support data array (1417), it is checked (1904), whether values of the current data section are obtained by means of non-overlapping parts of adaptive and/or linear composite cascade interpolation filters, and if it is, filtration of data obtained at the first stage (1901) is performed (1905) by means of overlapping compensating parts of adaptive and/or linear composite cascade interpolation filters. It is followed by checking (1906), whether the current level has the maximum possible resolution. If the current level has no maximum possible resolution, interpolation is performed (1908) of data obtained at previous stages, by means of non-overlapping parts of adaptive and/or linear composite cascade interpolation filters, with subsequent addition to obtained data of values of a similarly located section being on a neighboring level of reference pyramid with a higher spatial resolution, and with subsequent recording of obtained values to the relevant section of the pyramid being processed. Additionally, information is renewed in support data array (1417) for the section being recorded. Therefore, in processing the next level of the hierarchical pyramid, the recorded section is accounted for as a restored one. Otherwise, there are performed (1907) adding values of a similarly located section of the reference pyramid to obtained data, and recording obtained values back to the current section of the pyramid being processed.

[1437] FIG. 22 presents an example of flow chart of final interpolation with using a reference hierarchical pyramid for two levels of the hierarchical pyramid being restored (2200) and the reference hierarchical pyramid (2201). Data of the reference hierarchical pyramid (2205) located in the relevant way are deducted (2206) from values of restored data located on the first level of the pyramid being processed (2203). Obtained differential values are filtered (2207) by means of overlapping compensating parts of adaptive and/or linear composite cascade interpolation filters, whereupon they are interpolated (2208) by means of non-overlapping parts of adaptive and/or linear composite cascade interpolation filters. Thereafter, values of the zero level of the reference hierarchical pyramid (2204) located in the relevant way are added (2209) to obtained values. After that, obtained data are saved (2202) to the zero level of the pyramid being processed. An additional processing cycle is performed for processing the zero decimation level (2203). Data of the reference hierarchical pyramid located in the relevant way (2204) are deducted (2210) from values of restored data located on the zero level (2202) of the pyramid being processed. Obtained differential values are filtered (2211) by means of overlapping compensating parts of adaptive and/or linear composite cascade interpolation filters, whereupon values of the zero level of the reference hierarchical pyramid (2104) located in the relevant way are added thereto (2212), whereupon obtained data are saved (2202) to the zero level of the pyramid being processed.

[1438] Processing by unit (1418) of final filtration and interpolation of the next data section is followed by checking (1811) availability of unprocessed sections on the current level of the pyramid being restored. If such sections are available, the next section is selected from the list (1812), and the processing cycle is repeated. Otherwise, it is checked (1813), whether all the levels of the hierarchical pyramid being restored are processed, and if it is not the case, transition is performed (1814) to the next level of hierarchical pyramid with a higher spatial resolution. Here, a full list of data sections on the new level of hierarchical pyramid, and the first section is selected from the list, whereupon the processing cycle is repeated. If, however, all the levels of the hierarchical pyramid being processed, the process is completed (1815). At the end of the process of final interpolation, restored data (1419) are read from the level of the hierarchical pyramid being processed, which is of the highest spatial resolution.

[1439] It is also possible to use an accelerated process of restoring transmitted data. With the accelerated restoring process, the intermediate stage of restoration performed by unit (1414) of interpolation of missed sections, for which there are restored similarly located sections on levels with a lower spatial resolution, is eliminated, and in the process of operation of unit (1416) of restoring missed sections, for which there are restored similarly located sections on levels with a higher spatial resolution, filtration (1703) of values of the current data section, by means of adaptive and/or linear overlapping low-pass filters is replaced, with filtration with non-overlapping low-pass filters. An example of such an accelerated process is presented in FIG. 20. At the first stage (2006), after operation of unit (1405) of restoring transmitted sections by means of non-overlapping parts of interpolation filters determined in resampling patterns, there is performed successive filling (2007) of levels of hierarchical pyramid, which have a low spatial resolution, by means of modified unit (1416) of restoring missed sections, for which there are restored similarly located sections on levels with a higher spatial resolution. As a result, the level of the pyramid being restored, which has the lowest spatial resolution, is filled completely (2008), which is immediately followed by the process (1418) of final filtration and interpolation. Here, it is possible to combine the fast and slow methods of restoring transmitted data. For example, it is possible to use the fast method of restoration for levels of the pyramid being restored, which are of high spatial resolution, and the slow method for the rest of the levels.

[1440] It is also possible to use another, yet more accelerated method of restoring transmitted data, where no low-pass filtration is performed in the unit of restoring missed sections, for which there are restored similarly located sections on levels with a higher spatial resolution, with the decimation process immediately performed instead. Here, it is also possible to combine the fast and slow methods of restoration for different levels of the hierarchical pyramid being restored.

[1441] In addition, it is possible to use a variant of the claimed method of decoding data, where a one-dimensional data arrays encoded through the lossy compression method is obtained from subsamples obtained by means of adaptive and/or linear filters from sections of the hierarchical pyramid formed of digital signals being encoded, and from sections of differential pyramids obtained from the aforesaid pyramid and from reference hierarchical pyramids of the same size as the aforesaid pyramid, obtained from reference data arrays, and where the aforesaid subsamples were obtained without using resampling patterns, and information encoded through the lossless method contains no data on the type of used resampling patterns, as the aforesaid patterns were not used in encoding. In this case, the process of restoring transmitted data sections is performed without using resampling patterns, and the process of final filtration is not performed altogether, with just the process of final interpolation implemented instead.

[1442] Additionally, the claimed method and device for decoding may include the following essential features: [1443] Encoded data may be obtained from sections of different fixed size, whereas a number of sets of resampling patterns are used in the process of restoring transmitted data sections, each of them intended for its own fixed size of section.

[1444] If encoded data constitute a full-color image presented in the form of several independently encoded color planes, each of the aforesaid planes is decoded independently from the others.

[1445] Together with encoded data, information may be encoded through a lossless method, which contains unambiguous description of the process of restoring encoded data sections from a restored array of subsamples, that is, resampling patterns used in encoding, or just parts of these patterns. Here, the process of restoring transmitted data in the unit of lossless encoding of transmitted patterns is preceded by lossless decoding of information containing transmitted resampling patterns, or just parts thereof, whereupon this decoded information is added to storage (1406) of a predetermined set of resampling patterns and is used later in the process of restoring transmitted data sections.

[1446] The encoding process may be performed for the entire input data array, or else this array may be divided into overlapping units, and for each unit the above- enumerated operations may be performed independently from the others.

[1447] The system presented in a schematic way in FIG. 23 may comprise an encoding device of the present disclosure, or just a component thereof, and/or comprise a decoding device of the present disclosure, as well as a component thereof. In particular, the system (2300) may be a micro-computer connected through interface (2310) to various peripherals, such as camcorder (2311), scanner (2312), reader (2313) of memory cards (2314), printer (2320), as well as other devices, which may digitize, store, make physical copies of images and/or video sequences.

[1448] System (2300) comprises communication interface (2308), which may transmit via network (2309) images and video sequences compressed by system (2300), and/or receive from network (2309) compressed images and video sequences remotely transmitted for system (2300).

[1449] System (2300) also comprises storage device (2305), e.g., hard disk. System (2300) comprises drive (2315) for removable information carriers (2316), such as optical compact disks (CD) or digital versatile disks (DVD). Driver for removable carriers (2315) may also use other data carriers, such as removable hard disks, cassettes with magnetic tape or memory cards. Removable information carriers (2316), integrated information carrier (2305), as well as connectable peripherals (2313, 2314) may contain data encoded in the aforesaid way, as well as programs, which implement essential parts of the above-mentioned method of encoding and/or decoding.

[1450] Besides, programs, which implement the method of encoding and/or decoding presented in this disclosure, may be in nonvolatile memory (2302) recorded in the process of manufacturing device (2300), or may, be transmitted to system (2300) via network (2309) through communication interface (2308).

[1451] System (2300) may additionally comprise display (2307) for displaying decoded images and/or for interaction with the user. Besides, system (2300) may comprise keyboard (2320) with interface (2319) and/or pointing device (2318) with interface (2317), as well as other devices, which enable the user to interact with system (2300), in particular, select the data compression threshold (317).

[1452] System (2300) comprises unit (2301) of central processor, which is connected to above-described units (2305, 2308, 2310, 2315, 2317, 2319), as well as to unit (2306) of graphics processor, by means of system bus (2304). Central processor (2301) is also connected to nonvolatile memory (2302) and main memory (2303), and fulfills instructions recorded in nonvolatile memory (2302) or recorded in other units (2303, 2305, 2316, 2314) for implementation of the method of encoding and/or decoding described in this disclosure.

[1453] Central processor (2301) is able to fulfill efficiently operations required for implementation of all the above-described essential stages of the present disclosure and shown in FIGS. 2 to 22.

[1454] Central processor (2301), jointly with nonvolatile memory (2302) and main memory (2303) may implement the following essential parts of the claimed encoding device:

[1455] Unit of forming and storing a hierarchical pyramid from input data.

[1456] Unit of forming reference hierarchical pyramids from reference data

[1457] Unit of calculating interlevel difference.

[1458] Unit of calculating and storing differential hierarchical pyramids [1459] Unit (318, 504) of calculating local compression thresholds. [1460] Unit (320, 535) of preliminary classification of data sections.

[1461] Unit (322, 538) of final classification of data sections and adaptive non-linear filtration and resampling.

[1462] Storage (323, 537) of predetermined resampling patterns.

[1463] Unit (324,541) of converting filtered subsamples into one-dimensional arrays.

[1464] Unit (330, 550) of encoding location of subsamples and lossless compression.

[1465] Units (329, 546, 549) of lossy compression combined in unit of lossy compression of one-dimensional data arrays.

[1466] Unit (332, 551) of output driver.

[1467] Unit (202, 209) of converting the data format.

[1468] Unit (211) of forming reference arrays at encoding.

[1469] Unit (214) of forming reference arrays at decoding.

[1470] Unit (206, 215) of inverse transformation of data format.

[1471] Besides, system (2300) may also contain additional devices able to implement efficiently essential parts of the claimed encoding device. In particular, unit (2306) of graphics processor, jointly with nonvolatile memory (2302) and main memory (2303), may implement one or a number of above-enumerated essential parts of the claimed encoding device.

[1472] In addition, central processor (2301), jointly with nonvolatile memory (2302) and main memory (2303), may implement the following essential parts of the claimed decoding device:

[1473] Unit (1301, 1401) of receiving encoded data and demultiplexing.

[1474] Unit (1302, 1402) of lossless decompression and decoding of information on location of subsamples.

[1475] Unit (1304, 1404) of decoding one-dimensional arrays of subsamples encoded by means of the algorithm of lossy compression.

[1476] Unit (1410) of forming and storing reference hierarchical pyramids from reference data.

[1477] Unit (1305, 1405) of restoring transmitted data sections. [1478] Storage (1306, 1406) of a set of predetermined resampling patterns.

[1479] Unit (1307, 1407) of storing and output of hierarchical pyramid.

[1480] Unit (1312, 1414) of interpolation of missed sections, for which there are restored similarly located sections on levels with a lower spatial resolution.

[1481] Unit (1314, 1416) of restoring missed sections, for which there are restored similarly located sections on levels with a higher spatial resolution.

[1482] Unit (1316, 1418) of final filtration and interpolation.

[1483] Unit (214) of forming reference arrays at decoding.

[1484] Unit (206, 215) of inverse transformation of data format.

[1485] System (2300) may also comprise additional devices, which are able to implement efficiently essential parts of the claimed decoding device. In particular, unit (2306) of graphics processor, jointly with nonvolatile memory (2302) and main memory (2303) may implement one or a number of above-enumerated essential parts of the claimed decoding device.

[1486] After switching on system (2300), the program of encoding and/or decoding may be read from nonvolatile memory (2302) into main memory (2303) and directly executed, or else, intermediate software may be loaded, which would read the program of encoding and/or decoding from other data carriers, or receive it via network interface (2308) through network (2309).

[1487] System bus (2304) exercises communication between different devices within system (2300), e.g., between central processor (2301) and graphics processor (2306). Specific configuration of the central bus may differ from the one shown in FIG. 23. In particular, central processor (2301) may be connected to nonvolatile memory (2302) via system bus (2304).

[1488] Applying a set of resampling patterns in the process of compression makes possible efficient use of two-dimensional correlation dependencies in data being compressed. Patterns contained in a set are selected in such a way to transform efficiently common sections of data being encoded. For example, using vertical pattern (901) on a data section with sharp horizontal drops and smooth vertical variations, it is possible to achieve fourfold reduction in the number of transmitted samples relative to the original data section (900), with virtually the same accuracy of its restoration. During decoding, by means of preliminary stages of restoration (1312, 1314, 1414, 1416), and by means of composite cascade interpolation filters, restoration is performed of all the sections of the hierarchical pyramid, which adjoin the transmitted sections. It allows exercising the process of final interpolation of transmitted data sections with using a large number of samples adjacent thereto of the pyramid being restored, which makes possible to raise significantly the interpolation accuracy. Interpolation accuracy may be raised even more substantially through using adaptive filters, which would analyze data sections adjacent to the one being restored, thus optimizing their operation. As a result, owing to a more efficient method of interpolating subsamples being restored and using an adaptively applied set of resampling patterns, interpolation accuracy is raised, with concurrent reduction of the number of subsamples required for correct interpolation.

[1489] Therefore, there are created efficient methods of encoding and decoding digital signals, as well as devices for implementation thereof, and systems for efficient transmission of digital signals via limited throughput communication channels, and there is expanded a range of methods of encoding and decoding digital signals, encoding and decoding devices, as well as systems for transmission of digital signals via limited throughput communication channels.

[1490] Meanwhile, the compression ratio for encoding is raised, without increasing the computational complexity of encoding device, distortions at decoding are reduced, without increasing the computational complexity of decoding device, and high quality is ensured for transmission of digital signals via a limited throughput communication channel. The disclosed group of innovations presents new methods of encoding and decoding data, which allow raising efficiency of compression and/or improving the quality of the image being restored.

[1491] Various enhancements to the encoding and decoding techniques described above and with reference to FIGS. 2-23 are discussed below.

[1492] Interframe-difference reconstruction using the Laplacian differential pyramid.

[1493] This enhancement provides a method for speeding up decoding with an interframe codec and solving a number of problems.

[1494] In embodiments disclosed herein, when an anchor frame is used in encoding, two pyramids may be created: a reference pyramid, which is created with the help of the anchor frame, and a direct pyramid in which signal reconstruction occurs. [1495] Pattern subsamples obtained through the differential method are reconstructed with the help of the non-overlapping pattern method, added to the respective samples of the reference pyramid, and written into the direct pyramid. Pattern subsamples obtained through the direct method are reconstructed by using the regular method. When interpolating in the following decoding stages, the surroundings of a differential pattern are reconstructed by using the method of subtracting the respective samples of the reference pyramid. Interpolated values obtained this way are added to the respective samples of the reference pyramid, written to the next level of the direct pyramid, and transmitted to the subsequent decoding stages. Direct patterns are interpolated by using the standard method.

[1496] Therefore, for differential patterns, a large number of redundant operations are used, which may slow down decoding.

[1497] In alternative and enhanced embodiment, the encoding process involves the reference pyramid and differential pyramid, which is obtained by the method of subtraction of a direct frame and the anchor frame. When calculating pattern subsamples, differential patterns are calculated directly from the differential pyramid, while subsamples of direct patterns are calculated from the surroundings that are obtained by adding the respective samples of the differential and reference pyramids.

[1498] Attention is now directed to FIG. 24, which is a flowchart illustrating interframe- difference reconstruction using a Laplacian differential pyramid. In this alternative embodiment, two pyramids are created during the decoding process: a differential pyramid and a reference pyramid. Subsamples of differential patterns are reconstructed and written into the differential pattern by using a regular method. Subsamples of direct patterns are reconstructed by using a non-overlapping pattern method. Values of the respective samples of the reference pyramid are subtracted from the obtained values, and the obtained differential samples are written into the differential pyramid. When interpolating at the next decoding stages, differential patterns are interpolated by using the regular method, while the surroundings of direct patterns are reconstructed by using the method of addition to the corresponding samples of the reference pyramid. The respective samples of the reference pyramid are subtracted from the interpolated values obtained this way, written to the next level of the differential pyramid, and transmitted to the subsequent decoding stages. At the end of decoding, the reconstructed differential image is added to the anchor frame, which leads to reconstruction of the encoded frame. [1499] In embodiments of this method, we decode differential patterns, which are encoded in significantly larger numbers compared to direct patterns, by using a quick method. This results in approximately doubling the speed of the decoding process relative to the rate at which decoding may be performed using other embodiments disclosed herein.

[1500] Use of subsample predictors during encoding and decoding

[1501] Subsamples obtained as a result of a conversion in accordance with the disclosure retain a residual correlation with other subsamples; however, removal of the correlation is complicated by the differing positions of the subsamples within the encoded and decoded Laplacian pyramids. Therefore, in an embodiment of the proposed method we suggest:

[1502] Attention is now directed to FIGS. 25-26, which are flowcharts illustrating an exemplary use of subsample predictors during encoding and decoding. During an embodiment of the encoding process, the encoded pyramid may be passed through by using a method where the previously encoded patterns are located near the encoded pattern. After quantization and dequantization, the geometry of positions of subsamples for each encoded pattern is reconstructed by using a non-overlapping method within an additional Laplacian pyramid. If a pattern is located at the upper levels of the Laplacian pyramid, then in one embodiment blank samples at the lower levels of the pyramid are filled using the fast decimation method. Thus, from reconstructed subsamples of previously encoded patterns, each encoded pattern obtains filled surroundings similar to the surroundings obtained during decoding. In one embodiment the value of each subsample obtained during encoding may be predicted according to the existing data within the additional pyramid by using one or more methods selected during encoding. The predicted value may be subtracted from the subsample value obtained by a regular method, quantized, dequantized, reconstructed by using the predicted value, and transmitted to the additional pyramid to create surroundings for the next pattern that is to be encoded. In various embodiments prediction methods may use not only the upper level of the additional Laplacian pyramid but any of the possible levels as well as mixing the data of various levels. For options with encoding differential data, an additional pyramid can be created as a differential or direct one according to the chosen decoding method (see the item above). Inasmuch as there is a reference pyramid in the encoder and decoder, prediction methods may randomly employ available subsamples of the reference pyramid and the additional pyramid. As two-dimensional surroundings are created for each pattern that is being encoded in the proposed method, it is possible to use these surroundings to create two-dimensional context models during entropy compression of the data that are being encoded.

[1503] For subsamples of each decoded pattern during an embodiment of the decoding process, reconstruction of their geometry is performed by using a regular method and writing is performed into the pyramid that is being reconstructed. That can be either direct or differential depending upon the decoding method (see the item above). In one embodiment, if a pattern is located at the upper levels of the Laplacian pyramid, then blank samples at the lower levels of the pyramid are filled using the fast decimation method. Thus, from reconstructed subsamples of previously decoded patterns, each decoded pattern obtains filled surroundings similar to the surroundings obtained during encoding. The value of each subsample obtained during decoding is dequantized and added to the predicted subsample according to the existing data in the additional pyramid. The prediction can be performed by using one or several methods chosen during encoding and saved in the encoded data stream. Prediction methods may use not only the upper level of the Laplacian pyramid that is being reconstructed, but any of the possible levels. They may also mix the data of various levels. If a reference pyramid is used during decoding, then subsamples of the pyramid combined with the available samples of the pyramid being reconstructed can be used in the decoding process as well. As two-dimensional surroundings are created for each pattern that is being decoded in the proposed method, it is possible to use these surroundings to create two-dimensional context models during entropy compression of the data that are being encoded.

[1504] FIG. 27 illustratively represents the prediction of subsamples of patterns by means of restored signal geometry, according to an embodiment.

[1505] The reconstructed Laplacian pyramid obtained during the decoding process is transferred to the next stage of decoding, which is interpolation by overlapping compensating filters that depend upon the pattern type; the interpolation is similar to the one used in the decoding method described previously herein.

Encoding by using pattern groups with selection of optimal prediction and quantization methods

[1506] In one embodiment encoding is performed by a tree-like structure, which allows segmenting each block vertically or horizontally. Each rectangle subblock obtained from this can be, in turn, segmented into two tree subnodes. Therefore, in one embodiment there are 7 variations for the segmentation of each node. At the same time, each subblock may describe a pattern group that has 4 or more subsamples. Within the group, a fixed pattern type, fixed quantization methods, and subsample predictions are chosen. In one embodiment the pattern type, quantization parameters, and predictor type chosen for each group during encoding are encoded by using a lossless method and are written into the output stream. The nodes of the tree-like structure are passed through according to a fixed pass-through method, and each node is encoded by using the method described above.

[1507] During the decoding process, the nodes of the tree-like structure are consecutively decoded from the input stream according to the fixed pass-through method; and each node is decoded by the consecutive method. For each pattern group that is being decoded from the output stream, the pattern type, predictor type, and quantization parameters are decoded, which are used to reconstruct the decoded image.

Use of generalized tree patterns in image encoding

[1508] Attention is initially directed to FIG. 28, which is a high-level flow chart describing an exemplary process 2800 for encoding a digital image in accordance with the disclosure. The method may include determining a generalized tree pattern associated with a target region of the digital image (stage 2810). The generalized tree pattern may be formed using multiple sub-nodes of different type and multiple leaves of different shape. An example of a generalized tree pattern is illustrated in FIG. 30B and its one dimensional projection is depicted in FIG. 30C, each of which is discussed below.

[1509] In one embodiment the generalized tree pattern may be formed by selecting among multiple node splitting alternatives or patterns when splitting a node into multiple sub- nodes. This is believed to represent a departure from the prior art, in that the tree patterns developed for the different target regions of an image may have different structures, including different node patterns, different leaf shapes different leaf arrangements, and other differences. This is believed to provide improved encoding accuracy at minimal if any additional computational complexity or other overhead. Once tree patterns have been determined for all target regions (stage 2820), compressed image data is generated by encoding pattern data corresponding to the tree patterns for all target regions of the image (stage 2830). In one implementation this encoding may be performed using the improved SIF transformation described with reference to FIGS. 2-27.

[1510] FIG. 30B illustratively represents an exemplary generalized tree pattern 3000 in accordance with the disclosure. A one-dimensional projection 3001 of the tree pattern of FIG. 3 OB is illustrated in FIG. 30C. As shown, the generalized tree pattern 3000 includes multiple pattern levels, respectively denoted as "3", "2", "1" and "0" in FIG. 30B. As shown, a root node 3002 occupies level "3" of the tree pattern. In transitioning to level "2" of the tree diagram, the root node 3002 may undergo splitting, into a pair of sub-nodes and/or leaves, in accordance with one of the node splitting alternatives illustrated in FIG. 3 OA. In the example of FIG. 30B, the root node 3002 is split accordance with first node splitting alternative 3010 into sub-nodes 3002a, 3002b and leaf 3004, which are depicted in level "2" of the generalized tree diagram. Similarly, the two sub-nodes at level "2" of the generalized tree diagram are transformed in accordance with a pair of node splitting alternatives 3014 when progressing from level "2" of the generalized tree diagram to level "1" of the tree diagram. As shown, the node splitting alternatives 3014 correspond to the first node splitting alternative 3010 and a node splitting alternative 3020. This results in two sub-nodes and a pattern of leaves in level "1" of the tree diagram. Finally, the two sub-nodes in level "1" of the tree diagram are seen to be transformed into a pattern of leaves in accordance with the pair of splitting alternatives 3024 when progressing from level "1" of the generalized tree diagram to level "0" of the tree diagram. As shown, the pair of node splitting alternatives 3030 correspond to node splitting alternatives 3030 and 3040 in FIG. 3 OA.

[1511] Attention is now directed to FIG. 29, which is a more detailed flowchart describing an exemplary process 2900 for encoding a digital image in accordance with the disclosure. As shown, the method 2900 may include receiving input image data for a target region of a digital image (stage 2904). The method may include determining, for each target region of the image, a generalized tree pattern associated with the target region (stage 2910). The generalized tree pattern may be formed using multiple sub-nodes of different type and multiple leaves of different shape. In particular, the generalized tree pattern may be formed by selecting among multiple splitting patterns when splitting a node into multiple sub-nodes. Sub-nodes and leaf patterns of the generalized tree pattern may be determined based upon data associated with the splitting of nodes.

[1512] A node corresponds to a location within a tree pattern at which two or more branches appear or, equivalently, converge traversing the branches in a reverse direction. A leaf is the end of a specific branch from which no additional branches emerge. In the case in which SIF encoding is employed to encode object edges, a tree may include a "SIF leaf comprising a pattern or group of patterns placed in a certain order. In general, data within or associated with a leaf should cover a specific part of the image and the entire tree should cover an entire image.

[1513] In one embodiment the generalized tree structure includes multiple pattern types used to code the edges of objects within the digital image. The parameters of a pattern type may include, for example, pattern shape, pattern location, and the type of predictors used. One distinguishing characteristic of the generalized embedded tree coding described herein and conventional tree-based coding (e.g., binary or square tree coding) is that each node of the generalized tree can be split in two or more different ways. That is, multiple different splitting options may exist when a node is split into two or more sub-nodes when progressing to the next tree level during the encoding process. Each node splitting alternative may be coded using two or more bits. In one embodiment the following alternative splitting options are evaluated (stage 2912) in connection with the splitting of a tree node: (i) links to sub- nodes, and/or (ii) advance defined set of leafs with advance defined set of pattern types, and/or (iii) combination of links to sub-nodes and one or more leafs with advance defined type, and/or (iv) additional data which have been used in process of coding and decoding.

[1514] Sub-nodes of a generalized tree pattern can be of different types, where each type of sub-node may be associated with different splitting alternatives. During the encoding process a sub node type is selected for a node undergoing splitting.

[1515] The leaves of the generalized embedded tree may also be of multiple predefined types. Leaves may include or be associated with data such as, for example: (i) pattern type and shape; (ii) pattern predictors type; (iii) quantization parameters; (iv) interpolation parameters etc. When coding involves coding by pattern groups, leaves may include data concerning: (i) quantization parameters; (ii) predictors type; (iii) interpolation parameters; and (iv) other data set for the whole pattern group.

[1516] In the embodiment of FIG. 30B, the process 2900 may starts from root node 3002. If the root node 3002 does not have reasonably acceptable splitting alternatives for coding conditions associated with the present target region of the image, then coding continues by moving to one or many subnodes. The process of evaluating node splitting alternatives is then repeated at each of these sub-nodes (stage 2912) until all sub-nodes in a target region have been evaluated (stage 2920). Both psycho-visual model parameters associated with a specific node and objective characteristics (e.g., a level of distortion by specific splitting alternative) can be considered as criteria of acceptability when selecting a splitting alternative (stage 2930).

[1517] Again referring to FIG. 29, once a tree pattern has been determined for a given target region of the digital image, data for another target region is obtained (stage 2940). The encoding process continues until pattern data for one or more tree patterns associated with all target regions of the image have been determined (stage 2950). At this point compressed image dat may be generated by encoding the pattern dat using, for example, the improved SIF transform described above (stage 2960).

[1518] During the decoding process, predefined rules common to the encoder and the decoder are used to pass through node and leaf data within the incoming data stream through the decoder; that is, these rules ensure that the decoder operates on only the values of the SIF- encoded pattern samples produced by the encoder. By decoding the SIF-encoded pattern samples using the reverse SIF transformation and interpolating the results, the edges of objects within the original digital image are recovered. In general, the accuracy with which the object edges are recovered will be higher when tree structures utilizing more detailed splitting options are employed; however, the SIF-encoded compressed image will also generally be corresponding larger.

[1519] FIG. 31 illustrates a one-dimensional cut (A-A) of an interpolated image generated from a set of pattern values using a two dimensional interpolation process. In the case when the SIF transformation calculates subsamples values from low levels of Laplace's pyramid (which has reduced copies of the image), predictors' values can be calculated using data from all levels of Laplace's pyramid (not only from the highest level).

[1520] While various embodiments have been described above, it should be understood that they have been presented by way of example only, and not limitation. Where methods described above indicate certain events occurring in certain order, the ordering of certain events may be modified. Additionally, certain of the events may be performed concurrently in a parallel process when possible, as well as performed sequentially as described above. Although various modules in the different devices are shown to be located in the processors of the device, they can also be located /stored in the memory of the device (e.g., software modules) and can be accessed and executed by the processors. Accordingly, the specification is intended to embrace all such modifications and variations of the disclosed embodiments that fall within the spirit and scope of the appended claims. [1521] The various methods or processes outlined herein may be coded as software that is executable on one or more processors that employ any one of a variety of operating systems or platforms. Additionally, such software may be written using any of a number of suitable programming languages and/or programming or scripting tools, and also may be compiled as executable machine language code or intermediate code that is executed on a framework or virtual machine.

[1522] In this respect, various inventive concepts may be embodied as a computer readable storage medium (or multiple computer readable storage media) (e.g., a computer memory, one or more floppy discs, compact discs, optical discs, magnetic tapes, flash memories, circuit configurations in Field Programmable Gate Arrays or other semiconductor devices, or other non-transitory medium or tangible computer storage medium) encoded with one or more programs that, when executed on one or more computers or other processors, perform methods that implement the various embodiments discussed above. The computer readable medium or media can be transportable, such that the program or programs stored thereon can be loaded onto one or more different computers or other processors to implement various aspects of the present disclosure as discussed above.

[1523] The terms "program" or "software" are used herein in a generic sense to refer to any type of computer code or set of computer-executable instructions that can be employed to program a computer or other processor to implement various aspects of embodiments as discussed above. Additionally, it should be appreciated that according to one aspect, one or more computer programs that when executed perform methods of the present disclosure need not reside on a single computer or processor, but may be distributed in a modular fashion amongst a number of different computers or processors to implement various aspects of the present disclosure.

[1524] Computer-executable instructions may be in many forms, such as program modules, executed by one or more computers or other devices. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Typically the functionality of the program modules may be combined or distributed as desired in various embodiments.

[1525] Also, data structures may be stored in computer-readable media in any suitable form. For simplicity of illustration, data structures may be shown to have fields that are related through location in the data structure. Such relationships may likewise be achieved by assigning storage for the fields with locations in a computer-readable medium that convey relationship between the fields. However, any suitable mechanism may be used to establish a relationship between information in fields of a data structure, including through the use of pointers, tags or other mechanisms that establish relationship between data elements.

[1526] Also, various inventive concepts may be embodied as one or more methods, of which an example has been provided. The acts performed as part of the method may be ordered in any suitable way. Accordingly, embodiments may be constructed in which acts are performed in an order different than illustrated, which may include performing some acts simultaneously, even though shown as sequential acts in illustrative embodiments.

[1527] All definitions, as defined and used herein, should be understood to control over dictionary definitions, definitions in documents incorporated by reference, and/or ordinary meanings of the defined terms.

[1528] The indefinite articles "a" and "an," as used herein in the specification and in the claims, unless clearly indicated to the contrary, should be understood to mean "at least one."

[1529] The phrase "and/or," as used herein in the specification and in the claims, should be understood to mean "either or both" of the elements so conjoined, i.e., elements that are conjunctively present in some cases and disjunctively present in other cases. Multiple elements listed with "and/or" should be construed in the same fashion, i.e., "one or more" of the elements so conjoined. Other elements may optionally be present other than the elements specifically identified by the "and/or" clause, whether related or unrelated to those elements specifically identified. Thus, as a non-limiting example, a reference to "A and/or B", when used in conjunction with open-ended language such as "comprising" can refer, in one embodiment, to A only (optionally including elements other than B); in another embodiment, to B only (optionally including elements other than A); in yet another embodiment, to both A and B (optionally including other elements); etc.

[1530] As used herein in the specification and in the claims, "or" should be understood to have the same meaning as "and/or" as defined above. For example, when separating items in a list, "or" or "and/or" shall be interpreted as being inclusive, i.e., the inclusion of at least one, but also including more than one, of a number or list of elements, and, optionally, additional unlisted items. Only terms clearly indicated to the contrary, such as "only one of or "exactly one of," or, when used in the claims, "consisting of," will refer to the inclusion of exactly one element of a number or list of elements. In general, the term "or" as used herein shall only be interpreted as indicating exclusive alternatives (i.e. "one or the other but not both") when preceded by terms of exclusivity, such as "either," "one of," "only one of," or "exactly one of." "Consisting essentially of," when used in the claims, shall have its ordinary meaning as used in the field of patent law.

[1531] As used herein in the specification and in the claims, the phrase "at least one," in reference to a list of one or more elements, should be understood to mean at least one element selected from any one or more of the elements in the list of elements, but not necessarily including at least one of each and every element specifically listed within the list of elements and not excluding any combinations of elements in the list of elements. This definition also allows that elements may optionally be present other than the elements specifically identified within the list of elements to which the phrase "at least one" refers, whether related or unrelated to those elements specifically identified. Thus, as a non-limiting example, "at least one of A and B" (or, equivalently, "at least one of A or B," or, equivalently "at least one of A and/or B") can refer, in one embodiment, to at least one, optionally including more than one, A, with no B present (and optionally including elements other than B); in another embodiment, to at least one, optionally including more than one, B, with no A present (and optionally including elements other than A); in yet another embodiment, to at least one, optionally including more than one, A, and at least one, optionally including more than one, B (and optionally including other elements); etc.

[1532] In the claims, as well as in the specification above, all transitional phrases such as "comprising," "including," "carrying," "having," "containing," "involving," "holding," "composed of," and the like are to be understood to be open-ended, i.e., to mean including but not limited to. Only the transitional phrases "consisting of and "consisting essentially of shall be closed or semi-closed transitional phrases, respectively, as set forth in the United States Patent Office Manual of Patent Examining Procedures, Section 2111.03.