Search Results - Context-tree coding

Context Tree-Based Image Contour Coding Using a Geometric Prior by Amin Zheng, Cheung, Gene, Florencio, Dinei

“… To encode the symbol sequence using arithmetic coding, we compute an optimal variable-length context tree (VCT…”
Get full text

Patch-Based Conditional Context Coding of Stereo Disparity Images by Tabus, Ioan

“…This letter proposes a method for lossless coding the left disparity image, L, from a stereo disparity image pair (L,R…”
Get full text

Context Tree-Based Image Contour Coding Using a Geometric Prior by Amin Zheng, Gene Cheung, Dinei Florencio

Get full text

The Universal LZ77 Compression Algorithm Is Essentially Optimal for Individual Finite-Length N-Blocks by Ziv, J.

“…) algorithm, context tree algorithm and an adaptive Hufmann algorithm) such that when successively applied to N-blocks then, the best error-free compression for the particular individual sequence X is achieved as N tends to infinity…”
Get full text

On Finite Memory Universal Data Compression and Classification of Individual Sequences by Ziv, J.

“… It is demonstrated that context tree…”
Get full text

Context Tree based Image Contour Coding using A Geometric Prior by Zheng, Amin, Cheung, Gene, Dinei Florencio

“… To encode the symbol sequence using arithmetic coding, we compute an optimal variable-length context tree (VCT) \(\mathcal…”
Get full text

The context-tree weighting method: basic properties by Willems, F.M.J., Shtarkov, Y.M., Tjalkens, T.J.

“…" Using a context tree, this method weights in an efficient recursive way the coding distributions corresponding to all bounded memory tree sources, and achieves a desirable coding distribution…”
Get full text

An Efficient Bayes Coding Algorithm for the Non-Stationary Source in Which Context Tree Model Varies from Interval to Interval by Shimada, Koshi, Saito, Shota, Matsushima, Toshiyasu

“…The context tree source is a source model in which the occurrence probability of symbols is determined from a finite past sequence, and is a broader class of sources that includes i.i.d. and Markov sources…”
Get full text

A parallel two-pass MDL context tree algorithm for universal source coding by Krishnan, Nikhil, Baron, Dror, Mihcak, Mehmet Kivanc

“…We present a novel lossless universal source coding algorithm that uses parallel computational units to increase the throughput…”
Get full text

Compression of map images by multilayer context tree modeling by Kopylov, P., Franti, P.

“…We propose a method for compressing color map images by context tree modeling and arithmetic coding…”
Get full text

Reducing the space complexity of a Bayes coding algorithm using an expanded context tree by Matsushima, T., Hirasawa, S.

“… On the other hand, the predictive Bayes source coding algorithm cannot use a Patricia like context tree, because it is difficult to hold and update the posterior probability parameters on a Patricia like tree…”
Get full text

Google LLC Files Patent Application for Coding Video Syntax Elements Using a Context Tree

Get full text

Alphabet Class A (GOOGL) issued patent titled "Coding video syntax elements using a context tree"

Get full text

Lossless compression of map contours by context tree modeling of chain codes by Akimov, Alexander, Kolesnikov, Alexander, Fränti, Pasi

“…We consider lossless compression of digital contours in map images. The problem is attacked by the use of context-based statistical modeling and entropy coding of the chain codes…”
Get full text

An Efficient Bayes Coding Algorithm for the Non-Stationary Source in Which Context Tree Model Varies from Interval to Interval by Shimada, Koshi, Saito, Shota, Matsushima, Toshiyasu

“…The context tree source is a source model in which the occurrence probability of symbols is determined from a finite past sequence, and is a broader class of sources that includes i.i.d. and Markov sources…”
Get full text

WIPO PUBLISHES PATENT OF GOOGLE FOR "CODING VIDEO SYNTAX ELEMENTS USING A CONTEXT TREE" (AMERICAN INVENTORS)

Get full text

US Patent Issued to GOOGLE on Dec. 10 for "Coding video syntax elements using a context tree" (California Inventors)

Get full text

A Parallel Two-Pass MDL Context Tree Algorithm for Universal Source Coding by Krishnan, Nikhil, Baron, Dror, Mıhçak, Mehmet Kıvanç

“…We present a novel lossless universal source coding algorithm that uses parallel computational units to increase the throughput. The length-\(N…”
Get full text

A Bayes coding algorithm using context tree by Matsushima, T., Hirasawa, S.

“…The context tree weighting (CTW) algorithm [Willems et al., 1993] has high compressibility for universal coding with respect to FSMX sources…”
Get full text

Context Tree Weighting : A Sequential Universal Source Coding Procedure for Fsmx Sources by Willems, F.M.J., Shtarkov, Y.M., Tjalkens, T.J.

“…A binary FSMX source generates a given sequence of digits from {0, l} whose statistical behavior can be described using a postfix set S. This postfix set is a…”
Get full text