WO1999037085A2 - Compression de telecopie au moyen d'un codage arithmetique, avec detection d'erreur - Google Patents

Compression de telecopie au moyen d'un codage arithmetique, avec detection d'erreur Download PDF

Info

Publication number
WO1999037085A2
WO1999037085A2 PCT/US1999/000865 US9900865W WO9937085A2 WO 1999037085 A2 WO1999037085 A2 WO 1999037085A2 US 9900865 W US9900865 W US 9900865W WO 9937085 A2 WO9937085 A2 WO 9937085A2
Authority
WO
WIPO (PCT)
Prior art keywords
bits
follow
symbol
quar
coding
Prior art date
Application number
PCT/US1999/000865
Other languages
English (en)
Other versions
WO1999037085A3 (fr
Inventor
Santhana Krishnamachari
Original Assignee
Comsat Corporation
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Comsat Corporation filed Critical Comsat Corporation
Priority to US09/600,291 priority Critical patent/US6760129B1/en
Priority to AU22296/99A priority patent/AU2229699A/en
Publication of WO1999037085A2 publication Critical patent/WO1999037085A2/fr
Publication of WO1999037085A3 publication Critical patent/WO1999037085A3/fr

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/41—Bandwidth or redundancy reduction
    • H04N1/411—Bandwidth or redundancy reduction for the transmission or storage or reproduction of two-tone pictures, e.g. black and white pictures
    • H04N1/413—Systems or arrangements allowing the picture to be reproduced without loss or modification of picture-information
    • H04N1/417—Systems or arrangements allowing the picture to be reproduced without loss or modification of picture-information using predictive or differential encoding

Definitions

  • the present invention generally concerns the field of facsimile transmission of documents, and more particularly concerns an algorithm for compressing facsimile documents based on arithmetic coding.
  • Arithmetic coding is a well known concept that has been applied in a number of information transmission environments, including facsimile.
  • the basic idea behind arithmetic coding is the mapping of a sequence of symbols to be encoded to a real number in the interval [0.0,1.0), where a square bracket "[" indicates that equality is allowed and a curved bracket ")" indicates otherwise.
  • the binary expansion of this real number is then transmitted to the arithmetic decoder, where the inverse mapping is performed to retrieve the encoded symbols.
  • Fig. 1 An illustration of this principle is in Fig. 1, which can form the basis of an example of arithmetic coding.
  • the illustration shows that the input symbol takes two possible values, B and W.
  • B and W correspond to black and white picture elements (pel) respectively.
  • Pb and P w be the probabilities of occurrences of B and W respectively.
  • This coding interval is divided into two sub-intervals: [0.0, P w ) corresponding to W, and [P w 1.0) corresponding to B.
  • This coding interval is further sub-divided into two sub-intervals: [P w , P w , + P b P w ) corresponding to W, and [Pw, + PbPw 1.0) corresponding to B.
  • the new coding interval is [P w , P w , + P b P w )-
  • the lower bound after the third symbol is P w , + P R b 2 and the coding interval [P w , +
  • the corresponding upper bound U n can be obtained by adding L n and R n .
  • the encoder encode only three input symbols and transmit a real number that lies in the coding interval after encoding the first three symbols.
  • the decoder receives this number and lets it be a value, which lies in the interval [P w , + P w R b 2 > , + PwPb).
  • the decoder divides the coding interval [0.0, 1.0) into two intervals: [0.0,P W ) corresponding to W and P w ,l-0) corresponding to B. Since, value lies in the interval corresponding to B, the decoder decodes the first symbol to be B.
  • the new coding interval is [P w ,l .0), which in turn is sub-divided into two intervals, [P w , P w , + P b P w ) corresponding to W and [P w , + P b P w 1.0) corresponding to B. Since value lies in the interval corresponding to W, the decoder decodes the second symbol to be W and proceeds so on.
  • a more efficient scheme is to initialize the probabilities to a suitable value at the start of encoding and adapt the values as the encoding proceeds. 37085
  • N W + N ⁇ ⁇ W + N ⁇ initialization since the initial values for ⁇ b and N w are equal. It is also possible to use a biased initialization.
  • the aforementioned method to update the counts N b and N w helps to adapt to the local distribution of white and black pels. However, this scheme fails to exploit the redundancy present in the document.
  • the counts N and N w gives a measure of the probability of a pel being white or black. But, the probability of a pel being white or black can be better described if the "color" of some of the adjacent pels are known. This set of adjacent pels is defined to be the context.
  • the pel marked 's' is being presently encoded and the shaded pels form the context for 's'.
  • a further object is prevent the effect of a propagation of a transmission error to the whole document by using a combination of one-dimensional and two-dimensional arithmetic coding.
  • Another object is to present appropriate contexts for the probabilistic models associated with arithmetic coding for one and two dimensional cases.
  • Yet another object is to provide an error detection scheme to identify the presence of transmission errors.
  • the present invention is a facsimile system embodying a signal processing method wherein a document is scanned and a sequence of symbols is generated for each of a plurality of scan lines.
  • the sequence of symbols are arithmetic encoded by mapping the symbols to real numbers in a predetermined interval.
  • the real numbers are subject to a binary expansion for transmission by a transmitter. After transmission and reception at a receiver, the received signal is inverse mapped to retrieve the encoded signals.
  • the present invention further comprises arithmetic coding the scan lines using a combination of one-dimensional and two-dimensional arithmetic coding.
  • the arithmetic encoding step further comprises 2-D coding a first plurality of adjacent scan lines, followed by 1-D coding at least one scan line subsequent to the plurality of scan lines. This sequence of 2-D and 1 -D coding can be repeated for a plurality of scan lines generated from scanning a document.
  • Yet another feature of the invention is the application of an end of line
  • EOL EOL code
  • a further feature of the invention is to conduct the scanning with a reduced horizontal resolution through minimum difference compression.
  • Yet another feature of the invention is to apply, at the end of an encoding of a scan line, M bits to represent the "quarter" in which the arithmetic coding interval lies.
  • Figure 1 is a basic illustration of arithmetic coding as applied to the transmission of black and white symbols.
  • Figure 2 is an illustration of a context for arithmetic coding using one dimensional (1-D) and two dimensional (2-D) approaches.
  • Figure 3 is a flow chart for error detection at the decoder, in accordance with the present invention.
  • Figure 4 is a flow chart of an arithmetic encoding algorithm used in the present invention.
  • Figure 5 is a flow chart of an arithmetic decoding algorithm used in the present invention.
  • the present invention concerns a method and apparatus for compressing facsimile documents based on arithmetic coding.
  • Underlying the invention is the use of a combination of one-dimensional and two-dimensional arithmetic coding, in order to ensure that the effect of a transmission error is not propagated to the whole document, together with an error detection scheme to identify the presence of transmission errors.
  • Fundamental to the present invention is the task of identifying an appropriate context for one and two dimensional arithmetic coding.
  • Figure 2 shows the contexts used for one and two dimensional coding. The appropriate contexts were arrived at after thorough experimentation with over 25 facsimile documents in standard resolution, as reflected in ITU recommendations.
  • the Standardization of Group 3 Facsimile Apparatus for Document Transmission defines standard resolution to be 3.85 line/mm and 1728 pels along the scan line.
  • the horizontal resolution is reduced by half through a maximum-differences compression, which is designed to preserve the black- to-white or white-to-black transitions.
  • the resulting document is then coded with arithmetic coding.
  • a line is said to be 1-D coded, if the context used in coding the pels in that line does not contain any pels from the previous line.
  • a line is said to be 2-D coded, if the context used in coding the pels in that line contains pels from the previous lines.
  • every fourth line is 1-D coded with the three intermediate lines coded by 2-D coding.
  • Two dimensional coding exploits the vertical redundancy in the document, but allows decoding errors in a line to be propagated to the following lines. To prevent this, every fourth line is 1-D coded. This ensures that any error in the bitstream caused by the channel does not propagate to more than four lines.
  • Table 1 Prior Initialization of the probabilities for 2-d ⁇ mens ⁇ onal Mode of Coding (the pels a, b, c, and d are as designated in Figure 1).
  • Table 1 shows the initial values of the counts used for the two dimensional coding. These initial counts have been arrived at through testing over a varied set of facsimile documents. Every fourth scan line is coded using one dimensional coding. When the following line is coded using two dimensional coding, the N w and N are initialized according to Table 1. As the encoding process continues these counts are updated. For 1-D coding, if the context pel is a B, then N b and N w are initialized to be 9 and 1 respectively, and vice versa if the context pel is a W. The compression efficiency achieved is different for different documents, but is in the range of 1.6 to 2.0, when compared to the standard T4 one dimensional compression.
  • EOL End Of Line
  • the encoder At the end of an encoding of a scan line, the encoder outputs two bits to represent the "quarter" in which the arithmetic coding interval lies. These two bits can be either '01 ' or '10' and will be followed by the EOL to denote the end of the scan line. However, if the last two bits happen to be '10', this trailing '0' can be confused with the zeros in EOL. To circumvent this, a ' 1 ' bit is introduced between the two bits representing the "quarter" and the EOL.
  • the decoder first reads the 16 bits of the compressed data and then exactly mimics the operation of the encoder, i.e., decoder maintains the changes in the values of the probabilities, coding interval and takes in input bits at the same time when the encoder outputs bits, etc. Owing to this nature of the implementation, the decoder "leads" the encoder by 16 bits, i.e., the decoder will require 16 bits more than the compressed data output by the encoder to generate a scan line. Since the encoder generates 15 extra bits (2 bits to represent the quarter, a ' 1 ' bit and 12 bits in EOL), the decoder would require one more bit after EOL is reached to completely decode a scan line.
  • this extra bit is immaterial. If the decoder requires more than one extra bit after EOL to generate a scan line, then this is an indication of an error. On the other hand, if the decoder does not require an extra bit or if the scan line is decoded before the EOL is reached, this again is an indication of an error.
  • Fig 3 shows a flow chart for error detection at the decoder.
  • a series of compressed bits for a single scan line illustrated as individual blocks with a 1 or a 0, is followed by an EOC comprising eleven 0's and a single 1.
  • the bits are input to a process 101 for starting decoding and outputting a scan line of picture elements. That series of picture elements is provided to a decision 102 as to whether the number of picture elements equals M, where M is a desired number. If so, the processing proceeds along the Y path to a decision 103 as to whether the number of extra input bits used equals 1. If so, the Y path is followed and there is "no error”. If not, the N path is followed and there is an "error detected".
  • the N path is followed and another decision 104 is used to determine whether EOL has been detected and an extra bit used. If EOL has been detected and an extra bit has been used, the Y path is followed and an "error detected" indication is given. If EOL has not been detected and extra bit used, the N path takes the program back to the start decoding and output scan line box 101 for further processing.
  • the arithmetic coding algorithm presented in the "Background" section is not amenable to implementation with finite precision arithmetic, because of precision problems. It can be observed that the range and the lower bound are floating point numbers between 0.0 and 1.0. The value of range decreases every time an input symbol is encoded. Therefore, as the encoding process proceeds, more and more bits are required to represent the range and the lower bound. Eventually, the precision requirement will not be met by the hardware platform on which the algorithm is implemented.
  • the initial coding interval of [0.0,1.0) is replaced by an integer interval of 0 to 216 — 1.
  • N w and N b can be interpreted as the counts of number of occurrences of the B and W symbols.
  • L( n .i ) , U (n -i ) and R ⁇ n . i ) are the values of lower bound, upper bound and range before the n th symbol is encoded.
  • a flow chart for encoder operation is illustrated and at step 200, symbol to be encoded, as well as the counts N w and N b , the bounds L( n -i), U( himself-i) and the range R ⁇ n -i), are input. The following steps are then taken to update these values. First, in a decision 201 , a check is made as to whether the nth symbol is B (or alternatively W). Then in steps 203 and 202, respectively: symbol is B:
  • n' h symbol is W:
  • Condition 1 at decision 205 If U n ⁇ HALF, then follow the Y path and output(O) at step 206; go to HERE at step 207; Condition 2 at decision 208: If L n ⁇ HALF, then follow the Y path and output(l) at step 209;
  • bits corresponding to the 5 quarter in which the coding interval lies are sent. If the lower bound is less than QUAR, then the upper bound is greater than HALF, and the coding interval spans the interval QUAR to HALF. To represent this, bits 01 are sent. If the lower bound is greater than or equal to QUAR, then the upper bound is greater than 3* QUAR, and the coding interval spans the interval HALF to 10 3* QUAR. To represent this, bits 10 are sent.
  • arithmetic decoder its functions may be understood with regard to Fig. 5 as follows.
  • 16 bits received from the encoder are stored in a register value, with the first received bit placed at the MSB position and the 16 th bit placed at the LSB.
  • L 0 , U 0 , Ro, 15 N b , N w , QUAR and HALF are initialized to be exactly the same as at the encoder.
  • the decoder performs the same operations performed at the encoder by updating the lower, upper bound and range. Since the update rules are different for symbols B and W, the decoder has to first decode the symbol.
  • the following rule in step 301 is used to decode the symbol:
  • the input() function performs the following: input() ⁇

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)
  • Facsimiles In General (AREA)

Abstract

L'invention concerne un procédé et un dispositif permettant de compresser des documents de télécopie par un codage arithmétique. Une combinaison de codage arithmétique unidimensionnel et bidimensionnel permet d'assurer que l'effet d'une erreur de transmission ne se propage pas à l'ensemble du document. L'invention concerne également des contextes appropriés pour les modèles probabilistes associés au codage arithmétique pour les cas uni et bidimensionnels et un système de détection d'erreur permettant d'identifier la présence d'erreurs de transmission.
PCT/US1999/000865 1998-01-16 1999-01-15 Compression de telecopie au moyen d'un codage arithmetique, avec detection d'erreur WO1999037085A2 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US09/600,291 US6760129B1 (en) 1998-01-16 1999-01-15 Arithmetic coding-based facsimile compression with error detection
AU22296/99A AU2229699A (en) 1998-01-16 1999-01-15 Arithmetic coding-based facsimile compression with error detection

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US7168098P 1998-01-16 1998-01-16
US60/071,680 1998-01-16

Publications (2)

Publication Number Publication Date
WO1999037085A2 true WO1999037085A2 (fr) 1999-07-22
WO1999037085A3 WO1999037085A3 (fr) 1999-10-14

Family

ID=22102891

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US1999/000865 WO1999037085A2 (fr) 1998-01-16 1999-01-15 Compression de telecopie au moyen d'un codage arithmetique, avec detection d'erreur

Country Status (2)

Country Link
AU (1) AU2229699A (fr)
WO (1) WO1999037085A2 (fr)

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6683173B2 (en) 1998-04-03 2004-01-27 Epoch Biosciences, Inc. Tm leveling methods
US6949367B1 (en) 1998-04-03 2005-09-27 Epoch Pharmaceuticals, Inc. Modified oligonucleotides for mismatch discrimination
US7045610B2 (en) 1998-04-03 2006-05-16 Epoch Biosciences, Inc. Modified oligonucleotides for mismatch discrimination
EP1944310A2 (fr) 2000-03-01 2008-07-16 Epoch Biosciences, Inc. Oligonucléotides modifiées pour discrimination de désadaptation
EP1975256A1 (fr) 2000-03-01 2008-10-01 Epoch Biosciences, Inc. Oligonucléotides modifiées pour discrimination de désadaptation
US7715989B2 (en) 1998-04-03 2010-05-11 Elitech Holding B.V. Systems and methods for predicting oligonucleotide melting temperature (TmS)
WO2012129547A1 (fr) 2011-03-23 2012-09-27 Elitech Holding B.V. Analogues de 3-alcynyl pyrazolopyrimidines fonctionnalisées comme bases universelles et procédés d'utilisation
WO2013048583A2 (fr) 2011-05-24 2013-04-04 Elitech Holding B.V. Détection de staphylococcus aureus résistant à la méthicilline
WO2014159063A1 (fr) 2013-03-14 2014-10-02 Elitech Holding B.V. Analogues de 3-alcynyl pyrazolopyrimidines fonctionnalisés utilisés en tant que bases universelles et procédés d'utilisation
WO2014186147A2 (fr) 2013-05-13 2014-11-20 Elitech Holding B.V. Pcr numérique à gouttelettes (ddpcr) utilisant de petites sondes courtes cannelées
WO2016094162A1 (fr) 2014-12-12 2016-06-16 Elitechgroup B.V. Procédés et compositions pour la détection de bactéries résistant aux antibiotiques
WO2016094607A2 (fr) 2014-12-12 2016-06-16 Elitechgroup B.V. Procédés et compositions pour la détection de bactéries résistant aux antibiotiques

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4891643A (en) * 1986-09-15 1990-01-02 International Business Machines Corporation Arithmetic coding data compression/de-compression by selectively employed, diverse arithmetic coding encoders and decoders
US4905297A (en) * 1986-09-15 1990-02-27 International Business Machines Corporation Arithmetic coding encoder and decoder system
US5442458A (en) * 1991-12-18 1995-08-15 Eastman Kodak Company Method and associated apparatus for encoding bitplanes for improved coding efficiency
US5781136A (en) * 1996-06-19 1998-07-14 Mitsubishi Denki Kabushiki Kaisha Digital information encoding device, digital information decoding device, digital information encoding/decoding device, digital information encoding method, and digital information decoding method
US5809176A (en) * 1994-10-18 1998-09-15 Seiko Epson Corporation Image data encoder/decoder system which divides uncompresed image data into a plurality of streams and method thereof

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4891643A (en) * 1986-09-15 1990-01-02 International Business Machines Corporation Arithmetic coding data compression/de-compression by selectively employed, diverse arithmetic coding encoders and decoders
US4905297A (en) * 1986-09-15 1990-02-27 International Business Machines Corporation Arithmetic coding encoder and decoder system
US5442458A (en) * 1991-12-18 1995-08-15 Eastman Kodak Company Method and associated apparatus for encoding bitplanes for improved coding efficiency
US5809176A (en) * 1994-10-18 1998-09-15 Seiko Epson Corporation Image data encoder/decoder system which divides uncompresed image data into a plurality of streams and method thereof
US5781136A (en) * 1996-06-19 1998-07-14 Mitsubishi Denki Kabushiki Kaisha Digital information encoding device, digital information decoding device, digital information encoding/decoding device, digital information encoding method, and digital information decoding method

Cited By (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7715989B2 (en) 1998-04-03 2010-05-11 Elitech Holding B.V. Systems and methods for predicting oligonucleotide melting temperature (TmS)
US6949367B1 (en) 1998-04-03 2005-09-27 Epoch Pharmaceuticals, Inc. Modified oligonucleotides for mismatch discrimination
US7045610B2 (en) 1998-04-03 2006-05-16 Epoch Biosciences, Inc. Modified oligonucleotides for mismatch discrimination
US7368549B2 (en) 1998-04-03 2008-05-06 Epoch Biosciences, Inc. Tm leveling compositions
US6683173B2 (en) 1998-04-03 2004-01-27 Epoch Biosciences, Inc. Tm leveling methods
US7751982B2 (en) 1998-04-03 2010-07-06 Elitech Holding B.V. TM leveling methods
EP1944310A2 (fr) 2000-03-01 2008-07-16 Epoch Biosciences, Inc. Oligonucléotides modifiées pour discrimination de désadaptation
EP1995330A1 (fr) 2000-03-01 2008-11-26 Epoch Biosciences, Inc. Oligonucléotides modifiées pour discrimination de désadaptation
EP1975256A1 (fr) 2000-03-01 2008-10-01 Epoch Biosciences, Inc. Oligonucléotides modifiées pour discrimination de désadaptation
WO2012129547A1 (fr) 2011-03-23 2012-09-27 Elitech Holding B.V. Analogues de 3-alcynyl pyrazolopyrimidines fonctionnalisées comme bases universelles et procédés d'utilisation
WO2013048583A2 (fr) 2011-05-24 2013-04-04 Elitech Holding B.V. Détection de staphylococcus aureus résistant à la méthicilline
EP2801626A1 (fr) 2011-05-24 2014-11-12 Elitech Holding B.V. Détection de staphylococcus aureus méthicilline-résistant
WO2014159063A1 (fr) 2013-03-14 2014-10-02 Elitech Holding B.V. Analogues de 3-alcynyl pyrazolopyrimidines fonctionnalisés utilisés en tant que bases universelles et procédés d'utilisation
WO2014186147A2 (fr) 2013-05-13 2014-11-20 Elitech Holding B.V. Pcr numérique à gouttelettes (ddpcr) utilisant de petites sondes courtes cannelées
WO2016094162A1 (fr) 2014-12-12 2016-06-16 Elitechgroup B.V. Procédés et compositions pour la détection de bactéries résistant aux antibiotiques
WO2016094607A2 (fr) 2014-12-12 2016-06-16 Elitechgroup B.V. Procédés et compositions pour la détection de bactéries résistant aux antibiotiques
US9988670B2 (en) 2014-12-12 2018-06-05 Elitechgroup B.V. Methods and compositions for detecting antibiotic resistant bacteria

Also Published As

Publication number Publication date
AU2229699A (en) 1999-08-02
WO1999037085A3 (fr) 1999-10-14

Similar Documents

Publication Publication Date Title
US5045852A (en) Dynamic model selection during data compression
US5297220A (en) Image processing system for image compression and decompression
US6351569B1 (en) Coding method, decoding method, coding device and decoding device
EP0253326B1 (fr) Procédé et appareil pour coder et décoder les signaux de tremblement pour la reproduction en demi-teinte
US20050089233A1 (en) Adaptive encoding and decoding of bi-level images
KR102400372B1 (ko) 디지털 이미지의 무손실 압축을 달성하기 위한 픽셀 값들의 인코딩에 관련된 방법 및 인코더
JPH06224777A (ja) 符号化方法、符号化装置、復号方法、復号器、データ圧縮装置、ビットストリーム生成方法及び遷移マシン生成方法
WO1999037085A2 (fr) Compression de telecopie au moyen d'un codage arithmetique, avec detection d'erreur
US6373408B1 (en) Encoding apparatus, decoding apparatus, encoding/decoding apparatus, encoding method and decoding method
Ono et al. Bi-level image coding with MELCODE-comparison of block type code and arithmetic type code
US6728412B1 (en) Method and apparatus for on-the-fly image coding
EP0658982B1 (fr) Système à besoin en mémoire réduit pour le codage - décodage de symboles à deux niveaux et méthode associée
Bartrina-Rapesta et al. A lightweight contextual arithmetic coder for on-board remote sensing data compression
US6760129B1 (en) Arithmetic coding-based facsimile compression with error detection
JP2007306513A (ja) 画像データの圧縮方法および装置
EP0506405A2 (fr) Procédé et appareil de transmission d'images
JPH05151349A (ja) 画像データ圧縮方法および符号化回路
Usubuchi et al. Adaptive predictive coding for newspaper facsimile
Yamada Edge-difference coding-A new, efficient redundancy reduction technique for facsimile signals
EP0357388A2 (fr) Procédé d'encodage d'images
JPH07123276A (ja) 画像信号のデジタル圧縮符号化方法
JP3359214B2 (ja) 多値画像符号化装置
US7076109B2 (en) System and method of automatically determining the dominant periodicity in sequential binary data
Denecker et al. A comparative study of lossless coding techniques for screened continuous-tone images
JP3732329B2 (ja) 疑似中間調画像の符号化装置及び符号化方法

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): AL AM AT AU AZ BA BB BG BR BY CA CH CN CU CZ DE DK EE 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 MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT UA UG US UZ VN YU ZW

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): GH GM KE LS MW SD SZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
AK Designated states

Kind code of ref document: A3

Designated state(s): AL AM AT AU AZ BA BB BG BR BY CA CH CN CU CZ DE DK EE 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 MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT UA UG US UZ VN YU ZW

AL Designated countries for regional patents

Kind code of ref document: A3

Designated state(s): GH GM KE LS MW SD SZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
NENP Non-entry into the national phase in:

Ref country code: KR

WWE Wipo information: entry into national phase

Ref document number: 09600291

Country of ref document: US

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

122 Ep: pct application non-entry in european phase