Nova Patents
USRE35781E

Coding method of image information

Claim Score by NHIP

Read claim 4, the broadest

Abstract

A coding method of a binary Markov information source comprises the steps of providing a range on a number line from 0 to 1 which corresponds to an output symbol sequence from the information source, and performing data compression by binary expressing the position information on the number line corresponding to the output symbol sequence. The present method further includes the steps of providing a normalization number line to keep a desired calculation accuracy by expanding a range of the number line which includes a mapping range, by means of a multiple of a power of 2, when the mapping range becomes below 0.5 of the range of the number line; allocating a predetermined mapping range on the normalization number line for less probable symbols LPS proportional to its normal occurrence probability; allocating the remaining mapping range on the normalization number line for more probable symbols MPS; and reassigning the predetermined mapping range to the remaining mapping range the half of a portion where the allocated remaining range is less than 0.5, when the allocated remaining range becomes below 0.5.

Term

Term ended

Expired 7 November 2015, 10.9 years ago.

  1. Priority
  2. Filed
  3. Granted
  4. Expired
  5. Today

8 claims: 4 independent, 4 dependent

  1. 1.
    1. A method for coding information from a binary Markov information source by binary coding an output symbol sequence from said information source comprising less probable symbols (LPS) and more probable symbols (MPS), each having an occurrence probability, on a normalization number line, said method comprising the steps of;PA1 a) storing in a memory storage device a normalization number line having a range from 0 to 1 which corresponds to said output symbol sequence, PA1 b) keeping a desired calculation accuracy by expanding a range of the normalization number line which includes a mapping range by means of a multiple of a power of 2 when the mapping range becomes less than 0.5, PA1 c) allocating a portion of said normalization number line as a predetermined mapping interval for said LPSs, said portion being proportional to the occurrence probability of said LPSs, PA1 d) allocating the remaining portion of said number line as a mapping interval for said MPSs, PA1 e) reassigning half of the LPS mapping interval above 0.5 to said MPS mapping interval when the LPS mapping range exceeds 0.5, and PA1 f) repeating steps b, c, d and e.
  2. 4.
    4. An apparatus for coding information from a binary Markov information source by binary coding an output symbol sequence comprising less probable symbols (LPSs) and more probable symbols (MPS) from said information source on a normalization number line, said LPSs and MPSs each having an occurrence probability, said apparatus comprising:PA1 memory storage means for storing a normalization number line having a range from 0 to 1 which corresponds to said output symbol sequence, PA1 means for keeping desired calculation accuracy by expanding a range on said normalization number line, which includes a mapping range, by a multiple power of 2 when the mapping range becomes less than 0.5, PA1 means for allocating a portion of said normalization number line as a predetermined mapping interval for said LPSs, said portion being proportional to the occurrence probability of said LPSs, PA1 means for allocating the remaining portion of said normalization number line as a mapping interval for said MPSs, PA1 means for reassigning half of the LPS mapping interval above 0.5 to said
  3. 7.
    7. A method for coding information from a Markov information source by binary coding an output symbol sequence from said information source comprising less probable symbols (LPSs) and more probable symbols (MPSs), each sequence having an occurrence probability on a number line, said method comprising, PA1 (a) storing in memory storage device a number line having a range which corresponds to said output symbol sequence;PA1 (b) allocating a portion of said number line as a predetermined mapping interval for said LPSs, said portion being proportional to the occurrence probability of said LPS;PA1 (c) allocating the remaining portion of said number line as a mapping interval for said MPSs;and PA1 (d) controlling the allocating portion of said number line as a mapping interval for said LPSs by assigning a predetermined portion of the mapping interval for said LPSs above a prescribed value of said number line to said mapping interval for said MPSs, so as to maintain said portion proportional to the occurrence probability of said LPSs. .Iaddend..Iadd.
  4. 8.
    not exceed that of the more probable symbols. .Iaddend..Iadd.14. A coding method for a Markov information source by binary coding comprising the steps of:PA1 associating more probable symbols (symbols of higher occurrence probability) and less probable symbols (symbols of a lower occurrence probability) to predetermined ranges on a number line on the basis of a range on a number line or a preceding symbols;PA1 coding a signal according to a result of correspondence between the ranges to generate a codeword;PA1 comparing a range on the number line of more probable symbols with a fixed value;and PA1 adjusting the range on the number line of more probable symbols and the range on the number line of less probable symbols so that when a range of more probable symbols is below the fixed value on a number line, half of a value below the fixed value of a range of more probable symbols is moved from the range of less probable symbols to that of more probable symbols. .Iaddend.
Independent claims4