EP1405268A1 - Method of wavelet coding a mesh object - Google Patents
Method of wavelet coding a mesh objectInfo
- Publication number
- EP1405268A1 EP1405268A1 EP02762522A EP02762522A EP1405268A1 EP 1405268 A1 EP1405268 A1 EP 1405268A1 EP 02762522 A EP02762522 A EP 02762522A EP 02762522 A EP02762522 A EP 02762522A EP 1405268 A1 EP1405268 A1 EP 1405268A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- coefficients
- wavelet
- basic
- wavelet coefficients
- sub
- 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.)
- Withdrawn
Links
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/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
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T9/00—Image coding
- G06T9/007—Transform coding, e.g. discrete cosine transform
Definitions
- the field of the invention is that of coding mesh objects with at least two dimensions. More specifically, the invention relates to the representation and coding of meshes, or of textures coded by meshes, associated with objects of a graphic scene implementing a method called "wavelet".
- the invention applies more particularly, but not exclusively to 2nd generation wavelets, presented in particular in the document by Wim Sweldens, entitled “The Lifting Scheme: A Construction of Second Generation Wavelets” (in French, “The process of elevation: a construction of second generation wavelets "), SIAM Journal on Mafhematical Analysis, Volume 29, number 2, pp 511-546, 1998.
- the invention finds applications in all fields where it is desirable to optimize the storage and / or transmission of images.
- the invention applies in particular, but not exclusively, to the storage and transmission of three-dimensional models, elevation grids, and of objects and textures coded by two-dimensional meshes.
- an object coded according to such a technique is presented as the union of the following two elements: the basic mesh, which generally has few facets, and represents a coarse version of the object to be coded; the wavelet coefficients, which are triplets of real numbers assigned simultaneously to a precise area of the basic mesh and to a given level of subdivision of this mesh. These wavelet coefficients represent the refinements to be made to the zone with which they are associated in order to converge towards the geometry of the initial object.
- zero-trees coding technique which achieves the best results in terms of compression of the wavelet coefficients to be transmitted.
- One such technique consists in describing an order of coding of the wavelet coefficients, which is predetermined and known in advance by the transmitter and receiver terminals (for example of a server and of a client display terminal). Such a technique therefore makes it possible, during the transmission of wavelet coefficients, to avoid transmitting information relating to the ranges of non-significant coefficients for the coding of the object considered.
- Such zero-tree coding is generally coupled to a "bit-plane" coding, which makes it possible, when transmitting the coefficients, to transmit the most significant bits of each coefficient first.
- the coding techniques are based on the arbitrary adoption of a hierarchy between the wavelet coefficients to be transmitted, making it possible to determine their order of transmission to a remote display or storage terminal. This order, known to the receiving terminal, allows the latter to reconstruct the entire transmitted object.
- a disadvantage of these techniques of the prior art is that the server in charge of transmitting the wavelet coefficients to a display terminal cannot make a selection of the coefficients which it wishes to send, and therefore systematically transmits the whole coefficients at the client terminal.
- a disadvantage of these techniques of the prior art is therefore that the client receives all the wavelet coefficients, including those corresponding to the coding of portions of the object which he does not wish to visualize, and of which he therefore no need.
- the communication network used for the transmission of the wavelet coefficients is therefore unnecessarily overloaded, and the transmission rate of the useful coefficients decreases accordingly.
- the reconstruction of a representation of the object from all of the wavelet coefficients is long, which is a source of inconvenience for the customer.
- Another disadvantage of these techniques of the prior art is therefore that, if the client wishes to carry out an adaptive decoding, so as to view only the portions of the object which interest him, he must perform a sorting himself transmitted wavelet coefficients. The client must therefore decode the entire data stream transmitted by the server, or coming from a data carrier, then judge the relevance of the wavelet coefficients thus decoded, according to the portion of the mesh to which they are associates.
- a disadvantage of these techniques of the prior art is that, in order to carry out an adaptive decoding, the client must have a display terminal having sufficient processing capacities to carry out the decoding operations of the global stream, selection of the relevant coefficients, and reconstruction of a representation of the object from the coefficients thus selected.
- a disadvantage of these techniques of the prior art is that it is impossible, for a client having a display terminal having reduced processing capacities, to carry out an adaptive decoding.
- the invention particularly aims to overcome these drawbacks of the prior art.
- an objective of the invention is to implement a technique of coding an object by wavelets, allowing a display terminal to carry out an adaptive decoding of the object.
- Another objective of the invention is to provide a technique for coding an object by wavelets, allowing a server to select certain wavelet coefficients, and to transmit the selected coefficients, according to an area of the basic mesh. with which they are associated.
- an objective of the invention is to allow a server to transmit only certain wavelet coefficients, according to a request from a client.
- the invention also aims to implement a technique of coding meshes representative of objects or 3D scenes, allowing an adaptive reconstruction of a mesh within a display terminal.
- Another objective of the invention is to provide a coding technique for an object using wavelets which is suitable for display terminals having low processing capacities.
- the invention also aims, of course, to provide a reconstruction and transmission technique over a communication network of an object coded according to this coding method.
- an objective of the invention is not to unnecessarily overload the communication networks.
- Another objective of the invention is to implement a technique for coding an object by wavelets which is suitable for transmission via a communication network with limited bit rate.
- said wavelet coefficients are partitioned into at least two disjoint subsets each undergoing independent coding, and said method inserts, into said global data stream, location data making it possible to identify wavelet coefficients relating to a portion of said object in said global data flow, so as to allow a selective reconstruction of said portion using the coefficients of at least one of said subsets.
- the invention is based on a completely new and inventive approach to the coding of an object by wavelets and the shaping of the data thus coded within a global data stream.
- the invention is notably based on the generation of a global data flow, within which one can easily identify the wavelet coefficients, as a function of the portion of the mesh object with which they are associated. This is in particular allowed, within the framework of the invention, by the insertion of location data within the data stream, so as to allow an adaptive visualization of the coded object by a client terminal.
- each of said disjoint subsets is a basic facet.
- said coding implements the following steps: detection of at least one non-significant part; - specific treatment of each of said non-significant parts.
- a coding of the subsets of wavelet coefficients that is to say a transformation of these coefficients into a binary sequence
- said coding implements a "zero-tree" type technique.
- the "zero-tree” technique is to date the technique for achieving the best compression results. It is of course also possible to envisage using any other technique for coding the wavelet coefficients within the overall data stream, adapted to the implementation of the invention.
- said global data stream comprises a header, comprising at least some of said location data, and a zone of wavelet coefficients, comprising a sub-area identified by said location data for each of said disjoint subsets.
- the wavelet coefficients zone of the global data stream includes N identifiable sub-zones, within the flow, using location data. It will be noted here that the location data making it possible to identify a sub-zone of the flow can be included in the header and / or in any other part of the data flow.
- said location data contained in said header identifies a sub-area, by defining a distance between the position of a reference element and the start of said sub-area in said flow.
- Such a reference element can for example be the start or the end of the header, or any other element whose position in the flow can easily be known.
- the distance can for example be expressed in number of bits.
- said header further comprises at least some of the information belonging to the group comprising: the number of basic facets; the type of wavelet; information relating to said object; information relating to the coding of said location data.
- This information can be used by a display terminal to reconstruct, from the flow, a representation of a portion, or of the whole, of the meshed object.
- said global data stream comprises at least one area of wavelet coefficients, comprising a sub-area identified by said location data for each of said disjoint subsets, said location data comprising at least minus one marker at the beginning and / or at the end of each of the sub-areas.
- the location data is distributed throughout the overall data flow, and not grouped in a header, as before.
- said sub-areas are organized in said stream in order of increasing basic facet.
- each of the basic facets undergoes independent coding (for example of the "zero-tree" type)
- the invention also relates to a method for transmitting a data stream, between, on the one hand, at least one server and / or at least one data carrier, and, on the other hand, at least one display terminal , said data flow making it possible to reconstruct an object associated on the one hand with a basic mesh made up of a set of basic facets, and on the other hand with coefficients in a wavelet base corresponding to local modifications of said basic mesh.
- such a transmission method comprises: a step of receiving a request defining a portion of said object to be displayed; a step of analyzing location data present in said stream, as a function of said request, making it possible to identify wavelet coefficients relating to said portion in said data stream; a step of extracting said identified wavelet coefficients to form a reduced data stream; a step of transmitting said reduced data stream.
- a server on receipt of a request from a client relating to a portion of the object, can select, within the global data flow, the subset or coefficients associated with the portion of the object considered. It can then construct a reduced flow, from the coefficients of the sub-assembly (s) concerned, and transmit it to the customer's display terminal.
- the invention also relates to a signal representative of an object associated with a basic mesh consisting of a set of basic facets, and with coefficients in a wavelet base corresponding to local modifications of said basic mesh, comprising at at least one area of wavelet coefficients and at least one location area, comprising location data making it possible to locate wavelet coefficients relating to a portion of said object in said signal.
- said wavelet coefficients being partitioned into at least two disjoint subsets each undergoing independent coding comprises a header, comprising at least some of said location data, and a wavelet coefficient area, comprising a sub-area identified by said location data for each of said subsets.
- said wavelet coefficients being partitioned into at least two disjoint subsets each undergoing independent coding comprises at least one area of wavelet coefficients, comprising a sub- area identified by said location data for each of said subsets, said location data location comprising at least one marker at the start and / or at the end of each of the sub-areas.
- the invention also relates to a data medium intended to store at least one object coded according to the method described above.
- the invention also relates to a system for transmitting a data stream, between, on the one hand, at least one server and / or at least one data carrier, and, on the other hand, at least one display terminal , said data flow making it possible to reconstruct an object associated on the one hand with a basic mesh made up of a set of basic facets, and on the other hand with coefficients in a wavelet base corresponding to local modifications of said basic mesh.
- such a system comprises: means for receiving a request defining a portion of said object to be displayed; means for analyzing location data present in said stream, as a function of said request, making it possible to identify wavelet coefficients relating to said portion in said data stream; means for extracting said identified wavelet coefficients to form a reduced data flow; - means for transmitting said reduced data flow.
- the invention also relates to a terminal for viewing an object associated with a basic mesh consisting of a set of basic facets, and with coefficients in a wavelet base corresponding to local modifications of said basic mesh, comprising means for receiving a global data stream making it possible to reconstruct said object, further comprising means for formulating a request defining a portion of said object to be viewed intended for a server and / or a data medium , and means for reconstructing said portion from a reduced data stream, comprising wavelet coefficients relating to said portion, received from said server and / or from said data medium.
- a terminal therefore differs greatly from the display terminals of the prior art.
- the invention also relates to a server comprising means for storing at least one object coded according to the coding method described above and transmission means implementing the transmission method described above.
- the invention finally relates to a device for coding an object associated with a basic mesh consisting of a set of basic facets, and with coefficients in a wavelet base corresponding to local modifications of said basic mesh, said device generating a global data stream making it possible to reconstruct said object, partitioning said wavelet coefficients into at least two disjoint subsets, and applying independent coding to each of said subsets, and comprising means of insertion, into said global data flow, of localization data making it possible to locate wavelet coefficients relating to a portion of said object in said global data flow, so as to allow selective reconstruction of said portion using coefficients of at least one of said subsets.
- FIG. 1 presents a synoptic of the different steps implemented during the coding of a mesh object with at least two dimensions according to the invention
- FIG. 2 illustrates an example of the structure of a data stream generated during the coding presented in FIG. 1, and comprising location data, according to a first variant of the invention
- - Figure 3 details the structure of the data flow of Figure 2, when the location data is indicative of a distance within the flow
- FIG. 1 presents a synoptic of the different steps implemented during the coding of a mesh object with at least two dimensions according to the invention
- FIG. 2 illustrates an example of the structure of a data stream generated during the coding presented in FIG. 1, and comprising location data, according to a first variant of the invention
- - Figure 3 details the structure of the data flow of Figure 2, when the location data is indicative of a distance within the flow
- FIG. 1 presents a synoptic of the different steps implemented during the coding of a mesh object with at least two dimensions according to the invention
- FIG. 2 illustrates an example of the structure
- FIG. 4 describes an example of the structure of a data stream generated during the coding of a meshed object with at least two dimensions, and comprising location data distributed within the stream, according to a second variant of the invention
- FIG. 5 presents a block diagram of the different steps implemented by a server for transmitting the data flow of FIGS. 2 to 4, on receipt of a request from a client terminal.
- the general principle of the invention is based on the insertion of location data within a data stream generated during the wavelet coding of a mesh object with at least two dimensions, so as to allow selection and transmission. selective coefficients according to the area of the object with which they are associated.
- FIG. 1 a particular embodiment of the coding method of the invention is presented.
- wavelets an object with at least two dimensions coded according to a method called "wavelets”. It is recalled that, according to such a method, a basic mesh is associated with the object, and a plurality of wavelet coefficients, corresponding to the refinements to be made to the basic mesh in order to reconstruct a representation of the object. Each node of the basic mesh is thus associated with a wavelet coefficient.
- a wavelet coefficient is a triplet of reals (x, y, z), accompanied by information I of spatial and frequency location, making it possible to know to which wavelet a coefficient is associated.
- This information I can for example be a quadruplet (F0, a, b, c), where F0 represents a facet of the basic mesh, and (a, b, c) represent barycentric coordinates on this face.
- the coding device performs a partition of the set of wavelet coefficients associated with the mesh object to be coded, into subsets M 15 M 2 , ..., M N.
- These subsets are preferably disjoint. They can be constructed based, for example, on visual criteria. They each include the wavelet coefficients used to reconstruct a representation of a portion of the mesh object to be coded.
- the mesh object to be coded is a three-dimensional character
- the coding device defines, on each subset M i5 an arbitrary hierarchy by determining parentage links between the different vertices of the subset, if necessary.
- parentage links between the different vertices of the subset, if necessary.
- the coding device then performs (22) an independent coding of the wavelet coefficients of each of the subsets M i5 for i varying from 1 to N.
- Such coding is for example a "zero-tree" type coding, and allows to compress the representation of the wavelet coefficients, and therefore of the associated mesh nodes, of each of the subsets M ; .
- the coding device During a step referenced 23, the coding device generates a global data stream, comprising, on the one hand, the result of the coding (for example of the "zero-tree" type) of each of the subsets M i5 and secondly, location data making it possible to determine the position of each of the subsets M; in the stream.
- the structure of such a flow makes it possible to obtain great flexibility in sending one or more JV1 subsets to a display terminal, according to a request from a client.
- FIG. 2 an embodiment of a data stream 1, generated according to the method of FIG. 1, is presented.
- each of the subsets M includes the wavelet coefficients associated with a basic facet of the object. It will of course be easy for a person skilled in the art to generalize the description below in the event that a subset M ; includes the wavelet coefficients associated with a plurality of basic facets, or with a plurality of nodes of the basic mesh.
- the facets of the basic mesh are ordered in ascending order. For example, one arbitrarily chooses a starting facet, and one chooses an order of course of the set of basic facets (for example in the trigonometric, or anti-trigonometric direction), so that the starting facet is considered as the first facet, and so on until the last facet of the basic mesh traversed according to the order of course, which becomes the M lth basic facet.
- a data stream 1 is generated by a coding device during the wavelet coding of an object, for example three-dimensional.
- the data stream 1 comprises a header 10, and a zone of wavelet coefficients 11.
- the wavelet coefficients area 11 is preferably divided into a plurality of sub-areas (not shown in FIG. 1), each grouping the wavelet coefficients associated with a facet of the basic mesh of the object.
- a wavelet coefficient is a triplet of reals (x, y, z), accompanied by information I of spatial and frequency location, making it possible to know which wavelet a coefficient is associated with.
- This information I can for example be a quadruplet (F0, a, b, c), where F0 represents a facet of the basic mesh, and (a, b, c) represent barycentric coordinates on this face.
- each sub-zone comprises the "zero-tree" coding of the wavelet coefficients associated with a basic facet.
- the coefficients are partitioned into a plurality of subsets M ;, the same subset being able to group together several basic facets FO, and an independent “zero-tree” coding is carried out for each of the subsets Mi.
- Each sub-zone then comprises the “zero-tree” coding of the wavelet coefficients associated with a subset M;). It is of course also possible to envisage using any other coding technique allowing satisfactory compression and transmission of the wavelet coefficients. We preferentially use a coding technique allowing a specific coding of the insignificant parts of the object considered.
- the header 10 includes the location data, making it possible to locate each of the sub-areas within the wavelet coefficient area 11. It also includes information relating to the type of coding implemented, such as information on the type of wavelet functions used, the number of wavelet coefficients, the characteristics of the basic mesh (number of basic facets, ...), or even the maximum level of subdivision of the basic mesh. In the particular embodiment presented in relation to the figure,
- the area of the wavelet coefficients 11 is divided into a plurality of sub-areas referenced 111 to 113.
- the sub-area referenced 111 is the "sub-area 1" associated with the first facet of the basic mesh
- the sub-area referenced 112 is associated with the second basic facet
- sub-area referenced 113 is associated with the m th base facet. It will of course be noted that, for the sake of simplification of the figure, not all the sub-zones have been represented.
- the header 10 comprises a preamble 101, and a plurality of location data referenced 102 to 104.
- the preamble 101 comprises for example data relating to the type of mesh and to the type of wavelets used, mentioned above.
- the area referenced 102 entitled “offset 1" provides information on the position of the wavelet coefficients associated with the first basic facet in bit stream 1, that is to say that it provides information, for example, on the distance separating the end of the preamble 101 and the beginning of the "sub-area 1" referenced 111.
- such a distance is expressed in number of bits.
- the location data area referenced 102 can of course also provide information on the distance separating the start of the "sub-area 1" referenced 111 from any other reference element of the data stream 1 , so as to allow the localization of the wavelet coefficients of the "sub-area 1" 111 in the bit stream 1.
- the "offset 2" area 103 (respectively the “offset M” area 104) provides information on the number of bits separating the start of the "sub area 2" 112 (respectively of the "sub area M” 113) and the end of the preamble 101.
- a server in response to a request from a client terminal, wishes to transmit to the latter the wavelet coefficients associated with the M th basic facet, it consults the location data "M shift" 104 of the 'header 10.
- the "M shift" area 104 indicates to the server the number of bits separating the end of the preamble 101 from the start of the "M sub-area” 113, and the server can therefore go directly to the start of the " sub-area M "113, so as to extract and then transmit these only coefficients to the client terminal.
- the data stream 1 of FIG. 4 comprises a header 10 and a wavelet coefficient area 11, comprising on the one hand sub-areas of wavelet coefficients referenced 111 to 113 and location data areas referenced 120 to 123.
- the location data referenced 120 to 123 are therefore distributed in the data stream 1, and not grouped in the header 10 as previously.
- the location data 120 to 123 are for example markers indicating the start and / or the end of a wavelet coefficient sub-area.
- the area “mark 1" referenced 120 indicates the beginning of the "sub-area 1" 111, comprising the wavelet coefficients associated with the first facet of the basic mesh.
- the zone “mark 2" referenced 121 marks the beginning of the "sub-zone 2" referenced 112, and the “mark M” referenced 123 marks the beginning of the "sub-zone M" referenced 113.
- the information contained in the fields "mark 1" 120, "mark 2" 121 and so on up to “mark M” 123 are identical.
- a plurality of identical markers is inserted into the zone of wavelet coefficients 11 of the data stream 1, so as to separate the different sub-zones each associated with a facet of the basic mesh.
- a server wishes to send the wavelet coefficients associated with the "M sub-area” 113 to a display terminal, it traverses all of the flow 1, and counts the markers that it encounters, so as to determine the M -th marker 123, and thus determine where begins the "subfield M" 113, comprising code "zero-tree” wavelet coefficients associated with the m th base facet.
- the client terminal receives only the wavelet coefficients of the "sub-area M" 113, and does not need to decode the entire stream 1 to access the wavelet coefficients it needs.
- the markers referenced are identical.
- the marker "mark 1" 120 specifically indicates the start of "sub-area 1" 111
- the marker “mark 2" 121 specifically indicates the start of "Subarea 2” 112, and so on. (We can of course also consider, for example, that the markers referenced 120 to 123 indicate the end of the associated sub-areas 111 to 113.)
- a server wishing to transmit the coefficients of the "M sub-area” 113 in response to a request from a client traverses the data stream 1, until it finds the marker "mark M” 123, and deduces the position therefrom. from the start of "M sub-area” 113.
- FIGS. 3 and 4 It is also possible to envisage any other embodiment of the invention, not illustrated in FIGS. 3 and 4, but which makes it possible to construct a data stream 1, in which location data are inserted allowing a server to determine the location a sub-area of wavelet coefficients associated with a basic facet, or more generally with a subset M ; grouping a plurality of nodes or basic facets, with a view to its extraction and its selective transmission in response to a request from a client.
- Location data inserted in the header 10, would provide information on the distance between a reference element (for example the end of the preamble 101) and the start of a set of sub-areas. Markers would be inserted within such a set, so as to indicate the beginning and / or the end of each of the sub-areas of the set.
- a server could go to position itself directly at the start of a set of sub-areas, then browse this set, and determine, using the markers, the position of or sub-area (s) of the set that it must transmit in response to a request from a client.
- the terminal therefore sends a request to the server specifying the portion of the scene for which it wishes to obtain the wavelet coefficients determining the refinements to be made to the basic mesh in order to obtain a satisfactory reconstruction of the portion.
- the server receives the request from the client terminal, and determines the facets of the basic mesh concerned by the request.
- the server browses the data stream generated at the output of a scene coding device, and analyzes the location data present in this stream. For example, it consults the location data contained in the header of the stream.
- a step referenced 42 determines the position of the sub-areas of wavelet coefficients associated with the portion of the scene considered, as a function of the location data which it has previously analyzed.
- the server extracts (43) these coefficients from the global data flow, so as to form a reduced flow intended for the client terminal.
- the server transmits this reduced stream to the client's viewing terminal, so that the latter can reconstruct the portion of the scene that the client wishes to view, without having to decode the entire stream of global data.
Abstract
Description
Claims
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
FR0109184 | 2001-07-10 | ||
FR0109184A FR2827409B1 (en) | 2001-07-10 | 2001-07-10 | WAVELLET-BASED IMAGE CODING PROCESS ALLOWING ADAPTIVE TRANSMISSION OF WAVELLET COEFFICIENTS, SYSTEM SIGNAL AND CORRESPONDING DEVICES |
PCT/FR2002/002328 WO2003009234A1 (en) | 2001-07-10 | 2002-07-03 | Method of wavelet coding a mesh object |
Publications (1)
Publication Number | Publication Date |
---|---|
EP1405268A1 true EP1405268A1 (en) | 2004-04-07 |
Family
ID=8865352
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP02762522A Withdrawn EP1405268A1 (en) | 2001-07-10 | 2002-07-04 | Method of wavelet coding a mesh object |
Country Status (11)
Country | Link |
---|---|
US (1) | US7555168B2 (en) |
EP (1) | EP1405268A1 (en) |
JP (1) | JP4064345B2 (en) |
KR (1) | KR100922511B1 (en) |
CN (1) | CN1276390C (en) |
AU (1) | AU2002328371A1 (en) |
BR (1) | BR0210974A (en) |
CA (1) | CA2453283C (en) |
FR (1) | FR2827409B1 (en) |
MX (1) | MXPA04000217A (en) |
WO (1) | WO2003009234A1 (en) |
Families Citing this family (17)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
FR2849329A1 (en) * | 2002-12-20 | 2004-06-25 | France Telecom | Video sequence successive image coding having an image mesh divided and wavelet coded with two wavelet types applied distinct image zones |
FR2876821A1 (en) | 2004-10-14 | 2006-04-21 | France Telecom | METHOD FOR LOCALLY DECODING A BINARY TRAIN OF WAVELET COEFFICIENTS |
US20100053153A1 (en) * | 2007-02-01 | 2010-03-04 | France Telecom | Method of coding data representative of a multidimensional texture, coding device, decoding method and device and corresponding signal and program |
EP2910026B1 (en) * | 2012-10-19 | 2017-11-29 | Visa International Service Association | Digital broadcast methods using secure meshes and wavelets |
FR3018018A1 (en) * | 2014-02-27 | 2015-08-28 | Orange | METHOD FOR ENCODING AND DECODING A DEFINED SIGNAL ON AN N-DIMENSIONAL VARIETY, DEVICE FOR ENCODING AND DECODING SUCH A SIGNAL, AND CORRESPONDING COMPUTER PROGRAMS |
US10777320B2 (en) | 2014-10-21 | 2020-09-15 | Psomagen, Inc. | Method and system for microbiome-derived diagnostics and therapeutics for mental health associated conditions |
US10265009B2 (en) | 2014-10-21 | 2019-04-23 | uBiome, Inc. | Method and system for microbiome-derived diagnostics and therapeutics for conditions associated with microbiome taxonomic features |
US10357157B2 (en) | 2014-10-21 | 2019-07-23 | uBiome, Inc. | Method and system for microbiome-derived characterization, diagnostics and therapeutics for conditions associated with functional features |
US9758839B2 (en) | 2014-10-21 | 2017-09-12 | uBiome, Inc. | Method and system for microbiome-derived diagnostics and therapeutics for conditions associated with microbiome functional features |
US10313673B2 (en) | 2016-10-19 | 2019-06-04 | Google Llc | Methods and apparatus to encode and/or decode normals of geometric representations of surfaces |
US10733766B2 (en) | 2016-10-19 | 2020-08-04 | Google, Llc | Methods and apparatus to encode and/or decode normals of geometric representations of surfaces |
US9787321B1 (en) | 2016-11-17 | 2017-10-10 | Google Inc. | Point cloud data compression using a space-filling curve |
US10430975B2 (en) | 2016-11-17 | 2019-10-01 | Google Llc | Advanced k-D tree encoding for point clouds by most significant axis selection |
US10496336B2 (en) | 2016-11-17 | 2019-12-03 | Google Llc | K-D tree encoding for point clouds using deviations |
US10553035B2 (en) | 2017-06-02 | 2020-02-04 | Google Llc | Valence based implicit traversal for improved compression of triangular meshes |
US10950042B2 (en) | 2017-06-02 | 2021-03-16 | Google Llc | Guided traversal in compression of triangular meshes |
US10891758B2 (en) | 2018-07-23 | 2021-01-12 | Google Llc | Geometry encoder |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2000001153A1 (en) * | 1998-06-18 | 2000-01-06 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and apparatus in transmission of images |
Family Cites Families (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CA2027253C (en) * | 1989-12-29 | 1997-12-16 | Steven C. Bagley | Editing text in an image |
US6674911B1 (en) * | 1995-09-14 | 2004-01-06 | William A. Pearlman | N-dimensional data compression using set partitioning in hierarchical trees |
JP3929492B2 (en) * | 1995-10-25 | 2007-06-13 | コーニンクレッカ フィリップス エレクトロニクス エヌ ヴィ | Segmented image encoding method and system, and decoding method and system thereof |
JP3597780B2 (en) * | 1998-03-20 | 2004-12-08 | ユニヴァーシティ オブ メリーランド | Lossless / lossless image coding for regions of interest |
US6885774B2 (en) * | 1999-10-28 | 2005-04-26 | Lucent Technologies Inc. | Coefficient computation in image compression using set partitioning in hierarchical trees |
-
2001
- 2001-07-10 FR FR0109184A patent/FR2827409B1/en not_active Expired - Fee Related
-
2002
- 2002-07-03 BR BR0210974-3A patent/BR0210974A/en active Pending
- 2002-07-03 WO PCT/FR2002/002328 patent/WO2003009234A1/en active Application Filing
- 2002-07-03 AU AU2002328371A patent/AU2002328371A1/en not_active Abandoned
- 2002-07-03 MX MXPA04000217A patent/MXPA04000217A/en active IP Right Grant
- 2002-07-03 KR KR1020047000420A patent/KR100922511B1/en not_active IP Right Cessation
- 2002-07-04 JP JP2003514504A patent/JP4064345B2/en not_active Expired - Fee Related
- 2002-07-04 CA CA2453283A patent/CA2453283C/en not_active Expired - Fee Related
- 2002-07-04 EP EP02762522A patent/EP1405268A1/en not_active Withdrawn
- 2002-07-04 CN CNB028138422A patent/CN1276390C/en not_active Expired - Fee Related
- 2002-07-04 US US10/483,441 patent/US7555168B2/en not_active Expired - Fee Related
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2000001153A1 (en) * | 1998-06-18 | 2000-01-06 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and apparatus in transmission of images |
Non-Patent Citations (2)
Title |
---|
KHODAKOVSKY A ET AL: "PROGRESSIVE GEOMETRY COMPRESSION", COMPUTER GRAPHICS. SIGGRAPH 2000 CONFERENCE PROCEEDINGS. NEW ORLEANS, LA, JULY 23 - 28, 2000; [COMPUTER GRAPHICS PROCEEDINGS. SIGGRAPH], NEW YORK, NY : ACM, US, 23 July 2000 (2000-07-23), pages 271 - 278, XP001003565, ISBN: 978-1-58113-208-3 * |
See also references of WO03009234A1 * |
Also Published As
Publication number | Publication date |
---|---|
FR2827409B1 (en) | 2004-10-15 |
CA2453283C (en) | 2013-12-10 |
AU2002328371A1 (en) | 2003-03-03 |
KR20040018450A (en) | 2004-03-03 |
CN1276390C (en) | 2006-09-20 |
CN1526120A (en) | 2004-09-01 |
FR2827409A1 (en) | 2003-01-17 |
KR100922511B1 (en) | 2009-10-20 |
CA2453283A1 (en) | 2003-01-30 |
BR0210974A (en) | 2004-06-08 |
US20040208382A1 (en) | 2004-10-21 |
MXPA04000217A (en) | 2004-07-23 |
US7555168B2 (en) | 2009-06-30 |
WO2003009234A1 (en) | 2003-01-30 |
JP2004535644A (en) | 2004-11-25 |
WO2003009234A8 (en) | 2004-12-23 |
JP4064345B2 (en) | 2008-03-19 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2003009234A1 (en) | Method of wavelet coding a mesh object | |
EP1101200B1 (en) | Selective mesh refinement | |
EP1457023B1 (en) | Method for transmitting objects between a server and a client terminal using cache management, corresponding transmission, server and terminal. | |
EP3097692B1 (en) | Method for processing a sequence of holographic images, and associated computer program, devices, signals and devices. | |
EP1340195B1 (en) | Wavelet-based mesh coding method | |
EP1864258A1 (en) | Method of transmitting content display data between a server and at least one client terminal, and corresponding server, terminal and computer program | |
EP1800263A2 (en) | Method for locally decoding a bit stream of wavelet coefficients | |
FR2759474A1 (en) | METHOD FOR RECOGNIZING IN A PRELIMINARY CATALOG STARS DETECTED BY A STELLAR SENSOR | |
Cheng et al. | Receiver-driven view-dependent streaming of progressive mesh | |
WO2002100111A1 (en) | Methods and devices for encoding and decoding images using nested meshes, programme, signal and corresponding uses | |
EP1574068B1 (en) | Wavelet image-encoding method and corresponding decoding method | |
EP1654882A2 (en) | Method of representing a sequence of pictures using 3d models, and corresponding devices and signal | |
EP1004206B1 (en) | Graphic scene animation signal, corresponding method and device | |
US20050129322A1 (en) | Method and system for compressing, storing, and retrieving image data | |
EP1141899B1 (en) | Method for simplifying a source mesh, taking into account the local curvature and the local geometry, and corresponding uses | |
FR3105687A1 (en) | PROCESS FOR ENCODING A DIGITAL IMAGE FOR COMPRESSION | |
EP1121665B1 (en) | Source mesh coding method optimising vertex position resulting from edge fusion, and corresponding applications | |
WO2002039382A2 (en) | Method for representing three-dimensional scenes in virtual reality and corresponding device |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
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 |
|
17P | Request for examination filed |
Effective date: 20040107 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR IE IT LI LU MC NL PT SE SK TR |
|
AX | Request for extension of the european patent |
Extension state: AL LT LV MK RO SI |
|
REG | Reference to a national code |
Ref country code: HK Ref legal event code: DE Ref document number: 1064777 Country of ref document: HK |
|
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: ORANGE |
|
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
RIC1 | Information provided on ipc code assigned before grant |
Ipc: G06T 9/00 20060101AFI20160108BHEP |
|
INTG | Intention to grant announced |
Effective date: 20160201 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN |
|
18D | Application deemed to be withdrawn |
Effective date: 20160614 |
|
REG | Reference to a national code |
Ref country code: HK Ref legal event code: WD Ref document number: 1064777 Country of ref document: HK |