Variable Latency Goldschmidt Algorithm Based on a New Rounding Method and a Remainder Estimate.
Daniel Piso FernandezJavier D. BrugueraPublished in: IEEE Trans. Computers (2011)
Keyphrases
- preprocessing
- estimation algorithm
- dynamic programming
- cost function
- high accuracy
- detection method
- computational cost
- experimental evaluation
- optimization algorithm
- high efficiency
- recognition algorithm
- clustering method
- improved algorithm
- significant improvement
- detection algorithm
- objective function
- computational complexity
- single pass
- optimization method
- theoretical analysis
- matching algorithm
- learning algorithm
- synthetic and real images
- computationally efficient
- segmentation method
- segmentation algorithm
- energy function
- k means
- similarity measure
- tree structure
- reconstruction method
- image matching
- computational efficiency
- mathematical model
- probabilistic model
- classification algorithm
- selection algorithm
- input data
- region of interest
- prior information
- optimal solution
- parameter estimation
- convergence rate
- initial estimates
- classification method
- support vector machine svm
- linear programming
- pairwise
- approximation algorithms
- em algorithm
- expectation maximization
- highly efficient
- simulated annealing
- worst case
- np hard
- search space
- estimation process
- maximum likelihood estimator
- feature selection