Since the hough array is 3 dimensional, would the time complexity be abr?
mpotoole
Complexity will be at least abr, since this is the time required to construct and initialize the actual accumulator array. The cost in practice can be higher, as it depends on the number of features in an image. For every feature (e.g., edge) in an image, we have to increment all of the accumulator's voxels that intersect a (truncated) cone---the surface shape shown in the slide. So in short, the cost of a 3D Hough transform is the product between the number of features in an image, and the number of voxels intersected by a cone.
Since the hough array is 3 dimensional, would the time complexity be abr?
Complexity will be at least abr, since this is the time required to construct and initialize the actual accumulator array. The cost in practice can be higher, as it depends on the number of features in an image. For every feature (e.g., edge) in an image, we have to increment all of the accumulator's voxels that intersect a (truncated) cone---the surface shape shown in the slide. So in short, the cost of a 3D Hough transform is the product between the number of features in an image, and the number of voxels intersected by a cone.