U.S. patents available from 1976 to present.
U.S. patent applications available from 2005 to present.

Coding method of image information

Patent 5059976 Issued on October 22, 1991. Estimated Expiration Date: Icon_subject January 25, 2010. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.

Patent References

Apparatus for compression coding using cross-array correlation between two-dimensional matrices derived from two-valued digital images
Patent #: 4028731
Issued on: 06/07/1977
Inventor: Arps ,   et al.

Picture image information band compression and transmission system
Patent #: 4070694
Issued on: 01/24/1978
Inventor: Sakamoto ,   et al.

Markov processor for context encoding from given characters and for character decoding from given contexts
Patent #: 4099257
Issued on: 07/04/1978
Inventor: Arnold ,   et al.

Decoder for variable-length codes
Patent #: 4177456
Issued on: 12/04/1979
Inventor: Fukinuki ,   et al.

Facsimile encoding communication system
Patent #: 4191974
Issued on: 03/04/1980
Inventor: Ono ,   et al.

Method and means for arithmetic coding utilizing a reduced number of operations
Patent #: 4286256
Issued on: 08/25/1981
Inventor: Langdon, Jr. ,   et al.

Dynamic stack data compression and decompression system
Patent #: 4355306
Issued on: 10/19/1982
Inventor: Mitchell

Arithmetic coding encoder and decoder system Patent #: 4905297
Issued on: 02/27/1990
Inventor: Langdon, Jr., et al.

Inventors

Application

No. 470099 filed on 01/25/1990

US Classes:

341/51, Adaptive coding341/107, To or from code based on probability358/1.9Attribute control

Examiners

Primary: Fuller, Benjamin R.
Assistant: Gibson, R.

Attorney, Agent or Firm

International Class

H03M 007/34

Foreign Application Priority Data

1989-01-31 JP

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.

Other References

  • Pennebaker et al, "An Overview of the Basic Principles of the Q-Coder Adaptive Binary Arithmetic Coder", 11/1988, pp. 717-726
  • Robotics: Control, Sensing, Vision, and Intelligence, K. S. Fu et al., McGraw-Hill Book Company, New York, copyright 1987, pp. 342-35
PatentsPlus Images
Enhanced PDF formats
loading...
PatentsPlus: add to cart
PatentsPlus: add to cartSearch-enhanced full patent PDF image
$9.95more info
PatentsPlus: add to cart
PatentsPlus: add to cartIntelligent turbocharged patent PDFs with marked up images
$18.95more info
 
Sign InRegister
Username  
Password   
forgot password?