作者: Martin J. Turner
DOI: 10.1533/9780857099594.149
关键词:
摘要: Abstract This paper gives a brief overview of fractal compression techniques using quadtree decomposition based partitioned iterated function system, and applying it as texture mapping process. To aid understanding the process some visualisation are presented, both 2-D 3-D, well briefly considering performance quality measures. A description is given that maps images onto surfaces 3-D shapes, implementation prototype. Properties presented can be exploited within These include; speed creation, self-similarity common textures, stability algorithm unknown initial conditions, resolution independence infinite enhancement . Failings found in prototype system involve temporal nature image addition noise. Also, transformations have probabilistic distorting effect on decompression algorithm. technique valid operation if you accept certain assumptions; nature, or at least part used maps, fractal, ‘good’ version found. In these conditions likely to faster, take up less memory storage more pleasing human user.