Institution profile

Indian Institute of Science

Academic institutionasia · in
Official website
Research library529linked papers
Opportunities0open roles
Selected work

Representative Papers

GenzIQA: Generalized Image Quality Assessment using Prompt-Guided Latent Diffusion Models

Jun 07, 2024arXiv.org

Existing no-reference image quality assessment (IQA) methods exhibit poor cross-dataset generalization, particularly under distribution shifts such as user-generated content, synthetic imagery, and low-light conditions. To address this, we propose the first generic IQA framework leveraging the cross-attention mechanism of text-guided latent diffusion models (LDMs). Our method introduces learnable, quality-aware textual prompts and models prompt–image alignment to derive robust quality representations. Crucially, it exploits intermediate cross-attention features from the LDM denoising process—enabling zero-shot transfer to multiple benchmark datasets without fine-tuning. Extensive experiments demonstrate that our approach significantly outperforms state-of-the-art methods on diverse databases including LIVE-Youtube, KoNViD, and UHD-1. Moreover, it achieves superior out-of-distribution generalization, validating its effectiveness under substantial domain shifts. This work establishes a novel paradigm for leveraging generative model priors in blind IQA, bridging semantic understanding and perceptual quality estimation.

5 citations1 influentialRead paper

Identification of Patterns of Cognitive Impairment for Early Detection of Dementia

Jul 01, 2020Annual International Conference of the IEEE Engineering in Medicine and Biology Society

Traditional cognitive assessments for early dementia screening are time-consuming and difficult to scale. Method: This study proposes a personalized follow-up testing framework based on individualized cognitive impairment pattern recognition. It integrates population-level cognitive impairment clustering with individual longitudinal trajectory prediction via a two-stage strategy: (1) ensemble wrapper-based feature selection, and (2) unsupervised clustering—applied to 24,000 baseline subjects from the NACC database. Contribution/Results: The approach identifies data-driven cognitive impairment clusters highly consistent with clinically defined MCI subtypes and enables interpretable inference of prodromal risk pathways in asymptomatic individuals. Crucially, it supports individualized prediction of dementia progression for cognitively normal or mildly impaired subjects, thereby enhancing feasibility, accuracy, and clinical applicability of early detection.

3 citationsRead paper

Graph Burning: Bounds and Hardness

Feb 29, 2024arXiv.org

This paper investigates the computational complexity and theoretical bounds of the graph burning number: given a graph $G$, one unburnt vertex is ignited per step, and its neighbors burn automatically in the next step; the goal is to minimize the number of steps required to burn the entire graph. Methodologically, the authors employ combinatorial graph theory, structural analysis of graph classes, and carefully constructed polynomial-time reductions. Their contributions include: (i) the first proof that graph burning remains NP-complete on connected cubic graphs and connected proper interval graphs; (ii) a tight additive-1 upper bound on the burning number for connected $P_k$-free graphs; and (iii) a systematic complexity classification of two natural variants—edge burning (igniting edges only) and total burning (igniting vertices or edges)—establishing their equivalence to the original vertex-burning problem. These results strengthen support for the conjecture that the burning number is at most $lceil sqrt{n} ceil$, and yield tight theoretical bounds for multiple fundamental graph classes while fully mapping the complexity landscape of the variants.

1 citations1 influentialRead paper
Recent publications

Latest Papers