AMAkshay Malhotra

Akshay Malhotra

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Akshay Malhotra has a total of 28 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Deep OFDM Channel Estimation: Capturing Frequency Recurrence

    by Abu Shafin Mohammad Mahdee Jameel, Akshay Malhotra, Aly El Gamal, Shahab Hamidi-Rad

    In this paper, we propose a deep-learning-based channel estimation scheme in an orthogonal frequency division multiplexing (OFDM) system. Our proposed method, named Single Slot Recurrence Along Frequency Network (SisRafNet), is based on a novel study of recurrent models for exploiting sequential behavior of channels across frequencies. Utilizing the fact that wireless channels have a high degree of correlation across frequencies, we employ recurrent neural network techniques within a single OFDM slot, thus overcoming the latency and memory constraints typically associated with recurrence based methods. The proposed SisRafNet delivers superior estimation performance compared to existing deep-learning-based channel estimation techniques and the performance has been validated on a wide range of 3rd Generation Partnership Project (3GPP) compliant channel scenarios at multiple signal-to-noise ratios.


  • Fast Global Optimization for Hybrid Beamforming in Limited Feedback mmWave Systems

    by Akshay Malhotra, Mohamed Salah Ibrahim, Shahab Hamidi-Rad, Mihaela Beluri, Arnab Roy

    Hybrid beamforming provides a cost effective strategy towards practical deployment of massive multiple-input multiple-output (MIMO) systems. Since the hybrid precoder-combiner evaluation requires channel state information, the computation is performed at the receiver and the evaluated precoders are communicated back to the transmitter. This transmission overhead associated with the precoder feedback can be large when the number of transmit antennas is high. In this work, we study the optimization associated with hybrid beamforming in limited feedback systems. We propose an efficient solution for the optimization under a codebook constraint and prove that the proposed solution is globally optimal when the codebook is orthonormal. The proposed approach is also shown to provide superior performance compared to existing approaches in a limited feedback setup. Further, it exhibits a computational complexity far lower than existing alternatives, making it feasible for deployment in real, resource constrained systems.


  • Generative Networks for Synthesizing Human Videos in Text-Defined Outfits

    by Akshay Malhotra, Viswanathan Swaminathan, Gang Wu, Ioannis D. Schizas

    Generating a video from a textual input is a challenging research topic that would have a variety of applications in industries such as retail, e-commerce, online entertainment, education etc. In this paper, we discuss the application of generating videos of a human subject in a desired outfit using an input video of the subject. We present a two stage solution, wherein at the first stage a generative model is learned such that, given the subject's image and a textual description of the outfit, a corresponding image of the subject in the described outfit is synthesized. At the second stage, all the frames of the subject's video are individually processed by the stage 1 model to generate corresponding frames and an optical flow based post processing step is performed to maintain visual coherence across the generated frames. Towards the stage-1 objective, multiple supervised and unsupervised convolutional neural network (CNN) based generative models have been proposed. A novel approach to inject an external masking layer that maintains the structural integrity of the generated images is also presented. We train and test the different methods on the publicly available multi-view clothing image data-set and the performance in videos is showcased on a set of real-world commercial videos. The experiments show the efficacy of our approach in generating images/videos in both low (64 × 64) and high (256 × 256) resolutions.


  • MILP-Based Unsupervised Clustering

    by Akshay Malhotra, Ioannis D. Schizas

    In this letter, we discuss the problem of unsupervised clustering of sensor signals based on their information content. In the past, the problem has been formulated as a matrix factorization problem and has been solved with different variants of gradient descent. We reformulate the nonconvex cost function as a mixed integer linear programing problem with explicit clustering constraints and solve it with branch and bound, while introducing a scalable variant to reduce the computational time. The proposed method is applied to clustering problems in hyperspectral imaging and multiview image clustering and extensive results have been presented demonstrating the superiority of the novel framework over existing alternatives.


  • Unsupervised Kernel Learning for Correlation Based Clustering

    by Akshay Malhotra, Kazi T. Shahid, Ioannis D. Schizas

    Successful clustering of multiple objects using kernels, heavily relies on the proper selection of kernel parameters. This can be a computationally complex process and may necessitate prior knowledge of label information. In this paper, a novel method has been introduced that is computationally efficient and requires no prior information. The method relies on the eigenvalues of each kernel matrix to determine a proper linear combination of kernels among a dictionary of kernels that results in good clustering. A difference of convex functions formulation is proposed and solved via an algorithmically simple method which is extremely cost-effective in implementation. Comparisons using various forms of real-world data with two popular supervised methods show its superior performance.


  • Correlation Analysis-Based Classification of Human Activity Time Series

    by Akshay Malhotra, Ioannis D. Schizas, Vangelis Metsis

    Segmentation of sequential sensor data streams and classification of each segment are common steps in tasks dealing with the detection of events of interest in such data. In this paper, we introduce two correlation analysis-based methods for classifying time series data generated by sensors. Our first method is a lightweight supervised approach utilizing principal component analysis to jointly segment data and classify each segment into a class corresponding to an event of interest. The second method relies on unsupervised canonical correlation analysis to segment time series by clustering together consecutive data points that belong to the same event. Both methods operate without the need for prior feature extraction from the data. The theoretical model of the two methods and the solution to the resulting optimization problem are presented in detail. Classification of human activity from inertial measurement unit sensor data is used as a case study to demonstrate the applicability and effectiveness of the proposed methods.


  • Unsupervised Kernel Correlations Based Hyperspectral Clustering With Missing Pixels

    by Kazi Tanzeem Shahid, Akshay Malhotra, Ioannis D. Schizas, Saibun Tjuatja

    This paper focuses on unsupervised clustering of hyperspectral pixels whose intensity may not be available across certain spectral bands. The presence of statistical correlations among pixels that contain data originating from the same material is exploited here to develop a novel regularized correlation analysis framework to perform clustering. Kernel learning is integrated in a regularized correlations framework to exploit nonlinear dependencies of pixels acquiring information about similar materials. An effective technique is proposed to select the kernel mapping parameters and form pertinent kernel covariance matrices by proper weighted-averaging that takes into account the information content across the available spectral bands. The novel correlations framework will return proper sparse clustering matrices whose nonzero entries point to the correlated pixels. These matrices will be obtained via a minimization formulation that will be solved via computationally efficient subgradient descent iterations. The novel correlations formulation is applied in small-size pixel patches of the original hyperspectral image, while recursively bigger size patches are built that contain information about the same materials. Extensive numerical tests on real hyperspectral images reveal that the proposed approach, in spite of being unsupervised, can outperform existing supervised and unsupervised techniques especially in the presence of missing pixels.


  • Fault tolerant unsupervised kernel-based information clustering in hyperspectral images

    by Akshay Malhotra, Kazi Tanzeem Shahid, Ioannis D. Schizas, Saibun Tjuatja

    In this work we derive a novel clustering scheme for hyperspectral pixels according to the material they sense. We utilize statistical correlations that pixels sensing the same material exhibit. Specifically, kernel learning is combined with a norm-one regularized canonical correlations framework that can perform data clustering on nonlinearly dependent data. To tackle the derived minimization formulation we employ gradient descent iterations that enable a computationally efficient determination of proper sparse clustering matrices. Extensive numerical tests on real hyperspectral images reveal that the proposed approach, in spite of being unsupervised, can outperform existing supervised and unsupervised techniques especially in the presence of missing pixels that may be caused by malfunctioning in the data acquisition system.