G-FAQ – Why is Bit Depth Important?

直接抄:

https://apollomapping.com/2012/August/article15.html

For this month’s Geospatial Frequently Asked Question (G-FAQ), I pivot to a topic that deserves more attention than it gets, and that is bit depth. Some of you may have heard this term when ordering imagery from Apollo Mapping or perhaps when downloading free Landsat data without understanding its implications. As such, let’s delve into this topic, addressing the following set of questions:

What exactly is bit depth and why is it important when ordering satellite imagery? Is 16-bit imagery harder to work with? When should I order 16-bit imagery versus 8-bit depth?

To start of this discussion, it is important to understand the difference between base-10 and binary number systems. In a base-10 system, each digit place in a number represents 10 possible values from 0 to 9 and then each successive digit place increases by ten-fold in its value. Let’s look at this mathematically:

Base-10 Number = 123

This can be written mathematically as: (1 x 10^2) + (2 x 10^1) + (3 x 10^0)
Which can be simplified to: (1 x 100) + (2 x 10) + (3 x 1) 
And final to: 100 + 20 + 3 = 123

Given our familiarity with math since the early days of school, creating base-10 numbers is something we do seamlessly as opposed to writing out a mathematical formula as most beginners working with binary number systems do. In a binary system, each digit place only has two possible values, 0 or 1. This mimics a computer chip which can either be off (0) or on (1) – and this is the reason that computers are based around binary numbers at the system code level. So then, let’s see how a binary number is created mathematically:

Binary Number* = 111 1011

This can be written mathematically using base-10 numbers as: (1 x 2^6) + (1 x 2^5) + (1 x 2^4) + (1 x 2^3) + (0 x 2^2) + (1 x 2^1) + (1 x 2^0)
Which can be simplified to: (1 x 64) + (1 x 32) + (1 x 16) + (1 x 8) + (0 x 4) + (1 x 2) + (1 x 1)
And final to: 64 + 32 + 16 + 8 + 0 + 2 + 1 = 123

* In binary numbers, you add a space every fourth digit to the left of the decimal place.

By following steps similar to what I present above, you can convert any binary number to base-10 – though going from base-10 to binary involves more effort, check this website out for more details on those steps.

Now that we have explored binary number systems, we can pivot our attention back to bit depth. Satellites are based on binary numbers and as such bit depth is measured accordingly. The bit depth of a satellite tells you the maximum number of values it can measure per spectral band. The higher the bit depth, the more information it can measure and thus the more sensitive the sensor is to different illumination values (typically called digital numbers) of the surface of the planet.

As we explained in more detail last month, a passive optical satellite measures the intensity of photons that are reflected from the surface of our planet. Take for example two hypothetical satellites, one with 8-bit depth and the other with 9-bit depth. The 8-bit depth satellite can measure up to 2^8 digital number values (or 256 values) for the intensity of photon reflection; while a 9-bit depth satellite can measure up to 2^9 values (or 512).

To look at that same hypothetical situation another way, for each value an 8-bit depth satellite can measure, the 9-bit depth satellite can measure two values. That means the 9-bit satellite is twice as sensitive in each of its spectral bands as is the 8-bit satellite. Now remember that most satellites offer at least 4 multispectral bands. As such, a 9-bit depth satellite can produce 16 times the number of RGB + NIR values for each pixel in 4 band multispectral imagery than can an 8-bit depth satellite – this has important implications I will discuss later in this G-FAQ series.

The table below shows the imaging characteristics of the most common satellite we work with and then the maximum number of spectral combinations possible per pixel. The final column shows the increase in spectral information as related to a traditional 4-band, 11-bit depth satellite such as IKONOS. You can see from this table that increasing the number of spectral bands has a much larger impact on the maximum number of spectral combinations than does bit depth.

It is important to note that rarely, if ever, will satellite imagery utilize the entire range of pixel values possible with its bit depth. Imaging companies such as DigitalGlobe make the conscience decision to ‘dampen’ satellite systems, assuring that digital numbers close to the maximum possible (i.e. 2047 for 11-bit and 4095 for 12-bit depth) for each pixel are rarely reached. When the maximum value is reached and/or exceeded, flares can occur which destroy the spectral information in this pixel and surrounding ones.

Now that I have explained the basics, let’s take a look at the bit-depth ordering options for satellite imagery. If you have ever placed an order with Apollo Mapping for imagery products, you may have noticed that the two options for bit depth are 8 and 16, not 11 or 12 as in the table above. The reason for defining bit depth in increments of 8 ties back to computer technology. A single bit of information – either a 0 or 1 – is memory’s building block. Since the 1960s, it has been common practice for 8 bits to make up a single byte; so that 2 bytes is comprised of 16 bits of information.

As such, the binary digital numbers that are embedded in satellite imagery files (a TIFF usually) will either be 8-bits or 16-bits in length. In order to make 11 or 12-bit depth imagery 16 digits (or bits) long, 0’s are added to the front of the binary number so that the value itself remains unchanged. When 11 or 12-bit depth data is delivered as 8-bit depth imagery, the values are scaled so that each 8-bit depth pixel value represents multiple 11/12-bit depth values. Accordingly, 8-bit depth imagery will show less spectral variability. This 11/12-bit to 8-bit depth scaling process can also introduce additional signal noise. One term you might hear associated with 8-bit Red, Green, Blue (or Natural Color) imagery is 24-bits. They use this term as it is 3 spectral bands with 8-bit depth each, or 3 x 8 = 24-bit imagery.

In next month’s edition of G-FAQ, I will continue this discussion on bit depth by looking at the advantages and disadvantages of 8 and 11/12-bit depth imagery as well as provide recommendations on when to order each.

Until our next edition of G-FAQ, happy GIS-ing!

Do you have an idea for a future G-FAQ? If so, let me know by email at [email protected]. 

Find Out More About This Topic Here:

Brock Adam McCarty
Map Wizard
(720) 470-7988
[email protected]

时间: 2024-08-26 07:34:57

G-FAQ – Why is Bit Depth Important?的相关文章

comp.lang.javascript FAQ [zz]

comp.lang.javascript FAQ Version 32.2, Updated 2010-10-08, by Garrett Smith FAQ Notes 1 Meta-FAQ meta-questions 1.1 Which newsgroups deal with javascript? 1.2 What questions are on-topic for comp.lang.javascript? 1.3 What should I do before posting t

ArcGIS中的坐标系定义与转换 (转载)

原文:ArcGIS中的坐标系定义与转换 (转载) 1.基准面概念:  GIS中的坐标系定义由基准面和地图投影两组参数确定,而基准面的定义则由特定椭球体及其对应的转换参数确定,因此欲正确定义GIS系统坐标系,首先必须弄清地球椭球体(Ellipsoid).大地基准面(Datum)及地图投影(Projection)三者的基本概念及它们之间的关系.   基准面是利用特定椭球体对特定地区地球表面的逼近,因此每个国家或地区均有各自的基准面,我们通常称谓的北京54坐标系.西安80坐标系实际上指的是我国的两个大

hzau 1208 Color Circle(dfs)

1208: Color Circle Time Limit: 1 Sec  Memory Limit: 1280 MBSubmit: 289  Solved: 85[Submit][Status][Web Board] Description There are colorful flowers in the parterre in front of the door of college and form many beautiful patterns. Now, you want to fi

Fractal Tree

尝试使用递归方式实现一棵简单的分形树,给出初始点的坐标,在此基础上根据坐标轴旋转的规则计算出子树干与根节点的坐标关系,依次递归画出左子树干和右子树干,并提供一个递归的深度用于控制画的子树的数目. 在二维坐标系中,坐标轴旋转的公式如下: In two dimensions, every rotation matrix has the following form, This rotates column vectors by means of the following matrix multip

Use sed and awk to prettify json

$ cat prettify.sed s/,/,\r\n/g s/\[/\r\n\[\r\n/g s/\]/\r\n\]\r\n/g s/{/\r\n{\r\n/g s/}/\r\n}\r\n/g $ cat prettify.awk BEGIN{ depth = 0;} /\[/ { sp = 0; while(sp++ < depth) printf(" "); print $0; depth += 1; } /{/ { sp = 0; while(sp++ < dep

hadoop权威指南(第四版)要点翻译(4)——Chapter 3. The HDFS(1-4)

Filesystems that manage the storage across a network of machines are called distributed filesystems. Since they are network based, all the complications of network programming kick in, thus making distributed filesystems more complex than regular dis

[XAF] How to improve the application&#39;s performance

https://www.devexpress.com/Support/Center/Question/Details/T148978 The best way to determine the precise cause of a performance problem is to profile your application using a specialized performance profiler tool, e.g., AQTime, ANTS Performance Profi

How to embed Lua 5.1 in C++

http://blog.csdn.net/cnjet/article/details/5909555 Lua, is a scripting language providing dynamic data structures, maths, io and string manipulations just like any interprete language such as Bash, Python, Ruby etc. What is so special about Lua? Lua

Codeforces 786E. ALT 最小割+倍增

E. ALT http://codeforces.com/problemset/problem/786/E 题意: 给出一棵 n 个节点的树与 m 个工人.每个工人有一条上下班路线(简单路径),一个工人会得到满足只要下面一项满足:1.他得到一只puppy 2.他的上下班路径上每条边都有一只doge求使所有工人满足的最小dog数并输出方案.n≤20000,m≤10000 想法:暴力建图,源点连向工人Xi,边Yi连向汇点,容量为1.然后工人向其路径上的边连容量为1的边.O(nm) 优化建图:路径为树