Suchergebnisse - Context-tree coding

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

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

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

Volltext

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

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

The Universal LZ77 Compression Algorithm Is Essentially Optimal for Individual Finite-Length N-Blocks von 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 …”
Volltext

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

“… It is demonstrated that context tree …”
Volltext

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

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

The context-tree weighting method: basic properties von 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 …”
Volltext

An Efficient Bayes Coding Algorithm for the Non-Stationary Source in Which Context Tree Model Varies from Interval to Interval von 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 …”
Volltext

A parallel two-pass MDL context tree algorithm for universal source coding von 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 …”
Volltext

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

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

Reducing the space complexity of a Bayes coding algorithm using an expanded context tree von 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 …”
Volltext

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

Volltext

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

Volltext

Lossless compression of map contours by context tree modeling of chain codes von 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 …”
Volltext

An Efficient Bayes Coding Algorithm for the Non-Stationary Source in Which Context Tree Model Varies from Interval to Interval von 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 …”
Volltext

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

Volltext

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

Volltext

A Parallel Two-Pass MDL Context Tree Algorithm for Universal Source Coding von 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 …”
Volltext

A Bayes coding algorithm using context tree von 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 …”
Volltext

Context Tree Weighting : A Sequential Universal Source Coding Procedure for Fsmx Sources von 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 …”
Volltext