开源 企业版 高校版 私有云 模力方舟 AI 队友
代码拉取完成,页面将自动刷新
加入 Gitee
与超过 1400万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
已有帐号? 立即登录
文件
master
分支 (2)
标签 (11)
master
gh-pages
v18.05
v18.03
v18.02
v18.01
v17.12
v17.10
v17.09
v17.06
v17.05
v17.04
v17.03.1
master
分支 (2)
标签 (11)
master
gh-pages
v18.05
v18.03
v18.02
v18.01
v17.12
v17.10
v17.09
v17.06
v17.05
v17.04
v17.03.1
克隆/下载
克隆/下载
提示
下载代码请复制以下命令到终端执行
为确保你提交的代码身份被 Gitee 正确识别,请执行以下命令完成配置
初次使用 SSH 协议进行代码克隆、推送等操作时,需按下述提示完成 SSH 配置
1 生成 RSA 密钥
2 获取 RSA 公钥内容,并配置到 SSH公钥
在 Gitee 上使用 SVN,请访问 使用指南
使用 HTTPS 协议时,命令行会出现如下账号密码验证步骤。基于安全考虑,Gitee 建议 配置并使用私人令牌 替代登录密码进行克隆、推送等操作
Username for 'https://gitee.com': userName
Password for 'https://userName@gitee.com': # 私人令牌
master
分支 (2)
标签 (11)
master
gh-pages
v18.05
v18.03
v18.02
v18.01
v17.12
v17.10
v17.09
v17.06
v17.05
v17.04
v17.03.1
ComputeLibrary
/
src
/
runtime
/
CL
/
functions
/
CLHOGMultiDetection.cpp
ComputeLibrary
/
src
/
runtime
/
CL
/
functions
/
CLHOGMultiDetection.cpp
CLHOGMultiDetection.cpp 11.63 KB
一键复制 编辑 原始数据 按行查看 历史
Kaizen 提交于 2017年09月28日 21:38 +08:00 . arm_compute v17.09
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270
/*
* Copyright (c) 2017 ARM Limited.
*
* SPDX-License-Identifier: MIT
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to
* deal in the Software without restriction, including without limitation the
* rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
* sell copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#include "arm_compute/runtime/CL/functions/CLHOGMultiDetection.h"
#include "arm_compute/core/CL/OpenCL.h"
#include "arm_compute/core/Error.h"
#include "arm_compute/core/TensorInfo.h"
#include "arm_compute/runtime/CL/CLArray.h"
#include "arm_compute/runtime/CL/CLScheduler.h"
#include "arm_compute/runtime/CL/CLTensor.h"
#include "arm_compute/runtime/Scheduler.h"
#include "support/ToolchainSupport.h"
using namespace arm_compute;
CLHOGMultiDetection::CLHOGMultiDetection(std::shared_ptr<IMemoryManager> memory_manager) // NOLINT
: _memory_group(std::move(memory_manager)),
_gradient_kernel(),
_orient_bin_kernel(),
_block_norm_kernel(),
_hog_detect_kernel(),
_non_maxima_kernel(),
_hog_space(),
_hog_norm_space(),
_detection_windows(),
_mag(),
_phase(),
_non_maxima_suppression(false),
_num_orient_bin_kernel(0),
_num_block_norm_kernel(0),
_num_hog_detect_kernel(0)
{
}
void CLHOGMultiDetection::configure(ICLTensor *input, const ICLMultiHOG *multi_hog, ICLDetectionWindowArray *detection_windows, ICLSize2DArray *detection_window_strides, BorderMode border_mode,
uint8_t constant_border_value, float threshold, bool non_maxima_suppression, float min_distance)
{
ARM_COMPUTE_ERROR_ON_DATA_TYPE_CHANNEL_NOT_IN(input, 1, DataType::U8);
ARM_COMPUTE_ERROR_ON_INVALID_MULTI_HOG(multi_hog);
ARM_COMPUTE_ERROR_ON(nullptr == detection_windows);
ARM_COMPUTE_ERROR_ON(detection_window_strides->num_values() != multi_hog->num_models());
const size_t width = input->info()->dimension(Window::DimX);
const size_t height = input->info()->dimension(Window::DimY);
const TensorShape &shape_img = input->info()->tensor_shape();
const size_t num_models = multi_hog->num_models();
PhaseType phase_type = multi_hog->model(0)->info()->phase_type();
size_t prev_num_bins = multi_hog->model(0)->info()->num_bins();
Size2D prev_cell_size = multi_hog->model(0)->info()->cell_size();
Size2D prev_block_size = multi_hog->model(0)->info()->block_size();
Size2D prev_block_stride = multi_hog->model(0)->info()->block_stride();
/* Check if CLHOGOrientationBinningKernel and CLHOGBlockNormalizationKernel kernels can be skipped for a specific HOG data-object
*
* 1) CLHOGOrientationBinningKernel and CLHOGBlockNormalizationKernel are skipped if the cell size and the number of bins don't change.
* Since "multi_hog" is sorted,it is enough to check the HOG descriptors at level "ith" and level "(i-1)th
* 2) CLHOGBlockNormalizationKernel is skipped if the cell size, the number of bins and block size do not change.
* Since "multi_hog" is sorted,it is enough to check the HOG descriptors at level "ith" and level "(i-1)th
*
* @note Since the orientation binning and block normalization kernels can be skipped, we need to keep track of the input to process for each kernel
* with "input_orient_bin", "input_hog_detect" and "input_block_norm"
*/
std::vector<size_t> input_orient_bin;
std::vector<size_t> input_hog_detect;
std::vector<std::pair<size_t, size_t>> input_block_norm;
input_orient_bin.push_back(0);
input_hog_detect.push_back(0);
input_block_norm.emplace_back(0, 0);
for(size_t i = 1; i < num_models; ++i)
{
size_t cur_num_bins = multi_hog->model(i)->info()->num_bins();
Size2D cur_cell_size = multi_hog->model(i)->info()->cell_size();
Size2D cur_block_size = multi_hog->model(i)->info()->block_size();
Size2D cur_block_stride = multi_hog->model(i)->info()->block_stride();
if((cur_num_bins != prev_num_bins) || (cur_cell_size.width != prev_cell_size.width) || (cur_cell_size.height != prev_cell_size.height))
{
prev_num_bins = cur_num_bins;
prev_cell_size = cur_cell_size;
prev_block_size = cur_block_size;
prev_block_stride = cur_block_stride;
// Compute orientation binning and block normalization kernels. Update input to process
input_orient_bin.push_back(i);
input_block_norm.emplace_back(i, input_orient_bin.size() - 1);
}
else if((cur_block_size.width != prev_block_size.width) || (cur_block_size.height != prev_block_size.height) || (cur_block_stride.width != prev_block_stride.width)
|| (cur_block_stride.height != prev_block_stride.height))
{
prev_block_size = cur_block_size;
prev_block_stride = cur_block_stride;
// Compute block normalization kernel. Update input to process
input_block_norm.emplace_back(i, input_orient_bin.size() - 1);
}
// Update input to process for hog detector kernel
input_hog_detect.push_back(input_block_norm.size() - 1);
}
_detection_windows = detection_windows;
_non_maxima_suppression = non_maxima_suppression;
_num_orient_bin_kernel = input_orient_bin.size(); // Number of CLHOGOrientationBinningKernel kernels to compute
_num_block_norm_kernel = input_block_norm.size(); // Number of CLHOGBlockNormalizationKernel kernels to compute
_num_hog_detect_kernel = input_hog_detect.size(); // Number of CLHOGDetector functions to compute
_orient_bin_kernel = arm_compute::support::cpp14::make_unique<CLHOGOrientationBinningKernel[]>(_num_orient_bin_kernel);
_block_norm_kernel = arm_compute::support::cpp14::make_unique<CLHOGBlockNormalizationKernel[]>(_num_block_norm_kernel);
_hog_detect_kernel = arm_compute::support::cpp14::make_unique<CLHOGDetector[]>(_num_hog_detect_kernel);
_non_maxima_kernel = arm_compute::support::cpp14::make_unique<CPPDetectionWindowNonMaximaSuppressionKernel>();
_hog_space = arm_compute::support::cpp14::make_unique<CLTensor[]>(_num_orient_bin_kernel);
_hog_norm_space = arm_compute::support::cpp14::make_unique<CLTensor[]>(_num_block_norm_kernel);
// Allocate tensors for magnitude and phase
TensorInfo info_mag(shape_img, Format::S16);
_mag.allocator()->init(info_mag);
TensorInfo info_phase(shape_img, Format::U8);
_phase.allocator()->init(info_phase);
// Manage intermediate buffers
_memory_group.manage(&_mag);
_memory_group.manage(&_phase);
// Initialise gradient kernel
_gradient_kernel.configure(input, &_mag, &_phase, phase_type, border_mode, constant_border_value);
// Configure NETensor for the HOG space and orientation binning kernel
for(size_t i = 0; i < _num_orient_bin_kernel; ++i)
{
const size_t idx_multi_hog = input_orient_bin[i];
// Get the corresponding cell size and number of bins
const Size2D &cell = multi_hog->model(idx_multi_hog)->info()->cell_size();
const size_t num_bins = multi_hog->model(idx_multi_hog)->info()->num_bins();
// Calculate number of cells along the x and y directions for the hog_space
const size_t num_cells_x = width / cell.width;
const size_t num_cells_y = height / cell.height;
// TensorShape of hog space
TensorShape shape_hog_space = input->info()->tensor_shape();
shape_hog_space.set(Window::DimX, num_cells_x);
shape_hog_space.set(Window::DimY, num_cells_y);
// Allocate HOG space
TensorInfo info_space(shape_hog_space, num_bins, DataType::F32);
_hog_space[i].allocator()->init(info_space);
// Manage intermediate buffers
_memory_group.manage(_hog_space.get() + i);
// Initialise orientation binning kernel
_orient_bin_kernel[i].configure(&_mag, &_phase, _hog_space.get() + i, multi_hog->model(idx_multi_hog)->info());
}
// Allocate intermediate tensors
_mag.allocator()->allocate();
_phase.allocator()->allocate();
// Configure CLTensor for the normalized HOG space and block normalization kernel
for(size_t i = 0; i < _num_block_norm_kernel; ++i)
{
const size_t idx_multi_hog = input_block_norm[i].first;
const size_t idx_orient_bin = input_block_norm[i].second;
// Allocate normalized HOG space
TensorInfo tensor_info(*(multi_hog->model(idx_multi_hog)->info()), width, height);
_hog_norm_space[i].allocator()->init(tensor_info);
// Manage intermediate buffers
_memory_group.manage(_hog_norm_space.get() + i);
// Initialize block normalization kernel
_block_norm_kernel[i].configure(_hog_space.get() + idx_orient_bin, _hog_norm_space.get() + i, multi_hog->model(idx_multi_hog)->info());
}
// Allocate intermediate tensors
for(size_t i = 0; i < _num_orient_bin_kernel; ++i)
{
_hog_space[i].allocator()->allocate();
}
detection_window_strides->map(CLScheduler::get().queue(), true);
// Configure HOG detector kernel
for(size_t i = 0; i < _num_hog_detect_kernel; ++i)
{
const size_t idx_block_norm = input_hog_detect[i];
_hog_detect_kernel[i].configure(_hog_norm_space.get() + idx_block_norm, multi_hog->cl_model(i), detection_windows, detection_window_strides->at(i), threshold, i);
}
detection_window_strides->unmap(CLScheduler::get().queue());
// Configure non maxima suppression kernel
_non_maxima_kernel->configure(_detection_windows, min_distance);
// Allocate intermediate tensors
for(size_t i = 0; i < _num_block_norm_kernel; ++i)
{
_hog_norm_space[i].allocator()->allocate();
}
}
void CLHOGMultiDetection::run()
{
ARM_COMPUTE_ERROR_ON_MSG(_detection_windows == nullptr, "Unconfigured function");
_memory_group.acquire();
// Reset detection window
_detection_windows->clear();
// Run gradient
_gradient_kernel.run();
// Run orientation binning kernel
for(size_t i = 0; i < _num_orient_bin_kernel; ++i)
{
CLScheduler::get().enqueue(*(_orient_bin_kernel.get() + i), false);
}
// Run block normalization kernel
for(size_t i = 0; i < _num_block_norm_kernel; ++i)
{
CLScheduler::get().enqueue(*(_block_norm_kernel.get() + i), false);
}
// Run HOG detector kernel
for(size_t i = 0; i < _num_hog_detect_kernel; ++i)
{
_hog_detect_kernel[i].run();
}
// Run non-maxima suppression kernel if enabled
if(_non_maxima_suppression)
{
// Map detection windows array before computing non maxima suppression
_detection_windows->map(CLScheduler::get().queue(), true);
Scheduler::get().schedule(_non_maxima_kernel.get(), Window::DimY);
_detection_windows->unmap(CLScheduler::get().queue());
}
_memory_group.release();
}
Loading...
举报
举报成功
我们将于2个工作日内通过站内信反馈结果给你!
请认真填写举报原因,尽可能描述详细。
请选择举报类型
取消
发送
误判申诉

此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。

如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。

取消
提交

简介

取消

发行版

暂无发行版

贡献者

全部

近期动态

不能加载更多了
编辑仓库简介
简介内容
主页
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/zikim/ComputeLibrary.git
git@gitee.com:zikim/ComputeLibrary.git
zikim
ComputeLibrary
ComputeLibrary
master
点此查找更多帮助

搜索帮助

评论
仓库举报
回到顶部
登录提示
该操作需登录 Gitee 帐号,请先登录后再操作。
立即登录
没有帐号,去注册

AltStyle によって変換されたページ (->オリジナル) /