Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1995 · 27 citations · 0 references
ArtsComputer ScienceAlgorithmsDigital ImagingGeometryData CompressionDigital Image ProcessingDigital Signal ProcessingFractal GeometryImage CompressionImage ProcessingCodingEuclidean DomainsFractal Compression AlgorithmsFractal Image Compression
Fractal coding of digital images offers many promising qualities. However the coding process suffers from the long search time of the domain block pool. We offer a new approach to speed up the search, based on an efficient solution of the following problem. Given a sphere and a collection of lines going through the origin in Euclidean space, enumerate those lines which intersect the sphere. Experimental results show that the algorithm speeds up the coding process by up to 50 times.