首页 | 本学科首页   官方微博 | 高级检索  
     

压缩链码的研究
引用本文:刘勇奎,魏巍,郭禾.压缩链码的研究[J].计算机学报,2007,30(2):281-287.
作者姓名:刘勇奎  魏巍  郭禾
作者单位:1. 大连民族学院计算机科学与工程学院,大连,116600
2. 大连理工大学计算机科学与工程系,大连,116024
摘    要:对图像处理及模式识别中的链码技术进行研究.首先针对具有二位码长的顶点链码只有3个码值的情况,在不增加码长的情况下对其增加了一个码值,大大提高了其表达能力.其次,同样根据顶点链码的上述冗余情况对其进行了不等长编码压缩.然后,在上述两种改进链码的基础上,根据大量的统计数据提出了一种基于Huffman编码的新的压缩链码.文中还提出了一种对链码的评价方法.最后,用该评价方法和对实际图像的实验测试对所提出的链码和4种已有链码进行了理论上和实用方面的比较.比较的结果显示该文提出的压缩链码效率最高.

关 键 词:链码  哈夫曼编码  图像表示  边界  压缩  压缩链码  研究  Chain  Code  效率最高  显示  结果  比较  理论  实验测试  实际图像  评价方法  编码压缩  Huffman  统计数据  改进  不等长  冗余  表达能力  情况  码值
修稿时间:2005-12-212006-08-27

Research on Compressed Chain Code
LIU Yong-Kui,WEI Wei,GUO He.Research on Compressed Chain Code[J].Chinese Journal of Computers,2007,30(2):281-287.
Authors:LIU Yong-Kui  WEI Wei  GUO He
Affiliation:1.College of Computer Science and Engineering, Dalian Nationalities University, Dalian 116600; 2. Department of Computer Science and Engineering, Dalian University of Technology, Dalian 116024
Abstract:This paper introduces the research works on chain code used in Image Processing and Pattern Recognition. Firstly, considering that the vertex chain code uses 2 bits to represent only 3 kinds of elements, a new kind of elements is introduced without increasing the average bits per code. The efficiency is raised greatly. On the same observation, an unequal-length coding of the vertex chain code is presented. Based on this, a new compressed chain code coded by Huffman method is proposed by collecting mass of statistic data. Furthermore, a method for quantitatively evaluating chain codes is devised. Finally the proposed chain codes are compared, theoretically with the evaluating method and practically, with the existing four ones. The result of the comparison shows that the new compressed chain code is most efficient.
Keywords:chain code  Huffman code  image representation  contour  compression
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号