FR2761554A1 - Image data compression and decompression method - Google Patents

Abstract

The method involves, for each elementary subset which does not have the minimum dimension, an iteration of a sequence of steps having a division suitability estimation step during which a suitability for division of the elementary subset is estimated. The suitability estimate does not meet predetermined so-called "quality" criteria, a step of "supplementary partitioning" of the subset into so-called "intermediate" elementary subsets (Ki). A "construction" step in which, for each elementary subset resulting from the last partitioning step, n working subsets (Li) are considered, n being non-zero, and an elementary mapping of the n working subsets in the elementary subset under consideration is constructed by determining the parameters (ai, b) of the elementary mapping so as to make contractive a so-called "first type" global mapping. For the set of data, the global mapping belongs to the group of mappings composed of multidimensional mappings and non-linear mappings. The restrictions of the global mapping to the elementary subsets being composed of the elementary mappings. The fixed point of the global mapping constitutes an approximation of all or part of this set, allow the use of a method of successive approximations (407-410) converging towards the fixed point of the global contractive mapping. The set of parameters determined, and, when a supplementary partitioning step has taken place, so-called "partitioning" information, representing each the supplementary partitioning, jointly constitutes a primary representation of the set of data.

Description

The present invention is of a general nature, the method and

  a device for data processing, including representation, generation, restoration, regeneration or processing

Iterative data.

  More particularly, the present invention is directed to transmission (ie, remote representation) of the storage (i.e. representation in a memory) of data, with or without compression thereof. These data can advantageously be constituted by the digital or analog data of an image or sequence of irrigations, tl / uu numerical or analogical data rclativcs a sound (music, speech, etc.), and / or digital data. or analogical signals .. a.Signal mono or multidimensional any. More generally, the present invention

  aims at the representation of any mono or multidimensional data.

  Before explaining the objectives and means of the invention, the following definitions are proposed: "Data set": any set of data representing physical quantities (most often voltage levels) that can be presented themselves other physically measurable or measurable quantities. In preferred applications, the concerned dnnneq sets are images. sound or mono or multidimensional signals, etc ... In the application concerning the image processing, we sometimes aim the "image" instead of the "dataset" relating to the image. What will be explained below about "images" or "sub-images"

  3 o is respectively applicable to "sets of dornes" or "sub-

  datasets "and vice versa.

  "Data representation": any "processing" of a set of data of a given type, resulting in the perfect or imperfect transformation of said data set, into another type. Example. the data may be constituted by the 256 gray levels of the pixels of an image, their representation consisting of a series of binary words that can be stored or transmitted; reciprocally, the representation of the data constituted by said binary words may consist of their transformation

  to retrieve data of the same type as the original data.

  "Primary representation": by convention, any processing resulting in the transformation of data of a first type to data of a second type. In this case, we will speak of a "primary processing" of the "Secondary Representation" data: by convention, the transformation of data of the second type resulting from a primary treatment. We will speak in

this case of "secondary treatment".

  "Data restitution": special case of a secondary representation in which the data of the second type are transformed into

  data of the first type. This restitution can be perfect or imperfect.

  A "metric space" is a set of elements with a functional distance that is symmetrical, positive and satisfies the triangular inequality. This space is "complete" when it contains all the endpoints of

all the convergent suites.

  A "Lipschitzian application": an application that transforms the points of a metric space into the same space and for which the set of ratios of the distance of two elements transformed by the said

  application. on the distance of the two said elements, is bounded.

  A "contractive application" or "contraction": a Lipschitzian application for which the smallest of the majorities (contraction factor) of said set of ratios is less than unity. However. within the meaning of

  The present invention, are contractive all convergent applications.

  that is to say, having a fixed point (thus allowing the implementation of successive approximations) in a subset of the metric space A "similarity" is a Lipschitzlenne application for which the ratio of the distance of two elements transformed on the distance of said elements is a fixed quantity. A linear similarity is a "similarity". A "contractive similarity" is a Lipschitzian application for which the ratio of the distance of two elements transformed over the distance

  said elements is a fixed quantity strictly less than unity.

  The "fixed point" of a contraction of a complete metric space lo in the same space (or a subset of that space in itself)

  is the only element that is left invariant by said contractive application.

  The "construction" of a contractive application on a set of data consists in constituting a family of contractions able to transform the data and to select the parameters of one of the aforementioned

  contractions to satisfy one or more predetermined conditions.

  The "successive approximation method" makes it possible to approach iteratively as closely as one wishes, the fixed point of a contraction. Starting from an arbitrary element, it applies on the latter said contraction. The same contraction is then applied to the previously obtained transform. By reiterating this process we are approaching

  successively and inevitably from the fixed point of contraction.

  "A better approximation" of an element in a metric space is a point in a subset of candidates, which are themselves points in that space, which minimizes the distance to the element "A good approximation" of an element in a metric space is a point of a subset of that space that is procne with

  a predetermined error of a better predetermined approximation.

  We know, in the state of the art. various methods of

  image representation, with compression, using the so-called "fractal" technique.

  US-A-5,065,447 discloses a method and a device for processing or image storage with compression of data relating to the initial image. In this method, the data relating to the initial image are divided, that is to say that the image is divided into a plurality of sub-elementary images (called "domain blocks"). This method then consists in generating an ordered dictionary of a set of reference image frames (called "range blocks") constituted from image portions of predetermined size having undergone a certain number of predetermined operations such as rotation and reversal. according to various axes of symmetry. Then, for each elementary subimage, a comparison is made with all the reference sub-images of the dictionary and the most similar reference sub-image of the elementary sub-image under consideration is selected in the dictionary. Finally, the method consists in processing or storing parametric information relating to the addresses of the reference sub images selected in the dictionary, to represent

  each of the original elementary subimages.

  It is by this set of operations that the method described in this document makes it possible to obtain a first representation of the image with

data compression.

  To carry out, from said parametric information, the restitution of the initial image, the method and the device described in this document, carry out the following operations: starting from an arbitrary initial image, steps are performed similar to those above, that is to say that one partitions the initial arbitrary image and that one constitutes a dictionary starting from the elementary subimages of this one. However, the dictionary is constituted only partially by performing for each sub-image only the predetermined operation corresponding to the address

  concerned of the dictionary for the position of the sub-image considered.

  The data thus obtained are used to repeat this process until the difference between two images consecutively obtained is less than a predetermined threshold. The image obtained last

  3 C place is then an approximation of the initial image.

  Q This method is interesting theoretically. This major drawback is that it is sometimes difficult to practice industrially with the means known to date. Indeed. each image must give rise to a long analysis with constitution of a particularly important dictionary, the elementary subframes of the image to be stored or transmitted being all compared to each of the reference sub images contained in the dictionary. The inventors, who carried out simulations, have thus found that for some images of average size and resolution (512 x 512 pixels at 3 x 256 color levels) the processing time for the compression was in the order of 1000 to 2000 seconds on a workstation, about half an hour. Such a treatment time is

  obviously prohibitive for almost any industrial application.

  It is known from document WO-A-93/17519. another method and device for processing images with compression of data relating to the initial image. In this method the data relating to the initial image are also partitioned, that is to say that the image is divided into a plurality of sub-elementary images (called "domains"). In this method, a set of fractal transforms linking the subimages is then determined to the set of initial data, that is to say that the initial image is searched for a portion of image similar to the image. considered minimal, so as to minimize the error between the initial data and the approximated data thus obtained. The coefficients of the set of fractal transformations thus made constitute the first representation of the initial image. To realize the restitution of the image, the process and the device described in this document carry out the search for the fixed points of the elementary fractal transformations whose coefficients have been received without however explaining how this research is carried out. The initial image is thus restored by carrying out a collection of the restored sub-images. This method is also interesting from the theoretical point of view. However, the inventors have noted significant degradation of the image.

quality of the rendered image.

  The inventors have sought to develop a method of data processing of the same kind as the processes of the state of the art analyzed above, but having better performance both in terms of the quality of the data returned than in terms of treatment speed. In the course of their research, the inventors discovered that the

  o why the processes described in US-A-5,065,447 and WO-A-

  93/17519 have the aforementioned defects is due to the fact that the two processes involve geometric transformations of portions of images consisting essentially of contractive similarities (construction of

  dictionary in US-A-5,065,447 and fractal transformation in WO-A-

  93/17519). They have in fact been able to highlight that in both cases this is the implementation of an idea widely shared by the person skilled in the art concerned by the fractal compression at the time of filing of the present application, idea according to which the images would, whatever their origin, consist essentially of elements or parts presenting between them

  important degrees of resemblance.

  In fact, the performance of WO-A-93/17519 is very low in terms of the quality of the rendered image because the inventors have discovered that the capabilities of restitution of contractive similarities are very limited contrary to the belief of said men from the date of the filing of the

this request.

  Similarly the performance of US-A-5,065,447 is very limited in terms of processing time. As the restitution capacities of

  contractive similarities are inherently limited, the author of US-A-

  5,065,447 is brought to the realization of a large dictionary which is 3C built on the basis of many sub-image transformations in the process according to US-A-5,065,447: it is indeed to artificially multiply the elements of resemblance, which certainly makes it possible to appreciably improve the quality of the rendered image, but at the expense of the computing time The inventors have therefore sought to produce a method and a device for the processing of data, in particular images. to obtain better performances than the prior art, both in terms of the quality of the data or the rendered image and the speed of calculation, and likely to result in a significant compression of

  data to be transmitted or stored.

  In addition, when, as is commonplace, an image to be processed has substantially uniform ranges and other ranges where at least one of the components varies rapidly from one pixel to another. uniform treatment parameters over the entire image prove to be unsuitable, either because they provide too high quality treatment in the most uniform areas, or because they imply a treatment of too low quality in the most complex areas. The inventors have therefore sought to optimize, depending on the local complexity of the image to be processed. of the

  treatment parameters used locally.

  The methods and devices of the invention solve this problem. In general, the present invention firstly aims at a method of primary processing of a set of data (IM, f) representative of physical quantities, a primary treatment method taking into account a minimum dimension and comprising a step of "initial partition" (204) during which, one partitioned said set of

  data in subsets called "initial elementary" (K,).

  primary treatment method characterized in that it comprises a) for each elementary subset that does not have said minimum dimension, at least one iteration of a sequence of steps comprising: a step of determining criteria known as quality "in which at least one criterion of quality is determined by taking into account the dimension of said elementary subset, - a step of estimating the opportunity of division during

  which an opportunity of dividing the said sub-

  elementary set, and - when the opportunity estimate does not meet the criteria

  of quality, a stage of "complementary partition" of the said sub-

  together in elementary subsets called "intermediate" (K,), l0 b) a "construction" step (205 to 209) in which, for each of the elementary subsets (K,) resulting from the last partition step. we consider n subsets of work (L,), n being nonzero, and we construct a

  elementary application of the n subsets of work in the sub-

  elementary set considered by determining the parameters (a ,, b) of the elementary application so as to: make a global application called "first type" contractive for said set of data, a global application belonging to the group of applications consisting of multidimensional applications and non-linear applications, the restrictions of the global application to the elementary subsets (K,) being constituted of said elementary applications, the fixed point of the global application constituting an approximation of all or part of this set, to allow the implementation of a method of successive approximations (407 to 410) converging towards the fixed point of said global contractive application; the set of parameters (a ,, b) thus determined, as well as. when at least one complementary partitioning step has taken place, a so-called "partition" information representative of each said complementary partition. together constituting a primary representation of said data set In a general manner, the present invention then aims at a primary processing device of a set of data representative of physical quantities, characterized in that it comprises - input means of data to be processed; means for outputting parameters and partition information; first logical means for transforming the data to be processed into parameters and partition information; said first logical means comprising: - "partition" means adapted to partition said set of data into "elementary subsets" of so-called "quality" criterion determining means adapted to determine at least one quality criterion taking into account account the dimension of an elementary subset and - means of "estimation" adapted, for each elementary subset that does not have said minimum dimension, to estimate an opportunity of division of said elementary subset, said means of partition being, furthermore, adapted to partition each elementary subset that does not have said minimum dimension and whose division opportunity estimate does not meet the quality criteria, in subsets called "intermediate elementary" and - suitable "construction" means: to construct a so-called "first type" overall contractive application whose fixed point constitutes an approximate imation of all or part of this set of data, by determining the parameters of each elementary application of n work subsets associated with each elementary subset resulting from the last partition, in said elementary subset, n being non-zero . since the restrictions of the global application to the elementary subsets consist of said elementary applications, said global application belonging to the group of applications constitutes multidimensional applications and non-linear applications. to allow the implementation of a method of successive approximations converging towards the fixed point of said global contractive application; 5. delivering on the output means the parameters thus determined, and, when at least one elementary subset has been partitioned, a so-called "partition" information representative of each said complementary partition, jointly constituting a

  primary representation of said data set.

  With these features, the present invention achieves the objectives

outlined above.

  It should be noted first of all that it has been discovered that. in a general manner, in accordance with the invention, in order to process, and in particular to represent, a set of initial data representative of physical quantities, in particular with compression of said initial data, it suffices to construct, by appropriate means, a global contractive application. ,

acting on said data.

  Another important feature of the invention resides in the fact that in order to construct said global contractive application it is necessary to implement at least one application belonging to the group of applications consisting of multidimensional applications and non-linear applications. In doing so, we exclude any recourse to mathematical transformations belonging to the class of contractive similarities. what

  avoids the disadvantages noted above.

  However, to build said global contractive application acting on the data. the person skilled in the art has at his disposal a very wide range of mathematical tools in which he can draw. He can therefore choose among those tools those which are most favorable to performance, for example in conjunction with the type of data at 3. o represent or the particular application targeted. Such a possibility does not exist

  in the state of the art analyzed above and proves very advantageous.

  for example, in the case of a local processing of the image. by partition of the latter into sub-elementary images, the skilled person can choose. for

  local processing, applications that are not necessarily contractive.

  which gives him an important choice in the possibilities of local treatment of the image and thus leaves him a great freedom. In particular, it will be able to choose at the local level Lipschitzian applications which will enable it to facilitate the

  implementation of the contractive nature of the global application.

  Moreover, the implementation of a method of successive approximations, leaves the skilled person the freedom to choose the final difference between

  0 said fixed point and the data thus restored or generated.

  The estimation step allows the device to estimate or measure the local complexity of the data set in the elementary subset, and the complexity of the processing to be applied thereto. A division opportunity being estimated, it is checked during the estimation step if this opportunity meets criteria called "quality", which are functions of the dimensions of the elementary subset considered. When the division opportunity meets these criteria, which generally means that the local complexity of the data set can be processed correctly without further splitting, no splitting is performed on the elementary subset. On the other hand, when the division opportunity does not meet the said criteria, this generally means that the local complexity is greater than what can be correctly handled without complementary division, a complementary partitioning step is performed, the elementary subsets resulting from this partition being treated at their

tower.

  The method of the invention is thus adaptive according to the values of the data set, which makes it possible to deal with more than

  finesse the local variations between these data.

  Indeed, it will first be noted that the method and the device allow a representation of a set of data. especially those related to an image, with the event of significant compression In addition. considering the number of successive partitions defining an elementary subset and constructing each elementary application considered from work subsets, the quality of the restitution is significantly improved, and this insofar as the number of partitions is high. Of course, the calculation time increases with the

  number of additional partitions used to define each

  elementary sets but this computation time, even for a relatively large number, is well below the computational time associated with constructing a dictionary and analyzing the image on the basis described in the document

US-A-5,065,447.

  Moreover, by avoiding the constitution of a dictionary and the long analysis described in US-A-5.065.447, and thanks to the features of the present invention, the processing of an image is significantly accelerated compared to the US document. supra. By implementing their preferred embodiment, the inventors have found that for an image of 512 x 512 pixels at 3 x 256 color levels. the processing time, was of the order of less than 100 seconds on a workstation: they also have every reason to believe that improvements made to the method and device succinctly defined above, will make it possible to obtain

  Improved performance in speed.

  It should also be noted that since the elementary applications constructed belong to the group of applications consisting of multidimensional applications and nonlinear applications, applications belonging to the class of similarities are avoided, with the advantages observed above. in the primary treatment method as succinctly set forth above. for at least one iteration of said sequence of steps, the opportunity estimate determined during the opportunity estimation step consists of a measurement of a predetermined statistical magnitude applied to the data of the elementary 32e subset considered. Preferably, the measured statistical magnitude is

  the variance of the elementary subset considered.

  Correlatively, according to particular features, in the primary treatment device as succinctly set forth above. the estimation means are adapted to measure a predetermined statistical magnitude applied to the data of the elementary subset considered. Preferably, the measured statistical magnitude is the variance

  of the elementary subset considered.

  Thanks to each of these provisions, the determination of the opportunity estimate is easy and, preferably, it does not implement

  as functions of addition, multiplication and division.

  According to other particular features, at least one iteration of said sequence of steps is carried out after a construction step, the opportunity estimation step comprising an operation of measuring a difference between, on the one hand, the data of the elementary subset and, on the other hand, the restriction of the overall contractive application in construction to the elementary subset considered, and, when a complementary partitioning step of the elementary subset is performed, it is followed by a new construction step taking into account said complementary partition. Preferably, the difference measurement operation,

  consists of a distance measurement operation.

  Correlatively, according to particular features of the primary treatment device as succinctly set forth above: the construction means having constructed a contractive application

  overall, the estimation means are adapted to measure a difference between.

  on the one hand, the data of the elementary subset and, on the other hand. the

  restriction of the overall contractive application under construction to the sub-

  elementary set considered, and in that - when the partition means perform a complementary partition the construction means are adapted to construct a new global contractive application by taking into account said complementary partition Preferably, to measure said difference, the estimation means

  take into account a measure of distance.

  Thanks to these provisions, it is the adaptation of the overall contractive application to the data of the elementary subset considered that is estimated, which better reflects the result to expect from a treatment of

  the primary representation determined according to the invention.

  According to particular features of the primary treatment method as succinctly set forth above. the quality criteria consist in that the said measurement is less than a value whose determination during the criterion determination step takes into account

  the dimension of the elementary subset considered. Preferably, said value decreases with said dimension of the considered subset.

  Correlatively, according to particular characteristics of the primary treatment device as briefly described above, the estimation means are adapted to compare said measurement with a value whose determination by the crintère determination means takes into account the size of the sub - elementary set considers. to determine if the quality criteria are met. Preferably, the determination means are adapted so that said value decreases with said dimension of the subset considered and in that the estimation means are adapted to determine that the opportunity estimate meets the predetermined quality criteria when said measure is less than

said value.

  Thanks to these provisions, the application of the quality criteria is

particularly simple.

  According to another of its aspects, the present invention aims at a method of secondary processing of a set of parameters associated with at least one partition information, resulting from a preliminary processing of a first set of data, a secondary treatment method characterized by in that it comprises: a step of determining dimensions of elementary subsets constituting a partition of a second set of data. taking step

  account the presence of partition information corresponding to the said sub-

  sets. each elementary application corresponding to an elementary subset being determined by at least one parameter of the set of parameters. and an "iterative calculation" step during which, from said set of parameters and said dimensions, a method of successive approximations converging towards the fixed point of a set point is implemented on the second set of data. overall contractive application called "second type", the restrictions of the global application to the elementary subsets being constituted of said elementary applications, by implementing, for this purpose, at least one application belonging to the application group consisting of applications multidimensional and

non-linear applications.

  Correlatively, in another of its aspects, the present invention is directed to a secondary data processing device suitable for the secondary processing of a set of parameters associated with at least one partition information, resulting from the primary processing of initial data carried out by a primary treatment device. characterized in that it comprises: input means of the parameters and partition information; data output means; second logical means for transforming the parameters and partition information into data said second logic means comprising: means for "determining" dimensions adapted to determine dimensions of elementary subsets constituting a partition of a second set of data, taking into account the presence of partition information corresponding to said subsets, each elementary application corresponding to an elementary subset being determined by at least one parameter of said set of parameters, and adapted "iterative computation" means to implement, from said set of parameters and said dimensions, a method of successive approximations converging towards the fixed point of a global contractive application called "second type" comprising said elementary applications, by implementing, for this purpose, do, at least one application belonging to the application group const multidimensional applications and non-linear applications, said fixed point constituting a secondary representation of said set of initial data, and delivering the data thus calculated on the means

Release.

  With these provisions, it is possible to perform a secondary processing of a set of data comprising a set of parameters resulting from the primary processing of initial data in a relatively simple manner since it suffices to implement a method of successive approximations, in itself - even known, converging towards the fixed point of a global contractive application. The convergence process thus implemented makes it possible to approach a representation of the initial data set. One can, advantageously, set an error threshold, from which it will be considered that the precision required for the representation of the whole

initial data is reached.

  In the hypothesis, implemented in the preferred embodiment, the overall contractive application used during the primary treatment and the overall contractive application used during the secondary treatment are identical. the representation of the set of initial data which results after the secondary processing is actually a restitution of said initial data, with, if necessary, the predetermined error mentioned above. Thus, if the initial data set is relative to an image, the primary processing makes it possible to transform and / or compress this data, for example for storage or transmission, and the

  ; secondary treatment can restore them.

  In the hypothesis that the general contractive application implemented during the primary treatment and the overall contractive application implemented during the secondary treatment are of different types, the secondary representation no longer constitutes a restitution of the initial data but constitutes in reality a transformation of these. This will be the case for example when an initial image in color has been the subject of a primary treatment and it is then represented by an image at a level of grins: in both cases it is indeed the same image, however the data relating to the image obtained at the end of the secondary treatment are no longer of the same type

i0 that the initial data.

  Thanks to these provisions, the successive approximation method used for the secondary treatment is implemented in a particularly simple manner from the parameters obtained at the end of the primary treatment. The inventors have been able to observe, in the field of image processing with compression, the performances both in terms of the quality of

  the restored image than that of the processing speed recalled above.

  The advantages outlined above above with regard to supplementary partitions relate, in a similar way. the quality of the secondary processing, the partition information allowing to reconstitute the elementary subsets of different dimensions used during

primary treatment.

  Another aspect of the invention combines, within one and the same treatment method, a primary treatment phase and a secondary treatment phase. These provisions may be particularly advantageous in the case where it is desired to transform data of one type into data of another type. Thus, for example in some image processing applications, it may be useful to be able to transform a

  color image into a grayscale image. According to this aspect of in. ention.

  such a transformation will consist, on the one hand, in a primary treatment of the color image, followed (immediately or not) by a secondary treatment. parameters thus obtained, during which a so-called "second type" global contractive application (different from the overall contractive application minse implemented during the primary treatment) will be implemented so as to restore a different type of image, in the example cited, a level image of

  Grey. This is an example of "complex processing".

  The invention also relates to a printer, a photocopier. a camera and a facsimile device having a device

  treatment as succinctly set forth above.

  The invention also aims at a memory that keeps.

  parameters and partition information resulting from a primary treatment as briefly described above and instructions for a software allowing the implementation of a method of

  secondary treatment as succinctly set forth above.

  The advantages of these devices and memory being identical to

  those who are exposed above, they are not remembered here.

  L5 Characteristics, advantages and other objects of the invention

  will also be apparent from the description of the attached drawings in which:

  FIG. 1 schematically illustrates a partition of an image of 512 × 512 pixels in elementary subsets, consisting of squares of 32 × 32 pixels; FIG. 2 schematically illustrates a division of an image of 512 × 512 pixels in a slate covering. made up of squares of 32 x 32 pixels, offset horizontally and vertically by 16 pixels,

  FIG. 3 schematically illustrates the arrangement of a subset

  elementary set K, and its four subsets of work l-. 1. -, I / and L, which, in a first embodiment of the invention. are of identical size to that of the elementary subset K and shift in both directions, with respect to said elementary subset. in a predetermined manner, FIG. 3A is similar to FIG. 3 and schematic diagram illustrating a second embodiment. preferred embodiment of the invention. in

  which the arrangement of an elementary subset K, and its four subsets

  work sets L1, L2, L3 and L4, each dimension of which is twice that of the associated elementary subset K, and which is shifted in both directions, with respect to said elementary subset, in a predetermined manner; FIG. 4 is a simplified block diagram of a particular embodiment of

  realization of the primary processing device of a set of data.

  FIG. 5 is a block diagram of a device implementing the device of FIG. 4; FIG. 6 is a simplified block diagram of a particular embodiment of FIG.

  performing the secondary processing device of a set of data.

  FIG. 7 is a block diagram of a device implementing the device of FIG. 6; FIG. 8 is a block diagram of a primary treatment and secondary treatment device; FIG. is a block diagram of another primary processing device and secondary processing, - Figure 9A is a simplified block diagram of a particular embodiment of the processing device of Figure 9, - Figure 10 is a flowchart simplified compression of a 512 x 512 pixel color image implemented in the device of Figures 4, 9 and 9A, - Figures 11, 12, 12A, 12B, 13, 14 and 15 are flow charts illustrating certain operations of the flowchart of the figure, - Figure 16 is a simplified flowchart of decompression

  a color image implemented in the device of Figures 3. 9 and 9A.

2761554

  Fig. 16A is a flowchart illustrating an operation of the flowchart of Fig. 16; Figs. 17, 17A and 17B are flow charts illustrating an operation of the flowchart of Fig. 1b, bS; Fig. 18 is a flowchart of Figs. a program of

  uurifiyurutiui mi i work in the device of Figure 9A.

  FIGS. 19 and 20 are due to the embodiments illustrating certain operations of the flowchart of FIG. 10 and one of its variants, and FIG. 21A is a representation of a succession of partitions of elementary subsets, FIG. 21B is a structure representation of partition information and parameters representing this succession of partitions and - FIG. 21C is a representation of the organization of partitions.

  parameters and partition information resulting from primire processing.

  This description is divided into five parts:

  - the first part deals with the general description of the process.

  This part is divided into three sections: The first section deals with the general theory underlying the invention. It sets out the mathematical concepts which generally underlie the invention as it can be understood in its most general terms; the second section, in particular with the aid of FIGS. 1 to 3, shows certain particular characteristics of the first embodiment of the method allowing the primary processing of the data of an image of 512 × 512 pixels resulting in the compression of that -this. This section explains more particularly the structure of the multi-dimensional application chosen in this particular mode of implementation and the means allowing to

  calculate the coefficients of this application.

  the third section describes the particular characteristics of the first embodiment of the method of secondary representation of the data of the image, and in particular the restitution of the data thereof from the compressed data obtained at the end of an image. primary treatment This section discusses the approximation method

  successive implementation here to do this.

  - the second part relates to the description of a first mode of

  realization of a treatment device and it is divided into six sections:

  ò the first section relates to the description of a treatment device

  The first part of a data set, the second section, relates to a secondary processing device of a set of parameters resulting from the primary processing of initial data. Such a device makes it possible, for example, to restore the compressed image by the primary treatment device,

  ò the third section relates to the description of a device incorporating both

  a primary treatment device and a secondary treatment device,

  the fourth section deals with the description of a particular organizational chart of

  compression of a color image of 512 x 512 pixels implemented

  in the logic means that comprises the primary treatment device.

  ò the fifth section relates to the description of two embodiments

  a decompression flowchart implemented in the logic means included in the secondary processing device, and

  * the sixth section deals with the description of the organization chart of the program

  configuration of the device incorporating a primary treatment device

  and a secondary treatment device.

  - the third part deals with the description of the mode of

  preferred embodiment, implementing work subsets having a size different from that of the corresponding elementary subset. In this part, it is only described the modifications that

  are made to the embodiment described in the second part.

  in the fourth part, an embodiment variant is described, one of which implements a global contractive application 3 composed of non-linear applications. In this fourth part only the modified elements are exposed with respect to those of the embodiment described in the second part; and in the fifth part, there is described an alternative embodiment. implementing a measured quality criterion with the help of the overall contractive application.

  1. General description of the process

  The method as implemented in the first embodiment of the present invention will now be described in support of FIGS.

  invention. This description will be made in support of the above figures and a

  number of mathematical concepts belonging generally to the theory of analysis and more particularly to those of the

  topology and functional analysis.

  In this particular embodiment, it is proposed to compress the data relating to an image, to arrive at a "primary representation" thereof, and then to restore the initial data, that is to say to perform a "representation". secondary "compressed data to obtain a set of data of the same type as the initial data with a predetermined maximum deviation between data as well as

  2 c restitutions and initial data.

  To fix the ideas, here is considered a color image of 512 x 512 pixels with three components, one of luminance and two of chrominance, each having 256 levels. In general, such a color image is captured in the form of three components relating to the three fundamental colors, red, green and blue, and then converted, using conversion matrices well known to those skilled in the art, into components.

luminance and chrominance.

  This digital image requires 512 x 512 x 24 bits to store either, without data compression, 6 Mbit. In order to measure the difference between the initial image and the restored image, it is considered the square root this average quadratic deviation, averaged over all the pixels and all the components (classically RMSE rating). The effectiveness of a compression algorithm is expressed by the link between the compression ratio obtained for a tRMSE 'difference. The particular embodiment described here makes it possible to obtain the following efficiency.

Table 1

  Number of iterations at RMSE bits / pixel decompression

- 7 7 - 15 0.75

-8 5 - 10 1.50

6-8 4 - 8 2.25

7-9 3 - 7 3.00

7 - 10 2 - 5 4.50

  General theory behind the invention

  The representation of a set of data, representing

  even physical quantities, such as the data relating to the image described above, especially when it is desired to compress these data on the occasion of said representation, can be analyzed as an approximation

of all the data.

  The invention proceeds from the demonstration by the inventors. because the fixed point theory can be used to make such an approximation. It is considered that the approximation of a set of initial data is an operation consisting in searching in a family of 2 3 candidates for the representation, the candidate (s) which minimizes (s) a predetermined crinter. Most often, the criterion is expressed by a distance between two elements of a metric space, which can be expressed by the following equation

24 2761554

  d: (g, h) e Ex E -> d (g, h) (1) r OR: - d is the distance function, - E is a metric space, - R is the set of positive reals or zero. - g, h are elements of the metric space E, that is to say of the space which contains all the applications of a given domain of definition

  Q! _ Xq in a field of application Rd.

  The data to be processed are applications of S; c- sI in Kd.

  g. (, y) t n _ 0> g; X, y) E R U md and md follows product spaces of R of a given number (n or d) of

  dimensions. The dataset to be processed is a given E space.

  It will be noted that, for example, in the context of a 512 x 512 color image at 3 x 256 levels of each three components, the data i5 of the initial image are constituted by a correspondence table which at each position (xy) of Pixel in the definition range [0.511] x [0, 511] associates three positive values of chrominance, Y, chrominance, chrominance, and blue chrominance, Cb, between 0 and 255. It can be seen that these data of the initial image actually constitute an application f eE of a domain of the space R2 in a domain of the space R3 g: (x, y) E [0.51 1] x [o, 5 1] c R [0o, 255] 1 c R The problem of the approximation of a set of data to be treated f EE thus consists in looking in a family of candidates for the representation G c E the candidate (s) g * in G that minimize the distance (1). This is expressed by the following equation: ## EQU1 ## These candidates belong to the set P'G (f) = Jg * eG d (f, g *) = infjd (f, g2ge, '(2) o: - PG is the metric projection operator,

  - inf {...} is the largest of the minor in the set considered {...}.

  In the following, it is assumed that the metric space is complete, which guarantees the existence of a single fixed point for each contraction of

the metric space in itself.

  The inventors have shown that candidates for representation can be defined as fixed points relating to contractions, a family of contractions being jointly determined. Under these conditions, the search for the best approximation amounts to determining the fixed point relating to the contraction minimizing said predetermined error criterion.

in this family of contractions.

  These conditions can be expressed thus: a * E (X): d (f, a *) <d (f, a), Va E5 (X) (3) oc (.) Is the extension to a subset of contractions X. (Xc ().% V (E)) of the connection existing between a contraction and its fixed point. This mathematical relationship can be expressed as fy: T e CON (E) -> te E (4) ot is the fixed point of the contraction T (T (t) = t), ('ON (E ) The set of contractions of E. The problem of approximation can, under these conditions, be reformulated as follows: it is a question of looking for the contraction whose fixed point

  is the best approximation of the initial data.

  It will be observed that, in so doing, the inventors have moved the problem to be solved since it is no longer a question of seeking a candidate constituting in itself a better approximation but a

  contraction whose fixed point constitutes the best approximation.

  This can be expressed by the inequation:? T 'E X: d (Q ((T')) <d (', (T)) V Te A.' (5)

  o A ', is a subset of contractions of E (X c (C' (\).

  The inventors have thus demonstrated that, in accordance with the general method discovered by them, the essential step to arrive at a representation of data to be processed, especially in the context of data compression, consists in: - constituting a family of contractions capable of transforming the data, and - selecting the parameters of one of said contractions in order to satisfy one or more predetermined conditions, in this case minimizing the distance between the initial data and the fixed point constituting the best

  approximation of said initial data.

  This is, according to the invention, a step of

  "construction" of the global contractive application.

  Then, in accordance with the invention, the parameters thus determined must make it possible, for the restitution of the initial set of data, to implement a method of successive approximations converging towards the fixed point of said globular contractive transform representative of said set of initial data, which allows for the reasons explained above to restore with the best approximation

dataset to process.

  It will be observed that for the implementation of the general method according to the invention, and in particular in the step of constructing the overall contractive application, the skilled person has, to constitute the family of contractions capable of transforming the data, a wide range of mathematical application choices in the application group consisting of multidimensional applications and nonlinear applications. In the embodiment described hereinafter, the overall contraction will be piecewise constructed, and for each piece a specific multidimensional linear application will be used. It could use other applications, for example non-linear applications. The general method, a particular embodiment of which will be described in detail below, thus makes it possible to

  many possibilities of data processing, in order to represent them.

  We will now describe the means used in the mode

  particular embodiment to construct the overall contractive application.

  The inventors have shown that in order to find a contraction whose fixed point constitutes the best approximation of the

  initial data, it was first necessary to search for a constituent candidate

  even a good approximation, which is a practical approach to

solve such a problem.

* The inventors have shown that the practical approach can be to find the contraction that minimizes the distance between the initial and transformed data, taking into account a factor of

estimated contraction.

  This reformulation of the problem to be solved can be expressed by the following main optimization problem:

28 2761554

  ? T e X;) = min df T (f) TX (6) 1 cn (ij) = con (T)) E o con (D) is the contraction factor of the contractive application T. $ As, in reality, it is sometimes difficult to find the contraction factor of the overall application, the inventors have found that, in these hypotheses, we can simply solve a simplified optimization problem under which we must find a global contraction that minimizes the distance between the initial data and their transform. We will observe here

  that the factor 1 / I-con (T) is no longer taken into account.

  This simplified optimization problem is expressed as follows: T E X: d (f, T (f)) = min {d (f, T (f)) T E X}. (7)

  First mode of primary processing of image data.

  According to an important feature of one of the aspects of the invention as implemented here, the overall contraction is constructed in pieces. To do this, a "partitioning" step is performed of all the data relating to the image, during which said partition is partitioned

  set in m "elementary subsets".

  In the particular embodiment which relates to the treatment

  In Ireland, as a general rule, we partition the initial image, in m sub-

  elementary images, also called "elementary subsets"

  for the sake of clarity of the description.

  It will be recalled here that in a general way a "partition" of the metric space 52, amounts to defining the set T - iK ,, .... ', or

  A, A ',,, are subsets defined in said metric space ú_2.

  must meet the following four conditions: 1) the K subsets must be closed, which is expressed by

D = = 1 K ,, i = 1, .... m.

  2) none of the subsets K, can have an empty interior.

  what is expressed by: intK, = 0, i = 1 .... i.

  3) their union must produce the closure of the metric space ú2 considered, which is expressed by: adhQ = UK, 1cC 4) the interiors of each subset K must be disjoint two by two, which is expressed by

  int K, c int K ', = 0 i.j = l ..., n, i j. It will be noted here also that the partition of an initial datum of a type

  given (, 'g eE) returns, in a general way to define a restriction -5.g. K- for each subset Ki of the partition T. This characteristic allows, advantageously. to facilitate the work of constructing the global contraction, by bringing this work back to that of finding elementary mathematical transformations whose object is

  each to allow the restitution of the elementary subset A ',. Indeed.

  2C by definition, the subsets of data have less data than the initial set, and therefore it is much easier to find mathematical transformations to restore these data, again being specified that the set of mathematical transformations must, at the level of the entire image. constitute a

2-: global contractive application.

  Consequently, the global contractive application i is thus constructed per piece, each piece being, in accordance with this aspect of

  the invention, a Lipstchizian application.

  It will be observed here, moreover, that these elementary Lipstchizean applications are not necessarily contractive, and that at this level also, thanks to the invention, the person skilled in the art has at his disposal a wide range of mathematical applications to him. to process subset data. Note however that in some cases, there will be no need to proceed to this partition, for example when the image gives rise to a

simple geometric structure.

  According to the aspect of the invention described here, for each of the

  o10 elementary sets (KI, ..., Km), we consider n subsets of work (n = 4 in this embodiment). For each of the m elementary subassemblies made during the partition, the basic Lipstchizian application is constructed from these n work subsets. In order to be able to consider the n subsets of work related to each of the m elementary subsets, we will realize a "division"

  of the initial data set.

  This division. = {L, L, c Q, j 1, of the data set, which is defined in the metric space Q, must meet the following three conditions: 1) the subsets Lj must be closed, which is expresses by: Lj = adh Lj, j = 1, .... 1 2) None of the subsets Lj can have an empty interior

which expresses: int L, Qj =, .... 1.

  3) Their union is included in the metric space.Q, which is expressed by U LJ c E2 / = 1 3 31 It is observed at this stage that the division thus made includes a

  share. partitions, as defined above. but also encompasses.

  on the other hand, what will be called a "slate recovery" for which the subsets L, are likely to overlap, which is expressed by the equation int In the first embodiment, the image of 512 x 512 pixels is, according to an initial partition, partitioned into 256 subassemblies.

  elementary squares of 32 x 32 pixels (see Figure 1).

  According to a habit in the field of image processing, the data is organized as follows: the coordinate reference point (0.0) is constituted by the point at the bottom left of the image; the columns (abscissa x) are numbered from left to right

  15. - the lines (y-ordinate) are numbered from bottom to top.

  In Figure 1 is shown schematically in the ordinate the rank of some lines of the image and the abscissa the rank of some columns. For reasons of clarity, the scale used on the abscissa and the ordinate axis is not uniform. On the bottom left of the 2c Figure 1 the first 9 squares of 32 x 32 pixels are illustrated, so as to highlight the rows and columns constituting the border of the latter. The 32 x 32 pixel squares are an example of a domain partition

  2 = [0.511] x [0.511] where the image considered is defined.

  In the first embodiment, the division of the 512 x 512 pixel image into working subassemblies is illustrated in FIG. 2. It is similar to the partition of FIG. 1, except that the subassemblies of FIG. x 32 pixels are shifted by 16 pixels in both directions. and in each direction of movement, with respect to the elementary subsets. In this figure, which illustrates the lower left corner of the s mage, 512 x 512 pixels, the elementary subsets resulting from the partition are shown in bold lines while the subsets of work resulting from the

  division are shown in dotted lines and are hatched.

  In FIG. 2, the work subsets affecting the edges of the image have not been shown. Many solutions exist to provide each elemental subset that is not associated with sub-subsets.

  sets of work integrally inside the initial image. sub-

  substitution work sets.

  It is noted here that throughout the rest of the description, the choice

  of such a solution is applied, as well to the work sub-sets for the primary treatment, for the secondary treatment and for the complex treatment: the points of the subsets of work defined above which do not belong to the image, that is to say those whose at least one coordinate is negative, are fictitiously associated with an average value, for example 127 for the luminance component and the possible

chrominance components.

  Figure 3 illustrates how in this first embodiment.

  each subset of work L is bound to a given elemental subset K. The elementary subset K, having coordinates (v.) Is shown in bold lines, while the corresponding work subsets are shown in dashed lines, the other subassemblies being outlined in fine lines. It is observed that in this first embodiment. to each of

  K subsets, are linked four subsets of work 1. (nurnmerotes I ...

  L,) shifted by 16 pixels in both directions. It is actually the four subsets from the division that cover the elementary subset considered (from the partition). The expressions below show the coordinates of a subset K, and subsets of

work L,! L ,.

  K ,: [x, + 311 x l ..., 3- / 1? -; I1, '[x, - (6.x, + 151x [i, - + 1b, i.4-I L2: [x + 6, x, + 6 ,, - 47] x D,' 16, yi + 47] 1.3 Lx, -16, x, + 5] x [y, - / 5 ,, + 151 [4: [x, + 10, xx, + 47J x lv, - 16, yi - 15 1 It will be noted In this first embodiment, the subsets resulting from the division have the same characteristics as those resulting from the partition, and in the first embodiment the division of the image into sub-work sets. does not constitute a slate recovery but a simple partition Pn riisnn dcii so that the lo subsets of work have a size identical to the subsets and the offset, between a subset of work and the subset The corresponding elementary element is equal to one-half of the square subsets considered, and in particular a further preferred embodiment will be described in particular in accordance with Fig. 3A in which according to another aspect of the invention , the work subassemblies present a size different from that of the elementary subset to which they correspond, the division of the image thus resulting in a slate covering We will now detinir the global application used in the

  Particuller mode of réallsation described in the appul of Figures 2 and 3.

  We first recall that the global contractive application consists of taking an element g from the metric space R to transform it into an element T (g) of the mêco mospheric membrane E co which is expressed by T: g R - T (g) K (8) The belonging of g to the space E (^ L :: L) can also be expressed in the following way: Cg: (x, y) r Q c. R. ' - + g (x, y) = R. ' (9) It is observed that equation (9) only explains the type of special data considered: for each pair of values (.cl, taken in the domain of definition (in this case the plane image r2 c; -) corresponds to a value in the range R'i, that is to say three values among 256 levels of the three components, Y, Cr and Cb. Adler will be observed that in the case of image processing, the definition domain is - while the field of application is R3 since the color image has three components.

  of luminance and two of chrominance.

  In the particular embodiment of FIGS. 2 and 3 described above,

  after and in accordance with another aspect of the invention, each "piece" of the global contractive application, i.e., a Lipschitzian elementary application, is a multilinear application of the type T () À À x,) [ r))] (x .. = a ,, Ki. (il, '(10) -I or: T (, g) JK, the restriction of T (g) to the elementary subset / its dimension of the multilinear application ,, .. a, the multiplicative coefficients the translation factor L / .L ,, the working subassemblies, with predetermined position by

  report to k, and linked to this subset.

  Thus, in the example of FIG. 3, the values of coordinate pixels (xv) are transformed as follows [7 (r) (x.) A1 (x - / 1 + I)

a ^ Sr (v + I, Iy 6 Io) -

  ,, r (x - 16 - 16) + g14. X (v + I6, y-16) -h (1 Obls) o O: g (x, yX) is the value of the pixel (x, y) in the image., - (x, y) is a pixel of the elementary subset K,

  (.x - 16. v + 16) is the value of the corresponding pixel in the sub-

work set L,

  g, (. + / 1, y + 16) is the value of the corresponding pixel in the sub-

work set L,

  0 '(.v - / 6, v -16) is the value of the corresponding pixel in the

L3 work set

  ? û (. t., v - 16) is the value of the corresponding pixel in the sub-

  working set L4 q ...,% multiplicative coefficients

h the translation factor.

  It can be seen that equations (10) and (10Obis) above are of linear and multidimensional nature, that is to say multilinear, the coefficients a, for / = I .. n and h / respectively being the multiplicative coefficients and the factor of 0 translation. The coefficients (aI ..., .. b) are here the "parameters". within the meaning of the invention, of the elementary application relating to the subset Y. The set of coefficients (uI .....,) ,. relating to) 1 elementary subsets (KK, A,) constitutes, in this embodiment, "the set of parameters" of the overall contractive application, within the meaning of the invention. of realization, -. which means that only four subsets of work, such as those defined in support of Figure 3, are related to each subset

elementary K ,.

  Thus, for each pair of values xv-.) Of a given elementary subset K, we associate a value calculated from the multilinear equation (10) (see the example of FIG. 3 and the equation 10 bis). This is done for the set of m elementary subsets IK, .... Kv We will now explain how the coefficients of L0 the multilinear application a / ,, j = 1..n and b are determined for each of the elementary work subsets K, To solve the problem of simplified optimization (7) it is necessary. in general, for each elementary subset Ak. minimize the distance between the restriction to the elementary subset A ', and its transformed by the overall contractive application. In other words, it is necessary to minimize the distances d (f '! K,. T (./) I ^,) i = K .... 1J (11 In the particular embodiment, a set of least squares minimization method in the presence of constraints o the quantity to be minimized is the distance defined in equation (11) and is expressed as T '(&, (/)K.)t = E (/ (x.v1 /; <iv ..) (12) 1, "<3, i = 1. - i7 (13)

o 13 <l.

  By minimizing the expression (12) under the constraints (13), each restriction of 7T0 (at K, and at the same time the coefficients a, and

h of equation (10).

  The coefficients aj, b associated with each of the subsets K,

  constitute the primary representation of the initial data set.

  The problem of minimization according to the equations (10) and (12) under the constraints (13), in order to determine the coefficients (a, .... a, b) for

  each K, .- i = 1, ..., m will be detailed below.

  For each elementary subset, we consider the objective function ó K: R + K: R defined as follows 4K (ai, an, b) = ff (x, y) - [Z a, .L (x, y ) + b. (14) The problem of minimization under constraints is thus to look for the (n + 1) values (al, .., an *, b *) EC c R "which satisfy (a, a ,, ', b) = min {K (a,..., A., B) I (a ... a ,, b) eC} ,, (15) or

  C '= {(, I .... a, b) | r'R-n1 <a, <1; i = I .... n.

  Let us first recall that the resolution of a problem of minimization without constraints is well known to those skilled in the art. In this case it is a question of minimizing in general an objective function of the type: l * u 6 ,,) = S f (r ,, i) - 'E (, c (\ ") hi L i16 (rI) eKz L = om is the number of parameters of the objective function and when (.c) goes through the entire space R "'The vector (cli.

  This vector (î,,, cm) is characterized by the equation od 'Euler: I FC c .., C = ci (17) O DP (C'l, mc,) is the derivative of TP (in the sense of Frechet) It is a linear and continuous D5 application of R "'to R. This last equation is replaced here by the partial derivatives of Y at the point (c ... c,), with respect to each variable. We thus obtain that (c .. c) ischaracterized by: =: 18> .. DTD: 2P * <'(.)

  S i, 1 8) Taking into account the particular form of the functional 16). equations (18) are equivalent to (/ - =. ',' i = I..i (19) o ('= (', (y} = I: i / 1 ii =, = g>, ( y) i = 1.> - 1 1,.,., = number of points (xy) in K ,, S '= Y, () F (yi = 1 .. ,, -I (t ..) _ K

S ,,, = Z F (xy).

  Equations (19) form a linear system of easy equations

  to be solved by various methods well known in mathematics.

  The resolution of the problem of minimization (15) of the functional

  (14) under the constraints (13) will include the following steps.

  a) Resolution of the problem of minimization without constraints of the functional (14) on R "/ by the method described above by the equations (16) to (19) The solution will be noted (l .. d ,,. h) ER "(b) If (a), then, the solution sought to the problem described by equations (15) and 116 is found and so ....,,. b) = (Q ... ',) c) If (6] ...,. b) - (', some constraints are violated This will result in a disjoint partition of the set of indices P ....., - =. \ I 'Lj UV' LE o - NV is the set of indices cl .... n for which -f <il, <[13 - UVis the set clues I {L.

  nor for which 1 L - LV is the set of indices k c 1..u for which it. <-13: 10 o Thus expressed mathematically: {i .... n} = NVu UV u 'LV' (20) NV E {in} - P3 <a,} (21) {ô _I {n} [3 <a Q} (22) L // = {k {1 .... n} | ak <-13} (23 In this case it is necessary to solve a problem of minimization without constraints described by the equations (16) to (19) o F (Xy) = f (xy) - Z [3 g (x Y) +; T ((24 24 24 24 24 24 24 24 24 24 24 24 24 24 24 24 24 24 24 24 24 24 24 24 24 24 24 24 24 24 24 24 24 24 (24) the number of indices in.X'I ', = r expresses that the last constant not violated concerns the coefficient L' ... DTD: The solution of the last problem (24) and (25) will be (... .,).

  Finally, the solution of the problem with constraints will be c, 3 = c, - = it .... m-I o i e X '(26) u, t = D.k EUV, (27) c "= -' I ELV, (28)

= C 1. (29)

  if however (26) respects the constraints. Otherwise, it will be necessary to reiterate

the process.

  A flowchart allowing the partition of the 512 x 512 pixel image, its division and the calculation, for each of the elementary subspaces K,

  of coefficients ca, and b is described infra, in support of FIGS. 10 to 15.

  2n It is observed here that, when all the elementary subsets have the same dimensions, a compromise must be made. Indeed, when these dimensions are too small, the compression ratio is limited since it is directly a function of the number of

  pixels that are represented by the five parameters associated with each sub-

  elementary set. On the other hand, when the dimensions of

  Elementary sets are important, the quality of the reconstructed image after secondary processing of these parameters, may be too limited for a comfortable exploitation of the reconstructed image. the smallest details that may have been poorly treated during primary treatment

42 2761554

  In an image, it is common for some areas to have very little detail and to be practically uniform and for other areas of the image to be highly complex (which can be represented by the variance of values of each component of the pixels of the image).

the area considered).

  The invention proposes, in addition to the implementation of the

  the above theory, a method of using sub-

  large elementary sets in the most uniform image areas and smaller elementary subsets

  Io in the least uniroitrms image areas. A wand, for each sub-

  elementary set being processed, a criterion of complexity, called "quality", is determined and a partition opportunity estimate is

  If this estimate does not meet the quality criterion, that is,

  When the elementary subset considered is supposed to have a certain complexity, it is partitioned into smaller, smaller subsets which are processed in turn, until a minimum dimension has been reached. In the embodiments described and shown, this partition consists of dividing the elementary subset into four equal elementary subsets, of homothetic form to that of the initial elementary subset and separates them from one another.

in each direction.

  First mode of secondary treatment of compressed data. We will now describe a first embodiment of the method of secondary representation of a set of data constituted by parameters resulting from a primary processing of data, in accordance with Sau first embodiment of the treatment process

primary described above.

  In this first embodiment, the parameters resulting from the primary treatment are the subject of the secondary treatment. in VLle to restore

  with the error rate mentioned above, the initial data.

  In other embodiments. one of which is described below, the purpose of secondary treatment is to provide data of a different type than

that of the initial data.

  In a general manner, in the case of restitution of the initial data, an "iterative calculation" step is carried out during which, from said parameters (the ....., h), it is a method of successive approximations converging towards the fixed point of the global contractive application (T) this fixed point constituting a representation

  of said initial data set (f e E).

  To implement the method of successive approximations in the framework of a restitution, according to the first embodiment of the invention, an arbitrary set of data (0vo E) is applied to the overall contractive application. (T *) as defined above (equations (8) and (10)). The same contraction (T ') is then applied to the transform thus obtained and this process is repeated until the distance between two consecutive transforms is less than a given threshold, which is expressed by the following equation: .. T (T (Yo) = (T (V "). (30) By applying the global contractive application q times to the result of the previous transform, we obtain a good approximation of i, which is expressed by (T ')' (crt,) r / + rai the stop criterion of the iterations being expressed as follows:

CI T *)! (.). (T *) + (.)) - '

  where i is the tolerance allowed on a pixel multiplied by the number of pixels in

The image.

  It should be noted that implementing the global contractive application (T) amounts to performing the various partitions and divisions of the arbitrary image and successive transforms thereof, so as to be able to implement equation (10) for each of the elementary subsets of the partitions

considered.

  Infra, particularly in support of Figures 16 and 17, there is described a flow chart of an image represented in accordance with the first embodiment of the secondary treatment method of the invention.

  : LB In the foregoing description, the overall contractive application

  defined in equations (8) and (10) is used in the data restitution process. Indeed, as the purpose of the secondary treatment described above is, in this embodiment, to obtain as faithful a reproduction as possible of the initial data, it is the same overall contractive application which is

  used during the restitution stage.

  On the other hand, in the variant described below, in support of FIGS. 9, 9A, 18 and 19, it is desired to obtain, at the end of the secondary treatment. data of a different type from that of the original data, another global contractive application, and / or another definition set will be used 2E In general, the global contractive application used in primary processing is referred to as " first type ": that used during the secondary treatment is called" second type "In case of restitution of the initial data, the global contractive application of second type is identical to that of the first type. In the case where during secondary treatment the

  3: data of a different type from that of the initial data are obtained.

  the overall contractive application of the second type will be different from that of

first type.

  2. Description of a first embodiment of a

  processing device Primary data set processing device A first embodiment of a device for processing a set of data representative of physical quantities and intended to provide a set of data representative of physical quantities will now be described in support of FIG. to allow a primary representation of said assembly by the implementation of the method described above. In this embodiment, which concerns a color image processing device, the data of the image at 512 × 512 pixels is inputted, while at the output the device delivers the parameters

  (., i - I .. 4 and h and partition information, relating to each of the sub-

  sets constituting a partition of the image.

  It should be noted here that the present invention is certainly not limited to a particular image format but allows the processing of images of any size. However, in one embodiment described and shown, the image processed and rendered is an image of 512 x 512 pixels with 256 levels on each of the three components Y, luminance, Cr, chrominance

red, and Cb, blue chrominance.

  In the block diagram of FIG. 4, the coding device carries the

general reference 500.

  It comprises, connected to a data bus and addresses.

  designated as 501: - a controller (ALU + CTR) 550 incorporating an arithmetic logic unit This controller is constituted, in this embodiment, by a microprocessor of the type marketed by the company INTEL under the reference i486, - a random access memory RAM, bearing the reference 510 This memory comprises a certain number of registers which will be described hereinafter and a rapidly addressable part (cache) 514, - a program memory 530, of the ROM type, - a first memory register 560 Live-to-Live (REG 1),

  a second register 570 of direct access random access memory (REG 2).

  an input buffer (IBFR) 590, connected to an input connector 591 and an output buffer (OBFR) 580, connected to a connector of

exit 581.

  In the ROM 530 is recorded a program for processing the input data 591, with compression thereof in accordance with the method described above. The compression program. which relates to FIG. 4, the reference 531, is described below with reference to FIGS.

, 19. 20 and 21.

  All the means 510, 530, 531, 550, 560 and 570 constitute here an embodiment of "first logical means of transformation" at the

2 C- sense of the invention.

  In a particular embodiment, all of these elements are incorporated into one and the same specific integrated circuit (ASIC). In this embodiment, the RAM RAM 510 includes, among others, the following registers intended for implementation. of the program 531 - a register 511 (IM), intended to memorize the data of the image, - a counter 513 (CNT) used as it is explained will be fi nished). : Q the part 514 (CACHE) of the RAM This part is a part of memory addressable very quickly, in which are as it is known. stored the most commonly used data at a given moment. The portion (CACHE) 514 of the memory 510 includes the following registers - a register 515 CSI for storing at a given time. the coordinates of the elementary subset K, currently being processed, of the registers f (L) -. '(L4) referenced 516 to 519, in which the values [/ (L,)] (xv) corresponding to each point (,., i)

  (level among 256 of the component being processed) of the sub-

  1 sets of work L, - L4 associated with the elementary subset K, considered, - a register 520 for storing the coefficients ai ,. a ,: a4 and h. relating to an elementary subset considered K ,, and - a register 522 intended to keep division factors A i5 corresponding to the number of complementary partitions made to obtain the elementary subset considered K ,, - registers 521 and 523 to 526, intended to preserve

  intermediate variables of a processing generating the sub-references

  elementary sets forming an initial partition of an image to be compressed,

  - register 560 (REG 1), intended to cumulate, for each subset

  elementary set, the coefficients ai u. a, a, a and h, as well as any partition information. relating to each working sub-assembly - the register 570 (REG 2), intended to memorize the list of the addresses of all the elementary subsets K, in FIG. 5, there is shown, respectively connected to the means of input and output: a source 592 of uncompressed data, and - means 582 compressed data users The source 592 may include many means within the scope of those skilled in the art. For example, it may consist of a hard disk drive or floppy disk or compact disks (known as the initials CD-ROM). The data of the image to be compressed can therefore advantageously be recorded on the corresponding media hard disk, diskette or CD-ROM (compact disc). This recording can be done

  in any manner known to those skilled in the art.

  The source 592 may also be constituted by a video interface capable of delivering the data of the image to be compressed at the input

L0 591.

  The source 592 may also be constituted by data receiving means connected to a transmission network, the source 592 being capable of transforming the received data into a suitable format so that they can be presented at the input of the processing device.

primary.

  Similarly, the user means 582 may consist of means for storing the compressed image (hard disk, floppy disk, CM-ROM, etc.) or a simple interface intended to deliver the video signal in a known format, at a time. other user means, such as means intended, for example, to transmit this compressed image remotely or to store it. These means 582 may moreover consist in a device for transmitting

  data connected to a telecommunications network.

  Device for secondary treatment of a set of 2 parameters resulting from the primary processing of initial data.

  In this embodiment, which relates to image processing.

  the secondary treatment device is able to restore from the coefficients al. at,. uz. 4, and b and partition information, relating to each

  elementary subsets, the initial image, in color.

  It is also capable of delivering the data relating to a gray-scale image corresponding to an original image in color. It is, moreover, adapted to provide an image having a number of elementary points different from the number of elementary points of the image. treated by the primary processing device, these images being said to be of different definition or resolution. This output data of the secondary processing device is of a different type than the type of the data of the initial image that was the subject of the

primary treatment.

  In the block diagram of FIG. 6, the device for restitution or

  ic iterative calculation carries the general reference 600.

  It comprises, connected to a data and address bus, designated under the reference 601: a controller (ALU + CTR) 650 incorporating an arithmetic logic unit. This controller is constituted, in this embodiment, by a microprocessor z5 of the type marketed by the INTEL company under the

reference i486.

  a random access memory RAM, bearing the reference 610, which comprises a certain number of registers which will be described below and a part

  addressable quickly (called "cache memory") 614.

  2o - a program memory 630, ROM type. In this memory are recorded in particular: a program 631 for decompressing the data of the image presented at input 681 in order to reconstruct an approximation of the initial image of identical or different resolution, a decompression program 632 image data for the reconstruction of a grayscale image instead of a color image. and a zoom factor z in a "z" register 628 C The programs 631 and 632 implement the procedure described above and their flow charts are detailed below in support of the figures

16 to 17.

  a first register 560 with direct access (REG 1), and a second register 570 with direct access (REG 2) identical to those described in support of FIG. 4, an output buffer (OBFR) 690, connected to an output connector 691 and - an input buffer (IBFR) 680. connected to a connector

] 0 input 681.

  The set of means 610, 630, 631, 650, 560, and 570 constitutes here an embodiment of "second logic means" within the meaning of the invention: the set of means 610, 630, 632, 650, 560 and 570 constitutes here another embodiment of "second logical means" in the sense of

The invention.

  In a particular embodiment, all of these elements are incorporated into one and the same specific integrated circuit (ASIC).

  suitable for secondary treatment.

  In this embodiment, the RAM RAM 610 includes, among others, the following registers for the implementation of the programs 631 and 632:

  a register 511 (IM), described in support of FIG.

  a register 621 (RE), intended to store the data of an image, a register (CHTY) 622, intended to differentiate the general secondary processing from a restitution, a register (IT) 612 intended to memorize the value; current of the

  number of iterations performed to perform the secondary representation.

  a register (p) 623 for storing the number of terations 3 o to implement the successive approximation method in order to perform the secondary image processing,

) 1 2 7 2761554

  a counter 513 (CNT) described with the support of FIG. 4. This counter is used here as explained below (FIG. 16), the portion 611 (CACHE) of the random access memory 610. This part is a part of memory addressable very quickly, in which are, as is known, stored the most commonly used data at a given time, the part (CACI IE) 614 of the memory 610 uurriporte registers 515 to 520 and 627 respectively identical to the registers 515 to 520 and 522 described in support of FIG. 4,

  - the register 560 (REG 1), intended to store, for each subset

  elementalre, the coefficients a ,, a2, (3.,: a4 and / 6 and any possible partition information, associated with this subset, and the register 570 (REG 2), intended to memorize the list of

  addresses of all elementary subsets K ,.

  FIG. 7 shows, respectively connected to the input and output means: a source 682 of compressed data, and

  means 692 users of uncompressed data.

  The source 682 may consist of storage means of the compressed image (disk, disk, CD-ROM, etc.) for the interface intended to deliver them. Means 682 may also consist of a data reception system connected to a telecommunications network. The means U92 may for example consist of decompressed data storage means or a simple interface delivering on its output the decompressed data. It may also consist of a device for transmitting uncompressed data over a telecommunications network.

  Description of a device incorporating a device

  primary treatment and a secondary treatment device In the block diagram of FIG. 8. a device incorporating a primary treatment device 500 and a secondary treatment device

  600 is shown and has the general reference 700.

  This device is capable of parallel processing of image compressions and decompressions. It is therefore composed of the devices described in support of FIGS. 4 and 6. It is in this case the primary treatment device 500 and the secondary treatment device

  600. This type of device is called "full-duplex".

  In another embodiment (half-duplex), the device can perform only primary treatment or secondary treatment but never at the same time. It can furthermore carry out a "complex" treatment comprising a primary treatment and a secondary treatment carried out one after the other. The block diagram of such a device is represented in the

Figures 9 and 9A.

  This device which bears the reference 800 jointly comprises the resources of the devices 500 and 600 described above, avoiding duplication. Thus: the registers of the RAMs 510 and 610 described above are incorporated in a same RAM unit 810, the same ROM unit 830 incorporates the programs 531, 631 and 632 mentioned above and a configuration program 831, the same microprocessor 850 incorporates the means 550 and

650.

  The configuration program 831 which will be described below with the support of FIG. 18 allows the device 800 to carry out:

  a compression of the data of a color image.

  a decompression of the data either in order to restore the initial color image, or to render it with a different resolution. either in order to deliver a corresponding gray level image. and a complex treatment for transforming an image

  color in a grayscale image.

  Description of a particular flowchart of compression

  This flowchart is illustrated in FIG. 10. FIGS. 11 to 15 are flowcharts explaining certain operations of the flowchart of FIG.

compression of Figure 10.

  The flow charts of Figures 11 and 12 also detail operations of the decompression flow chart of Figures 16 and 17 which will be described below. References between the parameters refer to

steps of Figure 16.

  It is first recalled that the data relating to the image materialize an application as defined in equation (9) explained above. In the present case, for each pair of values (xi (column coordinates, line) taken in the definition domain (in this case, at the 512 x 512-pixel planar image), a value {{right arrow over (y)} in the domain R, ie a value among 256 levels relative to each of the three

Y, Cr and Cb components.

  We organize three series of numbers each corresponding to the level of a component (ie 512 x 512 = 262,144 values /(.v ') by

  component), scanning the image data as follows.

  2 5 - the lines are scanned from left to right;

  - the lines are incremented from bottom to top.

  These three suites are here recorded in the uncompressed data source 592. They can be read on the input port 591 at the

microprocessor control 550.

  In 200, the registers rIM) 511, (CNT) 513 and the two registers (REG 1) 560 and (REG 2) 570 are initialized to the value

zero uniform.

  The files relating to the Y, Cr and Cb components are accessible separately and are provided in a predetermined order, namely. firstly, the data of the image considered and relating to the luminance component (Y), then the image data relating to the red chrominance component (Cr) and finally the image data;

  relating to the blue chrominance component (Cb).

  In 201, a first test is conducted to determine whether

  the counter (CNT) 513 is not equal to 3.

  If not, the program branches to step 202, during which: - the counter 513 (CNT) is incremented by one unit - the microprocessor 550 will read on the input port 591 the

next component to be processed.

  Remember that each component, Y, Cr or Cb, is a sequence of 262,144 values f / (x,>) corresponding to the level of the component considered for each of the pixels of the image. This suite is

loaded in the register (IM) 511.

  It should be remembered that, in this particular embodiment, each subset of work has as much data as the elementary subsets. The program then branches to step 204 (explained in FIG. 11), during which the initial partition of the image of 512 × 512 pixels will be carried out in 256 elementary subsets K ,, i = ( 1 ..... 256) of 32 x 32 pixels. This partition is done by determining the

* coordinates (x.V,) of the lower left corners of each of ", sub-

  K sets, considered. Thus, the subset K, illustrated in FIG. 3, has the coordinates (x ,,). which correspond to those of its lower left corner. Each of the addresses of the lower left corners of the 32 x 32 pixel blocks corresponds to a particular address in the list stored in

  The register (IM) 511 of the random access memory 510.

  The list of these addresses is loaded in the register (REG 2).

  With reference to FIG. 11, after an initialization of a counter consisting of the register i 521 relating to the index of the subsets K, in step 211, the program branches to the test 212 over which it is verified whether the list is complete or not. If not, the program branches to step 213 in which the division factor A, which counts each additional lo partition that is performed on an elementary subset, is initialized to zero and where determines a variable Y as the quotient of an integer division of (i-1) by 16. The remainder of the division (variable C) is stored in register 524. The values r, ('* 32 ety, = l 3 2 are calculated during the operation 214 and temporarily stored in the registers 525 and 526. These coordinates which are those of the lower left corner of the elementary subset Kj considered, and the associated division factor A, are stored in the variables (xi, vi) in the register 570 (REG 2) during step 215. During step 216 the counter i is incremented and the

  program then runs the test 212 again.

  When the test 212 is positive, the program performs the test 205 (FIG. 10) during which it is checked whether the list registered in the register (REG 2) is empty or not. If not, it means that there are still elementary subsets K to be processed and the program branches to step 206. At step 200, the first elementary subset of the list is deleted. registered in the register (REG 2). This subset

  is stored in a CSI register 515 of the RAM 510 cache.

  The program then branches to step 207 detailed in FIG. 19 or, alternatively, in FIG. 20. During this step, a test 255 determines whether the elementary subset considered has the minimum dimensions, that is, ie in the embodiment described and shown, 2 times 2

pixels, or not.

  When the result of the test 255 is positive. the operation 250 consists in determining the four working sub-images L, associated with the working subenstrument in question. This operation 250 is detailed in FIG. 12. During the operation 250, starting from the address registered in the CSI register and the division factor A, the four neighboring work subassemblies L are searched for. ,. L, L3. L4 (see Figure 3 for the subsets of work associated with the initial partition). For this purpose, the rule recalled above is applied - each work subset has the same dimensions as the elementary subset to which it is connected, or in each direction: 32 divided by 2 brought to the power A; and - each subset of work is shifted by half a dimension in

  each direction, relative to the associated elementary subset.

  The purpose of the operation 250 is therefore to determine the values (.v.) Of the component considered associated with each of the pixels of the working subsets L ,, Li, L3 and L4 geometrically and in a predetermined manner to the set. elementary considered K ,. The set of values / (XY> related to the pixels of the subset L / (respectively L, L; and L,) will be noted below.

  / (L,) (respectively) (L2) J (L3) and / f (L4)).

  With reference to FIG. 12, for each elementary subset K considered, the controller 550 reads in the register 570 (REG 2) the coordinates (x, y) of the lower left pixel of K 1 at step 217 Then. in step 218, the arithmetic unit 550 reads the values of the component considered for each pixel of the four working subsets L, to L. defined according to the following table: [x, -i6 / 2 '. x, -I + 16/1)) x I ,, - 16 / 2._ i, - / --- lv - 2I L: Ix, -16 / 2. x, -1- (3x16 / 2'lx [v, - 16/2 '.- /' (, '1 Il- x, - - I6 / 2' xY, - li ll ", I x-, + 16 / '' x, -l - (3xl6), 2'J] x [y, 1) 2 '. -I / (, "It is observed here that each of the subsets of work has here the same number of pixels as the basic subset

considered, ie (32 / 2A) 2.

  Then, in step 219, the arithmetic unit 550 will search, for the component, Y, Cr or Cb, during processing, the value corresponding to each of (32/2) 2 pixels of L, (respectively L , .L; and l,) and stores 0 all (32 / 2A) 2 values in the register./(L,) 516. (respectively 1 (1. :)

  517, f (L3) 518 and (L4) 519) of the cache 514).

  Following the operation 250 (FIG. 19), the program performs the operation 251 in which, in general, the parameters a ,, (in this case al, a2, a3, a4) and b are calculated by implementing the least squares method with the constraints described supra (see equations 12 and 13).

  A simplified description of step 251 is given in

  the flowchart shown in FIG. 13. It will be recalled that in order to determine the coefficients a1, a2, a3 a4 and b, it is necessary to solve a problem of minimizing a functional under constraints. Supra it has been seen, in support of equations 14 to 29 that it amounts to iteratively solve two types of minimization problems without constraints. The explanations given above for a general case are put into practice for the determination of the four

  parameters a / 1. a2. a3. 14 and the parameter b.

  In step 220, the first problem of minimization without constraints is solved. We minimize the functional

A, (I I ci l), Z) ', [(' '.-

  (v. v) eK, /: I a8 2761554 for values (a ,, ..., a4, b) going through all 5. To do this we apply the least squares method described above by the equajtinns (1R ) s (19). The unique solution to this problem (a ,, ..., a4, b) in R5 is the solution of

b linear system (19).

  As illustrated in Figure 14, Step 220 is subdivided into four

steps 230 - 233.

  During step 230, coefficients Qi i = 1,..., S j = 1,..., 5 are calculated by implementing the following formulas: = jiE [tQ f (). Y) V (Ji)] (Yi, ..... 4

q25 = G, 5 = [[1 "j) (X Y = Y1.

(X, y) eK

(.J55 = 322

  The coefficients [Gij] constitute the matrix to be reversed in order to

  solve the linear system of equations (19).

  The formulas above make it possible to determine the coefficients Gi., Urilt ormille 1on it sees the simple additions and inultipliuatioruns implementing the valours of pixels corresponding to the levels of the component considered, and celA for nhanLun dRe pixels of the snis nsemhn.bl. the imentary considered. Similarly, in step 231, the coefficients S ', ......' constituting the second member of the linear system are calculated. The formulas used are: s, 9 = Z [([, /)] (xy / x) i - I.4 = () .., Y) fxy) = ... 4 S, .- 1. Step f (x, v) (v), K Step 232 uses a conventional inversion routine of a system of linear equations, in this case five unknowns. The linear system to reverse is as follows:

G-1 G21 G31 G41 G51

  G1,2 G22 G32 G42 G52 a2 S2 G13 G23 G33 G43 G53 a3 = S3 G1 4 G24 G34 G44 G54 a4 S4 G15 G25 G35 G45 G55 b S5 _ Solution a, ..., a4, b will be stored in step 233 in the

  register 520 of the part 514 (CACHE) of the random access memory 510.

  The program then proceeds to step 221 (Fig. 13) o, according to equations (20) to (23), a disjoint partition of the set of integers {1,2,3,4} is determined in NV, UV and LVdefined as NV = iz {j {1 ... 4} 13 <a,}, UV = {j E = {__1,4 1 P <a,

LV = {k e {1, ..., 4} a <}.

  The program then connects to test 222 in which it is checked whether the sets UV and LV are empty. If this test is positive, the values currently present in the register 520 constitute (step 224) the solution

the problem with constraints.

  In the negative, some constraints are active for the solution of the problem with constraints. In this case, (step 223, see FIG.

  there is a need to solve a limited problem.

  It is in this case to minimize under constraints the modified functional: r (c, ... cm) = e E (xy) - K "- '. [' (L,] (x ...) + ## EQU3 ## (x, y) = f (x, y) - P. [D. (Lj)] (x, y) + D [1 '(Lk) ] (X y), jEUV k eLi and m <4 since fewer constraints are active The solution to this problem is (CIl ..., cm) and is obtained in

  considering equations (16) to (18) and solving the linear system (19).

  The solution of the initial problem with constraints is: a, = cj: j = 1, ..., m-1 or i E NV, ak = k E UV, a = -: E LV,

b = Cm.

  Step 223 will be described in support of the flowchart of Fig. 15 assuming m = 3. The minimization problem without constraints described in step 223 which is subdivided into four steps 240 to 243. During step 240, coefficients Hj i = 1 ... 4, j = 1, .... 4 are calculated using the following formulas:

  Hj. = E [f (L)] (x, Y) [f (L ,,) (x, Y) .j.E ......

  (.T.y) x H4, = Hi4 = [f (L)] (x.y) (x.) K l K

H44 = 322

  The coefficients [H,], constitute the matrix to invert in order to

  solve the linear system of equations (19).

  The above formulas making it possible to derive the coefficients H ,,, are, as we can see, simple additions and multiplications implementing pixel values corresponding to the levels of the component under consideration, and for each of the pixels of the elementary subassembly under consideration. . Similarly, in step 241, the coefficients 7, are calculated. l, constituting the second member of the linear system, the formulas used are: Ti = I fr (L)] (X y). > F (X y) (My); K l4 = E lc (x, y) 4, '(x, yy)

(A, Y) C.K

  Step 242 uses a conventional inversion routine of a system of linear equations, in the range of 4 unknowns. The linear system to be reversed is the following: Hf H21 1131 H41 C [TI H, 2 H22 I132 H42 c2 T2 Ift / H23 H33 H43 C3 T3 H4 H4, 4 l 4 H74 4bj LTJ At the end of step 223, it is necessary to review whether the solution thus obtained still satisfies the constraints. To do this, step 221 and test 222 are executed again. This process is repeated until the test 222

be positive.

  In the course of the operation 251, the coefficients U 1, (.,. U,, b are recorded in the register 560 (REG 1), then the test 205 is reiterated, It is observed here that to the extent that the sub- elementary set has minimal dimensions, no partition information is needed

  since no additional partition can be made.

  When the result of the test 255 is negative. operation 252 consists of

  to measure the variance of the levels of the component under consideration, in the

  elementary set considered. Then, operation 253 consists in determining

  a so-called "quality" criterion applicable to the elementary subset considered.

  Preferentially, the definition of the quality criterion consists of the definition

  a threshold below which the quality criterion is considered to be respected.

  Preferentially also, the value of the threshold takes into account the dimensions of the subset-elemental considered. In the embodiment described and shown, this threshold is the function corresponding to the following table. Subset dimensions in threshold pixels 2x2 200 4 x 4 160 8x8 100 16 x 16 60 32 x 32 20 According to variants not shown: the value of the threshold is constant regardless of the dimensions of the elementary subsets or - the value of the threshold is a function inverse to a dimension of the

  elementary subset considered.

  The test 254 determines whether the quality criterion is met or not.

  In the embodiment described and shown, it is respected when the measurement of the variance of the levels of the component considered is less than the value of the threshold which corresponds, in the above table. to the dimensions

  of the elementary subset considered.

  When the result of one of the tests 254 or 255 is positive, the operation 250 consists in determining the four working sub-images as explained above. Then, the operation 258 is identical to the operation 251. except that are stored in the register 560 (REG 1) successively partition information worth "0" since no additional partition has was performed and the coefficients a /, I :. a3, a1, b. Then, the test 205 is reiterated When the result of the test 254 is negative, the operation 256 consists of performing a complementary partition of the elementary subset considered. In the embodiment described and represents. this complementary partition consists in dividing each elementary subset into four equal square elementary subsets. For this purpose, during operation 256, the coordinates of the four points defining the lower left-hand corners of the list_out_image are added to the top of the list_at_image list.

  four elementary subsets resulting from the complementary partition.

  To these coordinates are associated a division factor A which is equal to the division factor of the elementary subset that is partitioned, incremented by the value 1. In addition a partition information worth "1", since a complementary partition has been performed, is stored in the

register 560 (REG 1).

  Following the operation 256, the test 205 is reiterated.

  It is observed here that, according to general characteristics of the invention, the primary treatment: - takes into account a minimum dimension, during step 255 and includes an "initial partition" step, operation 204, during which, the data set is partitioned into so-called "initial elementary" subsets (K,), comprises: a) for each elementary subset that does not have said minimum dimension, at least one iteration of the sequence of operations 252 to 205. comprising: a step of determining so-called "quality" criteria, operation 253, during which at least one quality criterion is determined by taking into account the dimension of said elementary subset - a step of divest opportunity estimate, test 254, in which an opportunity is estimated for splitting the elementary subset, and - when the opportunity estimate does not meet the quality criteria, a ape of "complementary partition" of said subset into elementary subsets called "intermediate" K ,, operation 256, b) a step of "construction", operations 258 or 251, during which, for each of the elementary subsets K, resulting from the last stage of partition, one considers n subsets of work L, n being nonzero, and one constructs an elementary application of the n subsets of work in the elementary subset considered.

  In this respect, it should be noted that the parameters a, b of the elementary application are determined in such a way as to: make a global application called "first type" contractive for said set of data, a global application belonging to the group of applications constituted multidimensional applications and nonlinear applications, the restrictions of the global application to the elementary subsets Ki being constituted of said elementary applications, the fixed point of the global application constituting an approximation of all or part of this set, to allow the implementation of a method of successive approximations converging towards the fixed point of said application

overall contractive.

  The set of parameters a ,, b thus determined. as well as when at least one complementary partitioning step has taken place. a so-called "partition" information, representative of each said complementary partition, then jointly constitutes a primary representation

said set of data.

  Figures 21A. 21B and 21C illustrate the effect of additional partitions that are performed on elementary eps ntLis-ensernbles

  is.q.ss d. ln initial partition or previous complementary partitions.

  For the purpose of explanation, and by way of exception to the general rules of s doescription, it is assumed that, in the embodiment set out in FIG. 21A to 21C, the minimum dimensions of the elementary suus-assemblies are

  four times smaller than their maximum dimensions.

  FIG. 21A represents a part of an image, corresponding to twelve elementary subsets referenced Bo to B ,, resulting from the initial partition (operation 204, FIG. 11), in which - the elementary subset B1 has undergone a partition complementary in four elementary subsets B, o to B1.3, - the elementary subset B.3 has undergone an additional partition into four elementary subsets B1.30o to B1.33, ès - the elementary subset Br suffered a partition

  complementary in four basic subsets B6,0 to B6,3.

  - the elementary subset B0,1 has undergone a complementary partition into four elementary subsets Be ,, lo a Bt.3, and - the elementary subset B11 has undergone a partition

  complementary in four elementary subsets B1,0o to 11,3.

  Figure 21B illustrates, for the elementary subsets as well

  partitioned, the partition information that is associated with the sub-

  elementary sets resulting from the initial partition (subsets for which the value of the division factor A is zero) or subsets

  elementals resulting from additional partitions.

  Thus, the elementary subsets Be, B2, B: 1, B ,,. B7, B, Bq and Bro are associated with zero partition information, the elementary subsets B1, B6 and B11 are associated with partition information of 1, their elementary subsets B10, B ,, B.12, B .0, B6. ,, B6.3, B11, o0, B111, B,.> And B1 are associated with zero partition information, the elementary subsets B133 and B ,, are associated with partition information equal to " 1 "and the elementary subsets resulting from their complementary partition are not associated with any partition information since the dimensions of these elementary subsets are the

minimum dimensions.

  The dimensions of all these elementary subsets can thus be defined unambiguously by the following partition information: FIG. 21C proposes a representation of the parameters a ,. a2, a3, a4 and b, which together are referenced herein D and information from

  partition associated with them, using the sequence outlined above.

  It is observed that the sequence of the compressed data corresponding to the portion of the image represented in FIG. 21A comprises: a header, representing in particular the dimensions of the image (worth here 512 × 512 pixels) the initial dimensions of the sub elementary sets (corresponding here to 32 x 32 pixels) and the definition of the minimum dimensions of the elementary subsets (here corresponding to 2 x 2 pixels) and complementary processing information and the possible dimension ratio between the resolution of the luminance component and that of the chrominance components; - the continuation of the score information presented above

010001 000010100000010000

  associated with any data that correspond to them, during the storage performed during the steps 251 (without partition information) and 258 (with partition information), knowing that the partition information

  1 are not associated with any data.

  The set of operations 205-258 or 205-256 is repeated as long as the memory (REG 2) is not empty when the test 205 (FIG. 10) is positive. the program reconnects to test 201 to check whether counter (CNT) 513 is equal to 3. If yes, it means that all three components have been processed. The program then connects to the complementary processing determination step 209, during which it is proceeded: on the one hand, to the determination of the utility or not to carry out a complementary smoothing treatment on the image resulting from a secondary processing of the parameters and partition information and - secondly, to the storage of the header of the parameter file and _0 partition information, header including in particular the dimensions of the image , the maximum and minimum dimensions of the elementary subsets, the possible ratio of dimensions between the resolution of the luminance component and that of the chrominance components, and the complementary processing information representing the utility of said processing

1 5 complementary.

  To determine this utility, several criteria can be

  used. The first is to compare the minimum dimension of the sub-

  one-dimensional elementary sets that serves as a threshold. When the minimum dimension is greater than the threshold dimension, this means that relatively large elementary subsets (for example 8 x 8 pixels) will be used even if the quality criterion defined in step 253, n is not respected and it will therefore be profitable to reduce the edge sensation affecting such elementary subsets. The second is to compare the thresholds used in the table defining the quality criterion with so-called "critical" values, predetermined thresholds. When the thresholds actually used are higher than these critical values. this means that the quality criterion is easily respected on elementary subsets of large dimensions, subset whose edges can be visible. It is then, again, interesting to provide a treatment

o complementary.

68 2761554

  Then the end step 210 is performed. The parameters of the global down-focus application are associated with the partition information in the register (REG 1) 560. These parameters constitute a primary representation of the initial data that was stored in the source. 592. The following performances were observed on tJine color image 512 x 512 pixels at 256 levels per component Number of data at the start 3 x 512 x 512 x 8 bits = 6,291,456 Incoming data: 3x 256 x (4 x 64 + 10) = 204288 therefore: - compression ratio: 30 - number of bits per pixel: 0.78 Processing time:

3 x 256 x 80 msec = 6'1 sec.

  (BUmsec. = Unitary calculation time of a, /... T4 h) Of course, the invention applies both to the primary processing of grayscale images (having a single component) and to

  that of color images (having several components).

  Description of two embodiments of a flowchart

  In FIGS. 16 and 17, FIG. 16 and 17 show the program flow chart 631 for reconstructing the ridges of the original reference image. o During the operation 400, FIG. 16, the registers (IM), (RE) and (IT) of the live rib 610, the two memories (REG 1) 560 and (REG 2) are initialized. 570, and counter (CNT) 513, has the value

zero uniform.

  The test 401 determines whether or not the content of the counter 5-13 (CNT) is equal to. 3. When the result of the 401 test is positive. all three components have been returned and the decompression program is complete. The

  program then performs the test 416 described below.

  If not, the program performs the operation 403 during which the compressed data of the input memory is loaded into the memory (REG 1) 560. It is recalled that the compressed data 10 is formed of a sequence of five or six numbers, namely the coefficients a, a2, a3, a4 and b and, optionally, partition information relating to each elementary subset K ,. In the case of a 512 x 512 pixel color image, each component was compressed into suites during the

  primary treatment as implemented by the program 531 described above.

  This sequence of number sequences is loaded into (REG 1). During operation 420, the zoom factor z is read in the ROM 630. It is noted here that the selection of the zoom factor z can also be to make by any means within the reach of the person skilled in the art. In particular, it could be done by means of a switch (not shown) arranged on the housing of the secondary treatment device object of the present invention, multi-position switch each corresponding to a predetermined zoom factor. This switch would send the appropriate signals to the RAM RAM 610. so as to load the values indicated in a register not shown z. This initialization can also be done under similar conditions by means of a keyboard (not shown), with technical provisions not shown but

well known to those skilled in the art.

  The program then performs operation 404 during

  which the list of references for each sub-category is created.

  elementary set. This is a list of the cooroonnees (Xv ,, of the lower left pixel of each elementary subset K, whose number of pixels is ((zx 32) / 2 ") 2 pixels. division factor A being recalculated according to the partition information as exposed with the primary processing, this list is determined taking into account the partition information that is associated with each elementary subset as well as the zoom factor z which is associated with all the image resulting from the

secondary treatment.

  It is noted here that the zoom factor z is a multiplicative factor that applies to the dimensions of the reconstructed image during the secondary processing from the parameters from an image processed during a primary compression process. This multiplicative factor also applies to the dimensions of each elementary subset, whether it comes from the initial partition or complementary partitions, and to each dimension of

  subset of work associated with one of these elementary subsets.

  When a ratio between the resolutions of the luminance components has been transmitted in the header, the zoom factor z is applied to the luminance and the product of the zoom factor z by said ratio is applied to the chrominance, such that all the data sets on

  which one rebuilds a component have the same resolution.

  According to the invention, no zoom factor z causes a pixel duplication forming the appearance, in the image

rebuilt, of uniform pavers.

  The program then branches to step 406 during which according to the embodiment of the invention described here, an initial arbitrary image is stored in the register (IM) 511 of the random access memory 610. In the case present of decompression of a Color Image where each component has 256 levels respectively having values 0 to 255, the register (IM) is initialized to the numerical value 128 (corresponding substantially to the average value between 0 and 255) for each pixel for the

71 2761554

  first component processed. For the following components, we use

  as initialization the result previously obtained.

  the register (IT) 612 is initialized with a value p read in the register 623 of the RAM 610. The number of iterations is recorded in the register (p), taking into account the desired RMSE (see Table I above).

  general description of the process). The inventors have indeed noticed during

  of tests with the prototype that, to obtain a given RMSF from a compression ratio, a limited number of successive iterations during the approximation calculation was necessary. Typically: 2 <p <10; however for

  0 very complex images p may have a higher value.

  the counter (CNT) 513 is incremented by one unit.

  The program then executes a number p of iterations referenced

  on the loop 450 to allow the return of a component of the image.

  The program first connects to the 407 test during

  ib of which we check if the contents of the register (IT) 612 is positive and not zero.

  If the test 407 is positive, the program connects to the test 408 during which it is checked whether the list registered in (REG 2) 570 is empty or not. If the test 408 is negative, the program branches on step 2o 410 and executes it until all the elementary subsets K,

have been treated.

  The detail of step 410 will now be described in FIG.

  Step 410 itself comprises the steps 411 to 415: In step 411, the coordinates (xy,) corresponding to the elementary subset K, considered, are removed and copied into the CSI register 515. At the same time, the coefficients (a, ... a4, b) relating to the relevant elementary subset are copied from the register (REG 1) to the register 520 of

  part 614 (CACHE) of the RAM 610.

  The purpose of step 412 is to determine the geometrically and pre-determined work subsets of the elementary set K, taking into account that each work subset has the same dimensions as the subset. elementary set considered (thus taking into account the zoom factor z) and is shifted. compared

  to this elementary subset, of a half-size.

  This step comprises the same operations as in step 250 described above with the support of Figure 12. The values / (L1). / (L: i. / F (L) Lt / (L,) relative pixels respectively to LI, L ,, L3 and L4 are respectively copied into registers 516, 517, 518 and 519 of part 614 (CACHE) of the

RAM 610.

  The program then branches to steps 413 and 414 in which for each pixel (x, of K, the value L ",, [f (L,)] (x.) + / Ft = 1 is calculated from using the coefficients stored in the register 520 and data / (L4) stored in the registers 516 to 519, (step 413) and

  stores (step 414) this value in the register (RE) 621 of the RAM 610.

  If the test 408 is positive, the contents of the register (RE) 621 are copied into the register (IM) 511, and the contents of the register (IT) 612 are decreased by one.

unit.

  It is again carried out test 407. As long as this test is positive it means that the number of iterations provided by the number records in the

  register (pi, is not completed and operations 408 to 410 are repeated.

  When the test 407 is negative or zero, the number of iterations planned is completed, for the component being processed, and the program leaves the loop

  450. This component is therefore decompressed.

  Step 405, which consists in copying the contents of the register (IM) 511 into the output buffer (OBFR) 690, is carried out.

then branch to the 401 test.

  As long as the 401 test is negative, it means that there is at least

a component to decompress.

  It can be observed that for the second and the third components, the register (IM) 511 is not initialized again. The register (IM) has in fact the list of values corresponding to each pixel for the previously decompressed component. This value list is the initial arbitrary image for the next component. Figure 16A illustrates in this regard

the progress of step 406.

  However, according to a variant not shown, it is a method of L0 parallel to the treatment of the three components, Y. Cr and Cb. of the image, taking as initial data set, a set of

arbitrary data.

  It is observed here that, according to general characteristics of the invention, the secondary treatment comprises: a step of determining dimensions of elementary subsets constituting a partition of a second set of data. operation 404, a step taking into account the presence of partition information corresponding to said subsets, each elementary application corresponding to an elementary subset being determined by at least one parameter of said set of parameters, and - a step of "iterative computation , operation 450 or 407 to 410. during which, from said set of parameters and said dimensions, a method of successive approximations converging towards the fixed point of a second set of data is implemented on the second set of data. overall contractive application, the restrictions of the global application to the elementary subsets K, consisting of said elementary applications In FIG. 16A, during the test 430, the counter 513 (CNT) is tested. this means that it is the first component, that of luminance, and the register (IM) 511 is initialized 3o to 128 for each pixel (step 431) The register (IT) is initialized to a value p

(step 432).

  If the contents of counter 513 (CNT) are greater than zero. this means that at least one component has been decompressed and in step 433 the register (IM) 511 is loaded with the contents of the register (RE) 621, that is, with the values corresponding to the previously uncompressed component. This makes it possible to decrease the number of iterations p by two units (see step 434 where the initialization is done (IT) at the value p-2) because the initial image is very close to the final image. The calculation time is decreased thanks to this characteristic. The counter 513 (CNT) is then incremented by one unit (step

435).

  When all three components have been decompressed, the 401 test is positive. The test 416 then consists in determining whether: either the complementary processing information present in the header of the parameters and partition information is representative of a utility of performing a complementary processing, or the zoom factor z has a value that makes complementary processing useful (z being, for example, greater than or equal to 4)

or not.

  When the result of the test 416 is negative, the end step 402 is performed directly. When the result of the test 416 is positive, the operation 417 of complementary processing is performed. This operation 417 consists of an operation known to those skilled in the art under the name of "post-processing", which refers to a processing performed after the image decompression illustrated in FIG. 16. This processing comprises, in a known manner , filtering

  space, intended to reduce the possible border sensation of the sub-

elementary sets.

  Preferentially, the parameters of this filtering are functions of the dimensions of the processed subset. For example, the dimensions of the filter used are proportional to those of the subset considered, on the one hand. and the number of pixels on which this filter applies is proportional to each dimension of the elementary subset considered. on the other hand According to

2761554

  for each of these examples, the zoom factor is used in the parameterization di>

complementary treatment.

  At the end of the operation 417, the end step 402 is performed. During the end step 402, the data relating to each of the three components are, in turn, copied to the output buffer (OBFR) 690 from which they are transferred to the data user means.

decompressed 682 (Figure 7).

  It can be seen here that, to obtain a colorless gray-scale reconstructed image, it is sufficient to perform a primary treatment only on the data originating from the primary color image luminance treatment, this limitation being moreover referred to as program 632.

  Description of the organization chart of the program

  configuration We will now deframe. in support of FIG. 20, the flowchart of the configuration program implemented in the device

800 of Figures 9 and 9A.

  The configuration program is referenced 831 to

Figures 9A and 20.

  The device 800 illustrated in FIG. 9A has four modes of

  which will be detailed below.

  The operating mode of the apparatus is first selected (step 832). The mode selection is made by entering into the register MOD 822. a value equal to 0, 1 or 2 and in the register (CHTY) a value equal to 0 or 1. This recording can be done by any means within reach of the skilled person. In particular, it could be done by means of a switch arranged on the housing of the device 800 at four positions each corresponding to the desired operating mode. This switch would send the appropriate signals to the RAM 7 d 810, so as to load the values indicated in the MOD or (CHTY) registers. This initialization can also be done under conditions

  similar by means of a keyboard, not shown in Figure 9A.

  In step 833, a first test is performed on the register MOD for the purpose of determining whether or not its content is equal to zero. If the test 833 is positive, it means that the mode of operation chosen is the first of those mentioned above and the program 531 is implemented from data supplied from the data source 810. the compressed data being delivered in output 881 to means data users

1o compressed 860 (Figure 9).

  If the test 833 is negative, a test is carried out at step 834.

  for the purpose of determining whether the contents of the MOD register are equal to 1.

  If the 834 test is positive, then an 840 test is performed on the

  register content (CHTY) for the purpose of determining whether or not it is 1.

  If the test 840 is negative, it means that the device of FIGS. 9 and 9A is in the second mode of operation, that is to say in the one where it is used for restoring the original data of a color image. from parameters (compressed data) and partition information, provided at input 881, from a source 861 (FIG. 9). The decompressed data output 892 of the device 800 is intended for

  means users of uncompressed data 820.

  If the test 840 is positive, this means that the device 800 is in the third mode of operation, that is to say the one where it is used to carry out secondary processing of compressed data and to deliver data of another type. than that of the original data, in this case data relating to a gray-scale image corresponding to an original color image. In this case, the program 632 is implemented from parameters and partition information delivered by a compressed data source 861. The decompressed data is output 892 and

  3 C fed to user means 820.

  If the 834 test is negative. this means that the content of the register MOD is equal to 2. The device 800, which is then in its fourth mode of operation, is used to transform a color image into a greyscale image. This is an example of a complex treatment within the meaning of the present invention, comprising a primary treatment phase and

a secondary treatment phase.

  Thus, in the embodiment described herein, in accordance with this aspect of the invention, the primary treatment and

  secondary treatment are implemented sequentially.

  The program 531 makes it possible, from data delivered by an uncompressed data source 810 on the input 891 of the device 800, to compress these data, to obtain parameters a, / 1. I. relating to each of the elementary subsets K. of the original image. These parameters and partition information are, in accordance with what has been described above with the support of FIG. 10, all present in the register (REG 1) 560 at the end of the program 531. The main program of FIG. so

  a direct connection at the end of step 404 of program 631 described above.

  The transformed data is then present on the buffer register (OBFR) 893 of the device 800 and transferred to the means 820 users of uncompressed data. These data are those relating to a gray-scale image corresponding to the color image whose data

  were transferred to device 800 from source 810.

  It will be noted that the subroutine comprising all the steps 404, 452, 406, 450, 405 and 402 of the program 632 constitutes here a particular embodiment of a secondary treatment method within the meaning of the invention. It is this particular sub-program which is here implemented as a result of program 631 to constitute an example of a treatment.

  "complex" within the meaning of the present invention.

  3. Description of a preferred variant implementing

  subassemblies of work having a size different from that of the corresponding elementary subset When the work subsets have the same dimension as the elementary subsets to which they are associated, and the contractive application is linear on each subset of work, the reconstructed image can only have in the elemental subset

  considered to be a greater complexity than the ones it has in each

10 working group.

  In addition, the convergence of the approximation method

  successive can be relatively slow.

  For these two reasons, and at least in the case of the implementation of multilinear contractive applications, it is preferable to use subassemblies of work having dimensions greater than those of

elementary subsets. Also, will now be described in support of Figures 3A, 10, 11, 12A, 13

  at 16 and 17A, a preferred variant embodiment of the method and device described above, in which at least one working subassembly has a size different from that of the corresponding elementary subset. In the particular embodiment of this variant, four subsets of work are associated with each elementary subset, these four subsets of work having dimensions greater than

  those of the corresponding elementary subset.

  The image to be processed here is an image of 512 × 512 pixels initially partitioned into square subsets of 32 × 32 pixels, as described above with the support of FIG.

  We will now describe the initial division of the image in so-called

  sets of work, knowing that each additional partition of a subset

  elementary set gives rise to the definition of working subsets of dimensions proportional to that of this elementary subset

  subassemblies are twice as large as sub-assemblies

  elementary sets, so that the image of 512 x 512 pixcls is divided into square subsets of 64 x 64 pixels. However, in order to

  that to a given elementary subset correspond to four subsets

  sets of work (see Figure 3A), the offset used for the division of the image is 32 pixels, the division of the resulting image then cn a

  slate recovery (on English "tiling").

  In FIG. 3A, the elementary subset K 'having, for the coordinates (xi, y, is illustrated in bold lines, while the subsets of

  corresponding work are illustrated with dashed lines, the other sub-

  sets being sketches in fine lines. It is observed that, in this embodiment, to each of the subsets K, are connected four work subsets L, (numbered Li, ..., L4) offset by 64 pixels in both directions and arranged symmetrically with respect to subset K, considered. It is actually the four subsets derived from the division that cover the elementary subset considered (from the initial partition). The expressions below show the coordinates of a subset K, and work subsets L, ..., L4, for all values of the division factor A:

Tables 2

  Ki: [x1, xi -1 + i (32/2)] x [y, yi-1 + (32 / ")] L1 [xi - (48/2 '), xi -1 + (16/2") ] x [yi + (16/2), yj -1 + (80/2 "')] L2: [xi + (16/2), xi -1 + (80/1'] x [yi + (16 / 7Z), Y, -1 + (80/2 ")] L3: Lxi - (48/12"), xi -1 + (1612) x [yi - (48 / Z '), yi -1 + ( 16 / '2 ") L4: [Xi + (1612a), x -1 + (80/2' x [Y1- (4817 /), Y -1 + (16/1)] It is recalled here that the points of the subsets of work defined above which do not belong to the image, that is to say those of which at least one 8c of the coordinates is negative, are fictitiously associated with an average value, for example 127 for each component The compression and decompression devices used to implement this variant embodiment are similar to those described in support of FIGS. 4 and 6. However, the programs 531 and 631 are

* modified as will be explained below.

  With regard first of all to the compression program 531 described above with the support of FIG. 10, its structure is preserved. Only changes the operation 250. This modified operation 250A will be described below in support of

1o of Figure 12A.

  At step 250A, the search for the four subsets

  neighboring work sets L1, L ,, L3, L4 (see Fig. 3A) from the address registered in the CSI register. For this purpose, the rule recalled above is applied. The purpose of step 250A is to determine the values îv., De of the component considered, associated with each of the pixels of the working subsets LI, Lú, L3. L4 geometrically and predeterminedly related to the elementary set considered K ,. The set of values f / iY.) Related to the pixels of the subset L1 (respectively L, L, and L4) will be noted hereinafter 2o '(L1) (respectively. (L2), / (L3) andj (L4)) according to the notation used above. The essential element that differentiates step 250A (FIG. 12A) from step 250 (FIG. 12) lies in the fact that the set of values

  represented by f (L,). i = 1 ... 4 relates to work subassemblies L. i -

  /. v- which have a size different from that of the elementary subset K. In order to be able to carry out the comparison operations with the subset K ,, it is necessary to bring the sets f (L) to the same size Several methods are at the disposal of the person skilled in the art. In this embodiment o the size of the subsets of travafl is 64 x 64 pixels and that of the elementary subsets of 32 x 32 pixels, we retain a mean value per square of 4 pixels. All of these mean values will be noted for a set of work L, considered: f. / L The detailed flow chart of

  this step is shown in Figure 12A.

  Referring to FIG. 12A at step 317, the coordinates (x, y) of the lower left pixel of the elementary subset K, as well as the division factor A, are copied to the arithmetic unit 550 and stored therein. in the register (REG 2) 570. Next, the arithmetic unit 550 determines the coordinates of each pixel of each subset of

  work according to Table 2 as indicated in step 318.

  In step 319, the arithmetic unit 550 will seek, for the component being processed, the value corresponding to each of the (64 / 2A) 2 pixels of L, (respectively L2, L3 and L4) and stores the set of (64 / 2A) 2 values in the register J (L1) 516 (respectively. (L) 517, / (IL) 518 and

/ (L4) 519) of the cache 514.

  In step 320, the arithmetic unit 550 processes each square of 2 x 2 values of / (L,) and substitutes therefor a corresponding value of f1 / i, at the register 516. In this embodiment the value of / (Ll) will be obtained by averaging the values of said square of 2 x 2 values of

  / (L,). The other sets j (L2) .... (L4) are then treated in the same way.

  In step 321, the values of 4L,... LI L] are stored in the part 514 (CACHE) of the random access memory 510, in the registers / L '5I (

f / (L4) 519.

  The program then branches to step 208 (FIG. 13) during which, as indicated above, the parameters (in this case at, u2, _3, a4) and h are calculated by implementing the method of least squares with the constraints described above (see equations 12 and 13). However, in this embodiment, the value of P will be lower than, It is observed that this latter value is higher than that used in the first embodiment. Indeed, in step o, during step 320, substitute work subsets are set in registers 516 to 519 whose value of each pixel is calculated as the average of the values of four pixels. of the initial image, we have already made a contractive application. The constraints applied to the contractivity of the global application that succeeds this substitution can, in

Consequently, be reduced.

  The operation of the compression program is, for the rest, identical to the operation of the compression program 531 described above with the support of FIG. 10. The only difference being that in the registers

  516 to 519, are stored the values XL,) ... J L4j).

  In this alternative embodiment, the decompression program operates in a similar manner to the program 631 described above with reference to FIGS. 16 and 17. However, operation 410 must be modified as

  discussed below and will be referenced as 410A, shown in FIG. 17A.

  The detail of step 410A is described in support of FIG. 17A.

  Step 410A itself comprises steps 459 to 465: Steps 459 and 460 are identical to steps 411 and 412 described above.

  (Figure 17), but they take into account, for the definition of the sub-

  elementary sets and subsets of work the multiplicative factor called "zoom" z which multiplies each of their dimension in a set of data which itself has dimensions that are multiplied by this

zoom factor.

  The program then branches to steps 461, 462 and 463 in which the values f (LI) ... f (L4) are determined. Then at step 462 the values / L1) .X /, I are determined. To do this. the arithmetic unit 550 processes each square of 4 values of / i..j and substitutes a corresponding value of ./(Li) for the register 516. In this embodiment the value of '(LI) corresponding is obtained by calculating the average value of said square or any other low-pass filtering well known to those skilled in the art. The other sets f (L2) ...., [f (14) are then treated in the same way. At step 463, for each pixel xa) of K, the value [L j] (xv) + b "'' .f z '" z "i = 1 is calculated using the coefficients of 520 and the data.L, L ... 1.4 from 516 to 519, (step 462) and is memorized (step 463) this value to the corresponding pixel

  in the register (RE) 621 of the RAM 610.

  Finally, step 464 is identical to step 414 (FIG. 17).

  The operation of the modified decompression program as described above in support of FIG. 17A is otherwise identical to the operation of the decompression program 631 described above.

of Figure 16.

  In this variant embodiment, a complex processing can also be carried out making it possible to transform data. as described supra with the support of FIG. 20, implementing the modified compression and decompression programs 631 as explained above.

  the support of Figures 10, 11, 12A, 13, 14 and 17A.

  4. Description of a variant embodiment

  implement a global contractive application composed of non-linear applications In this variant embodiment of the methods and devices according to the invention, it is implemented a global contractive application

  composed of non-linear applications.

  In this variant embodiment, which also concerns compression and decompression of images, the image to be processed is also a

  0 image 512 x 512 pixels. This image is initially partitioned into

  elementary sets and divided into subsets of work the same

  way than what is described above in support of Figures 1 to 3.

  We will now define the global application used in a

  particular embodiment of this variant embodiment.

  According to this aspect of the invention, each "piece" of the global contractive application is a nonlinear Lipschitzian elementary mapping of the type: n T (f) K, (x, y) E Ki -> [T ( f)] (x, y) = - gj [f] Lj (xy) + bj = l (10b): T (f0 Ki the restriction of T6O to the elementary subset K, g [] .g, [ / are nonlinear transformations of f (g, c F (E, E)), such as fractional or integer powers of f (eg g [f] = f), n> I the number of subsets of (n = 4) in this embodiment) ... "the multiplicative coefficients h the translation factor LI, L., the work subsets, at a position predetermined by

  report to K, and related to this subset.

  It can be seen that the above equation (10b) is of a nonlinear nature essentially because of the nonlinear transformations g, .... g, the coefficients a, j = 1..n and b being respectively the coefficients multiplicative and the translation factor. The coefficients (a1, ..., a ,, b) are here the "parameters" within the meaning of the invention of the elementary application relating to the subset Ki. The set of coefficients (a1 .... an, b) Ki relating to the m elementary subsets (K1, .... Km) constitutes here also the "set of parameters" of

  the overall contractive application within the meaning of the invention.

  It is recalled that, in this embodiment, n = 4, which means that only four work subsets Lj = 1, ..., n such as those defined in support of FIG. each subset

elementary Ki.

  Thus, for each pair of values (x, y) of a determined elementary subset K, a value calculated from the nonlinear equation (10b) is associated. This is done for all the m elementary subsets (K, ..., K,) resulting from the initial partition as well as from

  complementary score, as described above.

  To solve the simplified optimization problem (see above, especially equation (7)) which makes it possible to determine the coefficients of the nonlinear application aj. j = I, .... n and b for each of the subsets

  elementary work K, it is necessary, in general, for each sub-

  elementary set K ,, to minimize the distance between the sub-restriction and the

  elementary set K, and its transformed by the global contractive application.

  In other words, the distances must be minimized: d (f ',,. T (f) [K :). i = L .... n (11) In this respect, the theory presented in support of equations (12) to (29) is applied in the part relating to the general theory. Moreover, it will be observed that, in a general manner in this variant embodiment, the method of secondary representation of the parameters resulting from the primary processing, of initial data, according to the variant described above, implements the general principles described. supra

  lo in support of equations (30) to (32).

  The compression and decompression devices used to implement this variant of embodiment are similar to those described above with reference to FIGS. 4 and 6. However, the programs 531 and 631

  are modified as will be explained below.

  With regard first of all to the compression program 531 described above with the support of FIG. 10, its structure is preserved. Only changes the step 251 relative to the calculations of the coefficients. This variant of step 251 (referenced as 251 B) will now be described in particular in support of the

Figure 12B.

  Step 251B comprises steps 322 and 323 respectively identical to steps 217 and 218 described above with the support of FIG.

  step 324, read in the register (IM) 511, the values f (Lú), ..., f (Ld.

  In step 325, the values gg [f (. F (L,)]... G4 [f (L4)] are determined by calculating by applying formula 25, [f (Li)] = ( Li) Finally, in step 326, the registers 516 to 519 of the part 514 (CACHE) of the random access memory 510 are memorized.

g, [f (L,). g4 ... f [f 'L.4).

87 2761554

  The operation of the compression program with the modified operation 250 as just described is, for the remainder, identical

  operation of the program 531 described supra with the support of Figure 10.

  Similarly, in this alternative embodiment, the decompression program operates similarly to the program 631 described supra with the aid of FIGS. 16 and 17. However, the operation 410 must be modified as explained below. This new operation is referenced 410B ut and illutstié

in Figure 17B.

  The detail of step 41UU will now be de ned in support of FIG. 17B. Step 410B itself comprises steps 471 to 475: In step 471, the coordinates (x, y,) of the elementary subset K are removed and copied to the CSI register 515. The coefficients (a 1 .... a 4, h, relative to the subsets K, are copied from the register (REG 1) to the register 520 of the part 614 (CACHF) of the

is RAM 610.

  The purpose of step 472 is to determine the geometrically and pre-determined geometrically related subsets of the elemental set K, considered. This step comprises the same operations as in step 250 described above with the support of FIG. 12. The values, - [,.] |, Gf],. G2], and g4] |, relative pixels respectively at L ,, L2. L3 and L4 are respectively copied into the registers 516, 517, 518

and 519 (CACHE) 614.

  The program then branches to steps 473 and 474 during which the value Jai - [g, [] |] (x, y) + / 8B is calculated for each pixel (xy) of K using the conserved coefficients. in the register 520 and the data (L1) .... / (L4) kept in the register from 516 to 519, (step 474) and this value is stored at the corresponding pixel in the register (RE) 621 of the

RAM RAM 610.

  In this variant embodiment, it is also possible to carry out a complex process for transforming data as described above with reference to FIG. 20, by implementing modified compression programs 531 and decompression programs 631 as described herein. above

the support of Figures 12B and 17B.

o10

  5. Description of a variant embodiment

  implemented a quality criterion measured using the global contractive application According to one variant, the quality criterion used to determine the need to perform a complementary partition is not. as shown in Figure 19, the comparison, on the one hand, of a statistical measure made on the levels of the component considered in a basic subset with, on the other hand, a threshold, but the comparison of a measure of difference between, on the one hand, the image obtained after having

  applied a global contractive application, with this initial image.

  This variant is illustrated in FIG. 20, in which the tests and operations common to FIG. 19 bear the same references. In this variant, following the operation 206, the operation 250 is performed, taking into account the present value of the division factor A even if this value is not the value that will ultimately be associated with the sub-factor. -together

  basic element. Operation 250 determines. it is recalled, the sub-

  work sets associated with the elementary subset considered.

  Then, the operation 260 is identical to the operation 251 (FIG. 19) with the exception of the storage in the memory register 560 (REG 1).

  therefore provides parameters of the overall contractive application. in the sub

  elementary set considered. The test 255 succeeds the operation 260 and determines, as explained above, whether the elementary subset possesses

minimum dimensions or not.

  When the result of the test 255 is positive, the operation 263 consists in storing in the register 560 (REG 1) the five parameters determined during the operation 260, without associating them with partition information since no new complementary partition did not take place. Then the test

205 is reiterated.

  When the result of the test 255 is negative, the operation consists in determining a criterion called "quality" applicable to the elementary subset considered. Preferentially, the definition of the quality criterion consists in defining a threshold below which the quality criterion is considered to be respected. Preferentially also, the value of the threshold takes into account the dimensions of the elementary subset considered. In the embodiment described and shown, this threshold is the function corresponding to the following table: subset size in pixels threshold 2 x 2 800 4 x 4 640 8x8 400 16 x 16 240 32 x 32 80 It can be seen here that is preferential to use Liun chart

  corresponding to a decreasing function.

  The test 254 then determines whether the quality criterion is respected or not. In the embodiment described is represented, it is respected 3o when the measurement of the mean square deviation between the component considered and its image by the overall contractive application, measurement restricted to the elementary subset considered. is less than the value of the threshold which corresponds, in the table above, to the dimensions of the elementary subset considered. When the result of the test 254 is negative, the operation 256 consists of performing a complementary partition of the elementary subset considered. In the embodiment described and represents. this complementary partition consists in dividing each elementary subset into four equal square elementary subsets. For this purpose, during operation 256, the coordinates of the four points defining the lower left corners of the list are added to the top of the list underimage.

  four elementary subsets resulting from the complementary partition.

  To these coordinates is associated a division factor A which is equal to the division factor of the elementary subset that is partitioned, incremented by the value 1. Finally, partition information worth "1" is stored in the register 560. (REG 1) since an additional partition has

been carried out.

  When the result of the test 254 is positive, the five parameters determined during the operation 260 are stored in the register 560 (REG 1) with partition information equal to "0" since no partition

complementary took place.

  In the variant shown in FIG. 20, it is interesting to measure the average of the values of the mean squared difference of all the treated elementary subsets for which this difference is measured during the operation 254, to determine the utility of an additional treatment during the secondary treatment when this average is greater than a predetermined overall critical value ,. it is useful to plan a

complementary treatment.

  It can be seen here that the variants presented with reference to FIGS. 19 and 20 are particularly well combined, while carrying out the operation

  262 of Figure 20 at the end of operations 258 of Figure 19.

  According to the variants not shown, the complementary partitions are made by performing a non-homothetic cutting of the elementary subsets, such as for example a

  cutting into triangles, into two equal rectangles, successively forming two rectangles side-by-side horizontally or vertically, ..

  According to another variant, the zoom factor is not uniform. It can thus, for example, have a horizontal value, which serves as a multiplicative coefficient to the horizontal dimensions of the elementary subsets and a vertical value which serves as a multiplicative coefficient to the vertical dimensions 1o of the elementary subsets. The zoom factor can also

  have a value that varies depending on the distance to the center of the image ...

  According to another variant, preferential, the zuurii factor is different for the different components of the processed image. For example, the zoom factor is double for each chrominance component of that it is for the luminance component. In this case, a filtering is carried out preliminary to the primary treatment (ie here the compression), filtering which divides the resolution of the chrominance components by a factor of two in each direction, giving to each component of each pixel of the lowest resolution image the average value of the corresponding component o four pixels of the initial image This factor, ef.st trns.mnis

  in the header in the form of the aforementioned ratio.

  At the same time, the number of initial data used for the reconstruction of the luminance component is, in each direction, twice that for each of the chrominance components. Indeed, it is common that the complexity of the chrominance components is less than that of the luminance component, on the one hand and that this

  complexity is less perceived by the human eye.

  In combination with this latter variant, the primary processing device is adapted to perform, before the operations illustrated in FIG. 10, a filtering of the chrominance components in order to divide by two

  their resolution in each direction affects the image.

  Of course, the present invention is not limited to the embodiments chosen and shown but encompasses. on the contrary,

  all variants within the reach of the skilled person.

-2761554

Claims (51)

  1. A method of primary processing of a set of data (IM, f) representative of physical quantities. primary processing method taking into account a minimum dimension and having an "initial partition" step (204) during which said data set is partitioned into so-called "initial elementary" subsets (K), primary treatment method characterized in that it comprises a) for each elementary subset which does not have said minimum dimension, at least one iteration of a sequence of steps comprising: a step of determining so-called "quality" criteria, during which at least one quality criterion is determined by taking into account the dimension of said elementary subset, - a division opportunity estimation step during which an opportunity of splitting said elementary subset is estimated , and - when the opportunity estimate does not meet the quality criteria, a step of "complementary partition" of said subset into elementary subsets said "intermediates" (K,), b) a "construction" step (205 to 209) in which, for each of the elementary subsets (Ki) resulting from the last partition step. we consider n subsets of work (L,), n being nonzero, and we construct a   elementary application of the n subsets of work in the sub-   elementary set considered by determining the parameters (a, b) of the elementary application so as to: make a global application called "of the first type" contractive. for said set of data, global application belonging to the application group consisting of multidimensional applications and non-linear applications, the restrictions of the global application to the elementary subsets (K,) consisting of said elementary applications, the fixed point of the global application constituting an approximation of all or part of this set, to allow the implementation of a method of successive approximations (407 to 410) converging towards the fixed point of said global contractive application; the set of parameters (ai, b) thus determined, as well as, when at least one complementary partitioning step has taken place, a so-called "partition" information, representative of each said complementary partition, constituting   together a primary representation of said data set.   2. Primary processing method according to claim 1, characterized in that, for at least one iteration of said sequence of steps, the opportunity estimate determined during the opportunity estimation step consists of: measuring a predetermined statistical magnitude   i applied to the data of the elementary subset considered.   3. Primary treatment method according to claim 2,   characterized in that the measured statistical magnitude is the variance of the sub- elementary set considered.   4. Primary treatment method according to any one of   Claims 1 to 3, characterized in that at least one iteration of said   sequence of steps is performed after a construction step. the opportunity estimation step comprising an operation of measuring a difference between, on the one hand, the data of the elementary subset and, on the other hand, the restriction of the overall contractive application during construction to the elementary subset considered, and, when a complementary partition step of the elementary subset is performed ,. it is followed by a new construction step taking into account the partition 3 o complementary.   Primary treatment method according to claim 4, characterized in that the difference measuring operation consists of a distance measurement operation.   6. Primary treatment method according to any one of   Claims 2 to 5 characterized in that compliance with the quality criteria   is that said measurement is less than a value whose determination during the criterion determining step takes into account   the dimension of the elementary subset considered.   7. Primary treatment method according to claim 6, characterized in that, during said criterion determining step, said value decreases with said dimension of the subassembly considered.   8. Primary treatment method according to one of claims 6   or 7, characterized in that the opportunity estimate satisfies the criteria of   quality when said measurement is less than said value.   9. Primary treatment method according to any one of   Claims 1 to 8 characterized in that said overall contractive application   consists, at least partially, of Lipschitzian applications   elementary elements each related to an elementary subset (K).   10. Primary treatment method according to any one of   Claims 1 to 9, characterized in that during the step of   construction, for each of said elementary subsets (K,), n geometrically related subsets of work (L,) of   predetermined way to the elementary subset considers.   Primary treatment method according to claim 10, characterized in that at least one of the work subassemblies (L,) has   a different size of the corresponding elementary subset (K,).   12. A method of secondary processing of a set of parameters (ai, b) associated with at least one partition information, resulting from a primary processing of a first set of data, a secondary treatment method characterized in that comprises: a step of determining dimensions of elementary subsets constituting a partition of a second set of data. step taking   account the presence of partition information corresponding to the said sub-   sets, each elementary application corresponding to an elementary subset being determined by at least one parameter of said set of parameters, and - an "iterative computation" step (450) during which, from said set of parameters (ai, b) and said dimensions, a method of successive approximations (407 to 410) converging towards the fixed point of a global contractive application called "second type" is implemented on the second set of data, the restrictions of the global application to the elementary subsets (K,) being constituted of said elementary applications, by implementing, for this purpose, at least one application belonging to the application group consisting of the applications   multidimensional and nonlinear applications.   13. Secondary treatment method according to claim 12.   characterized in that each elemental subset is related to n sub-   sets, n being non-zero, an elementary application of n   set of work in the basic subset being determined by   parameters of said set of parameters.   14. The secondary processing method according to claim 13, characterized in that said partition information is representative of partitions of initial elementary subsets into subsets. intermediate elements.   15. A method of processing a set of data (IM,) representative of physical quantities, comprising a primary treatment phase using a primary treatment method according to one   any of claims 1 to 11 and a secondary treatment phase   implementing a secondary treatment method according to any one of   Claims 12 to 14, the secondary treatment phase   the set of parameters (ai, b) resulting from the primary treatment.   16. Process according to any one of claims 12 to 15,   characterized in that, during said "iterative calculation" step (450), said set of parameters (ai, b) associated with partition information is taken into account, on the one hand, and on the other hand , a set of arbitrary data, called set of "initialization", and to realize said global ucontracting application called "second type": c1) partitioning the initialization set into elementary subsets (K), these subassemblies realizing the partition corresponding to said partition information; c2) considering, for each of the elementary subsets (Ki) thus determined, the parameters (ai, b) of the elementary applications corresponding to the elementary subsets ( K,) resulting from the partition of the set of initial data, and implementing said elementary applications on the elementary subsets (K,) of the set of initialization; c3) the whole of the data is collected; obtained by the bets 3 o of elementary applications, this constituting an intermediate representation of said initial data, affected by an error; c4) we repeat the operations cl-C3, taking as initialization set, said intermediate representation, faton to approach, the fixed point of said global contractive application of second type; The set of data finally obtained constituting a secondary representation (RE) of the data set having been the subject of a primary treatment.   17. Process according to any one of claims 15 or 16,   0 characterized in that said global second type contractive application is   identical to said global first type contractive application.   18. A treatment method according to any one of   claims 12 to 17 wherein said parameters (a, b) and said   Partition information is a primary representation of a multicomponent color image (Y, Cr, Cb), characterized in that, after an iterative computation step (450) on one of the components, the initialization of the component is used. iterative calculation step (450) relating to the next component the secondary representation (RE) obtained at the end of the iterative calculation step   2 (450) relating to one of the components already processed.   19. Treatment method according to any one of   Claims 12 to 18, wherein said parameters (a, b) and said   Partition information is a primary representation of a multicomponent color image (Y, Cr, Cb) characterized in that the iterative computation steps corresponding to said components implement initialization sets consisting of arbitrary data for the processing of data. parameters (a ,, b) relating to each component and in that said iterative calculation steps implement in parallel a method of successive approximations (407 to 410) converging towards the fixed point of each application   global contractive corresponding to each component.   20. Treatment method according to any one of   Claims 1 to 19, characterized in that it is adapted to determine   parameters (ai, b) and the partition information of the global contractive application so as to allow the implementation, on a second set of data comprising a number of data different from the number of data of the first set, of a method successive approximations (407 to 410) converging towards the fixed point of a global contractive application called "second type"; 0 the set of parameters (ai, b) and partition information thus determined constituting a primary representation of said set of data. 21. Process of treatment according to claim 20. characterized in that: - it comprises an "initial partition" step (204) during which, said first set of data is partitioned into so-called "initial elementary" subsets ( Ki)   - during the construction stage (205 to 209), for each of the sub-   elementary sets (Ki), we determine the parameters (a, b) of the elementary application which constitutes a restriction of the contractive application   overall audit of this elementary subset.   the successive approximation method carried out on the second set of data is allowed to take into account elementary subsets each corresponding to an elementary subset of the first set of data and comprising a number of data different from that of the first set of data; elementary subset of the first corresponding data set. 22. Processing method according to claim 21. caractériense in that the data numbers of the elementary subsets of the second set of data are proportional to the data numbers of the elementary subsets of the first set of data which their correspond respectively.   23. Treatment method according to any one of   claims 21 or 22, characterized in that:   - during the construction stage (205 to 209), for each of the sub-   elementary sets (K,) resulting from the initial partition and any additional partitions, consider n work subsets (L,). and we construct an elementary application of the n subsets of work in the elementary subset considered by determining the parameters (a, b) of the elementary application, we allow the method of successive approximations carried out on the second set of data, to take into account subsets of work each corresponding to a subset of work of the first set of data and having a different number of data than the one   of the working subset of the corresponding first data set.   24. The processing method as claimed in claim 23, characterized in that the data numbers of the work subsets of the second data set are proportional to the data numbers of the work subsets of the first set of data which correspond respectively.   25. Device for primary processing (500) of a data set (IM, f representative of physical quantities, characterized in that it comprises: input data means (591) for processing - output means (581) parameters (a, b) and partition information;   first logical means (510, 530, 531, 532, 550, 560.   570, 200 to 209), transforming the data to be processed into parameters (a ,, b) and partition information said first logic means comprising: - "partition" means (204) adapted to partition said set of data into " elementary subsets "(K,) - so-called" quality "criterion determining means adapted to determine at least one quality criterion taking into account the dimension of an elementary subset and - means" of "adapted" estimate for each elemental subset that does not have said minimum dimension. estimating an opportunity of division of said elementary subset, said partitioning means being further adapted to partition each elementary subset which does not have said minimum dimension and whose division opportunity estimate does not respond to quality criteria, in subsets called "intermediate elementary" and - means of "construction" (510, 530, 531, 550, 560, 570, 205 to 209) adapted: 20. to build a global contractive application called " of a first type whose fixed point is an approximation of all or part of this set of data, by determining the parameters of each elementary application of n work subsets associated with each elementary subset resulting from the last partition, in said elementary subset, n being non-zero, the restrictions of the global application to the elementary subsets being constituted by said elementary applications res, said global application belonging to the group of applications constitutes multidimensional applications and nonlinear applications, so as to allow the implementation of a method of successive approximations (407 to 410) converging towards the fixed point of said application overall contractive; to output on the output means (581) the parameters (a ,, b) thus determined, as well as, when at least one elementary subset has been partitioned, a so-called "partition" information, representative of each said partition complementary, jointly constituting   primary representation of said data set.   26. The primary processing device as claimed in claim 25, wherein the estimation means are adapted to measure a predetermined statistical quantity applied to the data of the subassembly. basic element.   Primary treatment device according to claim 26,   characterized in that the measured statistical magnitude is the variance of the sub- elementary set considered.   28. Primary treatment device according to any one of   Claims 25 to 27, characterized in that:   The means of construction having constructed a global contractive application, the estimation means are adapted to measure a difference between, on the one hand, the data of the elementary subset and. on the other hand. the   restriction of the overall contractive application under construction to the sub-   elementary set considered, and in that - when the partition means realize a complementary partition, the construction means are adapted to construct a new global contractive application taking into account said complementary partition 29. Primary treatment device according to claim 28, characterized in that for measuring said difference. the means of estimation   take into account a measure of distance.   30. Primary treatment device according to any one of   Claims 26 to 29, characterized in that the estimation means are   adapted to compare said measurement with a value whose determination by the criterion determining means takes into account the dimension of the elementary subset considered, to determine if the. s quality criteria are met. 31. Primary treatment device according to claim 30, characterized in that the determination means are adapted. to nC q.ue said value decroTt with said dimension of the subset considered and in that the estimating means are adapted to determine that the opportunity estimate meets the predetermined quality criteria when said   measurement is less than that value.   32. Primary treatment device according to any one of   30 or 31, characterized in that the estimation means are   adapted to determine that the opportunity estimate meets the criteria for   quality when said measurement is less than said value.   33. Primary treatment device according to any one of   Claims 25 to 32, characterized in that the construction means (205   209) are adapted to constitute said global contractive application, at least partially, of elementary Lipschitzian applications related to elementary subsets (K,).   34. Primary treatment device according to any one of   Claims 25 to 33, characterized in that the construction means (510,   530, 531, 550, 570, 205 to 209) adapted for each of said elementary subsets (K), n work subsets (L,) geometrically predeterminedly connected to the subassembly basic element.   35. Primary treatment device according to any one of   Claims 25 to 34, characterized in that the construction means (510,   530, 531, 550, 570, 205 to 209) are adapted to take into account at least one of the subsets (Li) of a different size of the subset elementary (Ki) corresponding.   36. Primary treatment device according to any one of   Claims 25 to 35, characterized in that the first logical means   comprise: - a microprocessor (550) - a read only memory (530) comprising a primary data representation program, and - a random access memory (510) comprising registers adapted to record modified variables during the execution of said program of primary representation.   37. Primary treatment device according to any one of   Claims 25 to 36, characterized in that it comprises:   means for "construction" (510, 530, 531, 550, 560, 570, 205 to 209) adapted to be constructed for each set of data to be processed. a global contractive application, called "first type" whose fixed point is an approximation of all or part of this set of data. by implementing, for this purpose, at least one application belonging to the group of applications consisting of multidimensional applications and non-linear applications, so as to:  30. to allow the implementation of a method of successive approximations (407 to 410) converging towards the fixed point of said global contractive application, on a second set of data comprising a number of data different from the number of data of the first data set to output on the output means (581) the parameters (a, b) and the partition information thus determined, these constituting a primary representation of said set of data.   38. Primary treatment device according to claim 37.   characterized in that said first logical means comprise "partition" means (204) adapted to partition said data set into "elementary subsets" (K,), and that the means of construction are adapted, for each elementary subsets (K,) to determine the parameters (a ,, b) of the elementary application which constitutes a restriction of the overall contractive application to said elementary subset, to allow the successive approximation method to be performed on the second set of data, to take into account elementary subsets each corresponding to an elementary subset of the first set of data and having a different number of data than that of the elementary subset of the first set corresponding data.   39. A primary processing device according to claim 38, characterized in that the data numbers of the elementary subsets of the second data set are proportional to the data numbers of the elementary subsets of the first set.   corresponding data respectively.   40. Primary treatment device according to any one of   Claims 37 to 39, characterized in that the construction means are   adapted, for each of the elementary subsets (K.) resulting from the initial partition step and any additional partitions. to take into account n subsets of work (L,) and to build a   elementary application of the n subsets of work in the sub-   elementary set considered by determining the parameters (a, b) of the elementary application. to allow the successive approximation method carried out on the second set of data, to take into account subsets of work corresponding each to a subset of work of the first set of data and comprising Liun different number of data from that of the sub-set of data -work set of the first corresponding data set.   41. The primary processing device according to claim 40, characterized in that the data numbers of the work subsets of the second data set are proportional to the data numbers of the work subsets of the first set of data. correspond to them respectively.   A secondary data processing device (600) suitable for the secondary processing of a set of parameters (a ,, b) associated with at least one partition information, resulting from the primary processing of initial data (IM,) performed by a primary processing device, characterized in that it comprises: input means (681) of the parameters (a ,, b) and partition information; data output means (691)   second logic means (560, 570, 610, 630, 631. 632.   650, 400 to 410) of transforming the parameters (a, b) and partition information into data said second logic means comprising: - means for "determination" of dimensions suitable for determining dimensions of elementary subsets constituting a partition of a second set of data, taking into account the presence of partition information corresponding to said subsets. each .0 7 2761554   elementary application corresponding to an elementary subset being determined by at least one parameter of said set of parameters, and means of "iterative computation" (650, 450) adapted to set An npeuvre, L from said set of parameters (a; b) and said dimensions, a method of successive approximations (407 to 410) converging towards the fixed point of a global contractive application called "second type" comprising said elementary applications, eri implementing, for this purpose, at least an app application to the application group o0 constitutes muftidimensional applications and nonlinear applications, said fixed point constituting a secondary representation (RE) of said set of initial data, and to deliver the data as well as ally on the output means.   43. Secondary treatment device according to claim 42,   characterized in that each elemental subset is related to n sub-   sets, n being non-zero, an elementary application of n   sets of work in the elementary subset being determined by   parameters of said set of parameters.   44. Device according to any one of claims 42 or 43,   characterized in that the elementary application, constructed for some at   least of said elementary subsets (K,) is Lipschitzian.   45. A secondary treatment device according to any one of the   claims 42 to 44, wherein said parameters (a ,, b) are a   primary representation of a multicomponent color image (Y, Cr, Cb) characterized in that said second logic means is adapted to provide the iterative computation means (450) with an initialization set uuilmil. eu   arbitrary data for processing the parameters (ai, h) relative to lin.   first component and, as initialization set for the processing of the following components, the secondary representation (RE) obtained at the end of the iterative calculation step (450) relating to one of the components already processed.   46. Secondary treatment device according to any one of   claims 42 to 45, wherein said parameters (a., b) are a   primary representation of a multicomponent color image (Y, Cr, Cb) characterized in that said second logic means are adapted to provide the iterative computation means (450) with an initialization set consisting of arbitrary data for the processing of data. parameters (a ,, b) relative to o each component and in that the iterative calculation means are adapted to implement in parallel the successive approximation methods (407 to 410) converging towards the fixed point of each global contractive application corresponding to each component.   47. Secondary treatment device according to any one of   Claims 42 to 46, characterized in that said second logic means   comprise: - a microprocessor (650), - a read-only memory (630) comprising a program for the secondary representation (RE) of data, and a random access memory (610) comprising registers adapted to record modified variables during execution. said   secondary representation program (ER).   48. Data processing device (700,800) incorporating a   device (500) according to one of claims 20 to 31 and   Device (600) according to one of Claims 32 to 37   49. Data processing device according to claim 48.   characterized in that said first and second logic means are incorporated in particular in: - a microprocessor (850), - a read-only memory (830) comprising at least one primary data representation program and a secondary representation program (RE) of data; a random access memory (810) comprising registers adapted to record modified variables during execution said programs.   50. Data processing device according to any one of   lo of claims 48 or 49, characterized in that said application   overall contractive second type is identical to said contractive application overall type.   51. Printer, characterized in that it comprises a device   treatment device according to any one of claims 42 to 50.   52. Photocopier, characterized in that it comprises a   treatment device according to any one of claims 42 to 50.   53. A camera, characterized in that it comprises a   treatment device according to one of claims 25 to 50.   54. Facsimile device, characterized in that it comprises a   treatment device according to one of claims 25 to 50.