Classifications

• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
  • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
  • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
  • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
  • H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
  • H04N19/172—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a picture, frame or field
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
  • G06T13/00—Animation
  • G06T13/80—2D [Two Dimensional] animation, e.g. using sprites
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
  • G06T9/00—Image coding
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
  • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
  • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
  • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
  • H04N19/12—Selection from among a plurality of transforms or standards, e.g. selection between discrete cosine transform [DCT] and sub-band transform or selection between H.263 and H.264
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
  • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
  • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
  • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
  • H04N19/136—Incoming video signal characteristics or properties
  • H04N19/14—Coding unit complexity, e.g. amount of activity or edge presence estimation
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
  • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
  • H04N19/30—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using hierarchical techniques, e.g. scalability
  • H04N19/33—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using hierarchical techniques, e.g. scalability in the spatial domain
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
  • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
  • H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
  • H04N19/63—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding using sub-band based transform, e.g. wavelets
  • H04N19/64—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding using sub-band based transform, e.g. wavelets characterised by ordering of coefficients or of bits for transmission
  • H04N19/645—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding using sub-band based transform, e.g. wavelets characterised by ordering of coefficients or of bits for transmission by grouping of coefficients into blocks after the transform
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
  • G06T2210/00—Indexing scheme for image generation or computer graphics
  • G06T2210/36—Level of detail

Definitions

• the present invention relates primarily to the field of animated multi-page animated images.
• the object of the invention is to propose a method that makes it possible to obtain an animation that incorporates the advantages of animations of the GIF type while being more fluid and quickly downloadable.
• a method comprises the use of scalable fixed images, that is to say images having scalability properties; preferably, each of the still images is stored in at least two levels, the first level comprising few details and each subsequent level providing additional details at the level which precedes it
• to play an image one reads first a level before the level of higher rank, preferably starting from the first level of the image
• For each image decompresses and displays the data contained in all the available levels for said image, or, one uncompresses and displays the corresponding data only at the levels available for all the images, or, one decompresses and displays only the data corresponding to the smallest set of levels making it possible to reach at least one given display resolution of the image.
• each of its levels is located, in the reading order of the media, before the next level.
• the media of the animation may include, in the playing order of said media, all the levels of a first rank according to the order in which the images of the animation are intended to be played, and then all levels of animation. rank immediately higher, preferably starting with the first levels.
• An image may be played according to the data from a level of said image before the data of the higher rank level has been read and processed.
• the processed image is advantageously redimaged, before being played, to achieve the desired display resolution.
• the still images are advantageously previously compressed by a wavelet method.
• the image media is preferably a file.
• the still images have been previously compressed by a method comprising at least one wavelet transform.
• the still images have been previously compressed by a method comprising at least one difference between two adjacent pixels.
• At least one first still image has been compressed using a first compression method
• at least one second still image has been compressed using a second method. compression.
• the method according to the invention comprises a step of analyzing each fixed image in order to determine the most appropriate compression method.
• the first compression method comprises at least one wavelet transform
• the second compression method comprises at least one difference between two adjacent pixels. . .
• the analysis step classifies the images by contrast levels, the least contrasted images being compressed according to the first method, and the most contrasted images being compressed according to the second method.
• the invention also relates to a medium for the implementation of a method according to the invention, characterized in that it comprises, in the reading order of said medium, all levels of a first rank according to the order in which the images of the animation are scheduled to be played, then all levels of next higher rank, preferably starting with the first levels.
• the invention also relates to a method for selecting a still image of such an animation medium, where a level of a rank is used to display a preview of the media images without reading or without reading and processing the images. higher ranks. .
• the invention also relates to a method, characterized in that a fixed image medium is created from the levels of the selected still image.
• the invention also relates to a computer program configured, when executed on a processor, to perform a multi-page type animation, characterized in that the animation medium comprises still images having scalability properties, preferably for all the images.
• Scalability allows, for the compression formats that use it, to get a preview of the image with only a part of the data and to obtain, by levels, more and more precise previews of the image as and as the data is decompressed.
• Such scalability is used statically, that is to say for an isolated image, for example in the formats Jpeg2000 and PGF.
• the GIF format meanwhile, allows the storage of multiple images within the same media, but not scalability.
• a “consistent" set of information created during compression will be referred to as a "level” that, in combination with previous levels, decompresses the image to a defined resolution.
• this level contains all the layers of the image for this level.
• the level advantageously contains data for the Y layer, the Cb layer and the Cr layer for this level.
• FIG. 1 schematically illustrates the levels of a compressed fixed image, shown in two dimensions.
• the size of each of the rectangles represents the resolution of the image, once the set of levels up to that represented by the rectangle are decompressed
• FIG. 2 illustrates a multi-page animation, comprising five compressed images of three levels of equivalent resolution for each of the images, according to the mode of FIG. 1;
• FIG. 3 illustrates the organization of the data of the animation of FIG. 2, according to a first mode of implementation of the invention, where the images are stored one after the other, and by successive levels within each picture ;
• FIG. 4 illustrates the organization of the data of the animation of FIG. 2, according to a second mode of implementation of the invention, where the levels of the same rank of all the images are stored one after the other, from the first to the last levels;
• FIGS. 5 and 6 illustrate, respectively in a representation in one and two dimensions, a possible display mode of the animation, according to a method of the invention in the embodiment of FIG. 4.
• FIG. 1 illustrates the resolution obtained during the decompression of each of three successive levels N1-N3 previously compressed.
• the decompression of a single first level NI comprising the least details, will generate a resolution image such as that of the area occupying the upper left corner of the matrix M.
• This partially decompressed image can obviously be resized to reach the image display resolution, or the size of a screen for example.
• the decompression of the data of a second level N2, combined with those of the first level NI, will generate a more detailed image, whose resolution will be equal to the whole area occupying the upper left corner of the matrix M, plus the area intermediate matrix M, located at the bottom right of it.
• the decompression of the set of levels NI, N2 and N3, combined with each other will generate a complete image whose resolution is proportional to the surface of the matrix M.
• the first NI level covers 1/16 of the size of the matrix M, that is to say that if only the first level NI is decompressed, an image is obtained which represents 1/16 of the size of the original image;
• the data of the first and second levels NI, N2 cover 1/4 of the size of the matrix M, that is to say that if only the first two levels N1, N2 are decompressed, an image is obtained which is 1/4 of the size of the original image;
• the data of the first, second and third levels N1-N3 cover the entire size of the matrix M, that is to say that if the three levels N1-N3 are decompressed, the set of the original image;
• Each level has data representing the image, with a lower resolution than the next level.
• Each level uses the data from the previous level at the same time as its own data.
• Such an image is therefore scalable, it has the property of scalability, that is to say that it is possible to decompress a level after the previous one, without having to decompress the following possible levels.
• FIG. 2 illustrates a multi-page animation A comprising a series of five images P1-P5 compressed according to the mode of FIG. 1, in three levels N1-N3.
• the level Nm is denoted Pn: Nm with, in this case, n varying from 1 to 5 and m varying from 1 to 3.
• the images Pn are a a set of images encoded with scalability, or a set of images that are encoded or re-encoded with scalability for the purposes of the application. They can for example be from a set of JPEG images in a gallery of images or images from a camera.
• FIG. 3 illustrates the arrangement of an AM media for animation A, according to a first embodiment of the invention.
• the AM medium comprises five pages AM1-AM5, each corresponding, in the order of their display, to a respective image P1-P5.
• each page AMn the data are classified in the order of the levels N1-N3, so that the data of the first level Pn: N1 of a picture Pn are arranged before those of the second level Pn: N2, themselves before those of the third level Pn: N3.
• each level can be read and decompressed before the next.
• the level data is reorganized as illustrated in FIG. 4, in a specific animated AG media, so that all the first NI levels are copied at the beginning. of the medium AG, in the order of the images Pn, followed by the second levels N2 and third levels N3, in the same order.
• the set of first levels Pn: N1 are read before the second Pn: N2, then the third Pn: N3.
• FIGS. 5 and 6 This reading mode is represented in FIGS. 5 and 6.
• the animation A can be played as in FIG. 6, the first two images PI, P2 being played in their intermediate resolution, corresponding to the details of the second level N2, the following images P3-P5 are played in their lowest resolution, corresponding to the details of their respective first NI level.
• At least one image Pn can be compressed according to the wavelet method.
• Wavelet-based compression methods are particularly effective at compressing "natural" images such as photographs.
• images compressed using a wavelet-based method generally have several levels that can be organized within a medium according to the invention.
• At least one image of the medium is encoded according to a method based on differences between the values of the adjacent pixels.
• Compression methods based on differences between adjacent pixels are generally particularly effective in compressing high contrast synthetic images.
• An image compressed using a method based on differences between the values of the adjacent pixels may comprise several successive levels, if the levels represent subsets of increasing size of the pixels of the image, and if the pixels of a level are encoded at least in part from differences with respect to the pixels of the previous levels. We then have several successive levels that can for example be organized according to one of the embodiments described in Figures 3 and 4.
• at least two images are compressed according to two different compression methods. For example, at least one first image may be compressed according to a compression method comprising a wavelet transform, and at least one second image may be compressed according to a compression method comprising a difference between two adjacent pixels.
• low-contrast images may be encoded using the wavelet transform method, and the contrast images may be encoded using the method including differences between two adjacent pixels.
• a method of creating a multipage animation includes a step of detecting the image type in order to apply the most appropriate compression method.
• the media according to the invention may contain header information indicating, for each image, the compression method having been used.
• Means and steps can be provided for changing the display timing of the media when writing and / or playing the media, in order to be able to use slow motion effects, i.e. idle, or acceleration, or by restoring all or part of each image as soon as the user or an application requires it.
• the animated media AG can be used as a directory of images P1-P5.
• the lower levels NI or intermediate N2 can be used to be displayed as icons, and a user having chosen a picture Pn among the pictures P1-P5, only the image Pn will be completely read and decompressed to be displayed in a fixed manner in its higher resolution, from the information corresponding to the third level Pn: N3.
• such a medium is used for shooting several continuous images in burst.
• This capture can be done via a camera / camera, or from successive screenshots.
• it is compressed and stored in several levels.
• the user selects, from the stored images, those that he wishes to transform into an animated image. This selection can relate to all the images, every other image, the second half of the images, etc.
• the user can associate a playback speed with this medium, which can correspond to the capture speed, but also at a faster or slower speed to create "slow motion" or acceleration effects.
• the application then creates, from the compressed images, an image media organized by levels, such as the animated media AG of FIG. 4.
• An image extracted from the media can also be stored independently, in the form of a media containing a single image. , fixed.
• the invention is not limited to the examples which have just been described.
• the number of levels is not limited to 3, it can be 2 or 4 or more than 4; thus, one can thanks to the method according to the invention, display quickly - - images of a size progressively much larger than those generally used in the GIF, in particular by increasing the number of levels.
• the invention therefore proposes methods for compressing and decompressing moving images using scalability. These methods allow the animation receiver to display it from data that has already arrived, without necessarily having received everything.

Landscapes

• Engineering & Computer Science (AREA)
• Multimedia (AREA)
• Signal Processing (AREA)
• Physics & Mathematics (AREA)
• General Physics & Mathematics (AREA)
• Theoretical Computer Science (AREA)
• Discrete Mathematics (AREA)
• Compression Or Coding Systems Of Tv Signals (AREA)
• Processing Or Creating Images (AREA)
• Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
• Compression Of Band Width Or Redundancy In Fax (AREA)

Applications Claiming Priority (1)

Publications (1)

Family

ID=54106389

Family Applications (1)

Country Status (4)

Families Citing this family (31)

Family Cites Families (15)

• 2014
  • 2014-11-05 JP JP2017523955A patent/JP6590925B2/ja not_active Expired - Fee Related
  • 2014-11-05 WO PCT/FR2014/000237 patent/WO2016071577A1/fr active Application Filing
  • 2014-11-05 EP EP14885847.5A patent/EP3216219A1/de not_active Ceased
  • 2014-11-05 US US15/524,199 patent/US11195317B2/en active Active

Non-Patent Citations (2)

Also Published As

Similar Documents

Legal Events