Searcharxiv⌕ Search

arXiv subjects

Abbas Alili

Publications and source records attributed to Abbas Alili.

4 recordsLinked to original sources

Temporal Pseudo-RGB Encoding for Label-Free Detection of VEEV Infection in Human Brain Endothelial Cells

Label-free detection of viral infection is central to antiviral screening and pathogen surveillance. Most deep-learning methods analyze individual frames and do not model temporal progression. We evaluate temporal pseudo-RGB encoding, which stacks three time-offset brightfield frames ($t{-}6$ h, $t{-}3$ h, $t$) as the red, green, and blue channels of a single image so that morphological change becomes color and an ImageNet-pretrained convolutional neural network (CNN) can be trained on infection trajectories without architectural modification. In human brain microvascular endothelial cells (HBMVEC) infected with Venezuelan equine encephalitis virus (VEEV) TC-83, a multi-task network predicts infected-versus-mock status and time post-infection in one forward pass. Across three experimental runs under leave-one-row-out cross-validation, with all 36 wells scored out of fold, the encoding reaches 91.6% accuracy against 87.4% for the single-frame model (paired difference $+4.2$ percentage points, 95% CI $[+2.5, +6.1]$; sign-flip $p = 3\times10^{-5}$; well-level inference, conditional on three runs). At the late-phase endpoint (40-48 h), where floating cells and debris can make conventional brightfield images difficult to interpret, the advantage widens to $+23.9$ points (95% CI $[+19.2, +28.9]$). Time post-infection is recovered on the fixed row split with MAE = 1.31 h ($R^2 = 0.975$). Among the temporal models tested the encoding has the highest mean accuracy, at a fraction of the cost of the recurrent and 3D convolutional alternatives, though only its margin over the single-frame model is resolved; the tested ViT-B/16 backbone showed no corresponding gain, so the finding is limited to convolutional backbones and this virus-cell system.

cs.CV↗

NSVQ: Mitigating Codebook Collapse by Stabilizing Encoder Drift in Vector Quantization

Vector quantization is central to modern generative modeling pipelines, but large-codebook VQ models often suffer from codebook collapse. We identify encoder drift as a key driver of this failure: as the encoder moves the latent distribution, sparsely updated code vectors can lag behind, lose assignments, and increase quantization error, creating a feedback loop through the straight-through estimator. We propose NSVQ, a non-stationary-aware VQ training strategy that combines a dense non-stationary embedding loss, codebook replacement, and stage-wise encoder freezing. NSVQ first helps the codebook track encoder drift during early training, then freezes the encoder to consolidate the codebook under a fixed latent geometry, and finally reintroduces adversarial refinement. Experiments on ImageNet-1k show that NSVQ improves reconstruction quality while maintaining full codebook utilization. On ImageNet-1k at 128$\times$128 with 65,536 codes, NSVQ reduces rFID from 2.39 to 2.10 compared with SimVQ, while both methods maintain 100\% utilization. Additional latent diffusion experiments show that NSVQ also improves downstream ImageNet generation FID.

cs.CV↗

Beyond Stationarity: Rethinking Codebook Collapse in Vector Quantization

Vector Quantization (VQ) underpins many modern generative frameworks such as VQ-VAE, VQ-GAN, and latent diffusion models. Yet, it suffers from the persistent problem of codebook collapse, where a large fraction of code vectors remains unused during training. This work provides a new theoretical explanation by identifying the nonstationary nature of encoder updates as the fundamental cause of this phenomenon. We show that as the encoder drifts, unselected code vectors fail to receive updates and gradually become inactive. To address this, we propose two new methods: Non-Stationary Vector Quantization (NSVQ), which propagates encoder drift to non-selected codes through a kernel-based rule, and Transformer-based Vector Quantization (TransVQ), which employs a lightweight mapping to adaptively transform the entire codebook while preserving convergence to the k-means solution. Experiments on the CelebA-HQ dataset demonstrate that both methods achieve near-complete codebook utilization and superior reconstruction quality compared to baseline VQ variants, providing a principled and scalable foundation for future VQ-based generative models. The code is available at: https://github.com/CAIR- LAB- WFUSM/NSVQ-TransVQ.git

cs.CV↗

PCA-VAE: Differentiable Subspace Quantization without Codebook Collapse

Vector-quantized autoencoders deliver high-fidelity latents but suffer inherent flaws: the quantizer is non-differentiable, requires straight-through hacks, and is prone to collapse. We address these issues at the root by replacing VQ with a simple, principled, and fully differentiable alternative: an online PCA bottleneck trained via Oja's rule. The resulting model, PCA-VAE, learns an orthogonal, variance-ordered latent basis without codebooks, commitment losses, or lookup noise. Despite its simplicity, PCA-VAE exceeds VQ-GAN and SimVQ in reconstruction quality on CelebAHQ while using 10-100x fewer latent bits. It also produces naturally interpretable dimensions (e.g., pose, lighting, gender cues) without adversarial regularization or disentanglement objectives. These results suggest that PCA is a viable replacement for VQ: mathematically grounded, stable, bit-efficient, and semantically structured, offering a new direction for generative models beyond vector quantization.

cs.LG↗