The Community for Technology Leaders
Green Image
Issue No. 11 - November (2011 vol. 33)
ISSN: 0162-8828
pp: 2215-2228
Rodrigo Moreno , Linköping University, Linköping and Rovira i Virgili University, Tarragona
Miguel Angel Garcia , Autonomous University of Madrid, Madrid
Domenec Puig , Rovira i Virgili University, Tarragona
Luis Pizarro , Imperial College London, London
Bernhard Burgeth , Saarland Univesity, Saarbrücken
Joachim Weickert , Saarland Univesity, Saarbrücken
This paper proposes two alternative formulations to reduce the high computational complexity of tensor voting, a robust perceptual grouping technique used to extract salient information from noisy data. The first scheme consists of numerical approximations of the votes, which have been derived from an in-depth analysis of the plate and ball voting processes. The second scheme simplifies the formulation while keeping the same perceptual meaning of the original tensor voting: The stick tensor voting and the stick component of the plate tensor voting must reinforce surfaceness, the plate components of both the plate and ball tensor voting must boost curveness, whereas junctionness must be strengthened by the ball component of the ball tensor voting. Two new parameters have been proposed for the second formulation in order to control the potentially conflictive influence of the stick component of the plate vote and the ball component of the ball vote. Results show that the proposed formulations can be used in applications where efficiency is an issue since they have a complexity of order O(1). Moreover, the second proposed formulation has been shown to be more appropriate than the original tensor voting for estimating saliencies by appropriately setting the two new parameters.
Perceptual methods, tensor voting, perceptual grouping, nonlinear approximation, curveness and junctionness propagation.

D. Puig, M. A. Garcia, R. Moreno, L. Pizarro, J. Weickert and B. Burgeth, "On Improving the Efficiency of Tensor Voting," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 33, no. , pp. 2215-2228, 2011.
93 ms
(Ver 3.3 (11022016))