Irregular Product Coded Computation for High-Dimensional Matrix Multiplication

Author(s):  
Hyegyeong Park ◽  
Jaekyun Moon
Author(s):  
Rohita H. Jagdale ◽  
Sanjeevani K. Shah

In video Super Resolution (SR), the problem of cost expense concerning the attainment of enhanced spatial resolution, computational complexity and difficulties in motion blur makes video SR a complex task. Moreover, maintaining temporal consistency is crucial to achieving an efficient and robust video SR model. This paper plans to develop an intelligent SR model for video frames. Initially, the video frames in RGB format will be transformed into HSV. In general, the improvement in video frames is done in V-channel to achieve High-Resolution (HR) videos. In order to enhance the RGB pixels, the current window size is enhanced to high-dimensional window size. As a novelty, this paper intends to formulate a high-dimensional matrix with enriched pixel intensity in V-channel to produce enhanced HR video frames. Estimating the enriched pixels in the high-dimensional matrix is complex, however in this paper, it is dealt in a significant way by means of a certain process: (i) motion estimation (ii) cubic spline interpolation and deblurring or sharpening. As the main contribution, the cubic spline interpolation process is enhanced via optimization in terms of selecting the optimal resolution factor and different cubic spline parameters. For optimal tuning, this paper introduces a new modified algorithm, which is the modification of the Rider Optimization Algorithm (ROA) named Mean Fitness-ROA (MF-ROA). Once the HR image is attained, it combines the HSV and converts to RGB, which obtains the enhanced output RGB video frame. Finally, the performance of the proposed work is compared over other state-of-the-art models with respect to BRISQUE, SDME and ESSIM measures, and proves its superiority over other models.


2016 ◽  
Vol 190 ◽  
pp. 25-34 ◽  
Author(s):  
Dong Wang ◽  
Haipeng Shen ◽  
Young Truong

2013 ◽  
Vol 278-280 ◽  
pp. 1392-1396
Author(s):  
Chao Xia Zhang

In this paper, a digital image encryption scheme is investigated based on n dimensional (n-D) generalized hyper-chaotic cat map. Firstly, the transformation matrix in n-D map is constructed by using n(n-1)/2 transformation sub-matrix multiplication. Secondly, a novel approach is proposed that the possible sorting numbers of transformation sub-matrix multiplication are used as encrypted keys, which is applied to image encryption. It is the first time in the literature to report the image encryption scheme based on high dimensional hyper-chaotic cat map. Both theoretical analysis and numerical experiment results have confirmed the feasibility of the proposed method.


Sign in / Sign up

Export Citation Format

Share Document