{"title":"变线性四叉树的码变换","authors":"Pei-Min Chen","doi":"10.1109/ICOSP.1998.770325","DOIUrl":null,"url":null,"abstract":"Depth-first (DF) and breath-first (BF) linear quadtree representations have the advantages in the performance of image operations and the storage requirements respectively. In this paper, the general guidelines and algorithms for code transformation between BF and DF linear quadtrees are proposed. Thus, we can exploit the advantages of DF and BF representations without suffering their drawbacks. Here, one typical DF linear quadtree scheme (Gargantini, 1982), and two BF linear quadtree schemes with different styles, FBLQ (Chang et al., 1994) with variant length and CBLQ (Lin), with constant length, are selected to depict the guidelines and algorithms. Each algorithm has time complexity O(l), where l is the length of the transformed code. This complexity is much less than that of the BF or DF encoding process for the corresponding image, which is at least of the same order as the number of pixels in this image.","PeriodicalId":145700,"journal":{"name":"ICSP '98. 1998 Fourth International Conference on Signal Processing (Cat. No.98TH8344)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Code transformations for variant linear quadtrees\",\"authors\":\"Pei-Min Chen\",\"doi\":\"10.1109/ICOSP.1998.770325\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Depth-first (DF) and breath-first (BF) linear quadtree representations have the advantages in the performance of image operations and the storage requirements respectively. In this paper, the general guidelines and algorithms for code transformation between BF and DF linear quadtrees are proposed. Thus, we can exploit the advantages of DF and BF representations without suffering their drawbacks. Here, one typical DF linear quadtree scheme (Gargantini, 1982), and two BF linear quadtree schemes with different styles, FBLQ (Chang et al., 1994) with variant length and CBLQ (Lin), with constant length, are selected to depict the guidelines and algorithms. Each algorithm has time complexity O(l), where l is the length of the transformed code. This complexity is much less than that of the BF or DF encoding process for the corresponding image, which is at least of the same order as the number of pixels in this image.\",\"PeriodicalId\":145700,\"journal\":{\"name\":\"ICSP '98. 1998 Fourth International Conference on Signal Processing (Cat. No.98TH8344)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-10-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ICSP '98. 1998 Fourth International Conference on Signal Processing (Cat. No.98TH8344)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOSP.1998.770325\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICSP '98. 1998 Fourth International Conference on Signal Processing (Cat. No.98TH8344)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOSP.1998.770325","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
深度优先(DF)和呼吸优先(BF)线性四叉树表示分别在图像操作性能和存储要求方面具有优势。本文提出了BF和DF线性四叉树之间代码转换的一般准则和算法。因此,我们可以利用DF和BF表示的优点,而不会遭受它们的缺点。本文选择一种典型的DF线性四叉树方案(Gargantini, 1982)和两种不同风格的BF线性四叉树方案,变长度的FBLQ (Chang et al., 1994)和定长度的CBLQ (Lin)来描述准则和算法。每种算法的时间复杂度为O(l),其中l为转换后的代码长度。这种复杂度远低于对应图像的BF或DF编码过程,其复杂度至少与该图像中的像素数相同。
Depth-first (DF) and breath-first (BF) linear quadtree representations have the advantages in the performance of image operations and the storage requirements respectively. In this paper, the general guidelines and algorithms for code transformation between BF and DF linear quadtrees are proposed. Thus, we can exploit the advantages of DF and BF representations without suffering their drawbacks. Here, one typical DF linear quadtree scheme (Gargantini, 1982), and two BF linear quadtree schemes with different styles, FBLQ (Chang et al., 1994) with variant length and CBLQ (Lin), with constant length, are selected to depict the guidelines and algorithms. Each algorithm has time complexity O(l), where l is the length of the transformed code. This complexity is much less than that of the BF or DF encoding process for the corresponding image, which is at least of the same order as the number of pixels in this image.