mirror of
https://github.com/opencv/opencv.git
synced 2025-01-11 06:48:19 +08:00
142 lines
5.1 KiB
C++
142 lines
5.1 KiB
C++
|
/*M///////////////////////////////////////////////////////////////////////////////////////
|
||
|
//
|
||
|
// IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
|
||
|
//
|
||
|
// By downloading, copying, installing or using the software you agree to this license.
|
||
|
// If you do not agree to this license, do not download, install,
|
||
|
// copy or use the software.
|
||
|
//
|
||
|
//
|
||
|
// License Agreement
|
||
|
// For Open Source Computer Vision Library
|
||
|
//
|
||
|
// Copyright (C) 2013, OpenCV Foundation, all rights reserved.
|
||
|
// Third party copyrights are property of their respective owners.
|
||
|
//
|
||
|
// Redistribution and use in source and binary forms, with or without modification,
|
||
|
// are permitted provided that the following conditions are met:
|
||
|
//
|
||
|
// * Redistribution's of source code must retain the above copyright notice,
|
||
|
// this list of conditions and the following disclaimer.
|
||
|
//
|
||
|
// * Redistribution's in binary form must reproduce the above copyright notice,
|
||
|
// 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*/
|
||
|
|
||
|
#include "../precomp.hpp"
|
||
|
#include "layers_common.hpp"
|
||
|
#include "op_halide.hpp"
|
||
|
|
||
|
namespace cv
|
||
|
{
|
||
|
namespace dnn
|
||
|
{
|
||
|
|
||
|
class ConcatLayerImpl : public ConcatLayer
|
||
|
{
|
||
|
public:
|
||
|
ConcatLayerImpl(const LayerParams& params)
|
||
|
{
|
||
|
setParamsFrom(params);
|
||
|
axis = params.get<int>("axis", 1);
|
||
|
}
|
||
|
|
||
|
virtual bool getMemoryShapes(const std::vector<MatShape> &inputs,
|
||
|
const int requiredOutputs,
|
||
|
std::vector<MatShape> &outputs,
|
||
|
std::vector<MatShape> &internals) const
|
||
|
{
|
||
|
CV_Assert(inputs.size() > 0);
|
||
|
outputs.clear();
|
||
|
outputs.push_back(inputs[0]);
|
||
|
int cAxis = clamp(axis, inputs[0]);
|
||
|
|
||
|
int axisSum = 0;
|
||
|
for (size_t i = 0; i < inputs.size(); i++)
|
||
|
{
|
||
|
MatShape curShape = inputs[i];
|
||
|
|
||
|
CV_Assert(curShape.size() == outputs.back().size());
|
||
|
for (int curAxis = 0; curAxis < outputs.back().size(); curAxis++)
|
||
|
{
|
||
|
if (curAxis != cAxis && outputs.back()[curAxis] != curShape[curAxis])
|
||
|
CV_Error(Error::StsBadSize, "Inconsitent shape for ConcatLayer");
|
||
|
}
|
||
|
|
||
|
axisSum += curShape[cAxis];
|
||
|
}
|
||
|
|
||
|
outputs.back()[cAxis] = axisSum;
|
||
|
|
||
|
return false;
|
||
|
}
|
||
|
|
||
|
virtual bool supportBackend(int backendId)
|
||
|
{
|
||
|
return backendId == DNN_BACKEND_DEFAULT ||
|
||
|
backendId == DNN_BACKEND_HALIDE && haveHalide() && axis == 1; // By channels
|
||
|
}
|
||
|
|
||
|
void forward(std::vector<Mat*> &inputs, std::vector<Mat> &outputs, std::vector<Mat> &internals)
|
||
|
{
|
||
|
int cAxis = clamp(axis, inputs[0]->dims);
|
||
|
Mat& outMat = outputs[0];
|
||
|
std::vector<Range> ranges(outputs[0].dims, Range::all());
|
||
|
|
||
|
ranges[cAxis].start = 0;
|
||
|
for (size_t i = 0; i < inputs.size(); i++)
|
||
|
{
|
||
|
ranges[cAxis].end = ranges[cAxis].start + inputs[i]->size[cAxis];
|
||
|
inputs[i]->copyTo(outMat(&ranges[0]));
|
||
|
ranges[cAxis].start = ranges[cAxis].end;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
virtual Ptr<BackendNode> initHalide(const std::vector<Ptr<BackendWrapper> > &input)
|
||
|
{
|
||
|
#ifdef HAVE_HALIDE
|
||
|
std::vector<Halide::Buffer<> > inputBuffers = halideBuffers(input);
|
||
|
|
||
|
Halide::Var x("x"), y("y"), c("c"), n("n");
|
||
|
Halide::Func top = (name.empty() ? Halide::Func() : Halide::Func(name));
|
||
|
int offset = inputBuffers[0].channels();
|
||
|
Halide::Expr topExpr = select(c < offset,
|
||
|
inputBuffers[0](x, y, c, n),
|
||
|
inputBuffers[1](x, y, c - offset, n));
|
||
|
for (int i = 2; i < input.size(); ++i)
|
||
|
{
|
||
|
offset += inputBuffers[i - 1].channels();
|
||
|
topExpr = select(c < offset, topExpr,
|
||
|
inputBuffers[i](x, y, c - offset, n));
|
||
|
}
|
||
|
top(x, y, c, n) = topExpr;
|
||
|
return Ptr<BackendNode>(new HalideBackendNode(top));
|
||
|
#endif // HAVE_HALIDE
|
||
|
return Ptr<BackendNode>();
|
||
|
}
|
||
|
};
|
||
|
|
||
|
Ptr<ConcatLayer> ConcatLayer::create(const LayerParams& params)
|
||
|
{
|
||
|
return Ptr<ConcatLayer>(new ConcatLayerImpl(params));
|
||
|
}
|
||
|
|
||
|
}
|
||
|
}
|