Efficient algorithms for coding Hilbert curve of arbitrary-sized image and application to window query

DOI10.1016/j.ins.2006.12.003zbMath1111.94001OpenAlexW2029966641MaRDI QIDQ881860

N. E. Zubov

Publication date: 18 May 2007

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2006.12.003

zbMATH Keywords

compressionimage representationHilbert curvemaximal quadtree blockquadrantsnake scan-based approachwindow query

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items

On computational algorithms for real-valued continuous functions of several variables

Cites Work

• Analysis of the Hilbert curve for representing two-dimensional space
• Chaotic spread spectrum watermark of optimal space-filling curves
• An optimal algorithm for decomposing a window into maximal quadtree blocks
• Decomposing a window into maximal quadtree blocks
• Space-filling curves
• Space-filling curves and their use in the design of geometric data structures
• Four alternative patterns of the Hilbert curve.
• Efficient region segmentation on compressed gray images using quadtree and shading representation
• One-dimensional B-B polynomial and Hilbert scan for graylevel image coding
• Space-filling approach for fast window query on compressed images
• Unnamed Item
• Unnamed Item
• Unnamed Item