One-dimensional B-B polynomial and Hilbert scan for graylevel image coding

DOI10.1016/J.PATCOG.2003.09.001zbMath1067.68777OpenAlexW2010212730MaRDI QIDQ1886658

Sambhunath Biswas

Publication date: 18 November 2004

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2003.09.001

zbMATH Keywords

ApproximationHuffman codingCompressionBezier-Bernstein polynomialHilbert scanRaster scan

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Binary contour coding using Bézier approximation
• A Locally Adaptive Peano Scanning Algorithm
• Unnamed Item

This page was built for publication: One-dimensional B-B polynomial and Hilbert scan for graylevel image coding