An algorithm for canonical forms of finite subsets of $\mathbb{Z}^d$ up to affinities.
Giovanni PaoliniPublished in: CoRR (2014)
Keyphrases
- preprocessing
- optimal solution
- expectation maximization
- high accuracy
- learning algorithm
- single pass
- computationally efficient
- computational complexity
- times faster
- improved algorithm
- experimental evaluation
- np hard
- markov random field
- computational cost
- k means
- search space
- objective function
- memory requirements
- worst case
- convergence rate
- estimation algorithm
- tree structure
- segmentation algorithm
- theoretical analysis
- linear programming
- dynamic programming
- special case
- significant improvement
- pairwise
- similarity measure