Search

Frank J Bossen

age ~49

from Mountain View, CA

Also known as:
  • Frank Bossen

Frank Bossen Phones & Addresses

  • Mountain View, CA
  • Palo Alto, CA
  • 1700 1St St, San Jose, CA 95112 • 408-452-1657

Us Patents

  • Method And Apparatus For Arithmetic Coding

    view source
  • US Patent:
    6850175, Feb 1, 2005
  • Filed:
    Sep 18, 2003
  • Appl. No.:
    10/666687
  • Inventors:
    Frank Jan Bossen - San Jose CA, US
  • Assignee:
    NTT Docomo, Inc. - Tokyo
  • International Classification:
    H03M 700
  • US Classification:
    341107, 341106
  • Abstract:
    Methods and apparatuses for performing arithmetic encoding and/or decoding are disclosed. In one embodiment, a method for encoding data comprises coding a plurality of events in an event sequence to produce encoded data and generating a bitstream using the encoded data, including adding zero or more stuffing bits to the bitstream after the encoded data. The zero or more stuffing bits operate to substantially maintain a relationship between an amount of events encoded, a number of blocks being coded, and a number of bits in the bitstream.
  • Method And Apparatus For Arithmetic Coding, Including Probability Estimation State Table Creation

    view source
  • US Patent:
    6906647, Jun 14, 2005
  • Filed:
    Sep 18, 2003
  • Appl. No.:
    10/666798
  • Inventors:
    Frank Jan Bossen - San Jose CA, US
  • Assignee:
    NTT Docomo, Inc. - Tokyo
  • International Classification:
    H03M007/00
  • US Classification:
    341107, 341106
  • Abstract:
    Methods and apparatuses for performing arithmetic encoding and/or decoding are disclosed. In one embodiment, the method for creating a state machine for probability estimation comprises assigning probabilities to states of a look up table (LUT), including setting a probability for each state i of the states equal to the highest probability of the LPS multiplied by the adaptation rate to the power i, where i is a number for a given state and the adaptation rate is smaller than 1. The method also comprises generating state transitions for states in the LUT to be transitioned to upon observing an MPS and an LPS, wherein the next state to which the state machine transitions from a current state when an MPS is observed is a next state higher than the current state if the current state is not the highest state and is the current state if the current state is the highest state. Furthermore, the next state to which the state machine transitions from a current state when an LPS is observed for a plurality of states is a rounded version of a result of calculating: number of current state+log((probability of the current state*the adaptation rate+(1−the adaptation rate))/probability of the current state)/log(the adaptation rate).
  • Method And Apparatus For Arithmetic Coding, Including Probability Estimation State Table Creation

    view source
  • US Patent:
    6967601, Nov 22, 2005
  • Filed:
    Oct 18, 2004
  • Appl. No.:
    10/968309
  • Inventors:
    Frank Jan Bossen - San Jose CA, US
  • Assignee:
    NTT DoCoMo, Inc. - Tokyo
  • International Classification:
    H03M007/00
  • US Classification:
    341107
  • Abstract:
    Methods and apparatuses for performing arithmetic encoding and/or decoding are disclosed. In one embodiment, the method for creating a state machine for probability estimation comprises assigning probabilities to states of a look up table (LUT), including setting a probability for each state i of the states equal to the highest probability of the LPS multiplied by the adaptation rate to the power i, where i is a number for a given state and the adaptation rate is smaller than 1. The method also comprises generating state transitions for states in the LUT to be transitioned to upon observing an MPS and an LPS, wherein the next state to which the state machine transitions from a current state when an MPS is observed is a next state higher than the current state if the current state is not the highest state and is the current state if the current state is the highest state. Furthermore, the next state to which the state machine transitions from a current state when an LPS is observed for a plurality of states is a rounded version of a result of calculating:.
  • Method And Apparatus For Arithmetic Coding And Termination

    view source
  • US Patent:
    7183951, Feb 27, 2007
  • Filed:
    Jul 20, 2004
  • Appl. No.:
    10/895882
  • Inventors:
    Frank Jan Bossen - San Jose CA, US
  • Assignee:
    NTT Docomo, Inc. - Tokyo
  • International Classification:
    H03M 7/00
  • US Classification:
    341107, 341 59, 714786
  • Abstract:
    Methods and apparatuses for performing arithmetic encoding and/or decoding are disclosed. In one embodiment, an arithmetic decoder comprises a sequencer to generate a context identifier for an event of an event sequence, a probability estimator to determine a value for a LPS and a probability estimate for the LPS, and a decoding engine that includes a range register to assign a value to a range for the LPS. The value is based on the probability estimate, a value stored in the range register and the context identifier to a range for the LPS if the context identifier is not equal to an index and the value is not based on the value stored in range register if the context identifier is equal to the index. The decoding engine further determines a value of a binary event based on the value of the range for the LPS and bits from an information sequence.
  • Representation And Coding Of Panoramic And Omnidirectional Images

    view source
  • US Patent:
    7292722, Nov 6, 2007
  • Filed:
    Jul 12, 2006
  • Appl. No.:
    11/486171
  • Inventors:
    Dan Lelescu - Morgan Hill CA, US
    Frank Jan Bossen - San Jose CA, US
  • Assignee:
    NTT Docomo, Inc. - Tokyo
  • International Classification:
    G06K 9/00
    G06K 9/32
    H04N 7/00
  • US Classification:
    382154, 382293, 348 36
  • Abstract:
    A method for representing an omnidirectional-like image by capturing an omnidirectional-like image and determining a representation format that is commonly applicable to any image acquisition system that is able to capture the omnidirectional-like image. The captured omnidirectional-like image is mapped onto the determined representation format.
  • Representation And Coding Of Panoramic And Omnidirectional Images

    view source
  • US Patent:
    7308131, Dec 11, 2007
  • Filed:
    Dec 3, 2002
  • Appl. No.:
    10/308828
  • Inventors:
    Dan Lelescu - Morgan Hill CA, US
    Frank Jan Bossen - San Jose CA, US
  • Assignee:
    NTT DoCoMo, Inc. - Tokyo
  • International Classification:
    G06K 9/00
    G06K 9/32
    H04N 7/00
  • US Classification:
    382154, 382293, 348 36
  • Abstract:
    A method for representing an omni directional-like image by capturing an omnidirectional-like image and determining a representation format that is commonly applicable to any image acquisition system that is able to capture the omnidirectional-like image. The captured omnidirectional-like image is mapped onto the determined representation format.
  • Wavelet Based Multiresolution Video Representation With Spatially Scalable Motion Vectors

    view source
  • US Patent:
    7321625, Jan 22, 2008
  • Filed:
    Dec 13, 2002
  • Appl. No.:
    10/318802
  • Inventors:
    Huipin Zhang - Milpitas CA, US
    Frank Jan Bossen - San Jose CA, US
  • Assignee:
    NTT DoCoMo, Inc. - Tokyo
  • International Classification:
    H04B 1/66
    H04N 7/12
    H04N 11/02
    H04N 11/06
  • US Classification:
    37524011
  • Abstract:
    Wavelet based multiresolution video representations generated by multi-scale motion compensated temporal filtering (MCTF) and spatial wavelet transform are disclosed. Since temporal filtering and spatial filtering are separated in generating such representations, there are many different ways to intertwine single-level MCTF and single-level spatial filtering, resulting in many different video representation schemes with spatially scalable motion vectors for the support of different combination of spatial scalability and temporal scalability. The problem of design of such a video representation scheme to full the spatial/temporal scalability requirements is studied. Signaling of the scheme to the decoder is also investigated. Since MCTF is performed subband by subband, motion vectors are available for reconstructing video sequences of any possible reduced spatial resolution, restricted by the dyadic decomposition pattern and the maximal spatial decomposition level. It is thus clear that the family of decomposition schemes provides efficient and versatile multiresolution video representations for fully scalable video coding.
  • Low Complexity And Unified Transforms For Video Coding

    view source
  • US Patent:
    7627187, Dec 1, 2009
  • Filed:
    Feb 15, 2008
  • Appl. No.:
    12/032433
  • Inventors:
    Frank Jan Bossen - San Jose CA, US
  • Assignee:
    NTT DoCoMo, Inc. - Tokyo
  • International Classification:
    G06K 9/36
  • US Classification:
    382250, 382232, 382233, 382248, 3752402
  • Abstract:
    A method and apparatus is disclosed herein for decoding data (e. g. , video data) using transforms. In one embodiment, the decoding process comprises scaling a block of coefficients using a scaling factor determined for each coefficient by computing an index for said each coefficient and indexing a look-up table (LUT) using the index. The index is based on a quantization parameter, a size of the block of coefficients, and a position of said each coefficient within the block. The method also comprises applying a transform to the block of scaled coefficients.

Get Report for Frank J Bossen from Mountain View, CA, age ~49
Control profile