hh.sePublikasjoner
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Parallelization of the Estimation Algorithm of the 3D Structure Tensor
Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).ORCID-id: 0000-0002-4932-4036
Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).ORCID-id: 0000-0001-6625-6533
2012 (engelsk)Inngår i: 2012 International Conference on Reconfigurable Computing and FPGAs, ReConFig 2012 / [ed] Peter Athanas, René Cumplido & Eduardo de la Torre, Piscataway, N.J.: IEEE Press, 2012, artikkel-id 6416771Konferansepaper, Poster (with or without abstract) (Fagfellevurdert)
Abstract [en]

The three dimensional structure tensor algorithm (3D-STA) is often used in image processing applications to compute the optical flow or to detect local 3D structures and their directions. This algorithm is computationally expensive due to many computations that are required to calculate the gradient, the tensor, and to smooth every pixel of the image frames. Therefore, it is important to parallelize the implementation to achieve high performance. In this paper we present two parallel implementations of 3D-STA; namely moderately parallelized and highly parallelized implementation, on a massively parallel reconfigurable array. Finally, we evaluate the performance of the generated code and results are compared with another optical flow implementation. The throughput achieved by the moderately parallelized implementation is approximately half of the throughput of the Optical flow implementation, whereas the highly parallelized implementation results in a 2x gain in throughput as compared to the optical flow implementation. © 2012 IEEE.

sted, utgiver, år, opplag, sider
Piscataway, N.J.: IEEE Press, 2012. artikkel-id 6416771
HSV kategori
Identifikatorer
URN: urn:nbn:se:hh:diva-19979DOI: 10.1109/ReConFig.2012.6416771ISI: 000316576900052Scopus ID: 2-s2.0-84874155878ISBN: 978-1-4673-2919-4 (tryckt)ISBN: 978-1-4673-2921-7 (tryckt)OAI: oai:DiVA.org:hh-19979DiVA, id: diva2:567702
Konferanse
International Conference on Reconfigurable Computing and FPGAs (ReConFig’12), Cancun, Mexico, December 5-7, 2012
Tilgjengelig fra: 2012-12-19 Laget: 2012-11-13 Sist oppdatert: 2018-03-22bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Alam, AshrafulUl-Abdin, ZainSvensson, Bertil

Søk i DiVA

Av forfatter/redaktør
Alam, AshrafulUl-Abdin, ZainSvensson, Bertil
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 1420 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf