EP3994890A1 - Procédé et dispositif de codage d'une séquence d'hologrammes numériques - Google Patents
Procédé et dispositif de codage d'une séquence d'hologrammes numériquesInfo
- Publication number
- EP3994890A1 EP3994890A1 EP20733836.9A EP20733836A EP3994890A1 EP 3994890 A1 EP3994890 A1 EP 3994890A1 EP 20733836 A EP20733836 A EP 20733836A EP 3994890 A1 EP3994890 A1 EP 3994890A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- scene
- digital hologram
- wavelets
- hologram
- multiplet
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 49
- 238000004458 analytical method Methods 0.000 claims abstract description 7
- 230000009466 transformation Effects 0.000 claims description 45
- 238000010276 construction Methods 0.000 claims description 6
- 230000011218 segmentation Effects 0.000 claims description 4
- 230000006870 function Effects 0.000 description 10
- 238000004422 calculation algorithm Methods 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 230000006835 compression Effects 0.000 description 2
- 238000007906 compression Methods 0.000 description 2
- 238000004590 computer program Methods 0.000 description 2
- 230000001419 dependent effect Effects 0.000 description 2
- 239000011159 matrix material Substances 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000000638 solvent extraction Methods 0.000 description 2
- 238000010835 comparative analysis Methods 0.000 description 1
- 230000010339 dilation Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000001093 holography Methods 0.000 description 1
- 238000003384 imaging method Methods 0.000 description 1
- 238000001228 spectrum Methods 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
- 238000000844 transformation Methods 0.000 description 1
- 238000013519 translation Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
- H04N19/597—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding specially adapted for multi-view video sequence encoding
-
- G—PHYSICS
- G03—PHOTOGRAPHY; CINEMATOGRAPHY; ANALOGOUS TECHNIQUES USING WAVES OTHER THAN OPTICAL WAVES; ELECTROGRAPHY; HOLOGRAPHY
- G03H—HOLOGRAPHIC PROCESSES OR APPARATUS
- G03H1/00—Holographic processes or apparatus using light, infrared or ultraviolet waves for obtaining holograms or for obtaining an image from them; Details peculiar thereto
- G03H1/04—Processes or apparatus for producing holograms
- G03H1/08—Synthesising holograms, i.e. holograms synthesized from objects or objects from holograms
-
- G—PHYSICS
- G03—PHOTOGRAPHY; CINEMATOGRAPHY; ANALOGOUS TECHNIQUES USING WAVES OTHER THAN OPTICAL WAVES; ELECTROGRAPHY; HOLOGRAPHY
- G03H—HOLOGRAPHIC PROCESSES OR APPARATUS
- G03H1/00—Holographic processes or apparatus using light, infrared or ultraviolet waves for obtaining holograms or for obtaining an image from them; Details peculiar thereto
- G03H1/04—Processes or apparatus for producing holograms
- G03H1/08—Synthesising holograms, i.e. holograms synthesized from objects or objects from holograms
- G03H1/0841—Encoding method mapping the synthesized field into a restricted set of values representative of the modulator parameters, e.g. detour phase coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
- H04N19/119—Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
- H04N19/136—Incoming video signal characteristics or properties
- H04N19/137—Motion inside a coding unit, e.g. average field, frame or block difference
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
- H04N19/18—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being a set of transform coefficients
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/20—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using video object coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
- H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
- H04N19/51—Motion estimation or motion compensation
- H04N19/547—Motion estimation performed in a transform domain
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
- H04N19/61—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding in combination with predictive coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
- H04N19/63—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding using sub-band based transform, e.g. wavelets
-
- G—PHYSICS
- G03—PHOTOGRAPHY; CINEMATOGRAPHY; ANALOGOUS TECHNIQUES USING WAVES OTHER THAN OPTICAL WAVES; ELECTROGRAPHY; HOLOGRAPHY
- G03H—HOLOGRAPHIC PROCESSES OR APPARATUS
- G03H2226/00—Electro-optic or electronic components relating to digital holography
- G03H2226/02—Computing or processing means, e.g. digital signal processor [DSP]
Definitions
- the present invention relates to the technical field of digital holography.
- It relates in particular to a method and a device for encoding a sequence of digital holograms.
- Each wavelet is defined by several characteristic parameters of the wavelet concerned.
- the digital hologram is then represented by a set of coefficients associated respectively with the different wavelets.
- the digital hologram can thus be easily reconstructed by summing the different wavelets, each time weighted by the associated coefficient.
- the present invention proposes a method for encoding a sequence comprising at least a first digital hologram representing a first scene and a second digital hologram representing a second scene, the first digital hologram and the second digital hologram being represented by means of a set of wavelets each defined by a multiplet of coordinates in a multidimensional space,
- the first hologram being represented by a set of first coefficients respectively associated with at least some of the wavelets of said set of wavelets and the second hologram being represented by a set of second coefficients respectively associated with at least some of the wavelets of said set of wavelets,
- the coding method comprising the following steps: - for each of a plurality of second coefficients, determination of a residue by the difference between the second coefficient concerned, associated with a first wavelet defined by a given byte, and the first coefficient associated with a second wavelet defined by a byte having for image the multiplet given by transformation in multidimensional space;
- the transformation is determined by analyzing the variation between the first scene represented by the first digital hologram and the second scene represented by the second digital hologram.
- the transformation makes it possible to assign at least some of the first coefficients to wavelets other than those to which these first coefficients are assigned in the first hologram.
- This transformation thus makes it possible to construct (at least in part) a predicted hologram, which can be subtracted from the second hologram (coefficient by coefficient) in order to obtain residues of lesser value, the coding of which is more efficient.
- the transformation is determined by analyzing the variation between the first scene represented by the first digital hologram and the second scene represented by the second digital hologram, the predicted hologram will best approximate the second hologram.
- This variation can correspond in practice to the movement of an object between the first scene and the second scene.
- Another transformation is thus used for other second coefficients, which makes it possible to refine the prediction of the second hologram using the first hologram.
- This other transformation is for example determined by analyzing another variation between the first scene and the second scene.
- This other variation may correspond in practice to the movement of another object (different from the aforementioned object) between the first scene and the second scene.
- the coding method can also comprise the following steps:
- the above-mentioned transformation can be determined in practice as a function of a movement, between the first scene and the second scene, of a set of connected points (a set of points called "connected component" in the following description).
- the transformation can be determined for example on the basis of three-dimensional representations of the first scene and of the second scene.
- the coding method can comprise the following steps:
- the step of constructing the first depth map may include the following steps: - reconstruction, by means of the first digital hologram (or, as the case may be, by means of the second digital hologram), of the light field at a plurality of points;
- the coordinates of said multidimensional space can respectively represent a parameter representative of a first spatial coordinate in the plane of the hologram, a parameter representative of a second spatial coordinate in the plane of the hologram, a parameter of spatial frequency expansion and an orientation parameter.
- the invention also proposes a device for encoding a sequence comprising at least a first digital hologram representing a first scene and a second digital hologram representing a second scene, the first digital hologram and the second digital hologram being represented by means of a set of wavelets each defined by a multiplet of coordinates in a multidimensional space, the encoding device comprising:
- the determining unit is adapted to determine the transformation by variation analysis between the first scene represented by the first digital hologram and the second scene represented by the second digital hologram.
- the determination unit and the coding unit can for example be implemented in practice by means of a processor of the coding device, this processor being programmed (for example by means of computer program instructions stored in a memory of the coding device) to implement respectively the steps of determining the residues and the step of coding the residues.
- the invention further provides, independently, a method of distributing coefficients respectively associated with wavelets into a plurality of sets of coefficients, the coefficients associated with the wavelets representing a digital hologram intended to reproduce a scene comprising a plurality of parts. , the method comprising the following steps implemented for each of a plurality of said coefficients:
- the line can be determined using the coordinates of that byte.
- these coordinates include a first spatial coordinate in the plane of the hologram, a second spatial coordinate in the plane of the hologram, a spatial frequency dilation parameter and an orientation parameter
- the orientation of the line corresponding to the light ray represented by the wavelet is determined as a function of the expansion parameter and the orientation parameter and / or the position of the straight line corresponding to the light ray represented by a roundelette is determined as a function of these first and second spatial coordinates.
- the invention finally proposes, again independently, a method of constructing a depth map relating to a scene represented by a digital hologram, the depth being defined according to a given direction in space (here the three-dimensional space containing the scene), the method comprising the following steps:
- FIG. 1 represents a coding device according to an exemplary implementation of the invention
- FIG. 2 represents the steps of a coding method in accordance with the teachings of the invention
- FIG. 3 shows the relative positioning of a digital hologram and the scene that this digital hologram represents
- FIG. 4 schematically illustrates the calculation of the residues during coding
- FIG. 5 shows steps in a method of constructing a depth map from a digital hologram.
- the encoding device 1 of FIG. 1 comprises a processor 2 and a storage device 4 (such as a hard disk or a memory).
- the encoding device 1 can also include a communication circuit 6 allowing the processor 2 to exchange data with an external electronic device (not shown).
- the storage device 4 stores at least two digital holograms H 1 ,, H 2 (each represented by a set of coefficients as explained below) forming part of a sequence of digital holograms (this sequence being intended to reproduce the evolution in the time of a given three-dimensional scene).
- the storage device 4 furthermore stores a three-dimensional representation Si; S2 of the three-dimensional scene represented by each of the digital holograms H 1 , H 2 .
- a three-dimensional representation Si S2 of the three-dimensional scene represented by each of the digital holograms H 1 , H 2 .
- no three-dimensional representation of the scene could be present within the coding device 1. This is particularly the case when the digital holograms H 1 , H 2 are received by the coding device 1 via the encoding circuit. communication 6.
- the digital holograms H 1 , H 2 can indeed in practice be constructed (prior to the coding method described below) within the coding device 1 on the basis of the three-dimensional representations Si, S2 (for example as described in 'article "View-dependent compression of digital hologram based on matching pursuit" already mentioned), or be received from an external electronic device.
- the storage device 4 also stores computer program instructions designed to implement a method as described below with reference to FIG. 2 when these instructions are executed by the processor 2.
- the digital holograms H 1 ,, H 2 are represented here respectively by two sets of real coefficients c 1 (k, s, X), C 2 (k, s, X), each coefficient c 1 (k, s, X) , C2 (k, s, X) being associated with a Gabor-Morlet wavelet Y k, s, X defined by the parameters k, s, X, where
- - s is a parameter (integer) which defines the expansion of the spatial frequencies (s varying between 1 and a);
- - X is a couple of integers which respectively define the two-dimensional spatial coordinates in the plane of the digital hologram (i.e. the plane (O, x, y) in figure 3), with X ⁇ [0 , N x [x [0, N y [.
- N, a, N x and N y are fixed for the representation considered.
- each Gabor-Morlet wavelet Y k, s, X is defined by a multiplet of coordinates k, s, X in a multidimensional space (here in 4 dimensions).
- first coefficients the coefficients c 1 (k, s, X) representing the digital hologram Hi and “second coefficients” the coefficients c 2 (k, s, X) representing the digital hologram H 2 .
- the digital holograms H 1 , H 2 could therefore be reconstructed as follows:
- H 1 S k, s, X C 1 (k, s, X).
- H 2 S k, s, X C 2 (k, s, X). Y k, s, X
- D x and D y and D s denote discretization steps respectively of the first spatial component in the plane of the hologram, of the second spatial component in the plane of the hologram and the expansion of spatial frequencies, for A ⁇ R 2 ,
- This method aims at a differential coding of the digital hologram H 2 on the basis of the digital hologram H 1 .
- the digital hologram H 1 is used as the reference digital hologram.
- This method begins here with a step E2 of segmentation of the coefficients into sets of coefficients E, respectively associated with parts P, of the scene (which amounts to grouping the wavelets Y k, s, X into groups of wavelets respectively associated with these parts P, of the scene).
- Each part P of the scene is formed by a set of points from the same region that may have a similar movement.
- a part P, of the scene is referred to below as a “connected component”. In practice, this is, for example, an object in the scene.
- the connected components P are for example identified on the basis of the three-dimensional representation Si of the scene (three-dimensional representation corresponding to the digital hologram H 1 ).
- the connected components P can be reconstructed from a digital hologram (here H 1 ), for example by means of a depth map, as described below.
- step E2 for each coefficient c 1 (k, s, X) of the digital hologram H 1 , it is determined which part P, (or connected component) of the scene is crossed by a straight line D (representing a light ray associated with a patch Y k, s, X ) passing through the point of coordinates X (in the plane of the digital hologram) and oriented according to the directing vector V k, s of coordinates:
- each set E comprising coefficients c 1 (k, s, X) associated with wavelets Y k, s, X which model light rays having an intersection with the part P, associated with the set E, concerned.
- each set E corresponds to a group of wavelets Y k, s, x which model light rays having an intersection with the part P associated with the set E, concerned.
- the segmentation step E2 could be omitted.
- a single set E, of coefficients in this case the set E 1 ) is processed.
- the method of FIG. 2 continues with a step E4 at which a rigid transformation F is determined, for each connected component (or part) P, of the scene.
- This rigid transformation F is for example determined by analyzing the movement of the connected component P, between the scene represented by the hologram H 1 and the scene represented by the hologram H 2.
- This motion analysis is for example performed by comparing the three-dimensional representation Si (scene represented by the digital hologram H 1 ), and the three-dimensional representation S2 (scene represented by the digital hologram H 2 ).
- Si scene represented by the digital hologram H 1
- S2 scene represented by the digital hologram H 2
- this motion analysis could be performed by comparing a first depth map derived (as explained below) from the digital hologram H 1 and a second depth map derived (as explained below) from l digital hologram H 2.
- Such depth maps make it possible to come back to the above-mentioned three-dimensional case.
- the method of FIG. 2 then comprises a step E6 of determining, for each set E i of coefficients, a linear transformation T, of the space-frequency domain on the basis of the rigid transformation determined in step E4 for the component connected P, associated with the set E i concerned.
- the linear transformation T i is defined as follows (on the basis of the corresponding rigid transformation F i ):
- the method of FIG. 2 then comprises in step E8 the construction of a predicted digital hologram H p as a function of the digital hologram H 1 and by means of the linear transformations Ti determined in step E6.
- This transformation G is thus the transformation which corresponds, in the multidimensional space of the definition coordinates of the wavelets, to the rigid transformation F, of the connected component P ,.
- This linear transformation G is valid for the coefficients of the set E, associated with this connected component P ,.
- H p S k, s, X C 1 (k, S, X).
- Y Gi (k, s, X)
- the method of FIG. 2 then comprises a step E10 for determining a set of residues by difference between the digital hologram H 2 (hologram to be encoded) and the digital hologram H p predicted on the basis of the digital hologram Hi (digital reference hologram).
- Each residue is therefore determined by the difference between a coefficient c 2 (k ', s', X '), associated (in the digital hologram H 2 ) with a roundet Y k', s ', X' defined by the multiplet (k ', s', X'), and a coefficient c 1 (k, s, X), associated in the digital hologram H 1 ,, to a wavelet Y k, s, X defined by a multiplet (k, s, X) having for image the multiplet (k ', s', X') by the transformation G, associated with the set E, comprising the coefficient c 1 (k, s, X).
- the method of FIG. 2 finally comprises a step E12 for coding the residues
- the differential coding of the digital hologram H 2 is carried out with reference to a single digital hologram H 1 ,.
- the value of the bidirectionally predicted coefficients may be equal to the average of the coefficients predicted from said two digital holograms.
- FIG. 5 represents steps of a method of constructing a depth map from a digital hologram H (this method can be applied to the hologram Hi and / or to the hologram H 2 as already indicated) .
- M x and M y the desired horizontal and vertical resolutions for the depth map
- M z the number of levels of the depth map.
- the method of FIG. 5 begins with a step E20 at which a variable d is initialized to the value 0.
- F and F -1 are the forward and reverse Fourier transforms, respectively, and f x and f y are the frequency coordinates of the hologram in the Fourier domain.
- the method then comprises a step E24 of segmenting the reconstructed field U into M x .M y segments (rectangular), each segment having a horizontal resolution K x and a vertical resolution K y .
- the method then comprises a step E26 of calculating a sharpness metric v for each of the segments obtained in step E24. If we refer to each segment by a horizontal index i and a vertical index j, we calculate the value v [i, j, d] of the sharpness metric for each segment of indices i, j, here by means of the normalized variance : where is the average intensity of the field on the segment concerned:
- Another sharpness metric could be used, for example one of the metrics mentioned in the article "Comparative analysis of autofocus functions in digital in-line phase-shifting holograph ⁇ ', by ESR Fonseca, PT Fiadeiro, M. Pereira , and A. Pinheiro in Appl. Opt., AO, vol. 55, no. 27, pp. 7663-7674, Sep. 2016.
- the method then comprises a step E28 of incrementing the variable d and a step E30 of testing the equality between the current value of the variable d and the number Mz of levels of the depth map.
- step E30 the method loops to step E22 for processing the depth level Z d corresponding to the (new) current value of the variable d.
- the method can then construct in step E32 the depth map D by choosing, for each element of the map (here identified by the indices i, j), the depth (denoted here D [i, j]) for which the sharpness metric is maximum (among the different segments aligned along the Oz axis, all here with indices i, j, and associated respectively with the different depths for d varying from 0 to M z -1).
- the depth map D thus obtained can be used as already mentioned to determine the connected components (or parts) P of the scene, for example by means of a partitioning algorithm (or “clustering algorithm”).
- a k-means algorithm can be used for this, for example as described in the article "Some methods for classification and analysis of multivariate observations", by MacQueen, J. in Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Volume 1: Statistics, 281 --297, University of California Press, Berkeley, Calif. , 1967.
- the partitioning algorithm makes it possible to group together the connected segments (here of indices i, j) having close depth values (here D [i, j]), the groups thus produced forming the connected components P i .
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Holo Graphy (AREA)
- Signal Processing For Digital Recording And Reproducing (AREA)
Abstract
Description
Claims
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
FR1907555A FR3098367B1 (fr) | 2019-07-05 | 2019-07-05 | Procédé et dispositif de codage d’une séquence d’hologrammes numériques |
PCT/EP2020/067744 WO2021004797A1 (fr) | 2019-07-05 | 2020-06-24 | Procédé et dispositif de codage d'une séquence d'hologrammes numériques |
Publications (1)
Publication Number | Publication Date |
---|---|
EP3994890A1 true EP3994890A1 (fr) | 2022-05-11 |
Family
ID=68138500
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP20733836.9A Pending EP3994890A1 (fr) | 2019-07-05 | 2020-06-24 | Procédé et dispositif de codage d'une séquence d'hologrammes numériques |
Country Status (4)
Country | Link |
---|---|
US (1) | US20220272380A1 (fr) |
EP (1) | EP3994890A1 (fr) |
FR (1) | FR3098367B1 (fr) |
WO (1) | WO2021004797A1 (fr) |
Families Citing this family (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
FR3134199B1 (fr) | 2022-03-31 | 2024-03-08 | Fond B Com | Procédé d’application d’une transformation à un hologramme numérique, dispositif d’holographie numérique et programme d’ordinateur associés |
WO2023187126A1 (fr) | 2022-03-31 | 2023-10-05 | Fondation B-Com | Procédé et dispositif de décodage d'un hologramme numérique, procédé et dispositif de codage d'un hologramme numérique et programme d'ordinateur associé |
FR3141582A1 (fr) | 2022-10-26 | 2024-05-03 | Fondation B-Com | Procédé et dispositif de codage d’un ensemble de coefficients, procédé et dispositif de décodage d’un ensemble de coefficients, flux de données et programme d’ordinateur associés |
Family Cites Families (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
PT921449E (pt) * | 1997-11-20 | 2001-10-30 | Europ Economic Community | Processo e dispositivo holograficos assistidos por computador |
EP1008919A1 (fr) * | 1998-12-09 | 2000-06-14 | Communauté Européenne (CE) | Procédé et dispositif holographiques assistés par ordinateur pour restituer des images tridimensionnelles |
US7792390B2 (en) * | 2000-12-19 | 2010-09-07 | Altera Corporation | Adaptive transforms |
US6888891B2 (en) * | 2002-01-09 | 2005-05-03 | Octa Technology, Inc. | Wavelet domain half-pixel motion compensation |
US6927886B2 (en) * | 2002-08-02 | 2005-08-09 | Massachusetts Institute Of Technology | Reconfigurable image surface holograms |
US7532772B2 (en) * | 2004-07-20 | 2009-05-12 | Duke University | Coding for compressive imaging |
KR100586026B1 (ko) * | 2005-03-25 | 2006-06-02 | 한국전자통신연구원 | 디지털 홀로그램 부호화 또는/및 복호화 장치 및 그 방법 |
WO2008081459A2 (fr) * | 2007-01-03 | 2008-07-10 | Numeri Ltd. | Procédé et système de traitement à base d'ondelettes |
FR2986874A1 (fr) * | 2012-02-15 | 2013-08-16 | France Telecom | Procede de codage de motif holographique, dispositif de codage et programme d'ordinateur correspondants |
FR3015743A1 (fr) * | 2013-12-23 | 2015-06-26 | Orange | Procede de traitement d'une sequence d'images holographiques, dispositifs, signaux, dispositifs et programme d'ordinateur associes |
FR3041440A1 (fr) * | 2015-09-17 | 2017-03-24 | Orange | Procede de traitement d'une image holographique |
EP3522539A1 (fr) * | 2018-02-01 | 2019-08-07 | Vrije Universiteit Brussel | Procédé et appareil permettant de compenser le mouvement d'un flux vidéo holographique |
-
2019
- 2019-07-05 FR FR1907555A patent/FR3098367B1/fr active Active
-
2020
- 2020-06-24 WO PCT/EP2020/067744 patent/WO2021004797A1/fr unknown
- 2020-06-24 EP EP20733836.9A patent/EP3994890A1/fr active Pending
- 2020-06-24 US US17/624,748 patent/US20220272380A1/en active Pending
Also Published As
Publication number | Publication date |
---|---|
WO2021004797A1 (fr) | 2021-01-14 |
FR3098367B1 (fr) | 2023-01-27 |
FR3098367A1 (fr) | 2021-01-08 |
US20220272380A1 (en) | 2022-08-25 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP3994890A1 (fr) | Procédé et dispositif de codage d'une séquence d'hologrammes numériques | |
EP0473476A1 (fr) | Procédé et dispositif de localisation en temps réel de contours rectilignes dans une image numérisée, notamment pour la reconnaissance de formes dans un traitement d'analyse de scène | |
WO2013121140A1 (fr) | Procédé de codage de motif holographique, dispositif de codage et programme d'ordinateur correspondants | |
EP3097692A2 (fr) | Procédé de traitement d'une séquence d'images holographiques, dispositifs, signaux, dispositifs et programme d'ordinateur associés | |
WO2000008604A1 (fr) | Affinement selectif de mailles | |
Denoyelle | Theoretical and numerical analysis of super-resolution without grid | |
EP0825556B1 (fr) | Codeur par transformation de blocs pour segments d'image de formes arbitraires | |
WO2006040270A2 (fr) | Procede de decodage local d'un train binaire de coefficients d'ondelettes | |
FR2853748A1 (fr) | Procede de tatouage d'une image en couleurs par approche vectorielle, procede de detection d'une marque de tatouage, dispositifs, image et programmes d'ordinateurs correspondants | |
FR2933520A1 (fr) | Procede et dispositif de restauration d'une sequence video | |
EP3350656A1 (fr) | Procédé de traitement d'une image holographique | |
CN112581362A (zh) | 用于调整图像细节的图像处理方法和装置 | |
EP3814850B1 (fr) | Procédé de génération d'un hologramme numérique, dispositif, système de restitution holographique et programme d'ordinateur associés | |
FR3141582A1 (fr) | Procédé et dispositif de codage d’un ensemble de coefficients, procédé et dispositif de décodage d’un ensemble de coefficients, flux de données et programme d’ordinateur associés | |
FR3134198A1 (fr) | Procédé et dispositif de décodage d’un hologramme numérique, procédé et dispositif de codage d’un hologramme numérique et programme d’ordinateur associé | |
US20230196520A1 (en) | Inverse kernel-based defocus deblurring method and apparatus | |
FR3111999A1 (fr) | Procédé et dispositif de reconstruction d’un hologramme numérique, procédé d’affichage d’un hologramme numérique et système associé | |
FR3141785A1 (fr) | Procédé et dispositif d’estimation d’une carte de profondeur associée à un hologramme numérique représentant une scène et programme d’ordinateur associé | |
WO2023187126A1 (fr) | Procédé et dispositif de décodage d'un hologramme numérique, procédé et dispositif de codage d'un hologramme numérique et programme d'ordinateur associé | |
FR2929431A1 (fr) | Procede et dispositif de classification des echantillons representatifs d'un signal numerique d'image | |
FR3142026A1 (fr) | Détection d’objets dans une image | |
FR3131417A1 (fr) | Correction d'artefacts de reconstructions tomographiques par reseaux de neurones | |
WO2021123617A1 (fr) | Procede d'encodage d'une image numerique en vue de sa compression | |
FR2667472A1 (fr) | Dispositif de segmentation binaire en temps reel d'images numerisees. | |
BE1021546B1 (fr) | Procede et systeme pour le stockage de donnees de forme d'onde. |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: UNKNOWN |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE |
|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE |
|
17P | Request for examination filed |
Effective date: 20211229 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
DAV | Request for validation of the european patent (deleted) | ||
DAX | Request for extension of the european patent (deleted) | ||
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: EXAMINATION IS IN PROGRESS |
|
17Q | First examination report despatched |
Effective date: 20231026 |