共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
给出了矩形点阵上八近邻图像的顶点链码(VCC)、Freeman链码和边界链码之间的转换算法,给出了图像边界的边界链码与顶点链码之间的相互转化算法和顶点链码与Freeman链码之间的相互转换算法,于是可以方便地直接由一种链码得到其他的链码表示,由某种链码获得的图像信息也为其他链码所共享. 相似文献
3.
矩形点阵上链码的转换算法 总被引:3,自引:0,他引:3
链码是图像处理和图像识别中的一个重要工具.给出了四近邻图像的顶点链码(VCC)、Freeman链码和边界链码之间的转换算法,这样只要获得一种链码就可以得到其它的链码表示,由某种链码获得的图像信息也为其他链码所共享. 相似文献
4.
This paper presents a new lossless raster font compression method that uses vertex chain code to define character’s outline. Obtained chain codes are compressed by Huffman coding algorithm. The results show that the new method requires least memory space to store the raster fonts among the known methods. Moreover, the font size has almost no impact on the coder efficiency. Due to the low complexity of the decoder that occupies only 2.7 kB of memory space, this method is ideal for use in embedded systems. 相似文献
5.
Yong Kui Liu 《Pattern recognition》2005,38(4):553-557
This paper presents a new chain code based on the eight-direction Freeman code. Each element in the chain is coded as a relative angle difference between it and the previous element. Statistical analysis showed that the probabilities of the Freeman codes differ importantly. Therefore, the Huffman coding was applied. The proposed chain code requires 1.97 bits/code, its chain length is short, it allows the representation of non-closed patterns, and it is rotationally independent. 相似文献
6.
图象边界的链码表示研究 总被引:3,自引:0,他引:3
图象边界表示在模式识别、图象处理以及计算机视觉等领域扮演着十分重要的角色。本文研究了图象边界的链码表示,提出一种改进的链码表示方法。该方法通过二元组代替方向编号逐一编码方法,使用一个字节的高低位存取二元组的两个数值,节省了存储空间。理论分析和实验结果表明,与常用链码相比,该方法有效缩短了链码长度,能提高边界重绘速度,具有较强的实用性。 相似文献
7.
8.
链码是一种以较少的数据存储表示线条、曲线和区域边界的编码技术。为进一步提高链码的压缩效率,提出了一种新的压缩顶点链码:改进的正交3方向顶点链码(IO3DVCC)。IO3DVCC将顶点链码(VCC)的统计特征与正交3方向链码(3OT)的方向特征相结合,共设5个码值。码值1将VCC中的1、3组合和3、1组合归并表示,码值2与VCC的对应码值表达相同,码值3与3OT中的码值2表达相同,码值4和码值5分别对应2个连续的新链码码值1和8个连续的VCC码值2。新链码基于Huffman编码,为不定长编码。针对100幅图像的轮廓边界,统计并计算了IO3DVCC与改进的相对8方向Freeman链码(ERD8FCC)、基于算数编码的变长相对四方向Freeman链码(AVRF4)、基于算数编码的正交3方向链码(Arith_3OT)、压缩VCC (CVCC)和改进的CVCC (ICVCC)6种链码各码值出现的概率、平均码值表达能力、平均码长和链码效率。实验结果表明,IO3DVCC效率最高。针对随机选择的20幅轮廓边界图像,统计并计算了IO3DVCC、Arith_3OT和ICVCC3种链码表达的总码数、二进制总位数,以及相对于8方向Freeman链码的压缩比率。实验结果表明,IO3DVCC的压缩效果最好。 相似文献
9.
10.
提出了一种适合于对线状结构的条形纹线二值图像进行压缩的最优化Freeman链码压缩算法——Freeman差分链码Huffman编码。与传统的Freeman链码相比,提出的压缩算法是基于Freeman链码、差分编码和Huffman编码的一种混和编码方式。通过理论分析和在指纹二值细化图上的实验结果证明,对于指纹二值细化图像,本算法优于现有的链码压缩二值图像的算法,针对于线状结构的条形纹线二值图像,本算法也优于其他压缩算法。其平均码长为1.7651bits,低于8方向Freeman链码或者Freeman差分链码的3bits的平均码长。 相似文献
11.
《Pattern recognition》2014,47(2):769-788
A new chain code to represent 3D discrete curves is proposed. The method is based on a search for relative changes in the 3D Euclidean space, composed of three main vectors: a reference vector, a support vector, and a change direction vector, utilized to obtain a directed simple path in a grid of 26 connected components. A set of rotation transformations is defined in the 3D Euclidean space, and an alphabet of only 25 symbols is required to represent any face, edge or vertex-connected discrete curve. Important properties of this code are found: independence under translation, rotation and mirror transformations, as well as high compression levels. A set of 3D curve-skeletons and digital elevation model data to study the terrain were utilized to prove the proposed code. Compared with the state-of-the-art, our method has more advantages: at first, it represents voxelized paths independently of vicinity, also it gives better representation for the tested objects and detects better the redundant parts. This fact is shown in the entropy calculated for 3D curve-skeletons: our method gives 3.03 bits/symbol, whereas the state-of-the-art method gives 4.35 bits/symbol. On the other hand, our proposed chain code uses 23% less memory than the well known Freeman code of 26 directions. In case of digital elevation models, our method improves memory for 36.1% regarding Freeman code and 10.7% regarding the well known relative code called orthogonal direction change chain code. Finally, average length of the chain code proposed is 14% shorter than the relative code of the state-of-the-art. 相似文献
12.
基于同步变长码(SVLC)的构造原理,先根据码长的不同将码表分成不同的码组,再根据前n位的不同将码组细分为不同的子码组,然后给出了一种计算SVLC子码组的码长分布的迭代算法。基于码表中码字首先按码长从小到大排列,码长相同时按码字对应的二进制值从小到大排列的准则,并利用码组和子码组的码长分布,给出了一种SVLC的码字和序号互换的算法。 相似文献
13.
在引入RS码编译码原理的基础上,通过对二维条码PDF417码和四一七国家条码规范的分析和研究,将RS码技术应用到PDF417码纠错码的编码、译码算法过程中,完成了PDF417纠错的实现,同时给出了在GF(929)域中计算3的幂值的方法,解决了中间结果过大导致数据溢出的问题。为PDF417码的纠错码提供了一个完整的解决方案。 相似文献
14.
15.
一种新型抗干扰32位串行编码及其实现 总被引:4,自引:2,他引:2
针对航空系统电磁干扰严重,普通串行信号不能满足可靠性传输要求,详细介绍了某航空系统采用的32位串行码,此编码抗干扰性强,可靠性高;并基于单片机设计了该编码的发送、接收电路,用来实现32位串行码与普通串行码之间的相互转换;实践证明该系统运行稳定,可靠. 相似文献
16.
利用有限域包含的循环群之间的映射,给出了特征为素数p,MOV次数为3的超奇异椭圆曲线上的一类Tate对的两种有效压缩方法,它们分别将Tate对的值从6logp比特长的串压缩到3logp和2logp比特长.两种压缩方法的实现均使用原有Tate对的优化算法的代码,不需要针对压缩对编写新的实现代码,而且两种压缩对的实现均保持原有Tate对的实现速度. 相似文献
17.
以DVB-S协议标准中物理层级联码作为研究对象,建立了由RS码、卷积码和卷积器交织器构成的典型级联码的通信模型,深入分析了级联码的体系结构,并在编码体制上找到了DVB-S协议标准中级联码存在的弱点,设计了一种基于交织的错误图样,给出了设计思路和具体设计方法,仿真研究了错误符号中含有不同错误比特数的错误图样对级联码译码性能的影响,并与突发错误图样进行了对比。仿真结果表明,基于交织的错误图样对级联码的译码性能影响要大于突发错误。 相似文献
18.
19.
20.
Test patterns are usually transferred from the tester to the circuit under test in a compressed form as it minimizes test access mechanism bandwidth and transfer time. It was found that nonlinear binary codes could be used for encoding test patterns in a similar way as it is done using linear codes, and the compression efficiency may be higher. The key important characteristic of the nonlinear codes is that the maximum number of codeword bits may be higher than it is obtained for the linear code words while the number of individually specified bits is preserved. It causes better encoding parameters that can be found for the transformation of code words into a test pattern that can feed a circuit under test with a higher number of parallel scan chains. The decompressors placed on a circuit under test transform nonlinear binary code words into test patterns with the help of nonlinear combinational or sequential circuits. In this paper, we propose a relatively fast heuristics that can be used for finding the decompressor nonlinear function truth tables guaranteeing a required number of specified bits within a test pattern. We quantify the benefits and costs of such nonlinear decompressors and verify the benchmark circuit test pattern encoding efficiency. 相似文献