搜索结果: 1-15 共查到“知识库 代数编码理论”相关记录103条 . 查询时间(2.301 秒)
基于视频的点云压缩(Video based point cloud compression,V-PCC)为压缩动态点云提供了高效的解决方案,但V-PCC从三维到二维的投影使得三维帧间运动的相关性被破坏,降低了帧间编码性能.针对这一问题,提出一种基于V-PCC改进的自适应分割的视频点云多模式帧间编码方法,并依此设计了一种新型动态点云帧间编码框架。
极化码的所有保持串行抵消译码不变的仿射自同构（马志明、闫桂英）
极化码 保持串行抵消 译码不变 仿射自同构
2023/2/22
Automorphism ensemble (AE) decoding for polar codes was proposed by decoding permuted codewords with successive cancellation (SC) decoders in parallel and hence has lower latency compared to that of s...
图谱方法改进GV界（马志明、闫桂英）
图谱方法 改进 GV界
2023/2/22
This paper improves Gilbert-Varshamov bound by graph spectral method. Gilbert graph Gq,n,d is a graph with all vectors in Fnq as vertices where two vertices are adjacent if their Hamming distance is l...
编码系统中的AMP容量最优性
编码系统 AMP容量 最优性
2023/1/5
This paper studies a large random matrix system (LRMS) model involving an arbitrary signal distribution and forward error control (FEC) coding. The authors establish an area property based on the appr...
为进一步提高块对角化预编码算法的性能，提出一种多用户多输入多输出下行链路中基于Givens变换的正交三角（QR）分解改进块对角化算法（QR-Givens-BD）。在块对角化预编码算法中，首先需要求出预编码矩阵的前半部分来解决多用户干扰问题，然后求出预编码矩阵的后半部分来降低用户自身天线间的数据干扰。
为了进一步降低芯片内无损压缩的运算复杂度和编码时间，该文在保持高压缩率的基础上，提出一种基于方向预测和混合熵编码的快速无损压缩算法。该算法首先采用自适应方法进行纹理方向的预测，以获得当前像素的参考像素，并计算预测残差；然后对预测残差进行混合哥伦布编码，最终大幅度地提高了无损压缩的压缩性能。实验结果显示，与基于梯度预测和变长编码的无损压缩算法相比，该算法在平均压缩率略有提升的前提下，平均编码时间减少...
针对目前Turbo码中，分量编码器递归系统卷积码识别算法计算量大，容错性不好两大缺点，该文提出了一种容错性能较好的快速识别算法。首先，在分析递归系统卷积码特殊结构的基础上，定义了更具普遍意义的广义码重概念；其次，建立出递归系统卷积码生成多项式数据库，按照数据库中多项式是否为实际编码多项式的情况，分析出多项式所对应的结果向量广义码重概率分布；然后，按照分析出的广义码重概率分布，基于极大极小准则，导出...
基于Co-training的用户属性预测研究
用户属性 Co-training 稀疏自编码器 梯度下降算法
2018/7/4
针对当前基于第三方应用数据的用户属性预测算法较少考虑应用前台实际使用时长问题，提出了“手机应用前台均使用时长”特征，同时采用基于稀疏自编码器和神经网络的Co-training框架，充分利用大量未标注数据，从应用类别和前台均使用时长两个角度进行属性预测。实验进行时，首先使用未标注数据对网络进行初始化，然后采用基于准确率的梯度下降算法对参数进行更新。实验结果表明，本文算法提高了用户属性预测准确率。
基于伪随机码置乱的分布式视频残差编码端码率控制算法
分布式视频残差编码 编码端码率控制 伪随机码置乱
2016/12/29
提出一种基于伪随机码置乱的分布式视频残差编码端码率控制算法,利用伪随机码对残差视频帧的像素进行置乱处理,将信源图像与其边信息图像之间的差别均匀化,实现帧级别上的码率估计,即每一帧用同一码率发送.如果收端译码失败,利用提出的一种量化序号估计算法能显著提高译码成功率,解决码率低估问题.同时发端视频残差帧的特性能近似表示收发两端信号之间的相关性,因此,发端无需产生一个预测的边信息.仿真结果表明,该算法发...
VISUALIZING AND ANALYZING LARGE AND DETAILED 3D DATASETS
Multi-resolution modeling interactive visualization GPU programming large datasets texture mapping
2015/10/8
This paper presents a set of tools developed to model, visualize and analyze large 3D datasets built from 2D and 3D sensor data. These
tools, grouped under the Atelier3D framework, first includ...
Information-Theoretically Optimal Compressed Sensing via Spatial Coupling and Approximate Message Passing
Compressed sensing random sensing matrix the space coupling space coupling
2015/8/21
We study the compressed sensing reconstruction problem for a broad class of random, banddiagonal sensing matrices. This construction is inspired by the idea of spatial coupling in coding theory. As de...
Why We Can Not Surpass Capacity: The Matching Condition
Iterations coding system coding binary input
2015/8/21
We show that iterative coding systems can not surpass capacity using only quantities which naturally appear in density evolution. Although the result in itself
is trivial, the method which we apply s...
TP Decoding
Tree pruning binary markov random field probability reasoning algorithm tree unique threshold
2015/8/21
‘Tree pruning’ (TP) is an algorithm for probabilistic inference on binary Markov random fields. It has been recently derived by Dror Weitz and used to construct the first fully polynomial approximatio...
The glassy phase of Gallager codes
UMR 8549, Unit′e Mixte de Recherche du Centre National de la Recherche Scientifi que et de l’ Ecole Normale Sup′erieure
2015/8/21
Gallager codes are the best error-correcting codes to-date. In this paper we study them by using the tools of statistical mechanics. The corresponding statistical mechanics model is a spin model on a ...
Coding for Network Coding
Sparse graph codes probabilistic channel models Shannon channel capacity network coding
2015/8/20
We consider communication over a noisy network under randomized linear network coding. Possible error mechanism include node- or link- failures, Byzantine behavior of nodes, or an over-estimate of the...
