SearcharxivSearch

arXiv subjects

Muxingzi Li

Publications and source records attributed to Muxingzi Li.

3 recordsLinked to original sources

Asset Harvester: Extracting 3D Assets from Autonomous Driving Logs for Simulation

Closed-loop simulation is a core component of autonomous vehicle (AV) development, enabling scalable testing, training, and safety validation before real-world deployment. Neural scene reconstruction converts driving logs into interactive 3D environments for simulation, but it does not produce complete 3D object assets required for agent manipulation and large-viewpoint novel-view synthesis. To address this challenge, we present Asset Harvester, an image-to-3D model and end-to-end pipeline that converts sparse, in-the-wild object observations from real driving logs into complete, simulation-ready assets. Rather than relying on a single model component, we developed a system-level design for real-world AV data that combines large-scale curation of object-centric training tuples, geometry-aware preprocessing across heterogeneous sensors, and a robust training recipe that couples sparse-view-conditioned multiview generation with 3D Gaussian lifting. Within this system, SparseViewDiT is explicitly designed to address limited-angle views and other real-world data challenges. Together with hybrid data curation, augmentation, and self-distillation, this system enables scalable conversion of sparse AV object observations into reusable 3D assets.

cs.CV

Enhance Images as You Like with Unpaired Learning

Low-light image enhancement exhibits an ill-posed nature, as a given image may have many enhanced versions, yet recent studies focus on building a deterministic mapping from input to an enhanced version. In contrast, we propose a lightweight one-path conditional generative adversarial network (cGAN) to learn a one-to-many relation from low-light to normal-light image space, given only sets of low- and normal-light training images without any correspondence. By formulating this ill-posed problem as a modulation code learning task, our network learns to generate a collection of enhanced images from a given input conditioned on various reference images. Therefore our inference model easily adapts to various user preferences, provided with a few favorable photos from each user. Our model achieves competitive visual and quantitative results on par with fully supervised methods on both noisy and clean datasets, while being 6 to 10 times lighter than state-of-the-art generative adversarial networks (GANs) approaches.

cs.CV

An analog of Hölder's inequality for the spectral radius of Hadamard products

We prove new inequalities related to the spectral radius $ρ$ of Hadamard products (denoted by $\circ$) of complex matrices. Let $p,q\in [1,\infty]$ satisfy $\frac{1}{p}+\frac{1}{q}=1$, we show an analog of Hölder's inequality on the space of $n\times n$ complex matrices $$ρ(A\circ B) \le ρ(|A|^{\circ p})^{\frac{1}{p}} ρ(|B|^{\circ q})^{\frac{1}{q}} \quad \text{for all $A,B\in \mathbb{C}^{n\times n}$,} $$ where $|\cdot|$ denotes entry-wise absolute values, and $(\cdot)^{\circ p}$ represents the entry-wise Hadamard power. We derive a sharper inequality for the special case $p=q=2$. Given $A,B\in \mathbb{C}^{n\times n}$, for some $β\in (0,1]$ depending on $A$ and $B$, $$ρ(A\circ B) \le βρ(|A\circ A|)^{\frac{1}{2}} ρ(|B\circ B|)^{\frac{1}{2}} .$$ Analysis for another special case $p=1$ and $q=\infty$ is also included.

math.SP