Optimized Color Gamuts for Tiled Displays

12/06/2002
by   Marshall Bern, et al.
0

We consider the problem of finding a large color space that can be generated by all units in multi-projector tiled display systems. Viewing the problem geometrically as one of finding a large parallelepiped within the intersection of multiple parallelepipeds, and using colorimetric principles to define a volume-based objective function for comparing feasible solutions, we develop an algorithm for finding the optimal gamut in time O(n^3), where n denotes the number of projectors in the system. We also discuss more efficient quasiconvex programming algorithms for alternative objective functions based on maximizing the quality of the color space extrema.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/15/2012

Color scales that are effective in both color and grayscale

We consider the problem of finding a color scale which performs well whe...
research
12/01/2018

Hierarchical Genetic Algorithms with evolving objective functions

We propose a framework of genetic algorithms which use multi-level hiera...
research
10/18/2021

Color Image Segmentation Using Multi-Objective Swarm Optimizer and Multi-level Histogram Thresholding

Rapid developments in swarm intelligence optimizers and computer process...
research
02/18/2020

Default Ambiguity: Finding the Best Solution to the Clearing Problem

We study financial networks with debt contracts and credit default swaps...
research
09/05/2019

On ultrametric 1-median selection

Consider the problem of finding a point in an ultrametric space with the...
research
09/16/2013

SEEDS: Superpixels Extracted via Energy-Driven Sampling

Superpixel algorithms aim to over-segment the image by grouping pixels t...
research
07/23/2023

A Bilevel Formalism for the Peer-Reviewing Problem

Due to the large number of submissions that more and more conferences ex...

Please sign up or login with your details

Forgot password? Click here to reset