差分链编码线图中的相对矢量概率

Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Pub Date : 1989-06-01 DOI:10.1109/PACRIM.1989.48324

R. Prasad, J. W. Vieveen, J. H. Bons, J. Arnbak

{"title":"差分链编码线图中的相对矢量概率","authors":"R. Prasad, J. W. Vieveen, J. H. Bons, J. Arnbak","doi":"10.1109/PACRIM.1989.48324","DOIUrl":null,"url":null,"abstract":"A derivation is given of the probabilities of the relative vectors which represent the approximating segments in a square coding ring for differential chain coding (DCC) of line drawings. These probabilities are required to calculate rate (coding efficiency) and distortion-versus-rate characteristics. The performances of the differential and nondifferential chain codes are compared. It is established that DCC has higher efficiency.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"111 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"30","resultStr":"{\"title\":\"Relative vector probabilities in differential chain-coded line-drawings\",\"authors\":\"R. Prasad, J. W. Vieveen, J. H. Bons, J. Arnbak\",\"doi\":\"10.1109/PACRIM.1989.48324\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A derivation is given of the probabilities of the relative vectors which represent the approximating segments in a square coding ring for differential chain coding (DCC) of line drawings. These probabilities are required to calculate rate (coding efficiency) and distortion-versus-rate characteristics. The performances of the differential and nondifferential chain codes are compared. It is established that DCC has higher efficiency.<<ETX>>\",\"PeriodicalId\":256287,\"journal\":{\"name\":\"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing\",\"volume\":\"111 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"30\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PACRIM.1989.48324\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.1989.48324","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 30

摘要

给出了线图差分链编码(DCC)的方形编码环中表示近似段的相对向量的概率的推导。这些概率是计算速率(编码效率)和失真与速率特性所必需的。比较了微分链码和非微分链码的性能。结果表明，DCC具有较高的效率。

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

查看原文本刊更多论文

Relative vector probabilities in differential chain-coded line-drawings

A derivation is given of the probabilities of the relative vectors which represent the approximating segments in a square coding ring for differential chain coding (DCC) of line drawings. These probabilities are required to calculate rate (coding efficiency) and distortion-versus-rate characteristics. The performances of the differential and nondifferential chain codes are compared. It is established that DCC has higher efficiency.<>

求助全文

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

来源期刊

Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing

自引率

0.00%

发文量