PROJECT TITLE :
Efficient Encrypted Images Filtering and Transform Coding With Walsh-Hadamard Transform and Parallelization - 2018
Since homomorphic encryption operations have high computational complexity, image applications based mostly on homomorphic encryption are usually time consuming, which makes them impractical. In this Project, we tend to study economical encrypted image applications with the encrypted domain Walsh-Hadamard transform (WHT) and parallel algorithms. We tend to first gift methods to implement real and complicated WHTs within the encrypted domain. We tend to then propose a parallel algorithm to improve the computational efficiency of the encrypted domain WHT. To compare the WHT with the discrete cosine remodel (DCT), integer DCT, and Haar remodel in the encrypted domain, we conduct theoretical analysis and experimental verification, that reveal that the encrypted domain WHT has the benefits of lower computational complexity and a shorter running time. Our analysis shows that the encrypted WHT will accommodate plaintext information of larger values and has higher energy compaction ability on dithered pictures. We have a tendency to propose 2 encrypted image applications using the encrypted domain WHT. To accelerate the sensible execution, we tend to present 2 parallelization ways for the proposed applications. The experimental results show that the speedup of the homomorphic encrypted image application exceeds 12.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here