Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!unix.cis.pitt.edu!dsinc!ub!uhura.cc.rochester.edu!rochester!pt.cs.cmu.edu!PROOF.ERGO.CS.CMU.EDU!tsf From: tsf@CS.CMU.EDU (Timothy Freeman) Newsgroups: comp.compression Subject: Re: Fractal Based Image Compression Message-ID: Date: 25 Mar 91 19:47:20 GMT References: <24985@hydra.gatech.EDU> Sender: tsf@PROOF.ERGO.CS.CMU.EDU Organization: School of Computer Science, Carnegie Mellon University Lines: 38 In-reply-to: ar12@prism.gatech.EDU's message of 25 Mar 91 17:42:32 GMT In article <24985@hydra.gatech.EDU> ar12@prism.gatech.EDU (REGISTER,ANDREW H) writes: I would like to find some references on the methods used to find the set of strange attractors used to compress images using the fractal based reconstruction methods. The process of creating the image is fairly well documented. The inverse problem is not. This reference is the best I've been able to find: @article ( BARNSLEY88, key = "Barnsley88" , author = "Michael F. Barnsley and Arnaud Jacquin and Francois Malassenet and Laurie Reuter and Alan D. Sloan" , title = "Harnessing Chaos for Image Synthesis" , journal = "Computer Graphics" , volume = "22" , number = "4" , month = "August" , year = "1988" , pages = "131--140" , keywords= "graph, tsf" , annote = "Tim has a copy." , bibdate = "Thu May 17 16:21:37 1990" ) The paper says "We introduce two new IFS[Iterated Function Systems]-based algorithms. The first one, the Collage algorithm, is a gemoetric modeling tool for interactively finding iterated funciton system codes. The second one is called the Measure Rendering algorithm. It applies chaotic dynamics to the computation of the gemometry and texture of IFS encode images." However, the detailed description of the Collage "algorithm" says that it requires human input for each image, so it isn't an algorithm, at least according to the way I understand the term. I feel that the abstract of this paper is very misleading. Tim