Searcharxiv⌕ Search

arXiv subjects

Jia Wang

Publications and source records attributed to Jia Wang.

At least 109 records · Page 6Linked to original sources

Image Editing with Diffusion Models: A Survey

With deeper exploration of diffusion model, developments in the field of image generation have triggered a boom in image creation. As the quality of base-model generated images continues to improve, so does the demand for further application like image editing. In recent years, many remarkable works are realizing a wide variety of editing effects. However, the wide variety of editing types and diverse editing approaches have made it difficult for researchers to establish a comprehensive view of the development of this field. In this survey, we summarize the image editing field from four aspects: tasks definition, methods classification, results evaluation and editing datasets. First, we provide a definition of image editing, which in turn leads to a variety of editing task forms from the perspective of operation parts and manipulation actions. Subsequently, we categorize and summary methods for implementing editing into three categories: inversion-based, fine-tuning-based and adapter-based. In addition, we organize the currently used metrics, available datasets and corresponding construction methods. At the end, we present some visions for the future development of the image editing field based on the previous summaries.

cs.GR↗

Exact spectral properties of Fermi polarons in one-dimensional lattices: Anomalous Fermi singularities and polaron quasiparticles

We calculate the exact spectral function of a single impurity repulsively interacting with a bath of fermions in one-dimensional lattices, by deriving the explicit expression of the form factor for both regular Bethe states and the irregular spin-flip state and $η$-pairing state, based on the exactly solvable Lieb-Wu model. While at low impurity momentum $Q\sim0$ the spectral function is dominated by two power-law Fermi singularities, at large momentum we observe that the two singularities develop into two-sided distributions and eventually become anomalous Fermi singularities at the boundary of the Brillouin zone (i.e., $Q=\pmπ$), with the power-law tails extending towards low energy. Near the quarter filling of the Fermi bath, we also find two broad polaron peaks at large impurity momentum, collectively contributed by many excited many-body states with non-negligible form factors. Our exact results of those distinct features in one-dimensional Fermi polarons, which have no correspondences in two and three dimensions, could be readily probed in cold-atom laboratories by trapping highly imbalanced two-component fermionic atoms into one-dimensional optical lattices.

cond-mat.quant-gas↗

OpenDosimeter: Open Hardware Personal X-ray Dosimeter

We present OpenDosimeter (www.opendosimeter.org), an open hardware solution for real-time personal X-ray dose monitoring based on a scintillation counter. Using an X-ray sensor assembly (LYSO + SiPM) on a custom board powered by a Raspberry Pi Pico, OpenDosimeter provides real-time feedback (1 Hz), data logging (10 hours), and battery-powered operation. One of the core innovations is that we calibrate the device using $^{241}$Am found in ionization smoke detectors. Specifically, we use the $γ$-emissions to spectrally calibrate the dosimeter, then calculate the effective dose from X-ray exposure by compensating for the scintillator absorption efficiency and applying energy-to-dose coefficients derived from tabulated data in the ICRP 116 publication. We demonstrate that this transparent approach enables real-time dose rate readings with a linear response between 0.1-1000 $μ$Sv/h at $\pm$25% accuracy, tested for energies up to 120 keV. The maximum dose rate readings are limited by pile-up effects when approaching count rate saturation ($\sim$77 kcps at $\sim$13 $μ$s average pulse processing time). The total component cost for making an OpenDosimeter is <\$100, which, combined with its open design (both hardware and software), enables cost-effective local reproducibility on a global scale. Through a student workshop, we also demonstrate its effectiveness as an educational and capacity-building tool. This paper complements the open-source documentation by explaining the underlying technology, the algorithm for dose calculation, and areas for future improvement.

physics.ins-det↗

Information Density Principle for MLLM Benchmarks

With the emergence of Multimodal Large Language Models (MLLMs), hundreds of benchmarks have been developed to ensure the reliability of MLLMs in downstream tasks. However, the evaluation mechanism itself may not be reliable. For developers of MLLMs, questions remain about which benchmark to use and whether the test results meet their requirements. Therefore, we propose a critical principle of Information Density, which examines how much insight a benchmark can provide for the development of MLLMs. We characterize it from four key dimensions: (1) Fallacy, (2) Difficulty, (3) Redundancy, (4) Diversity. Through a comprehensive analysis of more than 10,000 samples, we measured the information density of 19 MLLM benchmarks. Experiments show that using the latest benchmarks in testing can provide more insight compared to previous ones, but there is still room for improvement in their information density. We hope this principle can promote the development and application of future MLLM benchmarks. Project page: https://github.com/lcysyzxdxc/bench4bench

cs.CL↗

Beam test result and digitization of TaichuPix-3: A Monolithic Active Pixel Sensors for CEPC vertex detector

The Circular Electron-Positron Collider (CEPC), as the next-generation electron-positron collider, is tasked with advancing not only Higgs physics but also the discovery of new physics. Achieving these goals requires high-precision measurements of particles. Taichu seires, Monolithic Active Pixel Sensor (MAPS), a key component of the vertex detector for CEPC was designed to meet the CEPC's requirements. For the geometry of vertex detector is long barrel with no endcap, and current silicon lacks a complete digitization model, precise estimation of cluster size particularly causing by particle with large incident angle is needed. Testbeam results were conducted at the Beijing Synchrotron Radiation Facility (BSRF) to evaluate cluster size dependence on different incident angles and threshold settings. Experimental results confirmed that cluster size increases with incident angle. Simulations using the Allpix$^2$ framework replicated experimental trends at small angles but exhibited discrepancies at large angles, suggesting limitations in linear electric field assumptions and sensor thickness approximations. The results from both testbeam and simulations have provided insights into the performance of the TaichuPix chip at large incident angles, offering a crucial foundation for the establishment of a digital model and addressing the estimation of cluster size in the forward region of the long barrel. Furthermore, it offers valuable references for future iterations of TaichuPix, the development of digital models, and the simulation and estimation of the vertex detector's performance.

physics.ins-det↗

Constrained Gaussian Wasserstein Optimal Transport with Commutative Covariance Matrices

Optimal transport has found widespread applications in signal processing and machine learning. Among its many equivalent formulations, optimal transport seeks to reconstruct a random variable/vector with a prescribed distribution at the destination while minimizing the expected distortion relative to a given random variable/vector at the source. However, in practice, certain constraints may render the optimal transport plan infeasible. In this work, we consider three types of constraints: rate constraints, dimension constraints, and channel constraints, motivated by perception-aware lossy compression, generative principal component analysis, and deep joint source-channel coding, respectively. Special attenion is given to the setting termed Gaussian Wasserstein optimal transport, where both the source and reconstruction variables are multivariate Gaussian, and the end-to-end distortion is measured by the mean squared error. We derive explicit results for the minimum achievable mean squared error under the three aforementioned constraints when the covariance matrices of the source and reconstruction variables commute.

cs.IT↗

Multi-Dimensional Quality Assessment for Text-to-3D Assets: Dataset and Model

Recent advancements in text-to-image (T2I) generation have spurred the development of text-to-3D asset (T23DA) generation, leveraging pretrained 2D text-to-image diffusion models for text-to-3D asset synthesis. Despite the growing popularity of text-to-3D asset generation, its evaluation has not been well considered and studied. However, given the significant quality discrepancies among various text-to-3D assets, there is a pressing need for quality assessment models aligned with human subjective judgments. To tackle this challenge, we conduct a comprehensive study to explore the T23DA quality assessment (T23DAQA) problem in this work from both subjective and objective perspectives. Given the absence of corresponding databases, we first establish the largest text-to-3D asset quality assessment database to date, termed the AIGC-T23DAQA database. This database encompasses 969 validated 3D assets generated from 170 prompts via 6 popular text-to-3D asset generation models, and corresponding subjective quality ratings for these assets from the perspectives of quality, authenticity, and text-asset correspondence, respectively. Subsequently, we establish a comprehensive benchmark based on the AIGC-T23DAQA database, and devise an effective T23DAQA model to evaluate the generated 3D assets from the aforementioned three perspectives, respectively.

cs.CV↗

The Power of Graph Signal Processing for Chip Placement Acceleration

Placement is a critical task with high computation complexity in VLSI physical design. Modern analytical placers formulate the placement objective as a nonlinear optimization task, which suffers a long iteration time. To accelerate and enhance the placement process, recent studies have turned to deep learning-based approaches, particularly leveraging graph convolution networks (GCNs). However, learning-based placers require time- and data-consuming model training due to the complexity of circuit placement that involves large-scale cells and design-specific graph statistics. This paper proposes GiFt, a parameter-free technique for accelerating placement, rooted in graph signal processing. GiFt excels at capturing multi-resolution smooth signals of circuit graphs to generate optimized placement solutions without the need for time-consuming model training, and meanwhile significantly reduces the number of iterations required by analytical placers. Experimental results show that GiFt significantly improving placement efficiency, while achieving competitive or superior performance compared to state-of-the-art placers. In particular, compared to DREAMPlace, the recently proposed GPU-accelerated analytical placer, GF-Placer improves total runtime over 45%.

cs.LG↗

Slow Perception: Let's Perceive Geometric Figures Step-by-step

Recently, "visual o1" began to enter people's vision, with expectations that this slow-thinking design can solve visual reasoning tasks, especially geometric math problems. However, the reality is that current LVLMs (Large Vision Language Models) can hardly even accurately copy a geometric figure, let alone truly understand the complex inherent logic and spatial relationships within geometric shapes. We believe accurate copying (strong perception) is the first step to visual o1. Accordingly, we introduce the concept of "slow perception" (SP), which guides the model to gradually perceive basic point-line combinations, as our humans, reconstruct complex geometric structures progressively. There are two-fold stages in SP: a) perception decomposition. Perception is not instantaneous. In this stage, complex geometric figures are broken down into basic simple units to unify geometry representation. b) perception flow, which acknowledges that accurately tracing a line is not an easy task. This stage aims to avoid "long visual jumps" in regressing line segments by using a proposed "perceptual ruler" to trace each line stroke-by-stroke. Surprisingly, such a human-like perception manner enjoys an inference time scaling law -- the slower, the better. Researchers strive to speed up the model's perception in the past, but we slow it down again, allowing the model to read the image step-by-step and carefully.

cs.CV↗

Convexity of Mutual Information along the Fokker-Planck Flow

We study the convexity of mutual information as a function of time along the Fokker-Planck flow. The results are generalizations of that along heat flow and Ornstein-Ulenbeck flow, which were established by A. Wibisono and V. Jog. We prove the existence and uniqueness of the classical solutions to a class of Fokker-Planck equations and then we obtain the second derivative of mutual information along the Fokker-Planck equation. If the initial distribution is sufficiently strongly log-concave compared to the steady state, then mutual information always preserves convexity under suitable conditions. In particular, if there exists some time point at which the distribution is sufficiently strongly log-concave, then mutual information will preserve convexity after that time.

cs.IT↗

A Revisit to Rate-distortion Theory via Optimal Weak Transport

This paper revisits the rate-distortion theory from the perspective of optimal weak transport, as recently introduced by Gozlan et al. While the conditions for optimality and the existence of solutions are well-understood in the case of discrete alphabets, the extension to abstract alphabets requires more intricate analysis. Within the framework of weak transport problems, we derive a parametric representation of the rate-distortion function, thereby connecting the rate-distortion function with the Schrödinger bridge problem, and establish necessary conditions for its optimality. As a byproduct of our analysis, we reproduce K. Rose's conclusions regarding the achievability of Shannon lower bound concisely, without reliance on variational calculus.

cs.IT↗

Pruning for Sparse Diffusion Models based on Gradient Flow

Diffusion Models (DMs) have impressive capabilities among generation models, but are limited to slower inference speeds and higher computational costs. Previous works utilize one-shot structure pruning to derive lightweight DMs from pre-trained ones, but this approach often leads to a significant drop in generation quality and may result in the removal of crucial weights. Thus we propose a iterative pruning method based on gradient flow, including the gradient flow pruning process and the gradient flow pruning criterion. We employ a progressive soft pruning strategy to maintain the continuity of the mask matrix and guide it along the gradient flow of the energy function based on the pruning criterion in sparse space, thereby avoiding the sudden information loss typically caused by one-shot pruning. Gradient-flow based criterion prune parameters whose removal increases the gradient norm of loss function and can enable fast convergence for a pruned model in iterative pruning stage. Our extensive experiments on widely used datasets demonstrate that our method achieves superior performance in efficiency and consistency with pre-trained models.

cs.LG↗

Language-based Audio Retrieval with Co-Attention Networks

In recent years, user-generated audio content has proliferated across various media platforms, creating a growing need for efficient retrieval methods that allow users to search for audio clips using natural language queries. This task, known as language-based audio retrieval, presents significant challenges due to the complexity of learning semantic representations from heterogeneous data across both text and audio modalities. In this work, we introduce a novel framework for the language-based audio retrieval task that leverages co-attention mechanismto jointly learn meaningful representations from both modalities. To enhance the model's ability to capture fine-grained cross-modal interactions, we propose a cascaded co-attention architecture, where co-attention modules are stacked or iterated to progressively refine the semantic alignment between text and audio. Experiments conducted on two public datasets show that the proposed method can achieve better performance than the state-of-the-art method. Specifically, our best performed co-attention model achieves a 16.6% improvement in mean Average Precision on Clotho dataset, and a 15.1% improvement on AudioCaps.

cs.SD↗

When does a Fermi puddle become a Fermi sea? Emergence of pairing in two-dimensional trapped mesoscopic Fermi gases

Pairing lies at the heart of superfluidity in fermionic systems. Motivated by recent experiments in mesoscopic Fermi gases, we study up to six fermionic atoms with equal masses and equal populations in two different spin states, confined in a quasi-two-dimensional harmonic trap. We couple a stochastic variational approach with the use of an explicitly correlated Gaussian basis set, which enables us to obtain highly accurate energies and structural properties. Utilising two-dimensional two-body scattering theory with a finite-range Gaussian interaction potential, we tune the effective range to model realistic quasi-two-dimensional scattering. We calculate the excitation spectrum, pair correlation function, and number of pairs as a function of increasing attractive interaction strength. For up to six fermions in the ground state, we find that opposite spin and momentum pairing is maximised well below the Fermi surface in momentum space. By contrast, corresponding experiments on twelve fermions have found that pairing is maximal at the Fermi surface and strongly suppressed beneath [M. Holten et al., Nature 606, 287-291 (2022)]. This suggests that the Fermi sea $-$ which acts to suppress pairing at low momenta via Pauli blocking $-$ emerges in the transition from six to twelve particles.

cond-mat.quant-gas↗

Breakdown of the single-mode description of ultradilute quantum droplets in binary Bose mixtures: A perspective from a microscopic bosonic pairing theory

In his seminal proposal of quantum droplets in binary Bose mixtures {[}Phys. Rev. Lett. \textbf{115}, 155302 (2015){]}, Dmitry Petrov suggested that the density ratio $n_{2}/n_{1}$ of the two bosonic components are locked to an optimal value, which is given by the square root of the ratio of the two intra-species scattering lengths, i.e., $\sqrt{a_{11}/a_{22}}$. Due to such a density locking, quantum droplets can be efficiently described by using an extended Gross--Pitaevskii equation within the single-mode approximation. Here, we find that this single-mode description necessarily breaks down in the deep quantum droplet regime, when the attractive inter-species scattering length $a_{12}$ significantly deviates away from the threshold of mean-field collapse (i.e., $-\sqrt{a_{11}a_{22}}$). By applying a bosonic pairing theory, we show that the density ratio is allowed to fluctuate in a sizable interval. Most importantly, the optimal density ratio would be very different from $\sqrt{a_{11}/a_{22}}$, in the case of unequal intra-species scattering lengths ($a_{11}\neq a_{22}$). Our finding might provide a plausible microscopic explanation of the puzzling low critical particle number of quantum droplets, as experimentally observed. Our predicted interval of the density ratio, as a function of the inter-species scattering length, could also be experimentally examined in cold-atom laboratories in the near future.

cond-mat.quant-gas↗

Generative Iris Prior Embedded Transformer for Iris Restoration

Iris restoration from complexly degraded iris images, aiming to improve iris recognition performance, is a challenging problem. Due to the complex degradation, directly training a convolutional neural network (CNN) without prior cannot yield satisfactory results. In this work, we propose a generative iris prior embedded Transformer model (Gformer), in which we build a hierarchical encoder-decoder network employing Transformer block and generative iris prior. First, we tame Transformer blocks to model long-range dependencies in target images. Second, we pretrain an iris generative adversarial network (GAN) to obtain the rich iris prior, and incorporate it into the iris restoration process with our iris feature modulator. Our experiments demonstrate that the proposed Gformer outperforms state-of-the-art methods. Besides, iris recognition performance has been significantly improved after applying Gformer.

eess.IV↗

General OCR Theory: Towards OCR-2.0 via a Unified End-to-end Model

Traditional OCR systems (OCR-1.0) are increasingly unable to meet people's usage due to the growing demand for intelligent processing of man-made optical characters. In this paper, we collectively refer to all artificial optical signals (e.g., plain texts, math/molecular formulas, tables, charts, sheet music, and even geometric shapes) as "characters" and propose the General OCR Theory along with an excellent model, namely GOT, to promote the arrival of OCR-2.0. The GOT, with 580M parameters, is a unified, elegant, and end-to-end model, consisting of a high-compression encoder and a long-contexts decoder. As an OCR-2.0 model, GOT can handle all the above "characters" under various OCR tasks. On the input side, the model supports commonly used scene- and document-style images in slice and whole-page styles. On the output side, GOT can generate plain or formatted results (markdown/tikz/smiles/kern) via an easy prompt. Besides, the model enjoys interactive OCR features, i.e., region-level recognition guided by coordinates or colors. Furthermore, we also adapt dynamic resolution and multi-page OCR technologies to GOT for better practicality. In experiments, we provide sufficient results to prove the superiority of our model.

cs.CV↗

Exact Polaron-Polaron interactions in a Quantum Hall Fluid

We present an exact solution for effective polaron-polaron interactions between heavy impurities, mediated by a sea of non-interacting light fermions in the quantum Hall regime with highly degenerate Landau levels. For weak attraction between impurities and fermions, where only the manifold of lowest Landau levels is relevant, we obtain an analytical expression of mediated polaron-polaorn interactions. Remarkably, polaron interactions are exactly zero when fermions in lowest Landau levels outnumber heavy impurities. For strong attraction, different manifolds of higher Landau levels come into play and we derive a set of equations that can be used to numerically solve the mediated polaron interaction potential. We find that the potential vanishes when the distance R between impurities is larger than the magnetic length, but strongly diverges at short range following a Coulomb form -1/R. Our exact results of polaron-polaron interactions might be examined in cold-atom setups, where a system of Fermi polarons in the quantum Hall regime is realized with synthetic gauge field or under fast rotation. Our predictions could also be useful to understand the effective interaction between exciton-polarons in electron-doped semiconductors under strong magnetic field.

cond-mat.mes-hall↗