home *** CD-ROM | disk | FTP | other *** search
- Xref: sparky comp.graphics:8188 sci.image.processing:228 comp.ai.neural-nets:2980
- Newsgroups: comp.graphics,sci.image.processing,comp.ai.neural-nets
- Path: sparky!uunet!zaphod.mps.ohio-state.edu!usc!cs.utexas.edu!torn!watserv1!watmath!undergrad.math.waterloo.edu!cayley.waterloo.edu!icfaragh
- From: icfaragh@cayley.waterloo.edu (Chad Faragher)
- Subject: ALGORITHM NEEDED: Palette Selection
- Message-ID: <Bs1wLE.82z@undergrad.math.waterloo.edu>
- Sender: news@undergrad.math.waterloo.edu
- Organization: University of Waterloo
- Date: Mon, 27 Jul 1992 14:08:02 GMT
- Lines: 15
-
-
- The situation: An image is stored by giving the rgb value for each pixel.
-
- The problem: How to find the best palette of size-n for a particular image
- stored (at arbitrary resolution) as above.
-
- The solution: HELP!!!
-
- Does the algorithm exist? Is it memory intensive? Can it be solved with
- recursion (ie octree division)? Can a neural-net be trained to arrive at
- a visually pleasing palette given the original image?
-
- All input welcome.
-
- Chad Faragher -- University of Waterloo
-