Method of compression of graphic file by fractal method using ring classification of segments

FIELD: information technology.

SUBSTANCE: method of compression of graphic file by fractal method using ring classification of segments, in which the graphic file is split into rank regions and domains, and for each rank region the domain and the corresponding affine transformation is found, that best approximates it to the appropriate rank region, and using the obtained values of the domain parameters, comprising their coordinates, the coefficients of the affine transformations, the values of brightness and contrast, the archive is formed, and classification of domains and rank regions are introduced, based on the allocation in them of the "rings" and the calculation of the mathematical expectation of pixel intensity of these "rings", which enables to reduce the complexity of the phase of correlation of the segments and to accelerate compression.

EFFECT: reduced time of compression of the graphic file by fractal method.

3 dwg

 

The invention relates to the field of digital processing of image files, namely to methods of compression and can be used for efficient storage or transmission over a communication channel formed of a compressed file.

Known "Method of sharing vector quantization and fractal coding of images" (patent RU 2316908 C2, IPC H04N 7/26-published: 10.02.2008), which proposes to combine fractal compression method with vector quantization, by using ready-made library of domains formed in advance.

The disadvantage of this method is the increased complexity of the implementation phase correlation rank region - domain by increasing the size of the library domain and the complexity of the reverse decompression.

Also known for "Method for transmission of additional information for fractal coding of images" (patent EP 0742672 A2, IPC G06T 9/00, published: 13.11.1996) in which to search for the appropriate domain uses the strategy of the search tree.

The disadvantage of this method is that due to the use of this strategy is to increase the time compression of the graphic file and the loss of opportunity to use the entire library of domains, which affects the quality of compression.

The closest in technical essence and performed the diversified functions is a Way to increase the coding rate, when combined vector quantization and fractal coding" (patent RU 2321184 C2, IPC H04N 7/40, G06T 9/00, published: 27.03.2007), in which the domains stored in the code book are classified by the algorithm of Fisher.

The disadvantage of this method is the loss of correspondence between domains and rank areas during decompression, because the recovery depends on the initial point and the location of the domains that use codebook is impossible, when the search is excluded many domains due to the rough classification system.

The objective of the invention is to provide a method of compression of graphic file fractal method using the ring classification of segments that minimize the time the graphic file is compressed fractal method.

This task is solved in that in the way that the graphic file is compressed fractal method using the ring classification of segments, namely, that the graphic file is divided into a rank field and domains, and for each rank area find the domain and the corresponding affine transformation that best approximates it to the corresponding rank of field, and using the resulting coefficients form the archive, enter the ring classification domains and rank areas to reduce the complexity of the phase matching segments and to speed up the compression.

The analysis of the level of those who Nicki has allowed to establish, that analogues characterized by a set of characteristics is identical for all features of the claimed technical solution is available, which indicates compliance of the claimed method the condition of patentability "novelty".

Search results known solutions in this and related areas of technology in order to identify characteristics that match the distinctive features of the prototype of the features of the declared object, showed that they do not follow explicitly from the prior art. The prior art also revealed no known effect provided the essential features of the claimed invention transformations on the achievement of the technical result. Therefore, the claimed method meets the condition of patentability "inventive step".

"Industrial applicability" of the invention due to the fact that the device that implements the proposed method can be implemented with the help of modern element base, achieving specified in the invention destination.

The claimed method of the graphic file is compressed fractal method using the ring classification of segments is illustrated by drawings on which is shown:

Fig.1 - split of segment images to implement a ring classification, where A1, A2,..., An- mathematical expectation and is tensively pixels corresponding segments;

Fig.2 - the algorithm that describes the implementation of the proposed method;

Fig.3 is a graph describing the results of applying the comparison of classification algorithms.

Implementation of the proposed method is to include in the process of fractal compression stage ring classification of segments. Overall fractal compression algorithm initially assumes the input compression parameters (Walsted S. Fractals and wavelets for image compression in action: a manual. TRANS. from English. - M.: Publishing House Of Triumph", 2003. - S. 78). As compression settings are the minimum size of the domain, the minimum step of the domain, the threshold value of standard deviation (RMS) depth quadradrive.

After entering the compression settings in the system loads the original image intended for compression. The first stage is implemented by partitioning the image domain (Walsted S. Fractals and wavelets for image compression in action: a manual. TRANS. from English. - M.: Publishing House Of Triumph", 2003. - S. 81). The minimum size of the domain is specified in the initial settings. Also, domains are larger and more efficient calculation, each of the following groups of domains larger than the previous two times. The maximum possible size of the domain is chosen in accordance with the size of the original image.

In the next step, etc who comes allocation rank areas however, they must complete the entire image and not to overlap with each other. Rank region in accordance with the algorithm is less than the domain width in half.

After the formation of the library domain and determining grades is the main phase of the correlation of the ranking of regions and domains (Walsted S. Fractals and wavelets for image compression in action: a manual. TRANS. from English. - M.: Publishing House Of Triumph", 2003. - S. 86). It occurs through the selection of relevant rank domains.

The similarity of the domains, and rank is determined by the method of ordinary least squares (OLS). The analyzed domain is subjected to affine transformations to maximize the similarity rank, then the value obtained by OLS, the decision about the continuation of the match. Affine transformation involves such operations on segments of the image as a mirror image, rotation angles 90, 180, 270 degrees (Walsted S. Fractals and wavelets for image compression in action: a manual. TRANS. from English. - M.: Publishing House Of Triumph", 2003. - S. 51). You can also use the zoom. In the compression settings pre-determined minimum threshold RMSE obtained by calculating the value of the OLS, the lower it is, the better compressed image, but uvelichivaetsya compression and Vice versa. If for rank region is not found suitable domain implemented method quadradrive (Walsted S. Fractals and wavelets for image compression in action: a manual. TRANS. from English. - M.: Publishing House Of Triumph", 2003. - S. 83), in which the rank field is divided into 4 equal parts and they are the same.

After performing phase correlation levels and domains, an archive, consisting of a header that specifies the parameters of the generated compressed file, and a data field containing the coordinates of the respective domains, the coefficients of affine transformations and the values of brightness and contrast.

In the proposed method introduces the classification stage of the segments of the graphic file (Fig.2). The implementation of this stage is as follows. Selected in the first stage of the fractal compression of graphic files domains are distributed depending on their size, most often used in degree 2, i.e. the minimal domain is a segment with a width of 4, as the minimum rank region has a width of 2, and the domain is always greater than the rank of the region. In the proposed algorithm for the convenience of rank region is always less than 2 times the appropriate domain and all segments have the shape of a square. Accordingly, the formed arrays of domains with sizes of 4, 8, 16 and so on until Maxim is Ino possible values for the original image file. For each array of domains is classified with the aim of reducing the complexity of the stage of rank correlation region domain. In the proposed method, classification is carried out through the allocation of "rings" in the segments and the calculation of the mathematical expectation of intensities of pixels. The method consists in the selection of the rings thickness of one pixel (Fig.1). Minimum ring for all segments is square with a width of 2. Thus, in each segment, you can select the number of rings equal to half the width of, for example, for a domain of size 8, formed 4 "rings". For the selected rings of the intensities of all pixels are summed and the sum divided by their number, thus for each domain is formed by a vector of values of mathematical expectation of intensities of pixels of the rings". Similar steps are carried out with the rank areas on the stage of their selection. After carrying out the calculation of the mathematical expectation of intensities of pixels of the rings" all segments by the formation of the possible pairs of rank region domain. In the method it is proposed to use an interval equal to 25, which implies formation of the classification of samples based on the proposed interval and the last interval is extended to 30, since the maximum value of pixel intensity of 255. Is the size of the RA interval are selected empirically and is the most acceptable in terms of the number of classes and the effectiveness of further matching. In fact, for each possible segment size pool is formed, with the specific parameters such as domain size 8 first class will be specified intervals for the first ring 0-25, second 0-25, third 0-25 and fourth 0-25. The following class has the value of the first range of 25-50, and the rest do not change and so on for all possible segments. Thus, at the stage of rank correlation region - domain task matching is simplified hundreds of times. The use of split segments on "the ring" is associated with a fractal approach, as when performing affine transformations segments are turns and more profitable to use the classification parameters that do not depend on them, otherwise you have to find a classification criterion for each possible affine transformation. Also obvious is the fact that these segments should be the values of the intensities of the pixels of the rings" close, because of the very nature of graphic files. The proposed method in this sense is universal for all transformations and allows without significantly increasing the complexity to reduce the time of compression.

The efficiency of the proposed method in comparison with the prototype is that reduced the run time phase matching rank which region is the domain reducing the duration of the total time compression without noticeable changes.

Implementation of the proposed method showed the effectiveness of its application. Based on a model built in the software MatLab, the analysis duration compression of the same image based on the comparison of classification algorithms (Fig.3). The chart shows that the compression of the same original graphic file is faster when using the inventive method, the value of PSNR (engineering term for the ratio between the maximum possible value of the signal and noise power, distorting signal values), other things being equal compression settings, has increased. Thus, we can conclude that the use of this method allows to reduce the duration of image compression without compromising quality.

How to compress a graphic file fractal method using the ring classification of segments, namely, that the graphic file is divided into a rank field and domains, and for each rank area find the domain and the corresponding affine transformation that best approximates it to the corresponding rank of field, and using the obtained values of the parameters of domains, including their coordinates, adjusted anti affine transformations, the values of brightness and contrast, form the archive, characterized in that the injected classification domains and rank areas based on selection of the "rings" and the calculation of the mathematical expectation of the intensities of the pixel data of the rings, to reduce the complexity of the phase matching segments and to speed up compression.



 

Same patents:

FIELD: physics, computer engineering.

SUBSTANCE: invention relates to presentation of content recommendations. A computer-implemented system (100) for presenting content to a subscriber comprises: a detection component (104) for detecting an inactive subscriber in a session of a website portal; a tracking component (114) for tracking interaction of the inactive subscriber with the session content; and an analysis component (202) for analysing subscriber browsing behaviour, extrapolating subscriber experience level based on the analysis, and suggesting content as session content, wherein the subscriber experience level is extrapolated by tracking how often a subscriber selects Help and other menu categories; and a content component (116) for obtaining and presenting new content targeted to the inactive subscriber during the session based on the tracked interaction of the inactive subscriber with the session content, wherein the session content is new content as part of the session content based on the subscriber experience level.

EFFECT: providing dynamic tracking of information on a new or inactive user on a website and fast presentation of targeted content back to the user to maintain the interest of the user in the website.

13 cl, 9 dwg

FIELD: physics, computer engineering.

SUBSTANCE: invention relates to an apparatus and a method of creating an electronic programme guide from programme information stored in an electronic programme guide database for a plurality of channels. The apparatus for creating an electronic programme guide from programme information stored in an electronic programme guide database for a plurality of channels comprises a control unit, a display unit, a time selection unit comprising a user input interface, a programme information search unit and a determining device. The control unit further includes a displayed information updating unit. An electronic programme guide displays elements relating to programmes accessible on a plurality of channels at a given moment in time. When the given time changes, the electronic programme guide updates elements corresponding to channels on which a programme which is accessible at a new time is different from a programme accessible at the previous time.

EFFECT: reduced amount of data required to update an electronic programme guide.

17 cl, 7 dwg

FIELD: physics, video.

SUBSTANCE: invention relates to means of storing and transporting encoded video data. The method includes assembling encoded video data into a video file fragment comprising sub-track fragments, which comprise a plurality of hierarchically related encoded video images of the encoded video data, arranged continuously in the decoding order within a corresponding sub-track fragment, wherein the hierarchically related encoded video images each correspond to a common hierarchical layer; outputting data; receiving a request in accordance with a streaming protocol which specifies the sub-track fragment. In the method, the request comprises a hypertext transfer protocol (HTTP) partial GET request which specifies a byte range corresponding to the sub-track fragment; outputting the hierarchically encoded video images of the sub-track fragment.

EFFECT: retrieving encoded images of a specific hierarchical layer in a video fragment using a single request.

44 cl, 9 dwg, 3 tbl

FIELD: physics.

SUBSTANCE: method comprises phases, during which video bit stream containing a sequence of image frames is received, the error occurrence is determined in the display frame segment, time distribution and spatial distribution of the named error is identified by means of the motion vector information and internal prediction relating a segment, affected by the error, the quality of video bit stream is assessed on the basis of the named error distribution.

EFFECT: improvement of accuracy of assessment at the expense of identification of error spatial distribution in the display frame segment.

18 cl, 16 dwg

FIELD: physics, computer engineering.

SUBSTANCE: invention relates to computer engineering. A method of encoding video which comprises determining a transformation unit, i.e., a data unit in which a current coding unit from among coding units is transformed, the coding units being data units in which a current video image is encoded, wherein the size of the transformation unit is determined independent of the size of at least one prediction unit which is a data unit in the current coding unit; transforming data of the current coding unit based on the transformation unit to encode the data of the current coding unit; and outputting the encoded data of the current coding unit, encoding mode information which indicates an encoding mode of the encoded data of the current coding unit, and transformation index information which indicates a structure of the transformation unit, as a bit stream.

EFFECT: high rate of encoding and decoding data.

15 cl, 23 dwg, 1 tbl

FIELD: physics, computer engineering.

SUBSTANCE: invention relates to media content information processing. The method comprises: providing (S1) a pseudo-identifier of a media codec used to encode said media content; providing (S2) additional processing information which defines a post-decoding instruction for processing the decoded media content obtained by decoding said encoded media content; and joint organisation (S3) of said pseudo-identifier and said additional processing information in a file in order to stop decoding said encoded media content by a conventional media terminal which does not recognise said pseudo-identifier, and enable decoding of said encoded media content using said media codec and post-decoding processing of said decoded media content using said additional processing information by a media terminal which recognises said pseudo-identifier.

EFFECT: high efficiency of processing data.

20 cl, 13 dwg

FIELD: information technologies.

SUBSTANCE: method includes reception of a query of a code stream by a transformation device, analysis of the query of code stream, obtaining information of video parameters and coding format, detection of whether the analysed and received information is same with the appropriate information in information of code stream description, if specified information differs - establishment of a value of a set of parameters, corresponding to analysed and received information of parameters of video and coding format, sending the established value to the receiving end, end of the session of interaction with the receiving end.

EFFECT: elimination of video stream code decoding errors during reproduction of a video stream.

10 cl, 6 dwg

FIELD: physics, computer engineering.

SUBSTANCE: invention relates to controlling a recommender system and specifically to controlled placement of auxiliary media data relative to content items presented to a user. The method includes scheduling a content item in a first scheduler (111) based on a user profile obtained from a recommender system, receiving information about scheduled content and deciding in a second scheduler (118) based on the received information which auxiliary media data to place into a presentation space. Priority is allocated to items of auxiliary media data based on one of: targeting information, prioritisation information, factoring information and popularity information. The popularity information is determined based on a user rating or by measuring a dropping or watching rate of an item of said auxiliary media data. Furthermore, placement of auxiliary media data is controlled relative to content items presented to a user.

EFFECT: high efficiency of using system resources by selecting auxiliary media data depending on user preferences and type of selected content item.

15 cl, 7 dwg

FIELD: radio engineering, communication.

SUBSTANCE: invention relates to a transmitting device, a receiving device and a communication system. The technical result is achieved through a video data encoder, having an input for receiving stereoscopic image data. The stereoscopic image data include time-matching first and second image data. An error-correction encoding unit combines first image data units and corresponding second image data units from an input unit into a common encoding matrix. An error-correction code obtained from the combined units is added to the encoding matrix.

EFFECT: transmitting a plurality of video data with high resistance to packet loss and reduced delay.

14 cl, 10 dwg

FIELD: physics, computer engineering.

SUBSTANCE: invention relates to computer engineering. The motion prediction method includes obtaining a plurality of motion vector predictors to be included in a candidate set for motion prediction of a current unit of a current frame; determining whether the current frame is a non-reference frame which is not referred to by other frames for motion prediction; when the current frame is a reference frame, removing any motion vector predictor corresponding to a previously coded frame from the candidate set; and predicting a motion vector of the current unit based on the motion vector predictors of the candidate set.

EFFECT: preventing parsing error propagation.

14 cl, 9 dwg

FIELD: physics.

SUBSTANCE: method comprises making each array element in an image sensor from one "R, G, B radiation colour brightness to code" converter, which performs parallel synchronous conversion of radiation of three colours analogue video signals R, G, B into three codes. The frame image digitisation apparatus includes an objective lens, an image sensor comprising an array of elements, three switch units, three register units and a control signal generator, wherein each switch unit includes the same number of encoders as converters.

EFFECT: reduced cross dimensions of array elements in an image sensor, which enables to reduce the frame format size or increase resolution of the image sensor.

6 dwg, 1 tbl

FIELD: physics.

SUBSTANCE: disclosed is a frame image digitisation apparatus. The disclosed apparatus comprises a lens in the focal plane of which there is an image sensor having an array of elements, a control signal generator and three register units, the outputs of which are the outputs of the digitisation apparatus. Each array element consists of a converter for converting radiation of colours R, G, B into three codes. Images are input into the sensor, the number of said images being equal to the number of array elements and the number of colours R, G, B of analogue-to-digital converters (ADC).

EFFECT: high image frame resolution owing to conversion of three colours R, G, B into codes using one converter.

4 dwg, 2 tbl

FIELD: physics.

SUBSTANCE: apparatus comprises a lens, an image detector having an array situated in the focal plane of the lens, the array having elements which are converters for converting radiation to codes based on the frame resolution number 106, each having an opaque housing in the front part of which, in a partition wall, there is a microlens, on the optical axis of which and at an angle of 45 thereto semitransparent micromirrors are arranged in series and rigidly mounted based on the number of bits per code, each preceding micromirror transmitting to the next micromirror radiation flux with half the strength.

EFFECT: high speed of frame digitisation.

1 tbl, 4 dwg

FIELD: physics.

SUBSTANCE: apparatus comprises a lens, an image detector which includes an array of elements based on the frame resolution number 106, situated in the focal plane of the lens and having three groups of outputs of colour codes R, G, B, includes three register units and a control signal generator which outputs from the first output pulses with frame frequency (25 Hz), connected to the control inputs in array elements, and from the second output pulses with code sampling frequency, connected in parallel to the second control inputs of the first through third register units.

EFFECT: high frame resolution by making array element converters of brightness of radiation of colours R, G, B - three codes, which synchronously output codes of three colours R, G, B.

5 dwg, 1 tbl

FIELD: physics.

SUBSTANCE: disclosed is a method of obtaining a structural image of a biological object in optical coherence tomography. The method includes breaking down a source colour vide frame into non-overlapping spatial blocks consisting of more than one pixel. A structural image is obtained via small-angle raster scanning in the arm of an optical coherence tomography sample. The obtained image with a size of Piskh bytes is broken down into non-overlapping spatial blocks only on columns; adjacent column blocks are averaged pixel by pixel to form a new image with a size of Pstl bytes; the new image is broken down into non-overlapping spatial blocks only on rows; adjacent row blocks are averaged pixel by pixel to form a resultant image with a size of Pres bytes, and the averaging process is controlled based on an exponential relationship Pstl from the number of averaging column blocks Ustl and Pres from the number of averaging row blocks - Ustr.

EFFECT: high quality of the structural image of a biological object in optical coherence tomography.

7 dwg

FIELD: physics, video.

SUBSTANCE: invention relates to video encoding and decoding, which provides conversion between a spatial region and a conversion region. The method of encoding video includes breaking down a video image into encoding units having a maximum size. The images are encoded based encoding units according to depths obtained by hierarchically breaking down each maximum depth encoding unit, and based on the type of partition defined according to depths of the depth encoding units. The type of partition includes a data unit having the same size as the current encoding unit, and a partial data unit obtained by breaking down the height or width of the current encoding unit. Encoding units are determined according to encoding depths relative to each of the depth encoding units, and encoding units having a tree structure are therefore determined. The encoded data are output.

EFFECT: high efficiency of image compression and, as a result, high efficiency of encoding and decoding video.

15 cl, 15 dwg, 1 tbl

FIELD: physics, video.

SUBSTANCE: invention relates to encoding three-dimensional video signals, and specifically to a transport format used to transport three-dimensional content. The technical result is achieved using a device which is characterised by that it includes a means of generating a stream which is structured into multiple levels: level 0, having two independent layers: a base layer containing video data of a right-side image, and a level 0 extension layer containing video data of a left-side image, or vice versa; level 1, having two independent extension layers: a level 1 first extension layer containing a depth map relating to the image of the base layer, a level 1 second extension layer containing a depth map relating to the image of the level 0 extension layer; level 2, having a level 2 extension layer containing overlapping data relating to the image of the base layer.

EFFECT: high quality of three-dimensional images with a large number of presentations used.

6 cl, 2 dwg

FIELD: physics, computer engineering.

SUBSTANCE: invention relates to means of encoding and decoding images. In the method, the motion vector of a reference section has the same shape as the current section and belongs to a reference image which is different from the current image and is broken down in advance as a result of encoding with subsequent decoding into a plurality of sections. When a reference section overlaps a set of reference sections from said plurality of sections of the reference image, said motion vector of the current image section is determined based on a reference motion vector function belonging to a set of reference motion vectors associated with k overlapped reference sections.

EFFECT: high accuracy of predicting the motion vector of an image section.

15 cl, 6 dwg

FIELD: physics, computer engineering.

SUBSTANCE: invention relates to predictive motion vector predictive encoding/decoding of moving pictures. The moving picture encoding apparatus includes a primary candidate reference motion vector determination unit which sets N primary candidate reference motion vectors, a degree of reliability calculation unit which calculates the reliability of each primary candidate reference motion vector which quantitatively represents effectiveness in motion vector prediction of the block to be decoded, using encoded or decoded picture information, a reference motion vector determination unit selects M (M<N) secondary candidate reference motion vectors in accordance with the degree of reliability of N primary candidate reference motion vectors, a motion vector encoding unit calculates a predictive motion vector of the block to be encoded using M secondary candidate reference motion vectors with high reliability.

EFFECT: improved efficiency of predicting and encoding moving pictures.

16 cl, 14 dwg

FIELD: information technology.

SUBSTANCE: method for alphabetical representation of images includes a step for primary conversion of an input image to a multi-centre scanning (MCS) format, constructed according to rules of a plane-filling curve (PFC). The initial MSC cell is a discrete square consisting of nine cells (33=9), having its own centre and its own four faces (sides). Scanning of the initial MSC cell is performed from the centre to the edge of the square while bypassing the other cells on a circle. The path with a bypass direction to the left from the centre of the square and then on a circle, clockwise, is the priority path for scanning and displaying images.

EFFECT: high efficiency of encoding images.

3 cl, 5 dwg

FIELD: systems for encoding and decoding video signals.

SUBSTANCE: method and system for statistical encoding are claimed, where parameters which represent the encoded signal are transformed to indexes of code words, so that decoder may restore the encoded signal from aforementioned indexes of code words. When the parameter space is limited in such a way that encoding becomes inefficient and code words are not positioned in ordered or continuous fashion in accordance with parameters, sorting is used to sort parameters into various groups with the goal of transformation of parameters from various groups into indexes of code words in different manner, so that assignment of code word indexes which correspond to parameters is performed in continuous and ordered fashion. Sorting may be based on absolute values of parameters relatively to selected value. In process of decoding, indexes of code words are also sorted into various groups on basis of code word index values relatively to selected value.

EFFECT: increased efficiency of compression, when encoding parameters are within limited range to ensure ordered transformation of code word indexes.

6 cl, 3 dwg

Up!