简体   繁体   English

计算HOG功能

[英]Computing HOG features

I have one problem in the second step which is to accumulate weighted votes for gradient orientation over spatial cells. 我在第二步中遇到一个问题,就是在空间单元上累积加权投票以获得梯度方向。

Assuming the cell is 8*8 . 假设小区是8*8 Let me use two matrix GO[8][8]([1 9]) , GM[8][8] to represent the gradient orientation and gradient magnitude respectively. 让我用两个矩阵GO[8][8]([1 9])GM[8][8]分别表示梯度方向和梯度大小。 The gradient orientation ranges from 0 - 180 and there are 9 orientation bins. 梯度方向的范围为0 - 180 ,有9方向箱。

According to my understanding of HOG, for every pixel in a cell, adding its gradient magnitude to its corresponding orientation bin. 根据我对HOG的理解,对于单元格中的每个像素,将其渐变幅度添加到其对应的方向区域。 In this way, we can have the histogram for every cell. 通过这种方式,我们可以得到每个细胞的直方图。

But there is one sentence thats confusing me. 但有一句让我感到困惑。

" To reduce aliasing, votes(gradient magnitude) are interpolated trilinearly between the neighbouring bin centers in both orientation and position. " 1 为了减少混叠,投票(梯度幅度)在方向和位置的相邻二进制中心之间进行三线插值。1

Why interpolated? 为什么插值? How to interpolate? 如何插值? Can someone explains more detailed? 有人能解释得更详细吗? No reducing aliasing. 没有减少混叠。

Thanks in advance. 提前致谢。


1 This sentence is in Navneet Dalal's PHD thesis, p38, line 4. 1这句话在Navneet Dalal的PHD论文中,第38页,第4行。

Interpolation is a standard technique for computing histograms. 插值是计算直方图的标准技术。 The idea here is that each value is not simply placed into one bin, but is distributed between two neighboring bins (assuming a 1d histogram), based on how far away it is from the center of the original bin. 这里的想法是每个值不是简单地放置在一个箱子中,而是分布在两个相邻箱子之间(假设1d直方图),基于它离原箱子中心有多远。

The purpose of this is to deal with situations when a small error in your measurement can cause a value to be placed into a different bin. 这样做的目的是处理测量中的小错误可能导致将值放入不同的bin中的情况。 This is a very good thing to do for any type of histogram, not just for HOGs, assuming you have the CPU cycles. 对于任何类型的直方图,这是一件非常好的事情,不仅仅是针对HOG,假设你有CPU周期。

There is also bi-linear and tri-linear interpolation for 2d and 3d histograms, where each value is distributed between 4 and 8 neighboring bins respectively. 对于2D和3d直方图,还存在双线性和三线性插值,其中每个值分别在4到8个相邻区间之间分布。

声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.

 
粤ICP备18138465号  © 2020-2024 STACKOOM.COM