Editing Bit plane (section)

{{Short description|Computer graphics term}}
{{about|the digital information term|the company|Bitplane}}
[[File:Lichtenstein bitplanes.png|thumb|right|400px|The 8 bit-planes of a gray-scale image (the one on left). There are eight because the original image uses eight bits per pixel.]]

A '''bit plane''' of a [[Digital data|digital]] [[discrete signal]] (such as image or sound) is a set of [[bit]]s corresponding to a given bit position in each of the [[binary number]]s representing the signal.<ref>{{cite magazine
  | title =Bit Plane
  | magazine =PC Magazine
  | url =https://www.pcmag.com/encyclopedia_term/0%2C2542%2Ct%3Dbit+plane%26i%3D38689%2C00.asp
  | accessdate =2007-05-02
  | archive-date =2012-10-07
  | archive-url =https://web.archive.org/web/20121007084142/http://www.pcmag.com/encyclopedia_term/0%2C2542%2Ct%3Dbit+plane%26i%3D38689%2C00.asp
  | url-status =dead
  }}</ref>

For example, for [[16-bit]] data representation there are 16 bit planes: the first bit plane contains the set of the most significant bit, and the 16th contains the least significant bit.

It is possible to see that the first bit plane gives the roughest but the most critical approximation of values of a medium, and the higher the number of the bit plane, the less is its contribution to the final stage. Thus, adding a bit plane gives a better approximation.

If a bit on the nth bit plane on an m-bit dataset is set to 1, it contributes a value of 2<sup>m−n</sup>, otherwise it contributes nothing. Therefore, bit planes can contribute half of the value of the previous bit plane. For example, in the 8-bit value 10110101 (181 in decimal) the bit planes work as follows:

{| class="wikitable"
|-
! Bit plane !! Value !! Contribution !! Cumulative total
|-
| 1st || 1 || 1 × 2<sup>7</sup> = 128 || 128
|-
| 2nd || 0 || 0 × 2<sup>6</sup> = 0   || 128
|-
| 3rd || 1 || 1 × 2<sup>5</sup> = 32  || 160
|-
| 4th || 1 || 1 × 2<sup>4</sup> = 16  || 176
|-
| 5th || 0 || 0 × 2<sup>3</sup> = 0   || 176
|-
| 6th || 1 || 1 × 2<sup>2</sup> = 4   || 180
|-
| 7th || 0 || 0 × 2<sup>1</sup> = 0   || 180
|-
| 8th || 1 || 1 × 2<sup>0</sup> = 1   || 181
|}

Bit plane is sometimes used as synonymous to [[Bitmap]]; however, technically the former refers to the location of the data in memory and the latter to the data itself.<ref>{{cite web
  | last =
  | first =
  | authorlink =
  | title =Bit Plane
  | publisher =FOLDOC
  | url =http://foldoc.org/foldoc.cgi?bit+plane
  | format =
  | doi =
  | accessdate =2007-05-02  }}</ref>

One aspect of using bit-planes is determining whether a bit-plane is random noise or contains significant information.

One method for calculating this is to compare each pixel {{nowrap|(X, Y)}} to three adjacent pixels {{nowrap|(X − 1, Y)}}, {{nowrap|(X, Y − 1)}} and {{nowrap|(X − 1, Y − 1)}}. If the pixel is the same as at least two of the three adjacent pixels, it is not noise. A noisy bit-plane will have 49% to 51% pixels that are noise.<ref>{{cite journal
  | last =Strutz
  | first =Tilo
  | authorlink =
  | title =Fast Noise Suppression for Lossless Image Coding
  | journal =Proceedings of Picture Coding Symposium (PCS'2001), Seoul, Korea
  | volume =
  | issue =
  | pages =
  | year =2001
  | url =http://citeseer.ist.psu.edu/strutz01fast.html
  | doi =
  | id =
  | accessdate =2008-01-15  }}</ref>