arXiv Computer Vision

LIMODENet: Attention-Free Compact Encoders for Information-Preserving Onboard Satellite Image Restoration

arXiv Computer Vision
Oct 21

Efficient One-Step Diffusion Restoration Model with Compact Token Compression and Linear Attention

The paper introduces SANA‑SR, an efficient one‑step diffusion restoration framework for real‑world image super‑resolution. It uses a deep compression autoencoder to reduce latent tokens by a 32× ratio, preserving essential structures and textures, and applies a linear‑attention DiT with LoRA fine‑tuning for linear‑complexity token mixing. Experiments show competitive or superior performance on benchmark datasets, and the pruned model runs in 0.019 s with 407.95 G MACs and 344 M parameters, indicating strong potential for mobile deployment.

By Bingtian Qiao, Yue Shi, Yingjie Zhou, Yong Guo, Guangtao Zhai, Jiezhang Cao
arXiv Machine Learning
Oct 19

Replay Pruning and Few-Bit Integer Inference for Hardware-Efficient Speed-Sign Recognition

The paper presents a two‑stage speed‑limit sign recognizer for automotive SoCs that compresses a YOLO‑family detector via channel replay pruning and implements a lightweight five‑layer CNN reader using 4‑bit weights and 8‑bit activations. Replay pruning removes over 60% of parameters while matching parent accuracy, outperforming other pruning methods on YOLOv5n and YOLOv8n. The resulting system, with 0.72 M parameters, achieves 95.2% recognition accuracy at 94 fps on a Jetson AGX Orin, fitting within tight memory, arithmetic, and energy budgets.

By Se Un Park, Kyungkeon Chung, Huigeol Kim, Junyoung Park
arXiv AI
Oct 9

Rethinking Contrastive Loss in CLIP Post-training: A Complementary Framework with Frozen Text Encoder

The paper revisits the use of contrastive loss for post‑training CLIP models, showing that the reported catastrophic forgetting is mainly due to an overly large temperature parameter in the InfoNCE objective. By setting a smaller temperature, contrastive post‑training can actually improve CLIP. The authors introduce ComCLIP, a lightweight single‑epoch recipe that freezes the text encoder, trains the vision encoder with a properly tempered contrastive loss, an MSE anchoring loss, and a relational distillation loss, achieving comparable zero‑shot classification to CLIP‑Refine while significantly enhancing visual feature transferability and maintaining downstream compatibility with LLaVA.

By Zidan Wang, Yaqian Li, Xiaokai Zhang, Kaiwen Long, Kun He, Hanpeng Liu
arXiv Computer Vision
Sep 15

Restore What Matters: Lessons from Joint Restoration and Recognition

arXiv:2609.13791v1 Announce Type: new Abstract: Recognition pipelines typically adopt a restore-then-recognize workflow, yet decades of experience show that generating visually pleasing images seldom...

By Lanqing Guo, Xijun Wang, Minchul Kim, Yu Yuan, Wes Robbins, Xingguang Zhang, Nicholas Chimitt, Stanley H. Chan, Zhangyang Wang, Xiaoming Liu
arXiv Computer Vision
Sep 28

FuseReg: Regularizing Layer Fusion Mitigates the Reconstruction-Generation Gap in Representation Autoencoders

arXiv:2609.31620v1 Announce Type: new Abstract: Representation autoencoders (RAEs) reuse features from a pretrained visual encoder as reconstruction and diffusion latents, integrating strong visual r...

By Hongyang Du, Yunfei Xie, Junjie Ye, Jiawei Yang, Xiaoyan Cong, Haodong Zhang, Yongchao Huang, Haiyu Wu, Zongxia Li, Shihang Gui, Dawei Liu, Runhao Li, Jingcheng Ni, Chen Wei, Randall Balestriero, Yue Wang
arXiv AI
Sep 4

LRConv-NeRV: Low Rank Convolution for Efficient Neural Video Compression

LRConv-NeRV introduces low‑rank separable convolutions into the NeRV neural video decoder, replacing selected dense 3x3 layers to reduce computational load and memory usage. By applying low‑rank factorization progressively from the largest to earlier decoder stages, the method offers controllable trade‑offs between reconstruction quality and efficiency. Experiments show that applying LRConv only to the final decoder stage cuts decoder complexity by 68% and model size by 9.3% with negligible quality loss, while INT8 quantization preserves performance close to the dense baseline.

By Tamer Shanableh
arXiv Computer Vision
Oct 23

Provably Contractive and High-Quality Denoisers for Convergent Restoration

The paper introduces denoiser networks that are provably contractive, meaning their global Lipschitz constant is less than one. By combining proximal layers from unfolding techniques with Lipschitz‑controlled convolutional refinements, the authors ensure that small input perturbations produce at most equally small output changes, unlike many strong unconstrained baselines. The proposed denoisers achieve high restoration quality on image denoising tasks, close to that of powerful unconstrained models, and when used as priors in Plug‑and‑Play frameworks, they guarantee convergence and strong empirical performance.

By Shubhi Shukla, Pravin Nair