简体   繁体   English

C ++:累加器矩阵(3D数组)

[英]C++: Accumulator matrix (3D arrays)

I am trying to do some hough voting in 3D space in which I will have an accumulator over 3 dimensions which can be thought of as a 3D array. 我试图在3D空间中进行一些激烈的投票,在这个3D空间中,我将有3个维度的累加器,可以将其视为3D阵列。 I will then want to search for peaks in this array. 然后,我将要搜索此阵列中的峰。

I was wondering if boost , opencv or even the std lib have an inbuilt structure for this which can give fast search times when looking for local maxima? 我想知道boostopencv甚至std lib是否具有内置的结构,可以在寻找局部最大值时快速搜索?

Thanks 谢谢

您是否看过Boost.Accumulators库?

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

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