{"title":"关于平移的标准化四叉树","authors":"Ming Li, William I Grosky, Ramesh Jain","doi":"10.1016/0146-664X(82)90074-0","DOIUrl":null,"url":null,"abstract":"<div><p>Quadtrees offer a compact and hierarchical representation of an image. However, the location of an image segment on the coordinate grid and the grid size itself affect the quadtree representation, making comparison of image segments difficult. To alleviate this difficulty, we propose the concept of a normalized quadtree to represent a given image segment in a unique and optimal way over the class of all translations. An <em>O</em>(<em>s</em><sup>2</sup>log<sub>2</sub><em>s</em>) algorithm is presented for obtaining normalized quadtrees, where <em>s</em> is the length of the grid.</p></div>","PeriodicalId":100313,"journal":{"name":"Computer Graphics and Image Processing","volume":"20 1","pages":"Pages 72-81"},"PeriodicalIF":0.0000,"publicationDate":"1982-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0146-664X(82)90074-0","citationCount":"0","resultStr":"{\"title\":\"Normalized quadtrees with respect to translations\",\"authors\":\"Ming Li, William I Grosky, Ramesh Jain\",\"doi\":\"10.1016/0146-664X(82)90074-0\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Quadtrees offer a compact and hierarchical representation of an image. However, the location of an image segment on the coordinate grid and the grid size itself affect the quadtree representation, making comparison of image segments difficult. To alleviate this difficulty, we propose the concept of a normalized quadtree to represent a given image segment in a unique and optimal way over the class of all translations. An <em>O</em>(<em>s</em><sup>2</sup>log<sub>2</sub><em>s</em>) algorithm is presented for obtaining normalized quadtrees, where <em>s</em> is the length of the grid.</p></div>\",\"PeriodicalId\":100313,\"journal\":{\"name\":\"Computer Graphics and Image Processing\",\"volume\":\"20 1\",\"pages\":\"Pages 72-81\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1982-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/0146-664X(82)90074-0\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Graphics and Image Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/0146664X82900740\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Graphics and Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0146664X82900740","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Quadtrees offer a compact and hierarchical representation of an image. However, the location of an image segment on the coordinate grid and the grid size itself affect the quadtree representation, making comparison of image segments difficult. To alleviate this difficulty, we propose the concept of a normalized quadtree to represent a given image segment in a unique and optimal way over the class of all translations. An O(s2log2s) algorithm is presented for obtaining normalized quadtrees, where s is the length of the grid.