WO2004066297A1 - Lossless data embedding - Google Patents
Lossless data embedding Download PDFInfo
- Publication number
- WO2004066297A1 WO2004066297A1 PCT/IB2004/050050 IB2004050050W WO2004066297A1 WO 2004066297 A1 WO2004066297 A1 WO 2004066297A1 IB 2004050050 W IB2004050050 W IB 2004050050W WO 2004066297 A1 WO2004066297 A1 WO 2004066297A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- data
- embedding
- segment
- signal segment
- host
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/387—Composing, repositioning or otherwise geometrically modifying originals
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
- G11B20/00086—Circuits for prevention of unauthorised reproduction or copying, e.g. piracy
- G11B20/0092—Circuits for prevention of unauthorised reproduction or copying, e.g. piracy involving measures which are linked to media defects or read/write errors
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T1/00—General purpose image data processing
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
- G11B20/00086—Circuits for prevention of unauthorised reproduction or copying, e.g. piracy
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
- G11B20/10—Digital recording or reproducing
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/13—Linear codes
- H03M13/19—Single error correction without using particular properties of the cyclic codes, e.g. Hamming codes, extended or generalised Hamming codes
-
- 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/46—Embedding additional information in the video signal during the compression process
- H04N19/467—Embedding additional information in the video signal during the compression process characterised by the embedded information being invisible, e.g. watermarking
Definitions
- the invention relates to a method of embedding auxiliary data in a host signal, comprising the steps of using a data embedding method having an embedding rate and distortion to produce a composite signal, and using a first portion of said embedding rate to accommodate restoration data for restoring the host signal and a second portion of said embedding rate for embedding said auxiliary data.
- the invention also relates to a corresponding arrangement for embedding auxiliary data in a host signal.
- the invention further relates to a method and arrangement for reconstructing such a host signal, and to a composition information signal with embedded data.
- a reversible data-hiding scheme is defined as a scheme that allows complete and blind restoration (i.e. without additional signaling) of the original host data.
- Kalker et al. use a predetermined embedder having a given embedding rate and distortion. They have shown that the embedding capacity can be increased by embedding in the host signal restoration data that identifies the host signal conditioned on the composite signal. This is understood to mean that the restoration data defines, given the composite signal, which host signal samples have undergone which modification by the embedding process. In practical embodiments, Kalker et al.
- reversible data-hiding scheme Such a reversible data-hiding scheme is referred to as "recursive" reversible embedding.
- the present invention also addresses such a recursive reversible embedding scheme.
- a problem of reversible embedding schemes including the recursive reversible embedding scheme of Kalker et al. is that they have a highly fragile nature. Changing a single bit in the watermarked data prohibits recovery of both the original host signal as well as the embedded auxiliary data. This puts a severe limitation on the usability of reversible watermarking schemes. Only in a context in which an owner has complete control over the watermarked data (e.g. archives) or in the context of authentication do these watermarking schemes have a useful application.
- a method is provided as defined in claim 1.
- the invention exploits the insight that a portion of the embedding capacity of a reversible embedding scheme can be used for error protection of the pay load as well as the host signal carrying said payload.
- the embedding scheme is thus robust with respect to channel errors. It should be noted that it is known per se from United States Patent Application US 2003/0009670, in particular paragraph [0419] thereof, to embed error correction data in a watermarked host signal. However, in this publication the error correction data protects the watermark payload only.
- error correction data for a given segment of the composite signal is embedded in a subsequent segment of the host signal.
- error correction data can be processed in a manner which is compatible with the processing of other data.
- Fig. 1 shows schematically a system including an arrangement for embedding auxiliary data in a host signal and an arrangement for reconstructing the host signal according to the invention.
- Figs. 3 and 4 show practical examples of dividing the host signal into segments in accordance with preferred embodiments of the invention.
- Fig. 5 shows schematically an embodiment of an arrangement for reconstructing the host signal which is shown in Fig. 1.
- Fig. 1 shows schematically a system including an embedding arrangement 3 for embedding auxiliary data in a host signal and a reconstructing arrangement 5 for reconstructing the host signal according to the invention.
- the source 1 is a binary source, the symbols x; of which are, for example, the bits of a certain bit plane of a bit mapped image, or the least significant bits of specific DCT coefficients of a JPEG image.
- the invention is not restricted to binary sources.
- a auxiliary data or message source 2 produces a message index or message symbols we ⁇ 1,2,..,M ⁇ with probability 1/M, independent of x .
- the embedding-rate R in bits per source-symbol, is defined as
- the composite sequence is sent through a memoryless attack channel 4 with transition probability matrix Q(*
- the word attack channel is somewhat of a misnomer, as it suggests the presence of an active and intelligent attacker. However, in this description no such connotation is intended and the word 'attack' is only chosen to reflect common terminology in watermarking literature.
- the reconstructing arrangement 5 produces an estimate of the host sequence x , and retrieves the embedded message w, from the composite sequence z .
- robustness can refer to robustness of the watermark payload, i.e. the channel degradations do not interfere with payload recovery.
- robustness can refer to the reversibility aspect, i.e. the original host signal can still be recovered after channel degradations. This second option can be further detailed with respect to the degree with which the original can be restored. At one extreme the original is completely recoverable; at the other extreme the original can only be retrieved up to a distortion that is compatible with the channel degradations.
- robustness can refer to both payload and reversibility.
- the first and second option have limited applicability, as one of two the desirable properties of reversible watermarking is lost (payload or reversibility).
- the invention focusses on the third option, where robustness refers to both to the payload and the reversibility aspect.
- a string of host signal symbols x of length N is compressed into a string y f of length K, where K is approximately equal to Nxh(p ⁇ ), where h( « ) denotes binary entropy. Note that this may be applied to the whole sequence x , or to successive segments x into which the sequence may have been divided.
- the compression leaves N-K bits space available for adding additional bits.
- robustness against transmission or channel errors is now obtained by accommodating error correction bits in a portion of this space. For N large, the number of errors to be corrected is dxN.
- the associated decoding procedure is a simple inversion of the embedding procedure. Firstly, the degraded sequence z is subjected to error correcting decoding.
- the corrected sequence minus error correction data is decompressed until a sequence of length N is obtained.
- the remaining bits are then automatically obtained as auxiliary message bits.
- the above-decribed embedding scheme can be slightly generalized by performing the construction above on only a fraction of the symbols in . This is often referred to as "time-sharing". The resulting distortion and information rate are then given by
- R(p ⁇ ,d) ⁇ (l-h(p ⁇ ))-h(d).
- R(D) 2D(l- h(p ⁇ ))-h(d) (1) whenever the righthand side of the equation is positive.
- Fig. 2 shows an embodiment of embedding arrangement 3 that is robust against transmission or channel errors, and has a higher embedding rate. Apart from an error correction coding circuit 35, the arrangement complies with the teaching of the Kalker et al. publication. Its operation has more exhaustively been described in Applicant's non- prepublished International patent application WO 03/107653 and will now briefly be summarized.
- the arrangement comprises a segmentation stage 30 which divides the host signal sequence xf of length N in segments x of length K. It will initially be assumed that all segments have the same length K, but an embodiment will later be described in which the segments have different lengths. It will also again be assumed that the host signal X is a binary signal with alphabet ⁇ 0,1 ⁇ .
- the arrangement further comprises a data embedder 31, which is conventional in the sense that the embedder embeds payload d at a given embedding rate by modifying samples of the host signal and thus introducing distortion of the host signal.
- the embedder 31 produces a composite signal segment Y f for each host signal segment X .
- a desegmentation circuit 32 concatenates the segments to form the composite signal sequence
- the embedder 31 operates in accordance with the teachings of an article by M. van Dijk and F.M.J. Willems, "Embedding Information in Grayscale Images", Proceedings of the 22 nd Symposium on Information Theory in the Benelux, Enschede, The Netherlands, May 15-16, 2001, pp. 147-154.
- the authors describe lossy embedding schemes that have an efficient rate-distortion ratio. More particularly, a number L (L>1) of host signal samples are grouped together to provide a block or vector of host symbols.
- the embedder modifies one or more host symbols of said block such that the syndrome of output block Y ⁇ " represents the desired message symbol d and is closest to Xf in a Hamming sense.
- the syndrome of a data word or vector is the result of multiplying it with a given matrix.
- the vector is multiplied with the following 3x2 matrix:
- the syndrome of input vector (001) is (11), because
- 3 data bits can be embedded in a block of 7 signal symbols, 4 bits can be embedded in 15 signal symbols, etc.
- the Hamming code based embedding schemes allow m message symbols to be embedded in blocks of
- L 2 m -1 host symbols by modifying at most 1 host symbol.
- the embedding rate is m
- a restoration encoder 33 receives each host signal segment X f and the composite signal Y f .
- the restoration encoder encodes X conditioned on Y , what can also be expressed as Xf given Y .
- the encoder 33 maintains a record of which host symbols have undergone which modification and encodes said information into restoration data r.
- the restoration encoder 33 represents a functional feature of the invention.
- the circuit does not need to be physically present as such.
- the information as to which symbols have been distorted is inherently produced by the embedder 31 itself.
- a portion of the embedding capacity is used to identify whether one of the signal samples has been modified and, if so, which sample that is.
- the original host vector x could have been (000). In that case, none of the original signal samples has been modified. However, the original host vector could also have been (001), (010), or (100). In that case, one of the host symbols has been modified.
- Each composite vector y has thus an associated set of conditional probabilities p(x
- the Table also includes, for each block y, the corresponding conditional entropy H(x
- the Table also includes, for each vector y, the probability p(y), assuming that the messages 00, 01, 10 and 11 have equal probabilities 1/4.
- Y) of the source, averaged over all blocks y, represents the number of bits to reconstruct x, given y.
- said average entropy equals:
- a portion of the remaining embedding capacity is now used to accommodate error correction data, in order to achieve robustness against transmission or channel errors.
- the embedding arrangement 3 (see Fig. 2) is made robust by comprising an error correction coding circuit 35, which produces parity bits p.
- the remaining embedding capacity is used for embedding auxiliary data or payload w.
- the restoration data r, parity bits p, and payload w are concatenated in a concatenation circuit 35. It is the concatenated data d which is applied to the embedder 31 for embedding.
- D is a (not necessarily memoryless) test channel from sequences x ⁇ N to sequences y ⁇ N .
- C be the recursive construction of the above.
- C(D) is a reversible data-hiding scheme with average distortion ⁇ and rate p - H(X
- the reversible embedding arrangement disclosed in the Kalker et al. prior art publication is recursive. This is understood to mean that the concatenation circuit 35 applies the restoration data r to embedder 31 with a one-segment delay. The restoration data for a segment is thus embedded in the subsequent segment.
- the concatenation circuit 35 also applies the error correction data p of a segment to embedder 31 with a delay, preferably the same one-segment delay.
- the error correction data for a segment is thus also embedded in the subsequent segment.
- this has the advantage that the error correction data p can be processed in a manner similar to and compatible with the restoration data r.
- the robust recursive reversible data embedding arrangement 3 thus has a non-complicated (hardware or software) structure.
- 0.8642 restoration bits r per block 0.288 bits/symbol, 864 bits per segment are required to reconstruct a segment X given segment Y.
- the restoration bits r(n) associated with segment S(n) are embedded in subsequent segment S(n+1), whereas the restoration bits embedded in segment S(n) are the restoration bits r(n-l) for reconstructing the previous segment S(n-l).
- the numbers are statistically average numbers.
- the precise number of restoration bits may vary from segment to segment. It is advantageous to identify the boundary between restoration bits r and the rest of the embedded data, for example, by providing each series of restoration bits with an appropriate end-code.
- 0.2864 parity bits per symbol (860 bits per segment) are to be embedded for error correction.
- the parity bits associated with segment S(n) are denoted p(n).
- the embedding rate of the robust recursive reversible embedder is thus 276 bits per 3000 symbols, which corresponds to 0.0922 bits/symbol as already mentioned before.
- the first and last segment of a sequence must be processed differently.
- payload data w only can be embedded.
- the afore mentioned "simple" embedding method can be used to accommodate restoration data r as well as error correction data p relating to said last segment.
- Fig. 4 shows a second example of segmenting the host signal X.
- an initial segment S(0) with a given initial length is provided with payload w only.
- the restoration bits r(0) and parity bits p(0) for this segment are accommodated in subsequent segment S(l).
- the subsequent segment S(l) is now assigned a length that is required to accommodate the restoration bits r(0) and parity bits p(0).
- the subsequent segment S(l) requires a new number of restoration bits r(l) and parity bits p(l) to be embedded in a yet further segment S(2), etc. This process is repeated a number of times, e.g. until the subsequent segment is smaller than a given threshold. No payload w is embedded in the subsequent segments. The whole process is then repeated for a new initial segment S(0) with the given initial length.
- Fig. 5 shows a schematic diagram of an arrangement for reconstructing the original host signal from a received composite signal.
- the arrangement receives the sequence Zf from attack channel 4 (cf. Fig. 1).
- a segmentation circuit 50 divides the sequence in segments Z f of length K.
- the segments Z f are applied to a data retrieval circuit 51 and an error detection an correction circuit 52 in reversed order.
- the data retrieval circuit 51 retrieves the data d being embedded in the composite signal. In the preferred embodiment, wherein de data d has been embedded using Hamming codes of length L, the retrieval circuit 51 determines the syndrome of each block of L symbols. The circuit also splits the retrieved data into error correction data p, restoration data r, and auxiliary payload w.
- the error correction data p is applied to the error detection an correction circuit 52 to correct errors in the segment Z . Its output is an estimated composite signal segment ⁇ , ⁇ .
- a reconstruction unit 53 is arranged to undo the modification(s) applied to the original host signal X , using the retrieved restoration data r.
- the restoration data r identifies whether one of the symbols in a segment Y has been modified and, if so, which symbol that is.
- the restoration is applied to the estimated composite signal segment Y ⁇ , yielding an estimation Xf of the orignal host signal segment X . Due to the embedded error correction data, the reconsruction is perfect, even in the case of bit errors caused by the attack channel.
- the reconstructed host signal segments Xf are finally re-ordered and desegmented in a desegmentation circuit 54.
Abstract
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/542,894 US20060075240A1 (en) | 2003-01-23 | 2004-01-23 | Lossless data embedding |
EP04704692A EP1590805A1 (en) | 2003-01-23 | 2004-01-23 | Lossless data embedding |
JP2006500362A JP2006516848A (en) | 2003-01-23 | 2004-01-23 | Lossless data embedding |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP03075226 | 2003-01-23 | ||
EP03075226.5 | 2003-01-23 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2004066297A1 true WO2004066297A1 (en) | 2004-08-05 |
Family
ID=32748894
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/IB2004/050050 WO2004066297A1 (en) | 2003-01-23 | 2004-01-23 | Lossless data embedding |
Country Status (6)
Country | Link |
---|---|
US (1) | US20060075240A1 (en) |
EP (1) | EP1590805A1 (en) |
JP (1) | JP2006516848A (en) |
KR (1) | KR20050098257A (en) |
CN (1) | CN1742334A (en) |
WO (1) | WO2004066297A1 (en) |
Families Citing this family (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8144368B2 (en) * | 1998-01-20 | 2012-03-27 | Digimarc Coporation | Automated methods for distinguishing copies from original printed objects |
US8094869B2 (en) | 2001-07-02 | 2012-01-10 | Digimarc Corporation | Fragile and emerging digital watermarks |
US8140848B2 (en) | 2004-07-01 | 2012-03-20 | Digimarc Corporation | Digital watermark key generation |
KR101126485B1 (en) * | 2005-03-22 | 2012-03-30 | 엘지디스플레이 주식회사 | Lamp Electrode And Method of Fabricating The Same |
EP2605536A1 (en) * | 2011-12-13 | 2013-06-19 | Thomson Licensing | Device for generating watermark metadata, associated device for embedding watermark |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6456726B1 (en) * | 1999-10-26 | 2002-09-24 | Matsushita Electric Industrial Co., Ltd. | Methods and apparatus for multi-layer data hiding |
WO2003107653A1 (en) * | 2002-06-17 | 2003-12-24 | Koninklijke Philips Electronics N.V. | Lossless data embedding |
Family Cites Families (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6792542B1 (en) * | 1998-05-12 | 2004-09-14 | Verance Corporation | Digital system for embedding a pseudo-randomly modulated auxiliary data sequence in digital samples |
AU2002214613A1 (en) * | 2000-11-08 | 2002-05-21 | Digimarc Corporation | Content authentication and recovery using digital watermarks |
-
2004
- 2004-01-23 CN CNA2004800026379A patent/CN1742334A/en active Pending
- 2004-01-23 KR KR1020057013577A patent/KR20050098257A/en not_active Application Discontinuation
- 2004-01-23 JP JP2006500362A patent/JP2006516848A/en active Pending
- 2004-01-23 US US10/542,894 patent/US20060075240A1/en not_active Abandoned
- 2004-01-23 EP EP04704692A patent/EP1590805A1/en not_active Withdrawn
- 2004-01-23 WO PCT/IB2004/050050 patent/WO2004066297A1/en active Application Filing
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6456726B1 (en) * | 1999-10-26 | 2002-09-24 | Matsushita Electric Industrial Co., Ltd. | Methods and apparatus for multi-layer data hiding |
WO2003107653A1 (en) * | 2002-06-17 | 2003-12-24 | Koninklijke Philips Electronics N.V. | Lossless data embedding |
Non-Patent Citations (4)
Title |
---|
FRIDRICH J ET AL: "Lossless data embedding for all image formats", PROCEEDINGS OF THE SPIE, SPIE, BELLINGHAM, VA, US, vol. 4675, 2002, pages 572 - 583, XP002275676, ISSN: 0277-786X * |
FRIDRICH J ET AL: "Lossless Data Embedding New Paradigm in Digital Watermarking", EURASIP JOURNAL OF APPLIED SIGNAL PROCESSING, HINDAWI PUBLISHING CO., CUYAHOGA FALLS, OH, US, vol. 2002, no. 2, February 2002 (2002-02-01), pages 185 - 196, XP002254473, ISSN: 1110-8657 * |
KALKER T ET AL: "Capacity bounds and constructions for reversible data-hiding", CONFERENCE PROCEEDINGS ARTICLE, vol. 1, 1 July 2002 (2002-07-01), EINDHOVEN, THE NETHERLANDS, pages 71 - 76, XP010599690 * |
M. VAN DIJK, F.M.J WILLEMS: "Embedding Information in Grayscale Images", PROCEEDINGS OF THE 22ND SYMPOSIUM ON INFORMATION THEORY IN THE BENELUX, 15 May 2001 (2001-05-15), ENSCHEDE, NETHERLANDS, pages 147 - 145, XP002277445 * |
Also Published As
Publication number | Publication date |
---|---|
KR20050098257A (en) | 2005-10-11 |
JP2006516848A (en) | 2006-07-06 |
EP1590805A1 (en) | 2005-11-02 |
US20060075240A1 (en) | 2006-04-06 |
CN1742334A (en) | 2006-03-01 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Sallee | Model-based steganography | |
US7321666B2 (en) | Multilayered digital watermarking system | |
JP4250187B2 (en) | System and method for robust and reversible data hiding and data restoration in spatial domain | |
US7389420B2 (en) | Content authentication and recovery using digital watermarks | |
Baudry et al. | Analyses of error correction strategies for typical communication channels in watermarking | |
JP2000513164A (en) | Variable length coding with error protection | |
JP2000174628A (en) | Information processing unit and method, and computer readable storage medium | |
US20020159614A1 (en) | Message coding for digital watermark applications | |
JP2004221715A (en) | Electronic watermark embedding method, and encoder and decoder capable of utilizing the method | |
Mobasseri et al. | A foundation for watermarking in compressed domain | |
WO2004066297A1 (en) | Lossless data embedding | |
JP4184339B2 (en) | Lossless data embedding | |
US7386148B2 (en) | Method and system for end of run watermarking | |
EP1743296B1 (en) | Watermarking a compressed information signal | |
Malathi et al. | Maximizing the embedding efficiency using linear block codes in spatial and transform domains | |
Gu et al. | Digital image self-recovery algorithm based on improved joint source-channel coding optimizer | |
Sivadasan | A survey paper on various reversible data hiding techniques in encrypted images | |
Rey et al. | TurboWm: enhanced robustness in image watermarking using turbo codes | |
Mobasseri et al. | Lossless watermarking of compressed media using reversibly decodable packets | |
Chung et al. | A secure digital watermarking scheme for MPEG-2 video copyright protection | |
Chang et al. | High-Capacity Reversible Data Hiding Method for JPEG Images. | |
KR20050021974A (en) | Lossless data embedding | |
Mythili et al. | Data Hiding with Image and Audio Steganography Cryptosystem in Network | |
Karim et al. | Reversible data embedding for any digital signal | |
Martinez-Noriega et al. | Increasing robustness of audio watermarking DM using ATHC codes |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): BW GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 2004704692 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2006500362 Country of ref document: JP |
|
ENP | Entry into the national phase |
Ref document number: 2006075240 Country of ref document: US Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 10542894 Country of ref document: US |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1670/CHENP/2005 Country of ref document: IN |
|
WWE | Wipo information: entry into national phase |
Ref document number: 20048026379 Country of ref document: CN Ref document number: 1020057013577 Country of ref document: KR |
|
WWP | Wipo information: published in national office |
Ref document number: 1020057013577 Country of ref document: KR |
|
WWP | Wipo information: published in national office |
Ref document number: 2004704692 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 10542894 Country of ref document: US |