Hierarchical entropy encoding and decoding

US9035807B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-9035807-B2
Application numberUS-201114240066-A
CountryUS
Kind codeB2
Filing dateAug 25, 2011
Priority dateAug 25, 2011
Publication dateMay 19, 2015
Grant dateMay 19, 2015

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

A particular implementation receives geometry data of a 3D mesh, and represents the geometry data with an octree. The particular implementation partitions the octree into three parts, wherein the symbols corresponding to the middle part of the octree are hierarchical entropy encoded. To partition the octree into three parts, different thresholds are used. Depending on whether a symbol associated with a node is an S1 symbol, the child node of the node is included in the middle part or the upper part of the octree. In hierarchical entropy encoding, a non-S1 symbol is first encoded as a pre-determined symbol ‘X’ using symbol set S2={S1, ‘X’} and the non-S1 symbol itself is then encoded using symbol set S0 (S2⊂S0), and an S1 symbol is encoded using symbol set S2. Another implementation defines corresponding hierarchical entropy decoding. A further implementation reconstructs the octree and restores the geometry data of a 3D mesh from the octree representation.

First claim

Opening claim text (preview).

The invention claimed is: 1. A method, comprising: determining that a symbol in a sequence of symbols does not belong to a first symbol set; encoding a pre-determined symbol to represent the determined symbol, using a statistical model for the first symbol set and the pre-determined symbol; and encoding the determined symbol, using a statistical model for a second symbol set. 2. The method of claim 1 , wherein the second symbol set is a superset of the f…

Assignees

Inventors

Classifications

Patent family

Related publications grouped by family.

External sources

Next steps

Free tools are coming soon. Tell us what you want to track and we'll notify you.

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US9035807B2 cover?
A particular implementation receives geometry data of a 3D mesh, and represents the geometry data with an octree. The particular implementation partitions the octree into three parts, wherein the symbols corresponding to the middle part of the octree are hierarchical entropy encoded. To partition the octree into three parts, different thresholds are used. Depending on whether a symbol associate…
Who is the assignee on this patent?
Jiang Wenfei, Cai Kangying, Hu Ping, and 1 more
What technology area does this patent fall under?
Primary CPC classification G06T17/005. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue May 19 2015 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).