Department Publications

Dynamic spectrum access is recognized as a potential solution to the problem of spectrum scarcity. Consequently, a significant amount of research has been conducted on spectrum allocation. In this study, we present a multi-traffic class queue-based spectrum allocation solution. The proposed solution is designed for a scenario where communication and other systems do not necessarily require agility in the frequency bands they operate in. The spectrum sensing and forecasting processes are carried out over relatively long time periods compared to the actual transmission rates. The study considers two traffic classes: priority and non-priority. Three packet handling strategies are presented and their average queuing delay performances are compared. While all three strategies yield satisfactory results under low/medium traffic conditions, Strategy 3 exhibits the greatest flexibility in terms of delay performance …

The optimal designs of multi-dimensional (M-D) complex-coefficient finite-extent impulse response (FIR) filters with low group delays predominantly consider only the minimization of the frequency response error. This leads to substantial deviation of the group delay from the desired constant group delay of such a filter, especially near the passband edges. In this paper, we propose a minimax design method for M-D complex-coefficient FIR filters with reduced group delay error. We incorporate constraints on phase response error while minimizing the frequency response error. We formulate the proposed minimax design method as a second-order cone programming problem. Design examples confirm that the proposed minimax design method significantly reduces the group delay error compared to previously proposed methods.

Broadband beamformers designed as two-dimensional (2-D) spatially-interpolated finite-extent impulse responses (FIR) filters, using a cascade structure, cannot employ sparse linear arrays despite significantly reducing the computational complexity. This happens due to the fact that the 2-D masking filter requires spatial samples equal to the spatial order at the input. Therefore, the output of the 2-D spatially-interpolated prototype filter should be computed for more than one spatial index. In order to address this limitation, we propose a 2-D spatially-interpolated FIR filter using a parallel structure. With the proposed structure, both 2-D spatially-interpolated prototype filter and the 2-D masking filter need to compute the output only for one spatial index, therefore allowing to employ sparse linear arrays. In order to support broadband beamforming, we design the 2-D FIR filter to have a parallelogram passband …

The use of approximate transforms in conjunction with approximate adder hardware is explored towards implementing low-complexity multi-beam antenna arrays. The use of approximate adders is motivated by the efficient look up table (LUT) usage on field programmable gate arrays (FPGA) resulting in better area and time complexities on hardware. 8-beam and 16-beam hardware architectures for multi-beamforming are designed using previously reported 8-point and 16-point spatial approximate-DFT (ADFT) algorithms, respectively, albeit with approximate adders. Designs have been implemented on Xilinx Kintex UltraScale KCU105 FPGA device verifying 31.5% reduction in (FPGA) LUT count and 58.08% improvement in critical path delay with a maximum beam error of 0.6 degrees and maximum peak side lobe level deviation 0.21 dB for the 8-beam case, when compared to ADFT with accurate adders with the …

Since its introduction, diffractive deep neural networks (D2NN) have been an emerging technology with many useful applications, such as 3D object recognition, saliency segmentation, and quantitative phase microscopy. However, fabricating D2NNs operating in the visible range has not been performed due to the complexities of fabricating nano-scale elements. Recent advancements such as Implosion Fabrication have made it possible to fabricate such networks using a discrete number of phase weights. We propose a quantization-aware training approach for D2NNs through modeling the quantization process in a differentiable manner using a sigmoid-based quantization function, facilitating the fabrication process. We also propose an efficient training schedule to guide the optimization process to converge to a better minima despite the limited number of quantization levels. Our method is simulated and …

Deep neural network models can learn clinically relevant features from millions of histopathology images. However generating high-quality annotations to train such models for each hospital, each cancer type, and each diagnostic task is prohibitively laborious. On the other hand, terabytes of training data–while lacking reliable annotations–are readily available in the public domain in some cases. In this work, we explore how these large datasets can be consciously utilized to pre-train deep networks to encode informative representations. We then fine-tune our pre-trained models on a fraction of annotated training data to perform specific downstream tasks. We show that our approach can reach the current state-of-the-art (SOTA) for patch-level classification with only 1-10% randomly selected annotations compared to other SOTA approaches. Moreover, we propose an uncertainty-aware loss function, to quantify the model confidence during inference. Quantified uncertainty helps experts select the best instances to label for further training. Our uncertainty-aware labeling reaches the SOTA with significantly fewer annotations compared to random labeling. Last, we demonstrate how our pretrained encoders can surpass current SOTA for wholeslide image classification with weak supervision. Our work lays the foundation for data and task-agnostic pretrained deep networks with quantified uncertainty.

Class Incremental Learning (CIL) is inspired by the human ability to learn new classes without forgetting previous ones. CIL becomes more challenging in real-world scenarios when the samples in each incremental step are imbalanced. This creates another branch of problem, called Generalized Class Incremental Learning (GCIL) where each incremental step is structured more realistically. Grow When Required (GWR) network, a type of Self-Organizing Map (SOM), dynamically creates and removes nodes and edges for adaptive learning. GWR performs incremental learning from feature vectors extracted by a Convolutional Neural Network (CNN), which acts as a feature extractor. The inherent ability of GWR to form distinct clusters, each corresponding to a class in the feature vector space, regardless of the order of samples or class imbalances, is well suited to achieving GCIL. To enhance GWR's classification …

Real-time and online action localization in videos poses a critical and formidable challenge. Achieving accurate action localization necessitates the integration of both temporal and spatial information. However, existing approaches rely on computationally intensive 3D convolutional neural network (CNN) architectures or redundant two-stream architectures with optical flow, rendering them unsuitable for real-time, online applications. To address this, we propose a novel approach that leverages fast and efficient key-point-based bounding box prediction for spatial action localization. Additionally, we introduce a tube-linking algorithm that ensures the temporal continuity of action tubes even in the presence of occlusions. By combining temporal and spatial information into a cascaded input for a single network, we eliminate the need for a two-stream architecture, enabling the network to effectively learn from both types …

Law enforcement officials heavily depend on Forensic Video Analytic (FVA) Software in their evidence extraction process. However present-day FVA software are complex, time consuming, equipment dependent and expensive. Developing countries struggle to gain access to this gateway to a secure haven. The term forensic pertains the application of scientific methods to the investigation of crime through post-processing, whereas surveillance is the close monitoring of real-time feeds. The principle objective of this Final Year Project was to develop an efficient and effective FVA Software, addressing the shortcomings through a stringent and systematic review of scholarly research papers, online databases and legal documentation. The scope spans multiple object detection, multiple object tracking, anomaly detection, activity recognition, tampering detection, general and specific image enhancement and video synopsis. Methods employed include many machine learning techniques, GPU acceleration and efficient, integrated architecture development both for real-time and postprocessing. For this CNN, GMM, multithreading and OpenCV C++ coding were used. The implications of the proposed methodology would rapidly speed up the FVA process especially through the novel video synopsis research arena. This project has resulted in three research outcomes Moving Object Based Collision Free Video Synopsis, Forensic and Surveillance Analytic Tool Architecture and Tampering Detection Inter-Frame Forgery. The results include forensic and surveillance panel outcomes with emphasis on video synopsis and Sri Lankan context. Principal …

Video synopsis, summarizing a video to generate a shorter video by exploiting the spatial and temporal redundancies, is important for surveillance and archiving. Existing trajectory-based video synopsis algorithms will not able to work in real time, because of the complexity due to the number of object tubes that need to be included in the complex energy minimization algorithm. We propose a real-time algorithm by using a method that incrementally stitches each frame of the synopsis by extracting object frames from the user specified number of tubes in the buffer in contrast to global energy-minimization based systems. This also gives flexibility to the user to set the threshold of maximum number of objects in the synopsis video according his or her tracking ability and creates collision-free summarized videos which are visually pleasing. Experiments with six common test videos, indoors and outdoors with many …

Since the dawn of its development the computer has been a staple of science fiction and thus mostly due to it humanity has constantly dreaded a day when intelligence stemming from computers commonly known as Artificial Intelligence (AI) would allegedly take over the world. The recent advent of advanced AI chatbot technology has again sparked that fear due to its ability to compose essays similar to that of a human being. This chapter discusses the concept of intelligence in biology and binary digital computing. Based upon the weaknesses of either, especially the hidden vulnerabilities of AI predicted by Gödel’s First Incompleteness Theorem and role of humans in programming AI, the question of whether it is likely to happen in the near future is discussed.

Traffic management is a serious problem in many cities around the world. Even the suburban areas are now experiencing regular traffic congestion. Inappropriate traffic control wastes fuel, time, and the productivity of nations. Though traffic signals are used to improve traffic flow, they often cause problems due to inappropriate or obsolete timing that does not tally with the actual traffic intensity at the intersection. Traffic intensity determination based on statistical methods only gives the average intensity expected at any given time. However, to control traffic accurately, it is required to know the real-time traffic intensity. In this research, image processing and machine learning have been used to estimate actual traffic intensity in real time. General-purpose electronic hardware has been used for in-situ image processing based on the edge-detection method. A deep neural network (DNN) was trained to infer traffic intensity in each image in real time. The trained DNN estimated traffic intensity accurately in 90% of the real-time images during road tests. The electronic system was implemented on a Raspberry Pi single-board computer; hence, it is cost-effective for large-scale deployment.

The escalating cost of VLSI packaging, driven by the proliferation of input and output pins and the growing design complexity, necessitates cost-effective solutions. This research paper explores a method to mitigate these costs by leveraging SerDes (Serializer/Deserializer) technology. We aim to reduce the number of I/O pins within internal chips that lack external signal requirements by employing open-source SerDes. We propose an integrated approach to incorporate SerDes into VLSI designs and validate its effectiveness through existing design cases.

In this paper, we propose a method for duplicating digital circuits using neural networks (NNs). Our approach involves training a common neural network model on the inputs and outputs of existing digital circuits, creating a digital twin. This digital twin can be used to predict the outputs of a digital I'C, only using its inputs and this has been verified using counter circuits, and shift register circuits. Moreover, we have successfully validated the functionality duplication of digital logic in a robotic arm equipped with servo motors, further validating the utility of our approach.

In this paper, we consider the problem of recovering desired sound source signals from on-board microphone recordings on a noisy drone.  Enhancement of source signal degraded by drone noise is considered to be a difficult task due to the strong noise generated from its motors and propellers causing an extremely low signal-to-drone noise ratio (SDNR).  We propose a solution (i) by using a multichannel Wiener filter (MWF) to remove drone noise from microphone recordings, and (ii) further reduction of residual noise using a Gaussian mixture model (GMM) based dual-stage parametric Wiener filter (WF).  The method exploits known statistics of motor current-specific drone noise.  The theory developed is applicable to irregular microphone arrays embedded on a drone enabling realistic integration to most drones. We demonstrate the validity of the proposed framework through (i) experimental recordings from two …

We propose a novel attention-based deep learning framework for reconstructing images from compressively sensed measurements. Our method leverages knowledge of the sampling basis and structured sampling patterns, highlighting the importance of learning adaptive features from measurements.

Compressive sensing (CS) reconstructs images from sub-Nyquist measurements by solving a sparsity-regularized inverse problem. Traditional CS solvers use iterative optimizers with hand crafted sparsifiers, while early data-driven methods directly learn an inverse mapping from the low-dimensional measurement space to the original image space. The latter outperforms the former, but is restrictive to a pre-defined measurement domain. More recent, deep unrolling methods combine traditional proximal gradient methods and data-driven approaches to iteratively refine an image approximation. To achieve higher accuracy, it has also been suggested to learn both the sampling matrix, and the choice of measurement vectors adaptively. Contrary to the current trend, in this work we hypothesize that a general inverse mapping from a random set of compressed measurements to the image domain exists for a given measurement basis, and can be learned. Such a model is single-shot, non-restrictive and does not parametrize the sampling process. To this end, we propose MOSAIC, a novel compressive sensing framework to reconstruct images given any random selection of measurements, sampled using a fixed basis. Motivated by the uneven distribution of information across measurements, MOSAIC incorporates an embedding technique to efficiently apply attention mechanisms on an encoded sequence of measurements, while dispensing the need to use unrolled deep networks. A range of experiments validate our proposed architecture as a promising alternative for existing CS reconstruction methods, by achieving the state-of-the-art for metrics of …

With applications ranging from metabolomics to histopathology, quantitative phase microscopy (QPM) is a powerful label-free imaging modality. However, the speed of current QPM systems is limited by electronic hardware. To improve throughput further, here we propose differentiable optical-electronic quantitative phase microscopy (∂μ) that acquires images in a compressed form such that more information can be transferred beyond the electronic hardware bottleneck. The proposed microscopy uses optical feature extractors as image compressors. The resultant intensity distribution is then decompressed into QPM images by a reconstruction network. By optimizing optical-electronic parameters in an end-to-end manner, our method can improve the QPI throughput from Hours to Seconds (more than an order of magnitude).