A new algorithm for the fast computation of a 2-D discrete cosine transform(DCT) is presented. It is shown that the N×N DCT
where N=2m
can be computed using only N 1-D DCT’s
as in the conventional row-column approach. Hence the total number of multiplications for the proposed algorithm is only half of that required for the row-column approach
and is also less than that of most of other fast algorithms
while the number of additions is almost comparable to that of others.
Image Dehazing Based on Gradient Guided Polarization Degree Estimation
DRHA-UIE: An Underwater Image Enhancement Method Based on Dual Residual Hybrid Attention Block
Image Harmonization Guided by Semantic Information
MalMKNet: A Multi-Scale Convolutional Neural Network Used for Malware Classification
A Review of Single-pass Connected Component Analysis Algorithms
Related Author
XU Wan-chun
ZHANG Yan
ZHANG Jing-hua
LING Feng
LI Shun
WANG Xin
SHI Hui
YANG Zi-yuan
Related Institution
National Key Laboratory of Science and Technology on Automatic Target Recognition, College of Electronic Science and Technology, National University of Defense Technology
Academy of Military Science
College of Electronic Science and Technology, National University of Defense Technology
College of Computer Science and Technology, Jilin University
School of Communication and Information Engineering, Chongqing University of Posts and Telecommunications