Parallelization of discrete cosine transform in shape from focus

Malik, A.S. and Humayun, J. (2013) Parallelization of discrete cosine transform in shape from focus. Advanced Science Letters, 19 (5). pp. 1459-1462. ISSN 19366612

Full text not available from this repository.
Official URL: https://www.scopus.com/inward/record.uri?eid=2-s2....

Abstract

Increased number of frames and computational complexity of focus measure causes Shape From Focus (SFF) method to become memory hungry and time consuming technique. These factors become limitation for SFF techniques to be used in fast and real time applications. However, computational time can be reduced significantly with parallel implementation of these methods on multiple cores. In this article, focus has been measured through Discrete Cosine Transform (DCT) and speedup performance has been tested at different number of cores; as a result of which one can easily decide about the optimal number of cores required for SFF application. © 2013 American Scientific Publishers All rights reserved. All rights reserved.

Item Type: Article
Additional Information: cited By 5
Depositing User: Mr Ahmad Suhairi UTP
Date Deposited: 09 Nov 2023 15:51
Last Modified: 09 Nov 2023 15:51
URI: https://khub.utp.edu.my/scholars/id/eprint/3648

Actions (login required)

View Item
View Item