An efficient algorithm for finding multiple DC solutions based on Spice oriented Newton homotopy method.
Akio UshidaYoshihiro YamagamiIkkei KinouchiYoshifumi NishioYasuaki InouePublished in: ISCAS (5) (2001)
Keyphrases
- dynamic programming
- high accuracy
- detection algorithm
- improved algorithm
- method finds
- computational complexity
- computational cost
- preprocessing
- computationally efficient
- cost function
- detection method
- theoretical analysis
- global solution
- experimental evaluation
- clustering method
- significant improvement
- optimization algorithm
- optimization method
- synthetic and real images
- optimal solution
- energy function
- highly efficient
- computational efficiency
- tree structure
- mathematical model
- matching algorithm
- selection algorithm
- estimation algorithm
- heuristic methods
- objective function
- support vector machine svm
- classification algorithm
- k means
- learning algorithm
- dc programming
- recognition algorithm
- multiple models
- similarity measure
- input data
- expectation maximization
- em algorithm
- segmentation algorithm
- combinatorial optimization
- linear programming
- iterative algorithms
- classification method
- benchmark problems
- probabilistic model
- newton method
- decision trees
- metaheuristic
- graph cuts
- segmentation method
- convex functions
- levenberg marquardt
- solution space
- convergence rate
- regularized least squares