An effective and efficient approximate two-dimensional dynamic programming algorithm for supporting advanced computer vision applications

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of visual languages and computing Ročník 42; s. 13 - 22
Hlavní autoři: Cuzzocrea, Alfredo, Mumolo, Enzo, Grasso, Giorgio Mario, Vercelli, Gianni
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Ltd 01.10.2017
Témata:
Computer vision
CUDA platform
Intelligent systems
Two-dimensional dynamic programming
Computer vision
CUDA platform
Two-dimensional dynamic programming
Intelligent systems
ISSN:1045-926X, 1095-8533
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISSN:1045-926X
1095-8533
DOI:10.1016/j.jvlc.2017.07.002