Searcharxiv⌕ Search

arXiv subjects

Hui Zhang

Publications and source records attributed to Hui Zhang.

At least 271 records · Page 15Linked to original sources
arXiv2024

UniCATS: A Unified Context-Aware Text-to-Speech Framework with Contextual VQ-Diffusion and Vocoding

The utilization of discrete speech tokens, divided into semantic tokens and acoustic tokens, has been proven superior to traditional acoustic feature mel-spectrograms in terms of naturalness and robustness for text-to-speech (TTS) synthesis. Recent popular models, such as VALL-E and SPEAR-TTS, allow zero-shot speaker adaptation through auto-regressive (AR) continuation of acoustic tokens extracted from a short speech prompt. However, these AR models are restricted to generate speech only in a left-to-right direction, making them unsuitable for speech editing where both preceding and following contexts are provided. Furthermore, these models rely on acoustic tokens, which have audio quality limitations imposed by the performance of audio codec models. In this study, we propose a unified context-aware TTS framework called UniCATS, which is capable of both speech continuation and editing. UniCATS comprises two components, an acoustic model CTX-txt2vec and a vocoder CTX-vec2wav. CTX-txt2vec employs contextual VQ-diffusion to predict semantic tokens from the input text, enabling it to incorporate the semantic context and maintain seamless concatenation with the surrounding context. Following that, CTX-vec2wav utilizes contextual vocoding to convert these semantic tokens into waveforms, taking into consideration the acoustic context. Our experimental results demonstrate that CTX-vec2wav outperforms HifiGAN and AudioLM in terms of speech resynthesis from semantic tokens. Moreover, we show that UniCATS achieves state-of-the-art performance in both speech continuation and editing.

cs.SD↗
arXiv2024

Towards Source-free Domain Adaptive Semantic Segmentation via Importance-aware and Prototype-contrast Learning

Domain adaptive semantic segmentation enables robust pixel-wise understanding in real-world driving scenes. Source-free domain adaptation, as a more practical technique, addresses the concerns of data privacy and storage limitations in typical unsupervised domain adaptation methods, making it especially relevant in the context of intelligent vehicles. It utilizes a well-trained source model and unlabeled target data to achieve adaptation in the target domain. However, in the absence of source data and target labels, current solutions cannot sufficiently reduce the impact of domain shift and fully leverage the information from the target data. In this paper, we propose an end-to-end source-free domain adaptation semantic segmentation method via Importance-Aware and Prototype-Contrast (IAPC) learning. The proposed IAPC framework effectively extracts domain-invariant knowledge from the well-trained source model and learns domain-specific knowledge from the unlabeled target domain. Specifically, considering the problem of domain shift in the prediction of the target domain by the source model, we put forward an importance-aware mechanism for the biased target prediction probability distribution to extract domain-invariant knowledge from the source model. We further introduce a prototype-contrast strategy, which includes a prototype-symmetric cross-entropy loss and a prototype-enhanced cross-entropy loss, to learn target intra-domain knowledge without relying on labels. A comprehensive variety of experiments on two domain adaptive semantic segmentation benchmarks demonstrates that the proposed end-to-end IAPC solution outperforms existing state-of-the-art methods. The source code is publicly available at https://github.com/yihong-97/Source-free-IAPC.

cs.CV↗
arXiv2024

HIMap: HybrId Representation Learning for End-to-end Vectorized HD Map Construction

Vectorized High-Definition (HD) map construction requires predictions of the category and point coordinates of map elements (e.g. road boundary, lane divider, pedestrian crossing, etc.). State-of-the-art methods are mainly based on point-level representation learning for regressing accurate point coordinates. However, this pipeline has limitations in obtaining element-level information and handling element-level failures, e.g. erroneous element shape or entanglement between elements. To tackle the above issues, we propose a simple yet effective HybrId framework named HIMap to sufficiently learn and interact both point-level and element-level information. Concretely, we introduce a hybrid representation called HIQuery to represent all map elements, and propose a point-element interactor to interactively extract and encode the hybrid information of elements, e.g. point position and element shape, into the HIQuery. Additionally, we present a point-element consistency constraint to enhance the consistency between the point-level and element-level information. Finally, the output point-element integrated HIQuery can be directly converted into map elements' class, point coordinates, and mask. We conduct extensive experiments and consistently outperform previous methods on both nuScenes and Argoverse2 datasets. Notably, our method achieves $77.8$ mAP on the nuScenes dataset, remarkably superior to previous SOTAs by $8.3$ mAP at least.

cs.CV↗
arXiv2024

ArtiGrasp: Physically Plausible Synthesis of Bi-Manual Dexterous Grasping and Articulation

We present ArtiGrasp, a novel method to synthesize bi-manual hand-object interactions that include grasping and articulation. This task is challenging due to the diversity of the global wrist motions and the precise finger control that are necessary to articulate objects. ArtiGrasp leverages reinforcement learning and physics simulations to train a policy that controls the global and local hand pose. Our framework unifies grasping and articulation within a single policy guided by a single hand pose reference. Moreover, to facilitate the training of the precise finger control required for articulation, we present a learning curriculum with increasing difficulty. It starts with single-hand manipulation of stationary objects and continues with multi-agent training including both hands and non-stationary objects. To evaluate our method, we introduce Dynamic Object Grasping and Articulation, a task that involves bringing an object into a target articulated pose. This task requires grasping, relocation, and articulation. We show our method's efficacy towards this task. We further demonstrate that our method can generate motions with noisy hand-object pose estimates from an off-the-shelf image-based regressor.

cs.RO↗
arXiv2024

Ultra-short lifetime isomer studies from photonuclear reactions using laser-driven ultra-intense γ-ray

Isomers, ubiquitous populations of relatively long-lived nuclear excited states, play a crucial role in nuclear physics. However, isomers with half-life times of several seconds or less barely had experimental cross section data due to the lack of a suitable measuring method. We report a method of online γ spectroscopy for ultra-short-lived isomers from photonuclear reactions using laser-driven ultra-intense γ-rays. The fastest time resolution can reach sub-ps level with γ-ray intensities >10^{19}/s ({\geqslant} 8 MeV). The ^{115}In(γ, n)^{114m2}In reaction (T_{1/2} = 43.1 ms) was first measured in the high-energy region which shed light on the nuclear structure studies of In element. Simulations showed it would be an efficient way to study ^{229m}Th (T_{1/2} = 7 μs), which is believed to be the next generation of nuclear clock. This work offered a unique way of gaining insight into ultra-short lifetimes and promised an effective way to fill the gap in relevant experimental data.

nucl-ex↗
arXiv2024

Joint Design of ISAC Waveform under PAPR Constraints

In this paper, we formulate the precoding problem of integrated sensing and communication (ISAC) waveform as a non-convex quadratically constrainted quadratic program (QCQP), in which the weighted sum of communication multi-user interference (MUI) and the gap between dual-use waveform and ideal radar waveform is minimized with peak-to-average power ratio (PAPR) constraints. We propose an efficient algorithm based on alternating direction method of multipliers (ADMM), which is able to decouple multiple variables and provide a closed-form solution for each subproblem. In addition, to improve the sensing performance in both spatial and temporal domains, we propose a new criteria to design the ideal radar waveform, in which the beam pattern is made similar to the ideal one and the integrated sidelobe level of the ambiguity function in each target direction is minimized in the region of interest. The limited memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) algorithm is applied to the design of the ideal radar waveform which works as a reference in the design of the dual-function waveform. Numerical results indicate that the designed dual-function waveform is capable of offering good communication quality of service (QoS) and sensing performance.

eess.SP↗
arXiv2024

Magnetosheath ion field-aligned anisotropy and implications for ion leakage to the foreshock

The ion foreshock is highly dynamic, disturbing the bow shock and the magnetosphere-ionosphere system. To forecast foreshock-driven space weather effects, it is necessary to model foreshock ions as a function of upstream shock parameters. Case studies in the accompanying paper show that magnetosheath ions sometimes exhibit strong field-aligned anisotropy towards the upstream direction, which may be responsible for enhancing magnetosheath leakage and therefore foreshock ion density. To understand the conditions leading to such an anisotropy and the potential for enhanced leakage, we perform case studies and a statistical study of magnetosheath and foreshock region data surrounding ~500 THEMIS bow shock crossings. We quantify the anisotropy using the heat flux along the field-aligned direction. We show that the strong field-aligned heat flux persists across the entire magnetosheath from the magnetopause to the bow shock. Ion distribution functions reveal that the strong heat flux is caused by a secondary thermal population. We find that stronger anisotropy events exhibit heat flux preferentially towards the upstream direction near the bow shock and occur under larger IMF strength and larger solar wind dynamic pressure and/or energy flux. Additionally, we show that near the bow shock, magnetosheath leakage is a significant contributor to foreshock ions, and through enhancing the leakage the magnetosheath ion anisotropy can modulate the foreshock ion velocity and density. Our results imply that likely due to field line draping and compression against the magnetopause that leads to a directional mirror force, modeling the foreshock ions necessitates a more global accounting of downstream conditions.

physics.space-ph↗
arXiv2024

Two mini-Neptunes Transiting the Adolescent K-star HIP 113103 Confirmed with TESS and CHEOPS

We report the discovery of two mini-Neptunes in near 2:1 resonance orbits ($P=7.610303$ d for HIP 113103 b and $P=14.245651$ d for HIP 113103 c) around the adolescent K-star HIP 113103 (TIC 121490076). The planet system was first identified from the TESS mission, and was confirmed via additional photometric and spectroscopic observations, including a $\sim$17.5 hour observation for the transits of both planets using ESA CHEOPS. We place $\leq4.5$ min and $\leq2.5$ min limits on the absence of transit timing variations over the three year photometric baseline, allowing further constraints on the orbital eccentricities of the system beyond that available from the photometric transit duration alone. With a planetary radius of $R_{p}=1.829^{+0.096}_{-0.067}\,R_{\oplus}$, HIP 113103 b resides within the radius gap, and this might provide invaluable information on the formation disparities between super-Earths and mini-Neptunes. Given the larger radius $R_{p}=2.40^{+0.10}_{-0.08}\,R_{\oplus}$ for HIP 113103 c, and close proximity of both planets to HIP 113103, it is likely that HIP 113103 b might have lost (or is still losing) its primordial atmosphere. We therefore present simulated atmospheric transmission spectra of both planets using JWST, HST, and Twinkle. It demonstrates a potential metallicity difference (due to differences in their evolution) would be a challenge to detect if the atmospheres are in chemical equilibrium. As one of the brightest multi sub-Neptune planet systems suitable for atmosphere follow up, HIP 113103 b and HIP 113103 c could provide insight on planetary evolution for the sub-Neptune K-star population.

astro-ph.EP↗
arXiv2024

Choice of training label matters: how to best use deep learning for quantitative MRI parameter estimation

Deep learning (DL) is gaining popularity as a parameter estimation method for quantitative MRI. A range of competing implementations have been proposed, relying on either supervised or self-supervised learning. Self-supervised approaches, sometimes referred to as unsupervised, have been loosely based on auto-encoders, whereas supervised methods have, to date, been trained on groundtruth labels. These two learning paradigms have been shown to have distinct strengths. Notably, self-supervised approaches have offered lower-bias parameter estimates than their supervised alternatives. This result is counterintuitive - incorporating prior knowledge with supervised labels should, in theory, lead to improved accuracy. In this work, we show that this apparent limitation of supervised approaches stems from the naive choice of groundtruth training labels. By training on labels which are deliberately not groundtruth, we show that the low-bias parameter estimation previously associated with self-supervised methods can be replicated - and improved on - within a supervised learning framework. This approach sets the stage for a single, unifying, deep learning parameter estimation framework, based on supervised learning, where trade-offs between bias and variance are made by careful adjustment of training label.

physics.med-ph↗
arXiv2024

Explore the Origin of Spontaneous Symmetry Breaking from Adaptive Perturbation Method

Spontaneous symmetry breaking occurs when the underlying laws of a physical system are symmetric, but the vacuum state chosen by the system is not. The (3+1)d $ϕ^4$ theory is relatively simple compared to other more complex theories, making it a good starting point for investigating the origin of non-trivial vacua. The adaptive perturbation method is a technique used to handle strongly coupled systems. The study of strongly correlated systems is useful in testing holography. It has been successful in strongly coupled QM and is being generalized to scalar field theory to analyze the system in the strong-coupling regime. The unperturbed Hamiltonian does not commute with the usual number operator. However, the quantized scalar field admits a plane-wave expansion when acting on the vacuum. While quantizing the scalar field theory, the field can be expanded into plane-wave modes, making the calculations more tractable. However, the Lorentz symmetry, which describes how physical laws remain the same under certain spacetime transformations, might not be manifest in this approach. The proposed elegant resummation of Feynman diagrams aims to restore the Lorentz symmetry in the calculations. The results obtained using this method are compared with numerical solutions for specific values of the coupling constant $λ= 1, 2, 4, 8, 16$. Finally, we find evidence for quantum triviality, where self-consistency of the theory in the UV requires $λ= 0$. This result implies that the $ϕ^4$ theory alone does not experience SSB, and the $\langle ϕ\rangle = 0$ phase is protected under the RG-flow by a boundary of Gaussian fixed-points.

hep-th↗
arXiv2024

Nonlinear preconditioned primal-dual method for a class of structured minimax problems

We propose and analyze a general framework called nonlinear preconditioned primal-dual with projection for solving nonconvex-nonconcave and non-smooth saddle-point problems. The framework consists of two steps. The first is a nonlinear preconditioned map followed by a relaxed projection onto the separating hyperspace we construct. One key to the method is the selection of preconditioned operators, which tailors to the structure of the saddle-point problem and is allowed to be nonlinear and asymmetric. The other is the construction of separating hyperspace, which guarantees fast convergence. This framework paves the way for constructing nonlinear preconditioned primal-dual algorithms. We show that weak convergence, and so is sublinear convergence under the assumption of the convexity of saddle-point problems and linear convergence under a metric subregularity. We also show that many existing primal-daul methods, such as the generalized primal-dual algorithm method, are special cases of relaxed preconditioned primal-dual with projection.

math.OC↗
arXiv2023

Privacy-preserving transactive energy systems: Key topics and open research challenges

This manuscript aims to formalize and conclude the discussions initiated during the PriTEM workshop 22-23 March 2023. We present important ideas and discussion topics in the context of transactive energy systems. Moreover, the conclusions from the discussions articulate potential aspects to be explored in future studies on transactive energy management. Particularly, these conclusions cover research topics in energy technology and energy informatics, energy law, data law, energy market and socio-psychology that are relevant to the seamless integration of renewable energy resources and the transactive energy systems-in smart microgrids-focusing on distributed frameworks such as peer-to-peer (P2P) energy trading. We clarify issues, identify barriers, and suggest possible solutions to open questions in diversified topics, such as block-chain interoperability, consumer privacy and data sharing, and participation incentivization. Furthermore, we also elaborate challenges associated with cross-disciplinary collaboration and coordination for transactive energy systems, and enumerate the lessons learned from our work so far.

eess.SY↗
arXiv2023

Predicting urban tree cover from incomplete point labels and limited background information

Trees inside cities are important for the urban microclimate, contributing positively to the physical and mental health of the urban dwellers. Despite their importance, often only limited information about city trees is available. Therefore in this paper, we propose a method for mapping urban trees in high-resolution aerial imagery using limited datasets and deep learning. Deep learning has become best-practice for this task, however, existing approaches rely on large and accurately labelled training datasets, which can be difficult and expensive to obtain. However, often noisy and incomplete data may be available that can be combined and utilized to solve more difficult tasks than those datasets were intended for. This paper studies how to combine accurate point labels of urban trees along streets with crowd-sourced annotations from an open geographic database to delineate city trees in remote sensing images, a task which is challenging even for humans. To that end, we perform semantic segmentation of very high resolution aerial imagery using a fully convolutional neural network. The main challenge is that our segmentation maps are sparsely annotated and incomplete. Small areas around the point labels of the street trees coming from official and crowd-sourced data are marked as foreground class. Crowd-sourced annotations of streets, buildings, etc. define the background class. Since the tree data is incomplete, we introduce a masking to avoid class confusion. Our experiments in Hamburg, Germany, showed that the system is able to produce tree cover maps, not limited to trees along streets, without providing tree delineations. We evaluated the method on manually labelled trees and show that performance drastically deteriorates if the open geographic database is not used.

cs.CV↗
arXiv2023

Research on solitons interactions' in one-dimensional indium chains on Si(111) surfaces

Solitons have garnered significant attention across various fields, yet a contentious debate persists regarding the precise structure of solitons on indium chains. Currently, multiple forms of solitons in one-dimensional atomic chains have been reported. STM provides an effective means to study the precise atomic structure of solitons, particularly their dynamics and interactions. However, limited research has been conducted on soliton interactions and soliton-chain interactions, despite their profound impact on relative soliton motions and the overall physical properties of the system. In this work, we characterized the structures of the soliton dimer and trimer, observed the displacements induced by the soliton entity and statisticized the dynamic behaviors of soliton dimers over time evolution or temperature. To reveal the soliton mechanism, we further utilized STM to investigate the CDWs between two solitons when two monomers were encountered. Additionally, we achieved the manipulation of the monomer on the indium chain by the STM tip. Our work serves as an important approach to elucidate interactions in correlated electronic systems and advance the development of potential topological soliton computers.

cond-mat.mtrl-sci↗
arXiv2023

Preliminary Design of CSNS-II Linac SRF LLRF

China Spallation Neutron Source(CSNS) target power will upgrade to 500 kW(CSNS-II) from 300kW, energy gain of H-Linac will up to 300 MeV from 80 MeV using about 50 superconductor cavities. LLRF is an important device for controlling the amplitude and phase of the SRF cavity field to be less than 0.6% and 0.6 deg. The parameters and requirements for CSNS-II Linac LLRF are presented here. The preliminary design work and algorithm verification progress and results at C-ADS Injector-I are introduced.

physics.acc-ph↗
arXiv2023

AdapterShadow: Adapting Segment Anything Model for Shadow Detection

Segment anything model (SAM) has shown its spectacular performance in segmenting universal objects, especially when elaborate prompts are provided. However, the drawback of SAM is twofold. On the first hand, it fails to segment specific targets, e.g., shadow images or lesions in medical images. On the other hand, manually specifying prompts is extremely time-consuming. To overcome the problems, we propose AdapterShadow, which adapts SAM model for shadow detection. To adapt SAM for shadow images, trainable adapters are inserted into the frozen image encoder of SAM, since the training of the full SAM model is both time and memory consuming. Moreover, we introduce a novel grid sampling method to generate dense point prompts, which helps to automatically segment shadows without any manual interventions. Extensive experiments are conducted on four widely used benchmark datasets to demonstrate the superior performance of our proposed method. Codes will are publicly available at https://github.com/LeipingJie/AdapterShadow.

cs.CV↗
arXiv2023

A Comprehensive Survey on Database Management System Fuzzing: Techniques, Taxonomy and Experimental Comparison

Database Management System (DBMS) fuzzing is an automated testing technique aimed at detecting errors and vulnerabilities in DBMSs by generating, mutating, and executing test cases. It not only reduces the time and cost of manual testing but also enhances detection coverage, providing valuable assistance in developing commercial DBMSs. Existing fuzzing surveys mainly focus on general-purpose software. However, DBMSs are different from them in terms of internal structure, input/output, and test objectives, requiring specialized fuzzing strategies. Therefore, this paper focuses on DBMS fuzzing and provides a comprehensive review and comparison of the methods in this field. We first introduce the fundamental concepts. Then, we systematically define a general fuzzing procedure and decompose and categorize existing methods. Furthermore, we classify existing methods from the testing objective perspective, covering various components in DBMSs. For representative works, more detailed descriptions are provided to analyze their strengths and limitations. To objectively evaluate the performance of each method, we present an open-source DBMS fuzzing toolkit, OpenDBFuzz. Based on this toolkit, we conduct a detailed experimental comparative analysis of existing methods and finally discuss future research directions.

cs.DB↗
arXiv2023

Resilient and constrained consensus against adversarial attacks: A distributed MPC framework

There has been a growing interest in realizing the resilient consensus of the multi-agent system (MAS) under cyber-attacks, which aims to achieve the consensus of normal agents (i.e., agents without attacks) in a network, depending on the neighboring information. The literature has developed mean-subsequence-reduced (MSR) algorithms for the MAS with F adversarial attacks and has shown that the consensus is achieved for the normal agents when the communication network is at least (2F+1)-robust. However, such a stringent requirement on the communication network needs to be relaxed to enable more practical applications. Our objective is, for the first time, to achieve less stringent conditions on the network, while ensuring the resilient consensus for the general linear MAS subject to control input constraints. In this work, we propose a distributed resilient consensus framework, consisting of a pre-designed consensus protocol and distributed model predictive control (DMPC) optimization, which can help significantly reduce the requirement on the network robustness and effectively handle the general linear constrained MAS under adversarial attacks. By employing a novel distributed adversarial attack detection mechanism based on the history information broadcast by neighbors and a convex set (i.e., resilience set), we can evaluate the reliability of communication links. Moreover, we show that the recursive feasibility of the associated DMPC optimization problem can be guaranteed. The proposed consensus protocol features the following properties: 1) by minimizing a group of control variables, the consensus performance is optimized; 2) the resilient consensus of the general linear constrained MAS subject to F-locally adversarial attacks is achieved when the communication network is (F+1)-robust. Finally, numerical simulation results are presented to verify the theoretical results.

eess.SY↗