基于四叉树的图像表示中连通分量的维护

Proceedings International Conference on Information Technology: Coding and Computing Pub Date : 2001-04-02 DOI:10.1109/ITCC.2001.918870

V. Khanna, Phalguni Gupta, C. Hwang

{"title":"基于四叉树的图像表示中连通分量的维护","authors":"V. Khanna, Phalguni Gupta, C. Hwang","doi":"10.1109/ITCC.2001.918870","DOIUrl":null,"url":null,"abstract":"In this paper, we have considered the problem of maintaining connected components in quadtree representation of binary images when a small portion of the image undergoes change. The batch approach to re-compute the connected components information is very expensive. Our algorithms update the quadtree as well as the connected components' labeling when a homogeneous region in the quadtree is changing. The updating algorithms visit less nodes compared to the batch approach.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Maintenance of connected components in quadtree-based image representation\",\"authors\":\"V. Khanna, Phalguni Gupta, C. Hwang\",\"doi\":\"10.1109/ITCC.2001.918870\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we have considered the problem of maintaining connected components in quadtree representation of binary images when a small portion of the image undergoes change. The batch approach to re-compute the connected components information is very expensive. Our algorithms update the quadtree as well as the connected components' labeling when a homogeneous region in the quadtree is changing. The updating algorithms visit less nodes compared to the batch approach.\",\"PeriodicalId\":318295,\"journal\":{\"name\":\"Proceedings International Conference on Information Technology: Coding and Computing\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-04-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings International Conference on Information Technology: Coding and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITCC.2001.918870\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings International Conference on Information Technology: Coding and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITCC.2001.918870","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

在本文中，我们考虑了当图像的一小部分发生变化时，二叉树表示中保持连通分量的问题。重新计算连接组件信息的批处理方法非常昂贵。当四叉树中的齐次区域发生变化时，我们的算法会更新四叉树以及连接组件的标记。与批处理方法相比，更新算法访问的节点更少。

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

查看原文本刊更多论文

Maintenance of connected components in quadtree-based image representation

In this paper, we have considered the problem of maintaining connected components in quadtree representation of binary images when a small portion of the image undergoes change. The batch approach to re-compute the connected components information is very expensive. Our algorithms update the quadtree as well as the connected components' labeling when a homogeneous region in the quadtree is changing. The updating algorithms visit less nodes compared to the batch approach.

求助全文

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

来源期刊

Proceedings International Conference on Information Technology: Coding and Computing

自引率

0.00%

发文量