首页
学习
活动
专区
圈层
工具
发布
社区首页 >问答首页 >解释Numpy-Array中的特定位

解释Numpy-Array中的特定位
EN

Stack Overflow用户
提问于 2020-05-19 14:37:24
回答 2查看 197关注 0票数 3

我正在尝试解释HDF文件,或者更准确地说是文件内部的Rasterband。有一个用于质量评估的频带,它将比特信息表示为相应的整数(例如,01000000表示为64)。

根据特定的位,我想要得到一个计数,例如,在位位置5上有多少像素是1。如果它们被上一次计数考虑在内,则不应该再次获得计数。现在,我自己根据优先级列表更改每个单元格中的条目。这需要很长时间,我真的相信有更快的方法,因为我以前从未使用过bits。

下面是我的代码:

代码语言:javascript
复制
from osgeo import gdal
import numpy as np
QA_Band = gdal.Open(hdf.GetSubDatasets()[B][0],gdal.GA_ReadOnly)
QA = QA_Band.ReadAsArray()

# Calculate Bit-Representation of QA-Band
bin_vec = np.vectorize(np.binary_repr)
QAB = bin_vec(QA, width = 8)

# Filter by Bit-Values
QAB = np.where(QAB == '11111111', "OutOfSwath", QAB)

for i in range(QAB.shape[0]):
    for j in range(QAB.shape[1]):
        if QAB[i,j][6] == '1':
            QAB[i,j] = "Cloud"
            Cloud = (QAB == "Cloud").sum()
        elif QAB[i,j][4] == '1':
            QAB[i,j] = "Cloud Shadow"      
            Shadow = (QAB == "Cloud Shadow").sum()
        elif QAB[i,j][5] == '1':
            QAB[i,j] = "Adjacent Cloud"
            AC = (QAB == "Adjacent Cloud").sum()

        elif QAB[i,j][7] == '1':
            QAB[i,j] = "Cirrus"
            Cirrus = (QAB == "Cirrus").sum()

        elif QAB[i,j][3] == '1':
            QAB[i,j] = "Snow/Ice"
            SnowC = (QAB == "Snow/Ice").sum()
        elif QAB[i,j][2] == '1':
            QAB[i,j] = "Water"
            WaterC = (QAB == "Water").sum()

        elif QAB[i,j][0:1] == '11':
            QAB[i,j] = "High Aerosol"        
        elif QAB[i,j][0:1] == '10':
            QAB[i,j] = "Avrg. Aerosol"        
        elif QAB[i,j][0:1] == '01':
            QAB[i,j] = "Low Aerosol"
        elif QAB[i,j][0:1] == '00':
            QAB[i,j] = "Aerosol Climatology"

这将导致表示不同事物的字符串数组,但如前所述需要时间。

任何关于如何访问位表示的帮助都将是有帮助的:)

EN

回答 2

Stack Overflow用户

回答已采纳

发布于 2020-05-19 15:51:07

您可以使用numpy函数unpackbits来处理位。对于numpy,我们更喜欢使用numpy方法和函数,而不是python for loop --通常它会更快。所以你可以把每个数字解包到第三个轴,然后像QAB[i, j][5] == '1'这样的条件变成result[bits[5]]。我颠倒了你elif子句的顺序,就像你QAB[i, j][6] == '1',然后它设置为"Cloud",并且从不遍历子句,所以如果我们运行每个条件,这个例子应该是最后重写重写的。你的上一个例子,比如QAB[i,j][0:1] == '11',从来没有触发过,因为左边的长度总是1,所以我用消耗重写了一下,你指的是QAB[i,j][0:2] == ...

代码语言:javascript
复制
"""
>>> print(bits)
[[[False False False]
  [False False  True]]
<BLANKLINE>
 [[False False False]
  [False False  True]]
<BLANKLINE>
 [[False False False]
  [False False  True]]
<BLANKLINE>
 [[False False False]
  [False False  True]]
<BLANKLINE>
 [[False False False]
  [False  True  True]]
<BLANKLINE>
 [[False False False]
  [False False  True]]
<BLANKLINE>
 [[False  True  True]
  [ True False  True]]
<BLANKLINE>
 [[ True False  True]
  [ True  True  True]]]
>>> print(result)
[['Cirrus' 'Cloud' 'Cloud']
 ['Cloud' 'Cloud Shadow' 'OutOfSwath']]
>>> Cloud
3
"""
import numpy as np
QA = [[1, 2, 3], [3, 9, 255]]

bits = np.unpackbits(np.array(QA, dtype=np.uint8, ndmin=3), axis=0).astype(bool)
result = np.array([[""] * bits.shape[2] for _ in range(bits.shape[1])], dtype=object)
result[~bits[0] & ~bits[1]] = "Aerosol Climatology"
result[~bits[0] & bits[1]] = "Low Aerosol"
result[bits[0] & ~bits[1]] = "Avrg. Aerosol"
result[bits[0] & bits[1]] = "High Aerosol"
result[bits[2]] = "Water"
result[bits[3]] = "Snow/Ice"
result[bits[7]] = "Cirrus"
result[bits[5]] = "Adjacent Cloud"
result[bits[4]] = "Cloud Shadow"
result[bits[6]] = "Cloud"
result[bits.all(axis=0)] = "OutOfSwath"
Cloud = (result == "Cloud").sum()
Shadow = (result == "Cloud Shadow").sum()
AC = (result == "Adjacent Cloud").sum()
Cirrus = (result == "Cirrus").sum()
SnowC = (result == "Snow/Ice").sum()
WaterC = (result == "Water").sum()
票数 2
EN

Stack Overflow用户

发布于 2020-05-19 19:35:32

您程序的逻辑实际上精确地映射到numpy.select上,根据条件(布尔)数组列表,按元素从数组列表中选择,先匹配取胜。因此,您可以简洁地编写如下内容

代码语言:javascript
复制
conditions = QAB&(128>>np.arange(8))[:,None,None]
values = ["OutOfSwath","Cloud","Cloud Shadow","Adjacent Cloud","Cirrus","Snow/Ice",
          "Water","High Aerosol","Avrg. Aerosol","Low Aerosol","Aerosol Climatology"]

np.select([QAB==255,*conditions[[6,4,5,7,3,2]],*(QAB==np.arange(0,256,64)[::-1,None,None])],values)
票数 1
EN
页面原文内容由Stack Overflow提供。腾讯云小微IT领域专用引擎提供翻译支持
原文链接:

https://stackoverflow.com/questions/61884696

复制
相关文章

相似问题

领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档