SearcharxivSearch

arXiv subjects

Animesh Kumar

Publications and source records attributed to Animesh Kumar.

At least 19 recordsLinked to original sources

Sedentary Behavior Classification for Wearable Sensors with a CNN-BiLSTM Model

Accurate detection of sedentary behavior is important for studying health risks related to prolonged sitting, but posture-based classification remains challenging with wearable sensors, especially at the wrist. We study whether a deep learning model trained on hip-worn accelerometer data can transfer to wrist-worn accelerometer data for sitting versus non-sitting classification. We use CHAP, a CNN-BiLSTM model originally developed for hip accelerometers, and evaluate its zero-shot performance on wrist data as well as its adaptation through finetuning with varying amounts of labeled wrist data. Experiments are conducted on the iWatch dataset with ground-truth posture labels derived from wearable cameras. The hip-trained model performs strongly on hip data without retraining, but accuracy drops on wrist data due to sensor placement shift. Finetuning CHAP provides consistent advantages over transformer models trained from scratch. These findings suggest that hip-based pretraining provides a useful starting point for wrist deployment, while highlighting the need for wrist-specific adaptation to handle higher signal variability.

cs.LG

Calibrated Hybrid CNN-Transformer for Retinal OCT Classification

Deep models for retinal optical coherence tomography (OCT) classification report high accuracy but rarely report whether their confidence can be trusted -- a gap that matters when a wrong-but-confident reading delays sight-saving treatment. We pair a hybrid convolutional-Transformer encoder with a gradient-boosting (XGBoost) classification head and a three-part clinical safety layer: confidence calibration, out-of-distribution (OOD) rejection, and per-prediction uncertainty flagging. On four-class OCT (84,495 scans) the model reaches 95.4% accuracy while cutting calibration error twelve-fold (expected calibration error, ECE = 0.0024), so the confidence it reports tracks its true accuracy. To our knowledge this is the first OCT classifier to validate all three safety mechanisms jointly, with public weights and reproducible multi-seed evaluation.

eess.IV

Uncertainty-Aware Multi-Source Retinal Fluid Segmentation in OCT

Measuring retinal fluid from optical coherence tomography (OCT) drives treatment decisions in macular disease, but manual annotation is slow and segmentation models trained on one scanner degrade on another. We present an attention-guided TransUNet that segments three fluid types across four independent OCT sources, combining a domain-adaptive normalisation scheme with an uncertainty estimate that flags unreliable pixels. The model reaches a mean fluid Dice of 0.78, and -- most usefully for clinicians -- its uncertainty is 1.34x higher exactly where expert graders disagree (p<10^-4), turning a raw segmentation map into an actionable clinical triage signal.

eess.IV

Redefining Finance: The Influence of Artificial Intelligence (AI) and Machine Learning (ML)

With rapid transformation of technologies, the fusion of Artificial Intelligence (AI) and Machine Learning (ML) in finance is disrupting the entire ecosystem and operations which were followed for decades. The current landscape is where decisions are increasingly data-driven by financial institutions with an appetite for automation while mitigating risks. The segments of financial institutions which are getting heavily influenced are retail banking, wealth management, corporate banking & payment ecosystem. The solution ranges from onboarding the customers all the way fraud detection & prevention to enhancing the customer services. Financial Institutes are leap frogging with integration of Artificial Intelligence and Machine Learning in mainstream applications and enhancing operational efficiency through advanced predictive analytics, extending personalized customer experiences, and automation to minimize risk with fraud detection techniques. However, with Adoption of AI & ML, it is imperative that the financial institute also needs to address ethical and regulatory challenges, by putting in place robust governance frameworks and responsible AI practices.

cs.AI

AI-Driven Innovations in Modern Cloud Computing

The world has witnessed rapid technological transformation, past couple of decades and with Advent of Cloud computing the landscape evolved exponentially leading to efficient and scalable application development. Now, the past couple of years the digital ecosystem has brought in numerous innovations with integration of Artificial Intelligence commonly known as AI. This paper explores how AI and cloud computing intersect to deliver transformative capabilities for modernizing applications by providing services and infrastructure. Harnessing the combined potential of both AI & Cloud technologies, technology providers can now exploit intelligent resource management, predictive analytics, automated deployment & scaling with enhanced security leading to offering innovative solutions to their customers. Furthermore, by leveraging such technologies of cloud & AI businesses can reap rich rewards in the form of reducing operational costs and improving service delivery. This paper further addresses challenges associated such as data privacy concerns and how it can be mitigated with robust AI governance frameworks.

cs.AI

Data Contamination Can Cross Language Barriers

The opacity in developing large language models (LLMs) is raising growing concerns about the potential contamination of public benchmarks in the pre-training data. Existing contamination detection methods are typically based on the text overlap between training and evaluation data, which can be too superficial to reflect deeper forms of contamination. In this paper, we first present a cross-lingual form of contamination that inflates LLMs' performance while evading current detection methods, deliberately injected by overfitting LLMs on the translated versions of benchmark test sets. Then, we propose generalization-based approaches to unmask such deeply concealed contamination. Specifically, we examine the LLM's performance change after modifying the original benchmark by replacing the false answer choices with correct ones from other questions. Contaminated models can hardly generalize to such easier situations, where the false choices can be \emph{not even wrong}, as all choices are correct in their memorization. Experimental results demonstrate that cross-lingual contamination can easily fool existing detection methods, but not ours. In addition, we discuss the potential utilization of cross-lingual contamination in interpreting LLMs' working mechanisms and in post-training LLMs for enhanced multilingual capabilities. The code and dataset we use can be obtained from \url{https://github.com/ShangDataLab/Deep-Contam}.

cs.CL

Beyond Scaling: Predicting Patent Approval with Domain-specific Fine-grained Claim Dependency Graph

Model scaling is becoming the default choice for many language tasks due to the success of large language models (LLMs). However, it can fall short in specific scenarios where simple customized methods excel. In this paper, we delve into the patent approval pre-diction task and unveil that simple domain-specific graph methods outperform enlarging the model, using the intrinsic dependencies within the patent data. Specifically, we first extend the embedding-based state-of-the-art (SOTA) by scaling up its backbone model with various sizes of open-source LLMs, then explore prompt-based methods to harness proprietary LLMs' potential, but find the best results close to random guessing, underlining the ineffectiveness of model scaling-up. Hence, we propose a novel Fine-grained cLAim depeNdency (FLAN) Graph through meticulous patent data analyses, capturing the inherent dependencies across segments of the patent text. As it is model-agnostic, we apply cost-effective graph models to our FLAN Graph to obtain representations for approval prediction. Extensive experiments and detailed analyses prove that incorporating FLAN Graph via various graph models consistently outperforms all LLM baselines significantly. We hope that our observations and analyses in this paper can bring more attention to this challenging task and prompt further research into the limitations of LLMs. Our source code and dataset can be obtained from http://github.com/ShangDataLab/FLAN-Graph.

cs.CL

Signal Reconstruction from Quantized Noisy Samples of the Discrete Fourier Transform

In this paper, we present two variations of an algorithm for signal reconstruction from one-bit or two-bit noisy observations of the discrete Fourier transform (DFT). The one-bit observations of the DFT correspond to the sign of its real part, whereas, the two-bit observations of the DFT correspond to the signs of both the real and imaginary parts of the DFT. We focus on images for analysis and simulations, thus using the sign of the 2D-DFT. This choice of the class of signals is inspired by previous works on this problem. For our algorithm, we show that the expected mean squared error (MSE) in signal reconstruction is asymptotically proportional to the inverse of the sampling rate. The samples are affected by additive zero-mean noise of known distribution. We solve this signal estimation problem by designing an algorithm that uses contraction mapping, based on the Banach fixed point theorem. Numerical tests with four benchmark images are provided to show the effectiveness of our algorithm. Various metrics for image reconstruction quality assessment such as PSNR, SSIM, ESSIM, and MS-SSIM are employed. On all four benchmark images, our algorithm outperforms the state-of-the-art in all of these metrics by a significant margin.

eess.SP

Novel Near-Optimal Scalar Quantizers with Exponential Decay Rate and Global Convergence

Many modern distributed real-time signal sensing/monitoring systems require quantization for efficient signal representation. These distributed sensors often have inherent computational and energy limitations. Motivated by this concern, we propose a novel quantization scheme called approximate Lloyd-Max that is nearly-optimal. Assuming a continuous and finite support probability distribution of the source, we show that our quantizer converges to the classical Lloyd-Max quantizer with increasing bitrate. We also show that our approximate Lloyd-Max quantizer converges exponentially fast with the number of iterations. The proposed quantizer is modified to account for a relatively new quantization model which has envelope constraints, termed as the envelope quantizer. With suitable modifications we show optimality and convergence properties for the equivalent approximate envelope quantizer. We illustrate our results using extensive simulations for different finite support source distributions.

eess.SP

On Distributed Nonlinear Signal Analytics : Bandwidth and Approximation Error Tradeoffs

Analytics will be a part of the upcoming smart city and Internet of Things (IoT). The focus of this work is approximate distributed signal analytics. It is envisaged that distributed IoT devices will record signals, which may be of interest to the IoT cloud. Communication of these signals from IoT devices to the IoT cloud will require (lowpass) approximations. Linear signal approximations are well known in the literature. It will be outlined that in many IoT analytics problems, it is desirable that the approximated signals (or their analytics) should always over-predict the exact signals (or their analytics). This distributed nonlinear approximation problem has not been studied before. An algorithm to perform distributed over-predictive signal analytics in the IoT cloud, based on signal approximations by IoT devices, is proposed. The fundamental tradeoff between the signal approximation bandwidth used by IoT devices and the approximation error in signal analytics at the IoT cloud is quantified for the class of differentiable signals. Simulation results are also presented.

eess.SP

Spatial Field estimation from Samples taken at Unknown Locations generated by an Unknown Autoregressive Process

Sampling of physical fields with mobile sensors is an upcoming field of interest. This offers greater advantages in terms of cost as often just a single sensor can be used for the purpose and this can be employed almost everywhere without sensing stations and has nominal operational costs. In a mobile sensing setup, the accurate knowledge of sampling locations may lead to a manifold increase in the costs. Moreover, the inertia of the moving vehicle constrains the independence between the intersample distances, making them correlated. This work, thus, aims at estimating spatially bandlimited fields from samples, corrupted with measurement noise, collected on sampling locations obtained from an autoregressive model on the intersample distances. The autoregressive model is used to capture the correlation between the intersample distances. In this setup of sampling at unknown sampling locations obtained from an autoregressive model on intersample distances, the mean squared error between the field and its estimated version has been shown to decrease as O($1/n$), where $n$ is the average number of samples taken by the moving sensor.

cs.IT

On Bandlimited Spatiotemporal Field Sampling with Location and Time Unaware Mobile Sensors

Sampling of a spatiotemporal field for environmental sensing is of interest. Traditionally, a few fixed stations or sampling locations aid in the reconstruction of the spatial field. Recently, there has been an interest in mobile sensing and location-unaware sensing of spatial fields. In this work, the general class of fields governed by a constant coefficient linear partial differential equations is considered. This class models many physical fields including temperature, pollution, and diffusion fields. The analysis is presented in one dimension for a first exposition. It is assumed that a mobile sensing unit is available to sample the spatiotemporal field of interest at unknown locations and unknown times -- both generated by independent and unknown renewal processes. Based on measurement-noise affected samples, a spatial field reconstruction algorithm is proposed. It is shown that if the initial condition on the field is bandlimited, then the mean squared error between the original and the estimated field decreases as $O(1/n)$, where $n$ is the average sampling density of the mobile sensor. The field reconstruction algorithm is universal, that is, it does not require the knowledge of unknown sampling locations' or unknown time instants' statistical distributions.

cs.IT

Mobile Sensing of Two-Dimensional Bandlimited Fields on Random Paths

Mobile sensing has been recently proposed for sampling spatial fields, where mobile sensors record the field along various paths for reconstruction. Classical and contemporary sampling typically assumes that the sampling locations are approximately known. This work explores multiple sampling strategies along random paths to sample and reconstruct a two dimensional bandlimited field. Extensive simulations are carried out, with insights from sensing matrices and their properties, to evaluate the sampling strategies. Their performance is measured by evaluating the stability of field reconstruction from field samples. The effect of location unawareness on some sampling strategies is also evaluated by simulations.

cs.IT

Optimal Envelope Approximation in Fourier Basis with Applications in TV White Space

Lowpass envelope approximation of smooth continuous-variable signals are introduced in this work. Envelope approximations are necessary when a given signal has to be approximated always to a larger value (such as in TV white space protection regions). In this work, a near-optimal approximate algorithm for finding a signal's envelope, while minimizing a mean-squared cost function, is detailed. The sparse (lowpass) signal approximation is obtained in the linear Fourier series basis. This approximate algorithm works by discretizing the envelope property from an infinite number of points to a large (but finite) number of points. It is shown that this approximate algorithm is near-optimal and can be solved by using efficient convex optimization programs available in the literature. Simulation results are provided towards the end to gain more insights into the analytical results presented.

cs.IT

Bandlimited Field Reconstruction from Samples Obtained at Unknown Random Locations on a Grid

We study the sampling of spatial fields using sensors that are location-unaware but deployed according to a known statistical distribution. It has been shown that uniformly distributed location-unaware sensors cannot infer bandlimited fields due to the symmetry and shift-invariance of the field. This work studies asymmetric (nonuniform) distributions on location-unaware sensors that will enable bandlimited field inference. For the sake of analytical tractability, location-unaware sensors are restricted to a discrete grid. Oversampling followed by clustering of the samples using the probability distribution that governs sensor placement on the grid is used to infer the field . Based on this clustering algorithm, the main result of this work is to find the optimal probability distribution on sensor locations that minimizes the detection error-probability of the underlying spatial field. The proposed clustering algorithm is also extended to include the case of signal reconstruction in the presence of sensor noise by treating the distribution of the noisy samples as a mixture model and using clustering to estimate the mixture model parameters.

cs.IT

Estimation of Bandlimited Grayscale Images From the Single Bit Observations of Pixels Affected by Additive Gaussian Noise

The estimation of grayscale images using their single-bit zero mean Gaussian noise-affected pixels is presented in this paper. The images are assumed to be bandlimited in the Fourier Cosine transform (FCT) domain. The images are oversampled over their Nyquist rate in the FCT domain. We propose a non-recursive approach based on first order approximation of Cumulative Distribution Function (CDF) to estimate the image from single bit pixels which itself is based on Banach's contraction theorem. The decay rate for mean squared error of estimating such images is found to be independent of the precision of the quantizer and it varies as $O(1/N)$ where $N$ is the "effective" oversampling ratio with respect to the Nyquist rate in the FCT domain.

cs.CV

Towards Enabling Broadband for a Billon Plus Population with TV White Spaces

One of the major impediments to providing broadband connectivity in semi-urban and rural India is the lack of robust and affordable backhaul. Fiber connectivity in terms of backhaul that is being planned (or provided) by the Government of India would reach only till rural offices (named Gram Panchayat) in the Indian rural areas. In this exposition, we articulate how TV white space can address the challenge in providing broadband connectivity to a billion plus population within India. The villages can form local Wi-Fi clusters. The problem of connecting the Wi-Fi clusters to the optical fiber points can be addressed using a TV white space based backhaul (middle-mile) network. The amount of TV white space present in India is very large when compared with the developed world. Therefore, we discuss a backhaul architecture for rural India, which utilizes TV white spaces. We also showcase results from our TV white space testbed, which support the effectiveness of backhaul by using TV white spaces. Our testbed provides a broadband access network to rural population in thirteen villages. The testbed is deployed over an area of $25$km$^2$, and extends seamless broadband connectivity from optical fiber locations or Internet gateways to remote (difficult to connect) rural regions. We also discuss standards and TV white space regulations, which are pertinent to the backhaul architecture mentioned above.

cs.NI