A sequential algorithm for the universal coding of finite memory sources.
Marcelo J. WeinbergerAbraham LempelJacob ZivPublished in: IEEE Trans. Inf. Theory (1992)
Keyphrases
- dynamic programming
- cost function
- significant improvement
- preprocessing
- memory requirements
- computational cost
- memory usage
- theoretical analysis
- computational complexity
- optimal solution
- objective function
- memory space
- experimental evaluation
- times faster
- worst case
- optimization algorithm
- convex hull
- probabilistic model
- recognition algorithm
- detection algorithm
- segmentation algorithm
- selection algorithm
- simulated annealing
- high accuracy
- search algorithm
- learning algorithm
- parallel version
- clustering method
- computationally efficient
- image quality
- np hard
- similarity measure