Algorithm 376: Least squares fit by f(x) = A cos(Bx+C [E2].
Helmuth SpäthPublished in: Commun. ACM (1970)
Keyphrases
- least squares
- experimental evaluation
- dynamic programming
- learning algorithm
- significant improvement
- theoretical analysis
- convex hull
- times faster
- search space
- np hard
- linear programming
- levenberg marquardt
- improved algorithm
- monte carlo
- detection algorithm
- probabilistic model
- k means
- optimal solution
- expectation maximization
- high accuracy
- segmentation algorithm
- parameter estimation
- optimization algorithm
- association rules
- convergence rate
- recognition algorithm
- objective function
- computer vision