Inplace 2D matching in compressed images

DOI10.1016/S0196-6774(03)00088-9MaRDI QIDQ4458867zbMATH OpenFDO

Authors Amihood Amir, Gad M. Landau, Dina Sokol

Publication date 14 March 2004

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0196-6774(03)00088-9

zbMATH Keywords

Lempel-Ziv compressed images

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computing methodologies for image processing (68U10)

Recommendations

• scientific article; zbMATH DE number 2079423
• Inplace run-length 2d compressed search.
• Small-Space 2D Compressed Dictionary Matching
• Publication:4952705
• Optimal two-dimensional compressed matching

Cited in

(13)

• Inplace run-length 2d compressed search.
• On the complexity of pattern matching for highly compressed two-dimensional texts.
• Succinct 2D dictionary matching
• Multivariate image similarity in the compressed domain using statistical graph matching
• Space-filling approach for fast window query on compressed images
• Indexing and querying color sets of images
• COMPRESSED PATTERN MATCHING IN JPEG IMAGES
• Context-dependent multilevel pattern matching for lossless image compression
• Optimal Two-Dimensional Compressed Matching
• scientific article; zbMATH DE number 2079423 (Why is no real title available?)
• Optimal two-dimensional compressed matching
• scientific article; zbMATH DE number 1445382 (Why is no real title available?)
• Optimal bounds for distinct quartics

This page was built for publication: Inplace 2D matching in compressed images

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4458867)