home *** CD-ROM | disk | FTP | other *** search
- Xref: sparky comp.graphics:8257 sci.image.processing:261 comp.ai.neural-nets:3009
- Path: sparky!uunet!cs.utexas.edu!qt.cs.utexas.edu!yale.edu!nigel.msen.com!sdd.hp.com!uakari.primate.wisc.edu!crdgw1!rdsunx.crd.ge.com!rdsunx!montnaro
- From: montnaro@spyder.crd.ge.com (Skip Montanaro)
- Newsgroups: comp.graphics,sci.image.processing,comp.ai.neural-nets
- Subject: Re: ALGORITHM NEEDED: Palette Selection
- Message-ID: <MONTNARO.92Jul29103814@spyder.crd.ge.com>
- Date: 29 Jul 92 15:38:14 GMT
- References: <Bs1wLE.82z@undergrad.math.waterloo.edu>
- Sender: usenet@crd.ge.com (Required for NNTP)
- Reply-To: montanaro@crd.ge.com (Skip Montanaro)
- Organization: GE Corporate Research & Development, Schenectady, NY
- Lines: 11
- In-Reply-To: icfaragh@cayley.waterloo.edu's message of 27 Jul 92 14:08:02 GMT
- Nntp-Posting-Host: spyder.crd.ge.com
-
- In article <Bs1wLE.82z@undergrad.math.waterloo.edu> icfaragh@cayley.waterloo.edu (Chad Faragher) writes:
-
- The problem: How to find the best palette of size-n for a particular image
- stored (at arbitrary resolution) as above.
-
- Check out Appendices E (Color Allocation in XV) and F (The Diversity
- Algorithm) of the xv documentation. Consult archie for an xv archive site
- near you.
-
- --
- Skip (montanaro@crd.ge.com)
-