parent
ec353dbdda
commit
2124361ff7
5 changed files with 187 additions and 56 deletions
@ -1,62 +1,79 @@ |
|||||||
/************************************************************************************* |
/*M/////////////////////////////////////////////////////////////////////////////////////// |
||||||
* Copyright (c) 2015, Advanced Micro Devices, Inc. |
// |
||||||
* All rights reserved. |
// IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING. |
||||||
* |
// |
||||||
* Redistribution and use in source and binary forms, with or without modification, |
// By downloading, copying, installing or using the software you agree to this license. |
||||||
* are permitted provided that the following conditions are met: |
// If you do not agree to this license, do not download, install, |
||||||
* |
// copy or use the software. |
||||||
* 1. Redistributions of source code must retain the above copyright notice, this |
// |
||||||
* list of conditions and the following disclaimer. |
// |
||||||
* |
// License Agreement |
||||||
* 2. Redistributions in binary form must reproduce the above copyright notice, |
// For Open Source Computer Vision Library |
||||||
* this list of conditions and the following disclaimer in the documentation and/or |
// |
||||||
* other materials provided with the distribution. |
// Copyright (C) 2017, Intel Corporation, all rights reserved. |
||||||
* |
// Copyright (c) 2016-2017 Fabian David Tschopp, all rights reserved. |
||||||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND |
// Third party copyrights are property of their respective owners. |
||||||
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
// |
||||||
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
// Redistribution and use in source and binary forms, with or without modification, |
||||||
* IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, |
// are permitted provided that the following conditions are met: |
||||||
* INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, |
// |
||||||
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, |
// * Redistribution's of source code must retain the above copyright notice, |
||||||
* OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, |
// this list of conditions and the following disclaimer. |
||||||
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
// |
||||||
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
// * Redistribution's in binary form must reproduce the above copyright notice, |
||||||
* POSSIBILITY OF SUCH DAMAGE. |
// this list of conditions and the following disclaimer in the documentation |
||||||
**************************************************************************************/ |
// and/or other materials provided with the distribution. |
||||||
|
// |
||||||
|
// * The name of the copyright holders may not be used to endorse or promote products |
||||||
|
// derived from this software without specific prior written permission. |
||||||
|
// |
||||||
|
// This software is provided by the copyright holders and contributors "as is" and |
||||||
|
// any express or implied warranties, including, but not limited to, the implied |
||||||
|
// warranties of merchantability and fitness for a particular purpose are disclaimed. |
||||||
|
// In no event shall the Intel Corporation or contributors be liable for any direct, |
||||||
|
// indirect, incidental, special, exemplary, or consequential damages |
||||||
|
// (including, but not limited to, procurement of substitute goods or services; |
||||||
|
// loss of use, data, or profits; or business interruption) however caused |
||||||
|
// and on any theory of liability, whether in contract, strict liability, |
||||||
|
// or tort (including negligence or otherwise) arising in any way out of |
||||||
|
// the use of this software, even if advised of the possibility of such damage. |
||||||
|
// |
||||||
|
//M*/ |
||||||
|
|
||||||
__kernel void col2im(const int n, __global const T* data_col, const int col_offset, |
__kernel void col2im(const int n, __global const T* data_col, |
||||||
const int height, const int width, const int channels, |
const int data_col_offset, |
||||||
const int patch_h, const int patch_w, |
const int channels, |
||||||
const int pad_h, const int pad_w, |
const int height, const int width, |
||||||
const int stride_h, const int stride_w, |
const int height_col, const int width_col, |
||||||
const int height_col, const int width_col, |
const int coeff_h, const int coeff_w, |
||||||
__global T* data_im, const int img_offset) |
__global const T* biasvec, |
||||||
|
const int bias_offset, |
||||||
|
__global T* data_im, |
||||||
|
const int data_im_offset) |
||||||
{ |
{ |
||||||
data_col = data_col + col_offset; |
data_col = data_col + data_col_offset; |
||||||
data_im = data_im + img_offset; |
biasvec = biasvec + bias_offset; |
||||||
int index = get_global_id(0); |
data_im = data_im + data_im_offset; |
||||||
if(index < n) { |
int index = get_global_id(0); |
||||||
T val = 0; |
|
||||||
int w = index % width + pad_w; |
|
||||||
int h = (index / width) % height + pad_h; |
|
||||||
int c = index / (width * height); |
|
||||||
|
|
||||||
// compute the start and end of the output |
if(index < n) |
||||||
int w_col_start = (w < patch_w) ? 0 : (w - patch_w) / stride_w + 1; |
{ |
||||||
int w_col_end = min(w / stride_w + 1, width_col); |
T val = 0.f; |
||||||
int h_col_start = (h < patch_h) ? 0 : (h - patch_h) / stride_h + 1; |
int w = index % width + PAD_W; |
||||||
int h_col_end = min(h / stride_h + 1, height_col); |
int h = (index / width) % height + PAD_H; |
||||||
|
int c = index / (width * height); |
||||||
|
int h_col_start = (h < KERNEL_H) ? 0 : (h - KERNEL_H) / STRIDE_H + 1; |
||||||
|
int h_col_end = min(h / STRIDE_H + 1, height_col); |
||||||
|
int plane_size_col = height_col * width_col; |
||||||
|
int offset = (c * KERNEL_H * KERNEL_W + h * KERNEL_W + w) * plane_size_col; |
||||||
|
|
||||||
// equivalent implementation |
int w_col_start = (w < KERNEL_W) ? 0 : (w - KERNEL_W) / STRIDE_W + 1; |
||||||
int offset = |
int w_col_end = min(w / STRIDE_W + 1, width_col); |
||||||
(c * patch_h * patch_w + h * patch_w + w) * height_col * width_col; |
|
||||||
int coeff_h_col = (1 - stride_h * patch_w * height_col) * width_col; |
for (int h_col = h_col_start; h_col < h_col_end; ++h_col) |
||||||
int coeff_w_col = (1 - stride_w * height_col * width_col); |
for (int w_col = w_col_start; w_col < w_col_end; ++w_col) |
||||||
for (int h_col = h_col_start; h_col < h_col_end; ++h_col) { |
val += data_col[offset + h_col * coeff_h + w_col * coeff_w]; |
||||||
for (int w_col = w_col_start; w_col < w_col_end; ++w_col) { |
|
||||||
val += data_col[offset + h_col * coeff_h_col + w_col * coeff_w_col]; |
data_im[index] = val + biasvec[c]; |
||||||
} |
|
||||||
} |
} |
||||||
data_im[index] = val; |
|
||||||
} |
|
||||||
} |
} |
||||||
|
Loading…
Reference in new issue