Block image retrieval based on a compressed linear quadtree-Reference-Cited by-同舟云学术

Block image retrieval based on a compressed linear quadtree

Published:2004-05 Issue:5 Volume:22 Page:391-397
ISSN:0262-8856
Container-title:Image and Vision Computing
language:en
Short-container-title:Image and Vision Computing

Author:

Chan Yung-Kuan

Publisher

Elsevier BV

Subject

Computer Vision and Pattern Recognition,Signal Processing

Reference11 articles.

1. Y.K. Chan, C.C. Chang, An efficient data structure for storing similar binary images, in: Proceedings of the Fifth International Conference on Foundations of Data Organization (FODO'98), Kobe, Japan, November 1998, pp. 268–275.

2. H.K.C. Chang, P.M. Chen, L.L. Cheng, Overlapping representation of similar images using linear quadtrees codes, in: Proceedings of the Eighth IPPR Conference on Computer Vision, Graphics and Image Processing, Tao-Yuang, Taiwan, ROC, August 1995, pp. 122–129.

3. The space efficiency of quadtrees;Dyer;Computing Graphics Image Process,1982

4. An effective way to represent quadtrees;Gargantini;Communications of ACM,1982

5. Set operations on constant bit-length linear quadtrees;Lin;Pattern Recognition,1997

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Removing Coding and Inter Pixel Redundancy in Image Compression;ICST Transactions on Scalable Information Systems;2024-02-08

2. Map algebra on raster datasets represented by compact data structures;Software: Practice and Experience;2023-02-22

3. Compact and indexed representation for LiDAR point clouds;Geo-spatial Information Science;2022-11-11

4. Scalable and queryable compressed storage structure for raster data;Information Systems;2017-12

5. RUBIK;Proceedings of the 27th International Conference on Scientific and Statistical Database Management;2015-06-29