An Efficient Combinatorial Algorithm for Optimal Compression of a Polyline with Segments and Arcs.
Alexander GribovPublished in: GREC@ICDAR (2017)
Keyphrases
- worst case
- dynamic programming
- experimental evaluation
- optimal solution
- learning algorithm
- k means
- np hard
- cost function
- recognition algorithm
- computational cost
- search space
- preprocessing
- objective function
- detection algorithm
- convex hull
- equal length
- matching algorithm
- optimization algorithm
- high accuracy
- similarity measure
- optimal parameters
- arithmetic coding
- operating point
- locally optimal
- simulated annealing
- weighting coefficients
- exhaustive search
- compression scheme
- convergence rate
- closed form
- hough transform
- probabilistic model
- feature selection