Fractal based image coding has been shown to work well. The main reason is the ability to capture much significant information while discarding most of the redundancy. Therefore, a similar theoretical apparatus can be used to design a system that extracts information suitable for content based image indexing. After introducing the basics of partitioned iterated function systems as used in image processing, the structure of a fractal based image indexing system is described by showing how it evolved and developed over time, going from the image coding-compression stage through a histogram based approach (first and fire) to a more sophisticated and complex system (fine) that includes Peano-serialized spatial addressing, a linearized image space, a custom clustering strategy, ad-hoc search improving heuristics and specially defined distance functions. The resulting system is invariant or robust to a large class of typical variations that appear in natural images including rotations, scaling, and changes in color or illumination. The performance of fine is illustrated, discussed and compared with other contemporary alternatives using standard and custom-based image databases, mostly of single objects lying against a uniform background. Finally, some possible future developments are proposed with the ultimate goal of being able to deal with more complex pictorial scenes. © 2009 Springer-Verlag Berlin Heidelberg.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
|Titolo:||Fractal based image indexing and retrieval|
|Data di pubblicazione:||2009|
|Appartiene alla tipologia:||02a Capitolo o Articolo|