bit plane


Also found in: Dictionary, Thesaurus, Medical, Wikipedia.

bit plane

(graphics)
(Or "bitplane") The memory in a graphic display device which holds a complete one-bit-per-pixel image. Several bit planes may be used in conjunction to give more bits per pixel or to overlay several images or mask one with another.

"Bit plane" may be used as a synonym for "bitmap", though the latter suggests the data itself rather than the memory and also suggests a graphics file format.

bit plane

(1) The sequence of bits for each pixel in a bitmap. The number of bits in the bit plane determines the number of colors that are displayed in the image. See bitmap and color depth.

(2) A segment of memory used to control an object, such as a color, cursor or sprite. Bit planes may be reserved parts of a common memory or independent memory banks each designed for one purpose.
References in periodicals archive ?
This bit-stream was implanted in the cover using 2nd bit plane replacement and TPVD on remaining 7-bit cover image, to produce stego image.
Since the bit streams after Slepian-Wolf encoding are only the check bits and not the bit plane bits, the high compression performance can be reached.
In Figure 4, [b.sup.w] denotes one bit plane of image W, [b.sup.w.sub.j] denotes jth bit plane of image W, and [b.sup.w.sub.j](l) denotes Ith bit in the jth bit plane of image W.
The number of source node when processed in bit planes without compression will be 1584.
(4) Abu-Hajar A and Shankar R, "Wavelet based lossless image compression using partial SPIHT and bit plane based arithmetic coder", ICASSP 2002; 4:3497-3500
[direct sum] [cw.sub.nv] then (7) Modify the codeword of binary QR code image [T.sub.i] as [cw.sub.iv] = ~ [cw.sub.iv]; (8) end if (9) end for (10) end for (11) for i = 1 to n do (12) Replace the second significant bit plane of grayscale QR code image G[C.sub.i] with the modified QR code image [T.sub.i], and replace the last six significant bit planes with random binary numbers to generate grayscale share S[C.sub.i].
Here, the bits of the image are directly embedded into least significant bit plane of the cover-frame in a deterministic sequence.
The insignificant elements are preserved for the next bit plane. After that, the significant threshold is divided in half, and the process is repeated for the next pass.
T, for the first bit plane is equal to [2.sup.n] and n = log2 (max (i, j) {[absolute value of c (i, j)]} Where c (i, j) represents the (i, j)th wavelet coefficient.
In CNLSPECK, the State information is kept in a fixed size array that corresponds to the array of coefficient values, with two bits per coefficient to enable fast scanning of the bit planes. CNLSPECK uses special markers which are updated, when block splitting forms new significant blocks.
The DWT coefficients obtained after quantization are then divided into different bit planes and coded through multiple passes at embedded block coding with optimized truncation (EBCOT) to give a compressed byte stream.