wta.cl File Reference

Macros
#define	at2(arr, x, y, width)   arr[x * width + y]
#define	at3(arr, x, y, z, depth, width)   arr[x * depth * width + y * depth + z]

Functions
__kernel void	winner_takes_all (__global float *datacost, __global uchar *dispFinal, int width, int height, int dispRange, int dispScale)

Macro Definition Documentation

at2

#define at2	(		arr,
			x,
			y,
			width
	)		arr[x * width + y]

at3

#define at3	(		arr,
			x,
			y,
			z,
			depth,
			width
	)		arr[x * depth * width + y * depth + z]

Function Documentation

winner_takes_all()

__kernel void winner_takes_all	(	__global float *	datacost,
		__global uchar *	dispFinal,
		int	width,
		int	height,
		int	dispRange,
		int	dispScale
	)

Find the minimum cost for each pixel using winner takes all algorithm

Parameters

datacost	The Sobel filtered left image
dispFinal	The disparity result
width	The image width
height	The image height
dispRange	The stereo disparity search range
dispScale	The scaling factor so disparity is within 0-256 pixel value