You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
250 lines
9.8 KiB
250 lines
9.8 KiB
/*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) 2000-2008, Intel Corporation, all rights reserved. |
|
// Copyright (C) 2009, Willow Garage Inc., 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*/ |
|
|
|
#if !defined CUDA_DISABLER |
|
|
|
#include "opencv2/core/cuda/common.hpp" |
|
#include "opencv2/core/cuda/emulation.hpp" |
|
#include "opencv2/core/cuda/dynamic_smem.hpp" |
|
|
|
#include "opencv2/opencv_modules.hpp" |
|
|
|
#ifdef HAVE_OPENCV_CUDAFILTERS |
|
|
|
namespace cv { namespace cuda { namespace device |
|
{ |
|
namespace hough_circles |
|
{ |
|
//////////////////////////////////////////////////////////////////////// |
|
// circlesAccumCenters |
|
|
|
__global__ void circlesAccumCenters(const unsigned int* list, const int count, const PtrStepi dx, const PtrStepi dy, |
|
PtrStepi accum, const int width, const int height, const int minRadius, const int maxRadius, const float idp) |
|
{ |
|
const int SHIFT = 10; |
|
const int ONE = 1 << SHIFT; |
|
|
|
const int tid = blockIdx.x * blockDim.x + threadIdx.x; |
|
|
|
if (tid >= count) |
|
return; |
|
|
|
const unsigned int val = list[tid]; |
|
|
|
const int x = (val & 0xFFFF); |
|
const int y = (val >> 16) & 0xFFFF; |
|
|
|
const int vx = dx(y, x); |
|
const int vy = dy(y, x); |
|
|
|
if (vx == 0 && vy == 0) |
|
return; |
|
|
|
const float mag = ::sqrtf(vx * vx + vy * vy); |
|
|
|
const int x0 = __float2int_rn((x * idp) * ONE); |
|
const int y0 = __float2int_rn((y * idp) * ONE); |
|
|
|
int sx = __float2int_rn((vx * idp) * ONE / mag); |
|
int sy = __float2int_rn((vy * idp) * ONE / mag); |
|
|
|
// Step from minRadius to maxRadius in both directions of the gradient |
|
for (int k1 = 0; k1 < 2; ++k1) |
|
{ |
|
int x1 = x0 + minRadius * sx; |
|
int y1 = y0 + minRadius * sy; |
|
|
|
for (int r = minRadius; r <= maxRadius; x1 += sx, y1 += sy, ++r) |
|
{ |
|
const int x2 = x1 >> SHIFT; |
|
const int y2 = y1 >> SHIFT; |
|
|
|
if (x2 < 0 || x2 >= width || y2 < 0 || y2 >= height) |
|
break; |
|
|
|
::atomicAdd(accum.ptr(y2 + 1) + x2 + 1, 1); |
|
} |
|
|
|
sx = -sx; |
|
sy = -sy; |
|
} |
|
} |
|
|
|
void circlesAccumCenters_gpu(const unsigned int* list, int count, PtrStepi dx, PtrStepi dy, PtrStepSzi accum, int minRadius, int maxRadius, float idp, cudaStream_t stream) |
|
{ |
|
const dim3 block(256); |
|
const dim3 grid(divUp(count, block.x)); |
|
|
|
cudaSafeCall( cudaFuncSetCacheConfig(circlesAccumCenters, cudaFuncCachePreferL1) ); |
|
|
|
circlesAccumCenters<<<grid, block, 0, stream>>>(list, count, dx, dy, accum, accum.cols - 2, accum.rows - 2, minRadius, maxRadius, idp); |
|
cudaSafeCall( cudaGetLastError() ); |
|
|
|
cudaSafeCall( cudaStreamSynchronize(stream) ); |
|
} |
|
|
|
//////////////////////////////////////////////////////////////////////// |
|
// buildCentersList |
|
__global__ void buildCentersList(const PtrStepSzi accum, unsigned int* centers, const int threshold, int* counterPtr) |
|
{ |
|
const int x = blockIdx.x * blockDim.x + threadIdx.x; |
|
const int y = blockIdx.y * blockDim.y + threadIdx.y; |
|
|
|
if (x < accum.cols - 2 && y < accum.rows - 2) |
|
{ |
|
const int top = accum(y, x + 1); |
|
|
|
const int left = accum(y + 1, x); |
|
const int cur = accum(y + 1, x + 1); |
|
const int right = accum(y + 1, x + 2); |
|
|
|
const int bottom = accum(y + 2, x + 1); |
|
|
|
if (cur > threshold && cur > top && cur >= bottom && cur > left && cur >= right) |
|
{ |
|
const unsigned int val = (y << 16) | x; |
|
const int idx = ::atomicAdd(counterPtr, 1); |
|
centers[idx] = val; |
|
} |
|
} |
|
} |
|
|
|
int buildCentersList_gpu(PtrStepSzi accum, unsigned int* centers, int threshold, int* counterPtr, cudaStream_t stream) |
|
{ |
|
cudaSafeCall( cudaMemsetAsync(counterPtr, 0, sizeof(int), stream) ); |
|
|
|
const dim3 block(32, 8); |
|
const dim3 grid(divUp(accum.cols - 2, block.x), divUp(accum.rows - 2, block.y)); |
|
|
|
cudaSafeCall( cudaFuncSetCacheConfig(buildCentersList, cudaFuncCachePreferL1) ); |
|
|
|
buildCentersList<<<grid, block, 0, stream>>>(accum, centers, threshold, counterPtr); |
|
cudaSafeCall( cudaGetLastError() ); |
|
|
|
int totalCount; |
|
cudaSafeCall( cudaMemcpyAsync(&totalCount, counterPtr, sizeof(int), cudaMemcpyDeviceToHost, stream) ); |
|
cudaSafeCall( cudaStreamSynchronize(stream) ); |
|
|
|
return totalCount; |
|
} |
|
|
|
//////////////////////////////////////////////////////////////////////// |
|
// circlesAccumRadius |
|
|
|
__global__ void circlesAccumRadius(const unsigned int* centers, const unsigned int* list, const int count, |
|
float3* circles, const int maxCircles, const float dp, |
|
const int minRadius, const int maxRadius, const int histSize, const int threshold, |
|
int* counterPtr) |
|
{ |
|
int* smem = DynamicSharedMem<int>(); |
|
|
|
for (int i = threadIdx.x; i < histSize + 2; i += blockDim.x) |
|
smem[i] = 0; |
|
__syncthreads(); |
|
|
|
unsigned int val = centers[blockIdx.x]; |
|
|
|
float cx = (val & 0xFFFF); |
|
float cy = (val >> 16) & 0xFFFF; |
|
|
|
cx = (cx + 0.5f) * dp; |
|
cy = (cy + 0.5f) * dp; |
|
|
|
for (int i = threadIdx.x; i < count; i += blockDim.x) |
|
{ |
|
val = list[i]; |
|
|
|
const int x = (val & 0xFFFF); |
|
const int y = (val >> 16) & 0xFFFF; |
|
|
|
const float rad = ::sqrtf((cx - x) * (cx - x) + (cy - y) * (cy - y)); |
|
if (rad >= minRadius && rad <= maxRadius) |
|
{ |
|
const int r = __float2int_rn(rad - minRadius); |
|
|
|
Emulation::smem::atomicAdd(&smem[r + 1], 1); |
|
} |
|
} |
|
|
|
__syncthreads(); |
|
|
|
for (int i = threadIdx.x; i < histSize; i += blockDim.x) |
|
{ |
|
const int curVotes = smem[i + 1]; |
|
|
|
if (curVotes >= threshold && curVotes > smem[i] && curVotes >= smem[i + 2]) |
|
{ |
|
const int ind = ::atomicAdd(counterPtr, 1); |
|
if (ind < maxCircles) |
|
circles[ind] = make_float3(cx, cy, i + minRadius); |
|
} |
|
} |
|
} |
|
|
|
int circlesAccumRadius_gpu(const unsigned int* centers, int centersCount, const unsigned int* list, int count, |
|
float3* circles, int maxCircles, float dp, int minRadius, int maxRadius, int threshold, bool has20, int* counterPtr, cudaStream_t stream) |
|
{ |
|
cudaSafeCall( cudaMemsetAsync(counterPtr, 0, sizeof(int), stream) ); |
|
|
|
const dim3 block(has20 ? 1024 : 512); |
|
const dim3 grid(centersCount); |
|
|
|
const int histSize = maxRadius - minRadius + 1; |
|
size_t smemSize = (histSize + 2) * sizeof(int); |
|
|
|
circlesAccumRadius<<<grid, block, smemSize, stream>>>(centers, list, count, circles, maxCircles, dp, minRadius, maxRadius, histSize, threshold, counterPtr); |
|
cudaSafeCall( cudaGetLastError() ); |
|
|
|
int totalCount; |
|
cudaSafeCall( cudaMemcpyAsync(&totalCount, counterPtr, sizeof(int), cudaMemcpyDeviceToHost, stream) ); |
|
cudaSafeCall( cudaStreamSynchronize(stream) ); |
|
|
|
totalCount = std::min(totalCount, maxCircles); |
|
|
|
return totalCount; |
|
} |
|
} |
|
}}} |
|
|
|
#endif // HAVE_OPENCV_CUDAFILTERS |
|
|
|
#endif /* CUDA_DISABLER */
|
|
|