Risultati della ricerca - (endededededededededededededecoding OR coding) Algorithms
Cerca anche:
- Algorithms »
-
1
Feature-based fast coding unit partition algorithm for high efficiency video coding
Pubblicazione 2015Fuente: Universidad Nacional Autónoma de MéxicoTipo de material: Artículo de InvestigaciónDescripción: Resumen: High Efficiency Video Coding (HEVC), which is the newest video coding standard, has been developed for the efficient compression of ultra high definition videos. One of the important features in HEVC is the adoption of a quad-tree based video coding structure, in which each incoming frame is represented as a set of non-overlapped coding tree blocks (CTB) by variable-block sized prediction and coding process. To do this, each CTB needs to be recursively partitioned into coding unit (CU), predict unit (PU) and transform unit (TU) during the coding process, leading to a huge computational load in the coding of each video frame. This paper proposes to extract visual features in a CTB and uses them to simplify the coding procedure by reducing the depth of quad-tree partition for each CTB in HEVC intra coding mode. A measure for the edge strength in a CTB, which is defined with simple Sobel edge detection, is used to constrain the possible maximum depth of quad-tree partition of the CTB. With the constrained partition depth, the proposed method can reduce a lot of encoding time. Experimental results by HM10.1 show that the average time-savings is about 13.4% under the increase of encoded BD-Rate by only 0.02%, which is a less performance degradation in comparison to other similar methods. All Rights Reserved © 2015 Universidad Nacional Autónoma de México, Centro de Ciencias Aplicadas y Desarrollo Tecnológico. This is an open access item distributed under the Creative Commons CC License BY-NC-ND 4.0.Acceso al recurso -
2
Connectivity graph‐codes
Pubblicazione 2024Fuente: Wiley Open AccessTipo de material: Artículo Open AccessAcceso al recurso -
3
Probabilistic analysis of arithmetic coding showing its robustness
Pubblicazione 2025Fuente: arXivTipo de material: PreprintAcceso al recurso -
4
Weight distribution of random linear codes and Krawtchouk polynomials
Pubblicazione 2024Fuente: Wiley Open AccessTipo de material: Artículo Open AccessAcceso al recurso -
5
On the complexity and approximability of Bounded access Lempel Ziv coding
Pubblicazione 2024Fuente: arXivTipo de material: PreprintAcceso al recurso -
6
Tight bounds for stream decodable error-correcting codes
Pubblicazione 2024Fuente: arXivTipo de material: PreprintAcceso al recurso -
7
Deletion-correcting codes for an adversarial nanopore channel
Pubblicazione 2026Fuente: arXivTipo de material: PreprintAcceso al recurso -
8
Worst-case optimal adaptive alphabetic prefix-free coding
Pubblicazione 2021Fuente: arXivTipo de material: PreprintAcceso al recurso -
9
Constant delay Gray code enumeration of ideals and antichains in posets
Pubblicazione 2026Fuente: arXivTipo de material: PreprintAcceso al recurso -
10
Recursive and iterative approaches to generate rotation Gray codes for stamp foldings and semi-meanders
Pubblicazione 2024Fuente: arXivTipo de material: PreprintAcceso al recurso -
11
Generalized matching decoders for 2D topological translationally-invariant codes
Pubblicazione 2026Fuente: arXivTipo de material: PreprintAcceso al recurso -
12
Uniformity testing when you have the source code
Pubblicazione 2024Fuente: arXivTipo de material: PreprintAcceso al recurso -
13
More basis reduction for linear codes: backward reduction, BKZ, slide reduction, and more
Pubblicazione 2024Fuente: arXivTipo de material: PreprintAcceso al recurso -
14
Generating pivot Gray codes for spanning trees of complete graphs in constant amortized time
Pubblicazione 2025Fuente: arXivTipo de material: PreprintAcceso al recurso -
15
Trellis codes with a good distance profile constructed from expander graphs
Pubblicazione 2026Fuente: arXivTipo de material: PreprintAcceso al recurso -
16
Fast decision tree learning solves hard coding-theoretic problems
Pubblicazione 2024Fuente: arXivTipo de material: PreprintAcceso al recurso -
17
Algorithmic counting of nonequivalent compact Huffman codes
Pubblicazione 2019Fuente: arXivTipo de material: PreprintAcceso al recurso -
18
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
Pubblicazione 2020Fuente: arXivTipo de material: PreprintAcceso al recurso -
19
Algorithms of self-synchronizing single-deletion-correcting codes
Pubblicazione 2026Fuente: arXivTipo de material: PreprintAcceso al recurso -
20
Algorithmic bottlenecks in evolution: Genetic code, symbolic language, and the Great Filter hypothesis
Pubblicazione 2026Fuente: arXivTipo de material: PreprintAcceso al recurso