2011
DOI: 10.1109/tpami.2011.23
|View full text |Cite
|
Sign up to set email alerts
|

On Improving the Efficiency of Tensor Voting

Abstract: Abstract-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… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
44
0

Year Published

2012
2012
2018
2018

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 24 publications
(44 citation statements)
references
References 18 publications
0
44
0
Order By: Relevance
“…Different modifications have been proposed to tackle the time complexity of TV. Generally, most of these propositions try to find a closed solution for the problem [58], which was proven incorrect in [59], or optimizing the calculations of the plate and ball voting fields as the most time consuming parts of TV [56]. Therefore, applying TV to road gap filling requires further purpose-dependent customization.…”
Section: Tensor Votingmentioning
confidence: 99%
“…Different modifications have been proposed to tackle the time complexity of TV. Generally, most of these propositions try to find a closed solution for the problem [58], which was proven incorrect in [59], or optimizing the calculations of the plate and ball voting fields as the most time consuming parts of TV [56]. Therefore, applying TV to road gap filling requires further purpose-dependent customization.…”
Section: Tensor Votingmentioning
confidence: 99%
“…A common approach is to define each voxel in the image as a token, and to assign a ball-shaped tensor, i.e no preferred initial orientation, to each of the tokens [14]. In our case, we make use of a priori information obtained from the analysis of the Hessian matrix to 1) reduce the number of tokens to be processed and 2) initialise each token with a first estimation of its orientation.…”
Section: Methodsmentioning
confidence: 99%
“…Votes are combined at every token to infer the type of structure going through it. More formally, the tensor voting at p is given by [14]:…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…This is highly relevant considering that over fifteen years passed from the original publication of the technique, and there had been no success at finding a closedform solution to the problem. A number of reformulations have also been recently presented [2], [4], [5], though none of them features the simplicity of CFTV nor provides an analytic general solution.…”
Section: Introductionmentioning
confidence: 99%