三角形网格的链码方法研究

doi:10.13209/j.0479-8023.2019.116

北京大学学报自然科学版 ›› 2019, Vol. 55 ›› Issue (6): 1014-1020.DOI: 10.13209/j.0479-8023.2019.116

三角形网格的链码方法研究

魏小峰^1,2,†, 耿则勋³, 濮国梁¹, 王德永³

1. 北京大学工学院, 北京 100871 2. 96633 部队, 北京 100096 3. 平顶山学院, 平顶山 467000

收稿日期:2018-11-20 修回日期:2018-12-22 出版日期:2019-11-20 发布日期:2019-11-20
通讯作者: 魏小峰, E-mail: weixiaofeng(at)pku.edu.cn
基金资助:
国家重点研发计划(2017YFB0503700, 2018YFB0505300)、高分辨率对地观测系统重大专项(11-Y20A02-9001-16/17, 30-Y20A01-9003-16/17)和国防科技创新特区项目(17-H863-01-ZT-005-015-02, 17-H863-01-ZT-005-022-01)资助

Study on Chain Code Methods for Triangular Grids

WEI Xiaofeng^1,2,†, GENG Zexun³, PU Guoliang¹, WANG Deyong³

1. College of Engineering, Peking University, Beijing 100871 2. Troop 96633, Beijing 100096 3. Pingdingshan University, Pingdingshan 467000

Received:2018-11-20 Revised:2018-12-22 Online:2019-11-20 Published:2019-11-20
Contact: WEI Xiaofeng, E-mail: weixiaofeng(at)pku.edu.cn

摘要/Abstract

摘要：

目前可以应用于三角形网格的链码方法只有顶点链, 而它对角相邻情况的表达存在缺陷, 针对此问题, 提出3种链码方法, 并进行特性分析和性能比较。首先将Freeman链码扩展应用到三角形网格, 根据两种不同的三角形单元, 分别设计对应的12方向Freeman链码编码规则; 然后, 基于外轮廓前进相对方向的变化, 提出相对方向链码; 最后, 通过区分边界网格在外轮廓上的边数和内部网格数的不同组合, 得到边角组合链码。通过实验比较3种链码的表达能力和压缩率, 结果表明, 3 种链码方法均能克服顶点链的缺陷, 准确完备地实现三角形网格形状的边界表达。其中, 边角组合链码的综合性能最高, 平均码数为1, 压缩率可达0.75。

关键词: 三角形网格, Freeman 链码, 边角组合链码, 压缩率

Abstract:

Only vertex chain code can be applied to triangular grids, but it has defect in angle adjacent expression. Aimed at the problem of object border representation in triangular grid, three novel chain codes were proposed and compared in character and performance. Firstly, Freeman chain code was extended to triangular grids. For two different triangular elements, the corresponding 12-direction Freeman chain code encoding rules were designed respectively. Secondly, based on the relative direction changes of the contour, the relative direction chain code was proposed. Finally, the edge chain code could be obtained by differentiating the combinations of edges number and internal grids number of the boundary grids. The geometric properties, expressive abilities and compression ratios of three novel chain codes were compared and analyzed. Experiments show that the proposed methods can accurately and completely realize the shape boundary expression of triangular grids. Among them, edge chain owns the best performance, the average code number per grid is 1, and compression ratio can reach 0.75.

Key words: triangular grid, Freeman chain code, edge angle chain code, compression ratio

魏小峰, 耿则勋, 濮国梁, 王德永. 三角形网格的链码方法研究[J]. 北京大学学报自然科学版, 2019, 55(6): 1014-1020.

WEI Xiaofeng, GENG Zexun, PU Guoliang, WANG Deyong. Study on Chain Code Methods for Triangular Grids[J]. Acta Scientiarum Naturalium Universitatis Pekinensis, 2019, 55(6): 1014-1020.

导出引用管理器 EndNote|Ris|BibTeX

链接本文: https://xbna.pku.edu.cn/CN/10.13209/j.0479-8023.2019.116

https://xbna.pku.edu.cn/CN/Y2019/V55/I6/1014

三角形网格的链码方法研究

Study on Chain Code Methods for Triangular Grids

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 0

编辑推荐

Metrics

留言