Chain Code Methods for Hexagonal Grids

WEI Xiaofeng; MIAO Shuangxi; PU Guoliang; CHEN Bo; CHENG Chengqi

doi:10.13203/j.whugis20180018

Volume 44 Issue 11

Nov. 2019

Turn off MathJax

Article Contents

Abstract

References

Geomatics and Information Science of Wuhan University > 2019 > 44(11): 1700-1707. > DOI: 10.13203/j.whugis20180018

WEI Xiaofeng, MIAO Shuangxi, PU Guoliang, CHEN Bo, CHENG Chengqi. Chain Code Methods for Hexagonal Grids[J]. Geomatics and Information Science of Wuhan University, 2019, 44(11): 1700-1707. DOI: 10.13203/j.whugis20180018

Citation:

PDF (2530 KB)

Chain Code Methods for Hexagonal Grids

1.
College of Engineering, Peking University, Beijing 100871, China
2.
Troops 96633, Beijing 100096, China

Funds:

The National Key Research and Development Program of China 2017YFB0503700

The National Key Research and Development Program of China 2018YFB0505300

High Resolution Earth Observation System Major Projects 11-Y20A02-9001-16/17

High Resolution Earth Observation System Major Projects 30-Y20A01-9003-16/17

National Defense Science and Technology Innovation Zone 17-H863-01-ZT-005-015-02

National Defense Science and Technology Innovation Zone 17-H863-01-ZT-005-022-01

More Information

Author Bio:
WEI Xiaofeng, PhD, specializes in geographic information subdivision and expression. E-mail:wxf198861@163.com
Received Date: May 16, 2018
Published Date: November 04, 2019

Graphical Abstract

Abstract

Abstract

Only vertex chain code can be used directly to express hexagonal grid boundary. The classical chain codes for quadrilateral grids are modified and extended to apply to hexagonal grids, and a new chain code is proposed. Among them, 6-direction chain code (F6) encodes the 6 absolute directions of the adjacent boundary grid. Left right 2-direction chain code (2LR) records the two deflections along the contour move direction to realize the expression of boundary. Monotonicity identify chain code (MICC) marks the changes of monotonicity along the grid boundary by distinguish code. Edge chain code (ECC) records the edge numbers in the outer contour of each boundary grid as its code value. Moreover, the geometric properties, the expression efficiencies and the compression performances of the four chain code methods are compared and analyzed comprehensively. Experimental results show that four methods can effectively express the shape boundary in hexagonal grids, where ECC and F6 have the highest expression efficiency, the average code number per grid is about 1; 2LR and ECC have the best compression performance, compared with F6, the compression rate of which can reach 67%.
- chain code,
- hexagonal grid,
- edge chain code,
- geometric property,
- compression ratio

FullText(HTML)

References (17)

References

[1]	Jain J, Sahoo S K, Prasanna M, et al. Modified Chain Code Histogram Feature for Handwritten Character Recognition[J]. Lecture Notes of the Institute for Computer Sciences, 2012, 84(1): 611-619 http://cn.bing.com/academic/profile?id=8d425c0b3c55cf57e2f0807cadee5550&encoded=0&v=paper_preview&mkt=zh-cn
[2]	Rachmawati E, Supriana I, Khodra M L. Bag-of-Shapes Descriptor Using Shape Association Based on Freeman Chain Code[J]. Journal of Theoretical and Applied Information Technology, 2017, 95(5): 1 142-1 153
[3]	Lee D, Kim S J. Modified Chain-Code-Based Object Recognition[J]. Electronics Letters, 2015, 51(24): 1 996-1 997 doi: 10.1049/el.2015.1019
[4]	赵丽科, 宋伟东, 王竞雪. Freeman链码优先级直线提取算法研究[J].武汉大学学报·信息科学版, 2014, 39(1): 42-46 http://ch.whu.edu.cn/CN/abstract/abstract2861.shtml Zhao Like, Song Weidong, Wang Jingxue. Straight Line Extraction Algorithm of Freeman Chain Code Priority[J]. Geomatics and Information Science of Wuhan University, 2014, 39(1): 42-46 http://ch.whu.edu.cn/CN/abstract/abstract2861.shtml
[5]	Madenda S, Wibowo E P. Object Feature Extraction of Songket Image Using Chain Code Algorithm[J]. International Journal on Advanced Science, Engineering and Information Technology, 2017, 7(1): 235-241 doi: 10.18517/ijaseit.7.1.1479
[6]	Tawfiq A, Asadi A, Fanar A J. Removing Spatial Redundancy from Image by Using Variable Vertex Chain Code[J]. European Academic Research, 2014, 2(1): 179-192 http://cn.bing.com/academic/profile?id=77737ebb89feadd28c33de0e991c9a89&encoded=0&v=paper_preview&mkt=zh-cn
[7]	Ren M, Karimi H A. A Chain-Code-Based Map Matching Algorithm for Wheelchair Navigation[J]. Transactions in GIS, 2009, 13(2): 197-214 doi: 10.1111/j.1467-9671.2009.01147.x
[8]	Freeman H. On the Encoding of Arbitrary Geometric Configurations[J]. IRE Transactions on Electronic Computers, 1961, 10(2): 260-268 http://cn.bing.com/academic/profile?id=ee17481ccaad5fce073e7b0e764aa9d9&encoded=0&v=paper_preview&mkt=zh-cn
[9]	Bribiesca E. A New Chain Code[J]. Pattern Recognition, 1999, 32(27): 235-251 http://d.old.wanfangdata.com.cn/OAPaper/oai_pubmedcentral.nih.gov_2203320
[10]	Cruz S H, Dagnino R M R. Compressing Bi-level Images by Means of a 3-bit Chain Code[J]. SPIE Optical Eng, 2005, 44(9): 1-8 http://cn.bing.com/academic/profile?id=81f430ebc955be27e4adbae0021e9fcd&encoded=0&v=paper_preview&mkt=zh-cn
[11]	Sánchez-Cruz H, Bribiesca E, Rodríguez-Dagnino R M. Efficiency of Chain Codes to Represent Binary Objects[J].Pattern Recognition, 2007, 40(6): 1 660-1 674 doi: 10.1016/j.patcog.2006.10.013
[12]	Žalik B, Domen M, Liu Y K, et al. Unsigned Manhattan Chain Code[J]. Journal of Visual Communication and Image Representation, 2016, 38: 186-194 doi: 10.1016/j.jvcir.2016.03.001
[13]	Machand-Maillet S, Sharaiha Y M. Binary Digital Image Processing:A Discrete Approach[M]. Netherlands: Academic Press, 1999
[14]	Sdnchez-Cruz H, Bribiesca E, Rodriguez M A. Efficiency of Chain Codes to Represent Binary Objects[J]. Pattern Recognition, 2007, 40(6): 1 660-1 674 doi: 10.1016/j.patcog.2006.10.013
[15]	Liu Y K, Zalik B. An Efficient Chain Code with Huffman Coding[J]. Pattern Recognition, 2005, 38(4): 553-557 doi: 10.1016/j.patcog.2004.08.017
[16]	Sánchez-Cruz H. Proposing a New Code by Considering Pieces of Discrete Straight Lines in Contour Shapes[J]. Journal of Visual Communication and Image Representation, 2010, 21(4): 311-324 doi: 10.1016/j.jvcir.2010.02.002
[17]	于国防, 王莉.压缩型顶点链码的研究[J].中国图象图形学报, 2010, 15(10):1 465-1 470 http://d.old.wanfangdata.com.cn/Periodical/zgtxtxxb-a201010007 Yu Guofang, Wang Li. Research on Compression-type Vertex Chain Code[J]. Journal of Image and Graphics, 2010, 15(10):1 465-1 470 http://d.old.wanfangdata.com.cn/Periodical/zgtxtxxb-a201010007

Cited By

Get Citation

PDF

XML

Article views PDF downloads

Chain Code Methods for Hexagonal Grids

Abstract

References

Catalog

Related

Chain Code Methods for Hexagonal Grids

Abstract

References

Catalog

Related

Export File

Citation

Format

Content