一个有效的扩展链码的外部图像表示

2006 IFIP International Conference on Wireless and Optical Communications Networks Pub Date : 2006-08-07 DOI:10.1109/WOCN.2006.1666674

K. Nallaperumal, J. Varghese, S. Saudia, J. J. Ranjani, K. Velu, S. Kannan

{"title":"一个有效的扩展链码的外部图像表示","authors":"K. Nallaperumal, J. Varghese, S. Saudia, J. J. Ranjani, K. Velu, S. Kannan","doi":"10.1109/WOCN.2006.1666674","DOIUrl":null,"url":null,"abstract":"A novel contour representation algorithm for binary images which is an extension of the conventional chain code is proposed in this paper. The algorithm exploits the features of the conventional chain code when advantageous, is precise and simple with lesser computational complexity than most of the other standard shape representation algorithms. It uses very low bit-rate compared to the conventional chain code and is more robust to noise. The corresponding reconstruction algorithm is completely reversible to give the lossless reconstruction of the contour. Experimental results on various binary images add to the improved efficiency claim of the proposed contour representation algorithm in terms of visual fidelity and bit-rate","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"An efficient extension to chain codes for external image representation\",\"authors\":\"K. Nallaperumal, J. Varghese, S. Saudia, J. J. Ranjani, K. Velu, S. Kannan\",\"doi\":\"10.1109/WOCN.2006.1666674\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A novel contour representation algorithm for binary images which is an extension of the conventional chain code is proposed in this paper. The algorithm exploits the features of the conventional chain code when advantageous, is precise and simple with lesser computational complexity than most of the other standard shape representation algorithms. It uses very low bit-rate compared to the conventional chain code and is more robust to noise. The corresponding reconstruction algorithm is completely reversible to give the lossless reconstruction of the contour. Experimental results on various binary images add to the improved efficiency claim of the proposed contour representation algorithm in terms of visual fidelity and bit-rate\",\"PeriodicalId\":275012,\"journal\":{\"name\":\"2006 IFIP International Conference on Wireless and Optical Communications Networks\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IFIP International Conference on Wireless and Optical Communications Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WOCN.2006.1666674\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IFIP International Conference on Wireless and Optical Communications Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WOCN.2006.1666674","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

本文提出了一种新的二值图像轮廓表示算法，它是传统链码的扩展。该算法充分利用了传统链码的优点，与大多数其他标准形状表示算法相比，具有精确、简单、计算量小的优点。与传统的链码相比，它使用非常低的比特率，并且对噪声具有更强的鲁棒性。相应的重构算法是完全可逆的，可以给出轮廓的无损重构。在各种二值图像上的实验结果证实了所提出的轮廓表示算法在视觉保真度和比特率方面的有效性

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An efficient extension to chain codes for external image representation

A novel contour representation algorithm for binary images which is an extension of the conventional chain code is proposed in this paper. The algorithm exploits the features of the conventional chain code when advantageous, is precise and simple with lesser computational complexity than most of the other standard shape representation algorithms. It uses very low bit-rate compared to the conventional chain code and is more robust to noise. The corresponding reconstruction algorithm is completely reversible to give the lossless reconstruction of the contour. Experimental results on various binary images add to the improved efficiency claim of the proposed contour representation algorithm in terms of visual fidelity and bit-rate

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2006 IFIP International Conference on Wireless and Optical Communications Networks

自引率

0.00%

发文量