Searcharxiv⌕ Search

arXiv subjects

Haoyuan Tian

Publications and source records attributed to Haoyuan Tian.

6 recordsLinked to original sources

Graph spectra and late-time concurrence in a lossy reservoir network

We investigate how coupling the local environments of noninteracting qubits into a network changes their late-time entanglement dynamics. Each qubit interacts with a lossy bosonic memory mode, with coherent hopping between memory modes determined by an underlying graph. The initial state contains at most two excitations. We show that the graph spectrum selects the collective modes that survive longest, thereby controlling both the decay and spatial distribution of pair concurrence. At resonance, nonbipartite graphs generically approach a fixed pattern of relative concurrence determined by the Perron eigenvector, whereas bipartite graphs support interference between two equally damped modes. This interference can produce arbitrarily late entanglement revivals when it overcomes the exponential decay of the surviving modes. We derive explicit thresholds separating revival and eventual monotonic decay, and show that loss from two-excitation states can drive the system across these thresholds without changing the graph or the initial one-excitation state. Underlying these results is a general bound on the sector decay rates, $γ_2\ge2γ_1$, valid at arbitrary uniform detuning. We also identify an exceptional equal-rate regime in which coherence between the vacuum and two-excitation sectors contributes to the leading concurrence. Together, these results establish how the topology of a structured dissipative environment and the redistribution of excitations through loss determine the long-time behavior of entanglement.

quant-ph↗

Additive energy and Fourier complexity of graphs

We study the additive energy and the Fourier approximation of graph adjacency matrices labeled by a cyclic group. For a graph with $N$ vertices, $s$ edges and adjacency matrix $M$, the additive energy of its directed edge set is at most $\min\{(2s)^3,N^2\operatorname{tr}(M^4)\}$, and equality in the spectral bound holds exactly when the labeling attains the graph-energy lower bound for the Fourier ratio. Such a labeling also minimizes every best $k$-term Fourier approximation error, whose square equals the tail of the squared adjacency singular values. We prove that graphs of odd prime-power order admit an equality-attaining labeling exactly when they are cyclic Cayley graphs, and a connected example on $15$ vertices shows that equality need not imply vertex transitivity at other orders. We construct regular graph families with asymptotically maximal normalized additive edge energy and unbounded minimum Fourier ratio, one of them with density tending to one half. For dense graph sequences under uniformly random labelings, the collision dimension differs from the reciprocal squared edge density by a quantity tending to zero in probability. We also prove a quantitative stability estimate for the graph-energy bound and show why its dependence on a spectral scale cannot be omitted, even for regular graphs. For a rank-$m$ orthogonal projector we prove $m\leq D_4\leq\operatorname{FR}^2$, characterize the equality $D_4=m$ by cyclic translation invariance, and obtain a quantitative approximation by a circulant projector.

math.CO↗

Edge complexity of graphs

Gupta and Iosevich introduced the edge complexity of a graph as the minimum Fourier ratio of its adjacency matrix over all vertex labelings and bounded it below by graph energy divided by the square root of twice the number of edges. We characterize equality for a fixed labeling: the Fourier transform of the adjacency matrix must have at most one nonzero entry in each row and column. This implies regularity, circulancy of every positive even power of an extremizing adjacency matrix, and a parity restriction on connected components, and it gives equality results for certain Laplacian spectral projectors. We construct equality cases from affine involutions on cyclic groups. Singer difference sets yield, for every prime power $q$, an equality-attaining $(q+1)$-regular graph that is not an abelian Cayley graph. We also establish Fourier-ratio estimates for weak, Cartesian, and strong graph products, including preservation of equality under weak products of coprime orders. We use Fourier-ratio recovery as a coding theorem to obtain entropy upper bounds for low-complexity adjacency matrices and complement them with a lower bound obtained by perturbing complete graphs. Finally, a concentration argument shows that if $Np_N/\log N\to\infty$ and $\limsup_{N\to\infty}p_N<1$, then $\operatorname{FR}_{\min}(G(N,p_N))$ is of order $N$ with probability tending to one.

math.CO↗

Open-World Drone Active Tracking with Goal-Centered Rewards

Drone Visual Active Tracking aims to autonomously follow a target object by controlling the motion system based on visual observations, providing a more practical solution for effective tracking in dynamic environments. However, accurate Drone Visual Active Tracking using reinforcement learning remains challenging due to the absence of a unified benchmark and the complexity of open-world environments with frequent interference. To address these issues, we pioneer a systematic solution. First, we propose DAT, the first open-world drone active air-to-ground tracking benchmark. It encompasses 24 city-scale scenes, featuring targets with human-like behaviors and high-fidelity dynamics simulation. DAT also provides a digital twin tool for unlimited scene generation. Additionally, we propose a novel reinforcement learning method called GC-VAT, which aims to improve the performance of drone tracking targets in complex scenarios. Specifically, we design a Goal-Centered Reward to provide precise feedback across viewpoints to the agent, enabling it to expand perception and movement range through unrestricted perspectives. Inspired by curriculum learning, we introduce a Curriculum-Based Training strategy that progressively enhances the tracking performance in complex environments. Besides, experiments on simulator and real-world images demonstrate the superior performance of GC-VAT, achieving a Tracking Success Rate of approximately 72% on the simulator. The benchmark and code are available at https://github.com/SHWplus/DAT_Benchmark.

cs.RO↗

Automatic bony structure segmentation and curvature estimation on ultrasound cervical spine images -- a feasibility study

The loss of cervical lordosis is a common degenerative disorder known to be associated with abnormal spinal alignment. In recent years, ultrasound (US) imaging has been widely applied in the assessment of spine deformity and has shown promising results. The objectives of this study are to automatically segment bony structures from the 3D US cervical spine image volume and to assess the cervical lordosis on the key sagittal frames. In this study, a portable ultrasound imaging system was applied to acquire cervical spine image volume. The nnU-Net was trained on to segment bony structures on the transverse images and validated by 5-fold-cross-validation. The volume data were reconstructed from the segmented image series. An energy function indicating intensity levels and integrity of bony structures was designed to extract the proxy key sagittal frames on both left and right sides for the cervical curve measurement. The mean absolute difference (MAD), standard deviation (SD) and correlation between the spine curvatures of the left and right sides were calculated for quantitative evaluation of the proposed method. The DSC value of the nnU-Net model in segmenting ROI was 0.973. For the measurement of 22 lamina curve angles, the MAD, SD and correlation between the left and right sides of the cervical spine were 3.591, 3.432 degrees and 0.926, respectively. The results indicate that our method has a high accuracy and reliability in the automatic segmentation of the cervical spine and shows the potential of diagnosing the loss of cervical lordosis using the 3D ultrasound imaging technique.

eess.IV↗

Towards Artistic Image Aesthetics Assessment: a Large-scale Dataset and a New Method

Image aesthetics assessment (IAA) is a challenging task due to its highly subjective nature. Most of the current studies rely on large-scale datasets (e.g., AVA and AADB) to learn a general model for all kinds of photography images. However, little light has been shed on measuring the aesthetic quality of artistic images, and the existing datasets only contain relatively few artworks. Such a defect is a great obstacle to the aesthetic assessment of artistic images. To fill the gap in the field of artistic image aesthetics assessment (AIAA), we first introduce a large-scale AIAA dataset: Boldbrush Artistic Image Dataset (BAID), which consists of 60,337 artistic images covering various art forms, with more than 360,000 votes from online users. We then propose a new method, SAAN (Style-specific Art Assessment Network), which can effectively extract and utilize style-specific and generic aesthetic information to evaluate artistic images. Experiments demonstrate that our proposed approach outperforms existing IAA methods on the proposed BAID dataset according to quantitative comparisons. We believe the proposed dataset and method can serve as a foundation for future AIAA works and inspire more research in this field. Dataset and code are available at: https://github.com/Dreemurr-T/BAID.git

cs.CV↗