International Conference «Mathematical and Informational Technologies, MIT-2011»
(IX Conference «Computational and Informational Technologies for Science,
Engineering and Education»)

Vrnjacka Banja, Serbia, August, 27–31, 2011

Budva, Montenegro, August, 31 – September, 5, 2011

Baklanova O.E.  

Colour roundoff algorithm based on octrees

The various complicated numerical algorithms in digital colour image processing are used in recent time, and often they require the calculation with the real values. In this situation the initial colour image described by integers transforms to the few real arrays, corresponding for example to the red-green-blue components. We have here some problem for the visualization of the output image in the computer screen because its palette is restricted (under IBM standard only 256 colour combinations in the palette are possible). So, the colour roundoff problem arises in the natural way. Other reasons for the colour roundoff are also possible: an effective scanning of the colour images, the exchange of palette (Dali's picture in Gogen's palette?), data compression and so on. However in every case we need to treat all pixels, and for the huge image we need to minimize the computational expenses. Special colour roundoff problem arises in the visualization of the colour images in the computer screen under restricted palette after real valued treatment of the initial image, connected for example with the compression of colour components, and also in the scanning of colour images, palette exchanges and so on. An effective algorithm of colour roundoff based on octrees is presented in this paper.  

To reports list

© 1996-2019, Institute of computational technologies of SB RAS, Novosibirsk