Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 5/3/83; site ukc.UUCP
Path: utzoo!linus!decvax!genrad!wjh12!harvard!seismo!mcvax!ukc!msp
From: msp@ukc.UUCP (M.S.Parsons)
Newsgroups: net.graphics
Subject: Measuring complexity of images
Message-ID: <4624@ukc.UUCP>
Date: Thu, 15-Nov-84 14:26:19 EST
Article-I.D.: ukc.4624
Posted: Thu Nov 15 14:26:19 1984
Date-Received: Sat, 17-Nov-84 05:34:54 EST
Organization: Computing Laboratory, U of Kent at Canterbury, UK
Lines: 20

..... .   .    .       .           .               .

Does anyone have any references (or programs) which tackle the problem of
measuring image "complexity". I know that this is a subjective idea, but
surely there are some standard methods?

At the moment, I'm just looking at the size of the image when encoded as a
quadtree, as runlength code, and when compressed (using UN*X compress). There
must be better ways.

Please respond by mail.
Thanks,
   Mike.

---------------------------------------------------------------------------
Mike Parsons  UUCP:  {hirst1,cfg,west44,edcaad,ucl-cs,mcvax,vax135}!ukc!msp
              JANET: MSP%UKC%EDXA%.....
              ARPA:  MSP%UKC@UCL-CS.ARPA
              Mail:  Computing Laboratory, University of Kent, Canterbury,
                     Kent, England CT2 7NF