Parallelizations of an Inpainting Algorithm Based on Convex Feasibility.
Liviu Octavian Mafteiu-ScaiIrina Maria ArtinescuVlad Mafteiu-ScaiPublished in: SYNASC (2018)
Keyphrases
- learning algorithm
- preprocessing
- worst case
- cost function
- recognition algorithm
- experimental evaluation
- globally optimal
- detection algorithm
- high accuracy
- significant improvement
- optimal solution
- computational cost
- times faster
- dynamic programming
- k means
- segmentation algorithm
- search space
- matching algorithm
- tree structure
- convex hull
- convergence rate
- piecewise linear
- decision trees