Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4968148 | Journal of Visual Languages & Computing | 2017 | 10 Pages |
Abstract
Dynamic programming is a popular optimization technique, developed in the 60's and still widely used today in several fields for its ability to find global optimum. Dynamic Programming Algorithms (DPAs) can be developed in many dimension. However, it is known that if the DPA dimension is greater or equal to two, the algorithm is an NP complete problem. In this paper we present an approximation of the fully two-dimensional DPA (2D-DPA) with polynomial complexity. Then, we describe an implementation of the algorithm on a recent parallel device based on CUDA architecture. We show that our parallel implementation presents a speed-up of about 25 with respect to a sequential implementation on an Intel I7 CPU. In particular, our system allows a speed of about ten 2D-DPA executions per second for 85â¯Ãâ¯85 pixels images. Experiments and case studies support our thesis.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science Applications
Authors
Alfredo Cuzzocrea, Enzo Mumolo, Giorgio Mario Grasso, Gianni Vercelli,