共查询到20条相似文献,搜索用时 62 毫秒
1.
2.
针对现有局部立体匹配算法在计算匹配代价时, 不能很好区分强弱纹理区域,及在视差计算过程 中,不能很好的解决视差歧义问题,提出一种融合梯度特性与置信度的立体匹配算法。首先 计算梯度特 征,并根据梯度特征信息选择匹配代价计算的匹配窗口,针对强弱不同纹理区域选择不同尺 寸的匹配窗 口,有效的提高了立体匹配精度,降低了误匹配率;然后在视差计算中引入置信度约束条件 ,解决了视差 计算中视差歧义的问题,提高了立体匹配算法的稳定性与精度;最后使用水平与垂直方向交 叉区域检测进 行奇异值的修正。实验结果表明,该算法在Middlebury数据集中31对 立体图像对的平均误匹配率为7.96%,有效的提高了立体匹配精度。 相似文献
3.
在采用基于对数似然比的置信度传递译码算法LLR-BP(Log-Likelihood Ratio Belief Propagation)对低密度奇偶校验码LDPC code(Low-density Parity-check code)译码时,变量节点对数似然比外信息ex-LLR(Extrinsic Log-Likelihood Ratio)的震荡会引起比特节点发生错误.文中分析了ex-LLR值和后验概率值(APP)产生震荡的原因及两者的关系,提出了减弱其对整个译码过程影响的两种改进译码算法.仿真结果表明,改进的译码算法在基本不增加译码复杂度的情况下,能够降低译码错误平层,进一步改善传统的LLR-BP译码算法的性能. 相似文献
4.
词干提取是形态丰富语言信息处理中的基础任务,对其他自然语言处理任务有着重要的影响。该文将词干提取任务看作序列标注问题,以字符为切分粒度来表征维吾尔语单词的构成机制,结合条件随机场模型,实现基于字符序列标注的维吾尔语词干提取方法。首先使用词典查询方法进行词干提取,然后结合字符的弱化发音特征、音类特征以及语音特征,针对受限数据和非受限数据采用条件随机场训练模型及预测结果。实验结果表明,该方法在非受限数据集上效果较佳,且能广泛应用到其他语言。 相似文献
5.
6.
二维视频到三维视频转化技术中,深度图像生成至关重要.介绍一种基于置信度映射的半自动深度产生算法,利用关键帧深度信息和改进的双向双边滤波算法产生其他帧深度信息.此算法利用置信度映射技术减轻未被遮挡区域的模糊程度. 相似文献
7.
针对混合运动模式下目标数量及目标运动速度范围等多项先验信息缺乏状况下的复杂航迹起始问题,提出一种基于最大置信度的多目标检测算法。该算法借鉴动态规划技术中的能量积累思想,并充分利用了传感器信号强度信息。在粗起始阶段利用扩展搜索算法生成候选航迹,并利用模型粗匹配的方法将候选航迹大致分为直线运动及曲线运动两种类型。在航迹确认阶段,采用基于信号强度信息的概率多假设跟踪算法,通过计算最优状态估计值获得量测点属于某一目标的最大置信度,并依据最大置信度确认目标量测。仿真实验结果表明,该方法实时性强,不仅能对多目标航迹准确起始,也可以有效避免概率多假设跟踪算法由于初值质量差而导致的错误跟踪现象。 相似文献
8.
介绍了系统抗电磁脉冲性能评估的主要任务以及系统抗电磁脉冲加固性能的统计性描述方法,根据评估水平(或目标)的不同,将电磁脉冲试验分为4种类型,在此基础上分析了电磁加固设计余量评估中的随机误差来源,分析了总误差标准偏差的评定方法,介绍了一种设计余量下限估计及其对应可靠度与置信度的评定方法,分析了该方法应用的前提条件,并以某屏蔽舱内电子设备的加固设计余量评估计算为例,说明了算法的使用过程及注意事项。 相似文献
9.
控制流混淆用于混淆程序的运行流程,从而防止对软件的逆向工程,但通常混淆后的程序在代码量以及执行时间方面都有较大增长.针对不透明谓词难抵挡动态攻击这一弱点,提出了利用"垃圾代码"进行控制流混淆的思路,采用分支垃圾代码和循环垃圾代码算法相结合,并引入了Hash函数以限制代码的插入操作,从而控制代码长度的增长.实验结果表明,该混淆算法能够有效地控制混淆转换带来的性能过载,同时能够有效地防止逆向工程攻击. 相似文献
10.
11.
12.
13.
14.
15.
《Communications, IEEE Transactions on》2005,53(5):905-905
Joint Source/Channel Coding and MAP Decoding of Arithmetic Codes In this paper, a novel MAP estimation approach is employed for error correction of arithmetic codes with a forbidden symbol. The system is founded on the principle of joint source channel coding, which allows one to unify the arithmetic decoding and error correction takes into a single process, with superior performance compared to traditional separated techniques. The proposed system improves the performance in terms of error correction with respect to a separated source and channel coding approach based on convolutional codes, with the additional great advantage of allowing complete flexibility in adjusting the coding rate. The proposed MAP decoder is tested in the case of image transmission across the AWGN channel and compared against standard FEC techniques in terms of performance an complexity. Both hard and soft decodng are taken into account, and excellent result in terms of packet error rate and decoded image quality are obtained. 相似文献
16.
针对串行抵消翻转译码算法(Successive Cancellation Flip,SCF)受限于单比特翻转而性能提升有限问题,提出了一种双比特翻转译码算法(Successive Cancellation Flip with 2 Bits,SCF2)。针对SCP算法扰动方差初始值固定的问题,设计了一种扰动方差可随码长和码率变化的改进SCP算法。在此基础上,结合翻转和扰动机制,提出了一种动态扰动辅助的串行抵消双比特翻转(Dynamic Perturbation-Aided SCF2,DPA-SCF2)译码算法,并对其译码复杂度和性能进行了分析。仿真结果显示,相比于列表长度为4的循环冗余校验辅助串行抵消列表(Cyclic Redundancy Check Aided Successive Cancellation List,CA-SCL)译码算法,所提算法最大可获得约0.5 dB的性能增益。 相似文献
17.
为实现对无线电干扰源的精确定位,基于两部单二次雷达的空间坐标及时差参数,列出矩阵方程,求解该方程在欧氏范数空间下的最小范数解,以此得出无线电干扰源的空间坐标。而后借助两部雷达的原始视频,参照二维平面定位算法,并引入新的方位角概念,建立起两个辅助空间定位面;或依靠S模式接收机处理器的原始视频,完成误差分析和定位判别,由此证明可消除定位模糊。 相似文献
18.
《Very Large Scale Integration (VLSI) Systems, IEEE Transactions on》2009,17(3):417-426
19.
Increasing soft error rates for semiconductor devices manufactured in later technologies enforce the usage of fault tolerant techniques such as Roll-back Recovery with Checkpointing (RRC). As RRC introduces time overhead that increases the completion (execution) time, time constraints (deadlines) might be violated. This is a drawback for a class of computer systems where the correct operation is defined not only by providing the correct outcome of an operation but also by ensuring that the deadlines are met. These computer systems are referred to as real-time systems (RTSs). In general RTSs are classified as soft and hard RTSs depending on the consequences of violating the deadlines. For soft RTSs, where consequences of violating the deadlines are not very severe, research have focused on optimizing RRC and shown that it is possible to find the optimal number of checkpoints such that the average execution time (AET) is minimal. While minimal AET is important for soft RTSs, it is more important to provide a high probability that deadlines are met for hard RTSs, where consequences of violating the deadlines may be catastrophic. Hence, there is a need of probabilistic guarantees that jobs employing RRC complete before a given deadline. Traditionally, AET analysis have been used for soft RTSs and worst case execution time (WCET) analysis along with schedule feasibility have been used for hard RTSs. In this paper we introduce a reliability metric, Level of Confidence (LoC), which is equally applicable to both soft and hard RTS. LoC is used as a metric to evaluate to what extent a deadline is met. The main contributions of this paper are as follows. First, we present a mathematical framework for the evaluation of LoC when RRC is employed. Second, we provide a proof to verify the correctness of the proposed expression. Third, in the context of hard RTSs, we provide a method to obtain the optimal number of checkpoints that maximizes the LoC. Fourth, in the context of soft RTSs where the maximal LoC may not be needed, but instead some LoC requirement is needed, we present an optimization method for RRC that finds the number of checkpoints that results in the minimal completion time while the minimal completion time satisfies a given LoC requirement. Fifth, we use the proposed framework to evaluate and compare probabilistic guarantees when RRC is optimized towards soft RTSs. 相似文献