Search arXiv⌕ Search

arXiv subjects

Hui Zhang

Publications and source records attributed to Hui Zhang.

At least 271 records · Page 15Linked to original sources

Augmenting Sports Videos with VisCommentator

Visualizing data in sports videos is gaining traction in sports analytics, given its ability to communicate insights and explicate player strategies engagingly. However, augmenting sports videos with such data visualizations is challenging, especially for sports analysts, as it requires considerable expertise in video editing. To ease the creation process, we present a design space that characterizes augmented sports videos at an element-level (what the constituents are) and clip-level (how those constituents are organized). We do so by systematically reviewing 233 examples of augmented sports videos collected from TV channels, teams, and leagues. The design space guides selection of data insights and visualizations for various purposes. Informed by the design space and close collaboration with domain experts, we design VisCommentator, a fast prototyping tool, to eases the creation of augmented table tennis videos by leveraging machine learning-based data extractors and design space-based visualization recommendations. With VisCommentator, sports analysts can create an augmented video by selecting the data to visualize instead of manually drawing the graphical marks. Our system can be generalized to other racket sports (e.g., tennis, badminton) once the underlying datasets and models are available. A user study with seven domain experts shows high satisfaction with our system, confirms that the participants can reproduce augmented sports videos in a short period, and provides insightful implications into future improvements and opportunities.

cs.HC↗

Deep Lead Optimization: Leveraging Generative AI for Structural Modification

The idea of using deep-learning-based molecular generation to accelerate discovery of drug candidates has attracted extraordinary attention, and many deep generative models have been developed for automated drug design, termed molecular generation. In general, molecular generation encompasses two main strategies: de novo design, which generates novel molecular structures from scratch, and lead optimization, which refines existing molecules into drug candidates. Among them, lead optimization plays an important role in real-world drug design. For example, it can enable the development of me-better drugs that are chemically distinct yet more effective than the original drugs. It can also facilitate fragment-based drug design, transforming virtual-screened small ligands with low affinity into first-in-class medicines. Despite its importance, automated lead optimization remains underexplored compared to the well-established de novo generative models, due to its reliance on complex biological and chemical knowledge. To bridge this gap, we conduct a systematic review of traditional computational methods for lead optimization, organizing these strategies into four principal sub-tasks with defined inputs and outputs. This review delves into the basic concepts, goals, conventional CADD techniques, and recent advancements in AIDD. Additionally, we introduce a unified perspective based on constrained subgraph generation to harmonize the methodologies of de novo design and lead optimization. Through this lens, de novo design can incorporate strategies from lead optimization to address the challenge of generating hard-to-synthesize molecules; inversely, lead optimization can benefit from the innovations in de novo design by approaching it as a task of generating molecules conditioned on certain substructures.

q-bio.BM↗

Reconstructing Intrinsic Stellar Noise with Stellar Atmospheric Parameters and Chromospheric Activity

Accurately characterizing intrinsic stellar photometric noise induced by stellar astrophysics, such as stellar activity, granulation, and oscillations, is of crucial importance for detecting transiting exoplanets. In this study, we investigate the relation between the intrinsic stellar photometric noise, as quantified by the Kepler rrmsCDPP measurement, and the level of stellar chromospheric activity, as indicated by the S-index of Ca II HK lines derived from the LAMOST spectra. Our results reveal a clear positive correlation between S-index and rrmsCDPP, and the correlation becomes more significant at higher activity levels and on longer timescales. We have therefore built an empirical relation between rrmsCDPP and S-index as well as Teff, logg, [Fe/H], and apparent magnitude with the XGBoost regression algorithm, using the LAMOST-Kepler common star sample as the training set. This method achieves a precision of ~20 ppm for inferring the intrinsic noise from the S-index and other stellar labels on a 6-hour integration duration. We have applied this empirical relation to the full LAMOST DR7 spectra database, and obtained the intrinsic noise predictions for 1,358,275 stars. The resultant catalog is publicly available and expected to be valuable for optimizing target selection for future exoplanet-hunting space missions, such as the Earth 2.0 mission.

astro-ph.SR↗

Single-peak and multi-peak solutions for Hamiltonian elliptic systems in dimension two

This paper is concerned with the Hamiltonian elliptic system in dimension two\begin{equation*}\aligned \left\{ \begin{array}{lll} -ε^2Δu+V(x)u=g(v)\ & \text{in}\quad \mathbb{R}^2,\\ -ε^2Δv+V(x)v=f(u)\ & \text{in}\quad \mathbb{R}^2, \end{array}\right.\endaligned \end{equation*} where $V\in C(\mathbb{R}^2)$ has local minimum points, and $f,g\in C^1(\mathbb{R})$ are assumed to be of exponential growth in the sense of Trudinger-Moser inequality. When $V$ admits one or several local strict minimum points, we show the existence and concentration of single-peak and multi-peak semiclassical states respectively, as well as strong convergence and exponential decay. In addition, positivity of solutions and uniqueness of local maximum points of solutions are also studied. Our theorems extend the results of Ramos and Tavares [Calc. Var. 31 (2008) 1-25], where $f$ and $g$ have polynomial growth. It seems that it is the first attempt to obtain multi-peak semiclassical states for Hamiltonian elliptic system with exponential growth.

math.AP↗

Mutual Occurrence Ratio of Planets. I. New Clues to Reveal Origins of Hot- and Warm-Jupiter from the RV Sample

Many studies have analyzed planetary occurrence rates and their dependence on the host's properties to provide clues to planet formation, but few have focused on the mutual occurrence ratio of different kinds of planets. Such relations reveal whether and how one type of planet evolves into another, e.g. from a cold Jupiter to a warm or even hot Jupiter, and demonstrate how stellar properties impact the evolution history of planetary systems. We propose a new classification of giant planets, i.e. cold Jupiter(CJ), warm Jupiter(WJ), and hot Jupiter(HJ), according to their position relative to the snow line in the system. Then, we derive their occurrence rates($η_{\rm HJ}$, $η_{\rm WJ}$, $η_{\rm CJ}$) with the detection completeness of RV(Radial Velocity) surveys(HARPS$\&$ CORALIE) considered. Finally, we analyze the correlation between the mutual occurrence ratios, i.e. $η{_{\rm CJ}} / η_{\rm WJ}$, $η{_{\rm CJ}} / η_{\rm HJ}$ or $η{_{\rm WJ}}/η_{\rm HJ}$, and various stellar properties, e.g. effective temperature $T_{\rm eff}$. Our results show that the $η_{\rm HJ}$, $η_{\rm WJ}$ and $η_{\rm CJ}$ are increasing with the increasing $T_{\rm eff}$ when $T_{\rm eff}\in (4600,6600] K$. Furthermore, the mutual occurrence ratio between CJ and WJ, i.e. $η{_{\rm CJ}} /η_{\rm WJ}$, shows a decreasing trend with the increasing $T_{\rm eff}$. But, both $η{_{\rm CJ}}/η_{\rm HJ}$ and $η{_{\rm WJ}}/η_{\rm HJ}$ are increasing when the $T_{\rm eff}$ increases. Further consistency tests reveal that the formation processes of WJ and HJ may be dominated by orbital change mechanisms rather than the in-situ model. However, unlike WJ, which favors gentle disk migration, HJ favors a more violent mechanism that requires further investigation.

astro-ph.EP↗

A cut-and-project perspective for linearized Bregman iterations

The linearized Bregman iterations (LBreI) and its variants are powerful tools for finding sparse or low-rank solutions to underdetermined linear systems. In this study, we propose a cut-and-project perspective for the linearized Bregman method via a bilevel optimization formulation, along with a new unified algorithmic framework. The new perspective not only encompasses various existing linearized Bregman iteration variants as specific instances, but also allows us to extend the linearized Bregman method to solve more general inverse problems. We provide a completed convergence result of the proposed algorithmic framework, including convergence guarantees to feasible points and optimal solutions, and the sublinear convergence rate. Moreover, we introduce the Bregman distance growth condition to ensure linear convergence. At last, our findings are illustrated via numerical tests.

math.OC↗

The X-LANCE Technical Report for Interspeech 2024 Speech Processing Using Discrete Speech Unit Challenge

Discrete speech tokens have been more and more popular in multiple speech processing fields, including automatic speech recognition (ASR), text-to-speech (TTS) and singing voice synthesis (SVS). In this paper, we describe the systems developed by the SJTU X-LANCE group for the TTS (acoustic + vocoder), SVS, and ASR tracks in the Interspeech 2024 Speech Processing Using Discrete Speech Unit Challenge. Notably, we achieved 1st rank on the leaderboard in the TTS track both with the whole training set and only 1h training data, with the highest UTMOS score and lowest bitrate among all submissions.

eess.AS↗

SLSM : An Efficient Strategy for Lazy Schema Migration on Shared-Nothing Databases

By introducing intermediate states for metadata changes and ensuring that at most two versions of metadata exist in the cluster at the same time, shared-nothing databases are capable of making online, asynchronous schema changes. However, this method leads to delays in the deployment of new schemas since it requires waiting for massive data backfill. To shorten the service vacuum period before the new schema is available, this paper proposes a strategy named SLSM for zero-downtime schema migration on shared-nothing databases. Based on the lazy migration of stand-alone databases, SLSM keeps the old and new schemas with the same data distribution, reducing the node communication overhead of executing migration transactions for shared-nothing databases. Further, SLSM combines migration transactions with user transactions by extending the distributed execution plan to allow the data involved in migration transactions to directly serve user transactions, greatly reducing the waiting time of user transactions. Experiments demonstrate that our strategy can greatly reduce the latency of user transactions and improve the efficiency of data migration compared to existing schemes.

cs.DB↗

Recovery Sets of Subspaces from a Simplex Code

Recovery sets for vectors and subspaces are important in the construction of distributed storage system codes. These concepts are also interesting in their own right. In this paper, we consider the following very basic recovery question: what is the maximum number of possible pairwise disjoint recovery sets for each recovered element? The recovered elements in this work are d-dimensional subspaces of a $k$-dimensional vector space over GF(q). Each server stores one representative for each distinct one-dimensional subspace of the k-dimensional vector space, or equivalently a distinct point of PG(k-1,q). As column vectors, the associated vectors of the stored one-dimensional subspaces form the generator matrix of the $[(q^k -1)/(q-1),k,q^{k-1}]$ simplex code over GF(q). Lower bounds and upper bounds on the maximum number of such recovery sets are provided. It is shown that generally, these bounds are either tight or very close to being tight.

cs.IT↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗