mskuhn@immd4.informatik.uni-erlangen.de (Markus Kuhn) (06/12/91)
I've heard about a fractal image compression algorithm. It has been developped by two US mathematicians and has similar compression ratios as JPEG. I think this sounds like a quite interessting topic and I'd appreciate if anyone would post a small description of the idea behind this method. Thank you Markus --- Markus Kuhn, Computer Science student -- University of Erlangen, Germany X.400: G=Markus;S=Kuhn;OU1=rrze;OU2=cnve;P=uni-erlangen;A=dbp;C=de I'net: mskuhn@immd4.informatik.uni-erlangen.de
hart@uicbert.eecs.uic.edu (John C. Hart) (06/13/91)
mskuhn@immd4.informatik.uni-erlangen.de (Markus Kuhn) writes: >I've heard about a fractal image compression algorithm. It has been >developped by two US mathematicians and has similar compression ratios >as JPEG. >I think this sounds like a quite interessting topic and I'd appreciate >if anyone would post a small description of the idea behind this method. Which fractal image compression algorithm? There are several... Who are the mathematicians? -John Hart Electronic Visualization Laboratory University of Illinois at Chicago
jk87377@cc.tut.fi (Juhana Kouhia) (06/15/91)
In article <1991Jun13.150158.16826@uicbert.eecs.uic.edu> hart@uicbert.eecs.uic.edu (John C. Hart) writes: >mskuhn@immd4.informatik.uni-erlangen.de (Markus Kuhn) writes: > >>I've heard about a fractal image compression algorithm. It has been >>developped by two US mathematicians and has similar compression ratios >>as JPEG. > >>I think this sounds like a quite interessting topic and I'd appreciate >>if anyone would post a small description of the idea behind this method. > >Which fractal image compression algorithm? There are several... Who are the >mathematicians? I think Markus doesn't know them by the name; instead I think Markus could be a 'new comer' -- and apperently requested answers to questions as you John presented; how about answering to them by making a good summary about papers - with a simple describtion of the method they use - on this field? Juhana Kouhia
davidsen@sixhub.UUCP (Wm E. Davidsen Jr) (06/17/91)
In article <1991Jun14.204534.20978@cc.tut.fi> jk87377@cc.tut.fi (Juhana Kouhia) writes: | I think Markus doesn't know them by the name; instead I think Markus | could be a 'new comer' -- and apperently requested answers to questions | as you John presented; how about answering to them by making a good | summary about papers - with a simple describtion of the method they | use - on this field? I think there will be two papers on this at siggraph, but I can't remember where I saw the info. Could be totally wrong. -- bill davidsen - davidsen@sixhub.uucp (uunet!crdgw1!sixhub!davidsen) sysop *IX BBS and Public Access UNIX moderator of comp.binaries.ibm.pc and 80386 mailing list "Stupidity, like virtue, is its own reward" -me
mskuhn@immd4.informatik.uni-erlangen.de (Markus Kuhn) (06/17/91)
hart@uicbert.eecs.uic.edu (John C. Hart) writes: >Which fractal image compression algorithm? There are several... Who are the >mathematicians? Their names are Dr. Michael Barnsley and Dr. Alan Sloan and they founded Iterated Systems Inc., Norcross, Ga. The following is from Electronic Design, May 23, 1991, p.62: The company claims the picture quality of its decompressed images is better than that of the JPEG algorithm. They have a patent on their method. I would also be interessted in a general description of various fractal image compression algorithms. Markus --- Markus Kuhn, Computer Science student -- University of Erlangen, Germany X.400: G=Markus;S=Kuhn;OU1=rrze;OU2=cnve;P=uni-erlangen;A=dbp;C=de I'net: mskuhn@immd4.informatik.uni-erlangen.de
hart@uicbert.eecs.uic.edu (John C. Hart) (06/21/91)
The only methods I am aware of are by Arnaud Jacquin and Ed Vrscay. These two methods will be summarized at SIGGRAPH '91 in the Fractal Models in Computer Graphics course. Jacqin's method is a block-coding, Vrscay's method uses power moments. Is anybody aware of any others? Others besides of course the famous Barnsley top-secret method. -John Hart Electronic Visualization Laboratory University of Illinois at Chicago
aboulang@bbn.com (Albert Boulanger) (06/22/91)
In article <1991Jun20.193546.10135@uicbert.eecs.uic.edu> hart@uicbert.eecs.uic.edu (John C. Hart) writes:
The only methods I am aware of are by Arnaud Jacquin and Ed Vrscay. These
two methods will be summarized at SIGGRAPH '91 in the Fractal Models in
Computer Graphics course. Jacqin's method is a block-coding, Vrscay's method
uses power moments. Is anybody aware of any others? Others besides of course
the famous Barnsley top-secret method.
Moments were used in Barnsley's Royal Society paper. A neural net to
compute the Hutchinson metric used in the closeness calculation in the
inverse problem is described in:
"A Neural Network to Compute the Hutchinson Metric in Fractal Image Processing"
J. Stark, IEEE Trans. on Neural Networks, Vol 2 No 1, January 1991, 156,158
A novel optimization method used in the inverse problem, which has
some of the features of "tabu" search, because it involves marking
points in search space with positive and negative affinities is
described in:
"Chaotic Optimization and the Construction of Fractals: Solution of an
Inverse Problem", Giorgio Mantica & Alan Sloan, Complex Systems
3(1989) 37-62.
Interestingly, IFS Fractals and Wavelets share many properties. Some
of which is explored in:
"IFS Fractals and the Wavelet Transform", G.C. Freeland & T.S. Durrani,
1990 ICASSP proceedings, 2345-2348
Wavelets are good for measuring empirical fractal properties of signals
in general.
Recuse, of course,
Albert Boulanger
aboulanger@bbn.comlaborell@mimosa.unice.fr (Louis Laborelli) (06/26/91)
In article <1991Jun20.193546.10135@uicbert.eecs.uic.edu>, hart@uicbert.eecs.uic.edu (John C. Hart) writes: |> The only methods I am aware of are by Arnaud Jacquin and Ed Vrscay. These |> two methods will be summarized at SIGGRAPH '91 in the Fractal Models in |> Computer Graphics course. Jacqin's method is a block-coding, Vrscay's method |> uses power moments. Is anybody aware of any others? Others besides of course |> the famous Barnsley top-secret method. |> |> -John Hart |> Electronic Visualization Laboratory |> University of Illinois at Chicago I would be very happy to have a reference about the above two papers . Is Arnaud Jacquin french ? -- Louis Laborelli Universite de Nice Sophia Antipolis / phone: (33) 92 94 26 89 I3S LISAN - CNRS Batiment 4 \ telex: GRP 970006F 250 rue Albert Einstein / fax: (33) 92 94 28 98 Sophia Antipolis \ e-mail:laborell@zig.inria.fr 06560 Valbonne FRANCE / or laborell@mimosa.unice.fr
cnbr37@vaxa.strath.ac.uk (06/27/91)
In article <ABOULANG.91Jun22124200@taurus.bbn.com>, aboulang@bbn.com (Albert Boulanger) writes: > In article <1991Jun20.193546.10135@uicbert.eecs.uic.edu> hart@uicbert.eecs.uic.edu (John C. Hart) writes: > > > The only methods I am aware of are by Arnaud Jacquin and Ed Vrscay. These > two methods will be summarized at SIGGRAPH '91 in the Fractal Models in > Computer Graphics course. Jacqin's method is a block-coding, Vrscay's method > uses power moments. Is anybody aware of any others? Others besides of course > the famous Barnsley top-secret method. > > Moments were used in Barnsley's Royal Society paper. A neural net to > compute the Hutchinson metric used in the closeness calculation in the > inverse problem is described in: > > "A Neural Network to Compute the Hutchinson Metric in Fractal Image Processing" > J. Stark, IEEE Trans. on Neural Networks, Vol 2 No 1, January 1991, 156,158 > > A novel optimization method used in the inverse problem, which has > some of the features of "tabu" search, because it involves marking > points in search space with positive and negative affinities is > described in: > > "Chaotic Optimization and the Construction of Fractals: Solution of an > Inverse Problem", Giorgio Mantica & Alan Sloan, Complex Systems > 3(1989) 37-62. > > Interestingly, IFS Fractals and Wavelets share many properties. Some > of which is explored in: > > "IFS Fractals and the Wavelet Transform", G.C. Freeland & T.S. Durrani, > 1990 ICASSP proceedings, 2345-2348 > > > Wavelets are good for measuring empirical fractal properties of signals > in general. > > Recuse, of course, > > Albert Boulanger > aboulanger@bbn.com What is important, particularly in the practicality of the all the above methods, is to distinguish between the methods of inverse solution and a difference in the underlying model. It was a change of model which led to the Barnsley and Jacquin techniques and to an applicable coding method. G.C.Freeland.