An efficient CUDA-based approximate two-dimensional dynamic programming algorithm for advanced computer vision applications

2016 ◽  
Author(s):  
Alfredo Cuzzocrea ◽  
Enzo Mumolo ◽  
Daniel Pirro ◽  
Gianni Vercelli
Keyword(s):  
Computer Vision ◽  
Dynamic Programming ◽  
Dynamic Programming Algorithm ◽  
Programming Algorithm ◽  
Two Dimensional ◽  
Computer Vision Applications ◽  
Advanced Computer

scholarly journals An improved heuristic-dynamic programming algorithm for rectangular cutting problem

2020 ◽  
Vol 17 (3) ◽  
pp. 717-735
Author(s):  
Aihua Yin ◽  
Chong Chen ◽  
Dongping Hu ◽  
Jianghai Huang ◽  
Fan Yang
Keyword(s):  
Dynamic Programming ◽  
Dynamic Programming Algorithm ◽  
Optimal Solution ◽  
Computation Time ◽  
Programming Algorithm ◽  
Recursive Method ◽  
Two Dimensional ◽  
One Dimensional ◽  
Block Width ◽  
Cutting Problem

In this paper, the two-dimensional cutting problem with defects is discussed. The objective is to cut some rectangles in a given shape and direction without overlapping the defects from the rectangular plate and maximize some profit associated. An Improved Heuristic-Dynamic Program (IHDP) is presented to solve the problem. In this algorithm, the discrete set contains not only the solution of one-dimensional knapsack problem with small rectangular block width and height, but also the cutting positions of one unit outside four boundaries of each defect. In addition, the denormalization recursive method is used to further decompose the sub problem with defects. The algorithm computes thousands of typical instances. The computational experimental results show that IHDP obtains most of the optimal solution of these instances, and its computation time is less than that of the latest literature algorithms.

Sign in / Sign up

Export Citation Format

Share Document