What is the world's fastest connected component labeling algorithm?

Laurent Cabaret Lionel Lacassagne

Published in: SiPS (2014)

Keyphrases

times faster
learning algorithm
computational complexity
connected component labeling
objective function
k means
optimal solution
preprocessing
np hard
multi dimensional
detection algorithm
denoising
transfer function
connected components
tree structure
expectation maximization
dynamic programming
database systems