On the Recursions of Robust COMET Algorithm for Convexly Structured Shape Matrix.
Bruno MériauxChengfang RenArnaud BreloyMohammed Nabil El KorsoPhilippe ForsterJean Philippe OvarlezPublished in: EUSIPCO (2019)
Keyphrases
- detection algorithm
- np hard
- computationally efficient
- preprocessing
- dynamic programming
- learning algorithm
- convergence rate
- parameter tuning
- computational cost
- neural network
- worst case
- simulated annealing
- optimal solution
- cost function
- optimization algorithm
- matching algorithm
- probabilistic model
- shortest path
- geodesic distance
- segmentation algorithm
- k means
- objective function
- similarity measure
- genetic algorithm