On numerically trivial automorphisms of compact hyperkähler manifolds of dimension 4
We prove that the automorphism group of a compact hyperkähler manifold of dimension 4 acts faithfully on the cohomology ring.
math.AG↗
arXiv subjects
Chen Jiang
Publications and source records attributed to Chen Jiang.
On the bicanonical map of algebraic threefolds of general type
We answer an open problem of the first author and Zhang (see Open Problem 6.4 (3) in Math. Z. 258 (2008), 565-585) and prove that, for any nonsingular projective $3$-fold of general type with the geometric genus greater than 201, the bicanonical system is not composed of any pencil of surfaces.
math.AG↗
Enhancing the Reliability of Segment Anything Model for Auto-Prompting Medical Image Segmentation with Uncertainty Rectification
The Segment Anything Model (SAM) has recently emerged as a groundbreaking foundation model for prompt-driven image segmentation tasks. However, both the original SAM and its medical variants require slice-by-slice manual prompting of target structures, which directly increase the burden for applications. Despite attempts of auto-prompting to turn SAM into a fully automatic manner, it still exhibits subpar performance and lacks of reliability especially in the field of medical imaging. In this paper, we propose UR-SAM, an uncertainty rectified SAM framework to enhance the reliability for auto-prompting medical image segmentation. Building upon a localization framework for automatic prompt generation, our method incorporates a prompt augmentation module to obtain a series of input prompts for SAM for uncertainty estimation and an uncertainty-based rectification module to further utilize the distribution of estimated uncertainty to improve the segmentation performance. Extensive experiments on two public 3D medical datasets covering the segmentation of 35 organs demonstrate that without supplementary training or fine-tuning, our method further improves the segmentation performance with up to 10.7 % and 13.8 % in dice similarity coefficient, demonstrating efficiency and broad capabilities for medical image segmentation without manual prompting.
cs.CV↗
Dual-Modal Attention-Enhanced Text-Video Retrieval with Triplet Partial Margin Contrastive Learning
In recent years, the explosion of web videos makes text-video retrieval increasingly essential and popular for video filtering, recommendation, and search. Text-video retrieval aims to rank relevant text/video higher than irrelevant ones. The core of this task is to precisely measure the cross-modal similarity between texts and videos. Recently, contrastive learning methods have shown promising results for text-video retrieval, most of which focus on the construction of positive and negative pairs to learn text and video representations. Nevertheless, they do not pay enough attention to hard negative pairs and lack the ability to model different levels of semantic similarity. To address these two issues, this paper improves contrastive learning using two novel techniques. First, to exploit hard examples for robust discriminative power, we propose a novel Dual-Modal Attention-Enhanced Module (DMAE) to mine hard negative pairs from textual and visual clues. By further introducing a Negative-aware InfoNCE (NegNCE) loss, we are able to adaptively identify all these hard negatives and explicitly highlight their impacts in the training loss. Second, our work argues that triplet samples can better model fine-grained semantic similarity compared to pairwise samples. We thereby present a new Triplet Partial Margin Contrastive Learning (TPM-CL) module to construct partial order triplet samples by automatically generating fine-grained hard negatives for matched text-video pairs. The proposed TPM-CL designs an adaptive token masking strategy with cross-modal interaction to model subtle semantic differences. Extensive experiments demonstrate that the proposed approach outperforms existing methods on four widely-used text-video retrieval datasets, including MSR-VTT, MSVD, DiDeMo and ActivityNet.
cs.CV↗
Knowledge-enhanced Multi-perspective Video Representation Learning for Scene Recognition
With the explosive growth of video data in real-world applications, a comprehensive representation of videos becomes increasingly important. In this paper, we address the problem of video scene recognition, whose goal is to learn a high-level video representation to classify scenes in videos. Due to the diversity and complexity of video contents in realistic scenarios, this task remains a challenge. Most existing works identify scenes for videos only from visual or textual information in a temporal perspective, ignoring the valuable information hidden in single frames, while several earlier studies only recognize scenes for separate images in a non-temporal perspective. We argue that these two perspectives are both meaningful for this task and complementary to each other, meanwhile, externally introduced knowledge can also promote the comprehension of videos. We propose a novel two-stream framework to model video representations from multiple perspectives, i.e. temporal and non-temporal perspectives, and integrate the two perspectives in an end-to-end manner by self-distillation. Besides, we design a knowledge-enhanced feature fusion and label prediction method that contributes to naturally introducing knowledge into the task of video scene recognition. Experiments conducted on a real-world dataset demonstrate the effectiveness of our proposed method.
cs.CV↗
MDCS: More Diverse Experts with Consistency Self-distillation for Long-tailed Recognition
Recently, multi-expert methods have led to significant improvements in long-tail recognition (LTR). We summarize two aspects that need further enhancement to contribute to LTR boosting: (1) More diverse experts; (2) Lower model variance. However, the previous methods didn't handle them well. To this end, we propose More Diverse experts with Consistency Self-distillation (MDCS) to bridge the gap left by earlier methods. Our MDCS approach consists of two core components: Diversity Loss (DL) and Consistency Self-distillation (CS). In detail, DL promotes diversity among experts by controlling their focus on different categories. To reduce the model variance, we employ KL divergence to distill the richer knowledge of weakly augmented instances for the experts' self-distillation. In particular, we design Confident Instance Sampling (CIS) to select the correctly classified instances for CS to avoid biased/noisy knowledge. In the analysis and ablation study, we demonstrate that our method compared with previous work can effectively increase the diversity of experts, significantly reduce the variance of the model, and improve recognition accuracy. Moreover, the roles of our DL and CS are mutually reinforcing and coupled: the diversity of experts benefits from the CS, and the CS cannot achieve remarkable results without the DL. Experiments show our MDCS outperforms the state-of-the-art by 1% $\sim$ 2% on five popular long-tailed benchmarks, including CIFAR10-LT, CIFAR100-LT, ImageNet-LT, Places-LT, and iNaturalist 2018. The code is available at https://github.com/fistyee/MDCS.
cs.CV↗
Miyaoka type inequality for terminal threefolds with nef anti-canonical divisors
In this paper, we study the Miyaoka type inequality on Chern classes of terminal projective $3$-folds with nef anti-canonical divisors. Let $X$ be a terminal projective $3$-fold such that $-K_X$ is nef. We show that if $c_1(X)\cdot c_2(X)\neq 0$, then $c_1(X)\cdot c_2(X)\geq \frac{1}{252}$; if further $X$ is not rationally connected, then $c_1(X)\cdot c_2(X)\geq \frac{4}{5}$ and this inequality is sharp. In order to prove this, we give a partial classification of such varieties along with many examples. We also study the nonvanishing of $c_1(X)^{\dim X-2}\cdot c_2(X)$ for terminal weak Fano varieties and prove a Miyaoka--Kawamata type inequality for terminal weak Fano $3$-folds.
math.AG↗
Learning Segment Similarity and Alignment in Large-Scale Content Based Video Retrieval
With the explosive growth of web videos in recent years, large-scale Content-Based Video Retrieval (CBVR) becomes increasingly essential in video filtering, recommendation, and copyright protection. Segment-level CBVR (S-CBVR) locates the start and end time of similar segments in finer granularity, which is beneficial for user browsing efficiency and infringement detection especially in long video scenarios. The challenge of S-CBVR task is how to achieve high temporal alignment accuracy with efficient computation and low storage consumption. In this paper, we propose a Segment Similarity and Alignment Network (SSAN) in dealing with the challenge which is firstly trained end-to-end in S-CBVR. SSAN is based on two newly proposed modules in video retrieval: (1) An efficient Self-supervised Keyframe Extraction (SKE) module to reduce redundant frame features, (2) A robust Similarity Pattern Detection (SPD) module for temporal alignment. In comparison with uniform frame extraction, SKE not only saves feature storage and search time, but also introduces comparable accuracy and limited extra computation time. In terms of temporal alignment, SPD localizes similar segments with higher accuracy and efficiency than existing deep learning methods. Furthermore, we jointly train SSAN with SKE and SPD and achieve an end-to-end improvement. Meanwhile, the two key modules SKE and SPD can also be effectively inserted into other video retrieval pipelines and gain considerable performance improvements. Experimental results on public datasets show that SSAN can obtain higher alignment accuracy while saving storage and online query computational cost compared to existing methods.
cs.CV↗
CLIPUNetr: Assisting Human-robot Interface for Uncalibrated Visual Servoing Control with CLIP-driven Referring Expression Segmentation
The classical human-robot interface in uncalibrated image-based visual servoing (UIBVS) relies on either human annotations or semantic segmentation with categorical labels. Both methods fail to match natural human communication and convey rich semantics in manipulation tasks as effectively as natural language expressions. In this paper, we tackle this problem by using referring expression segmentation, which is a prompt-based approach, to provide more in-depth information for robot perception. To generate high-quality segmentation predictions from referring expressions, we propose CLIPUNetr - a new CLIP-driven referring expression segmentation network. CLIPUNetr leverages CLIP's strong vision-language representations to segment regions from referring expressions, while utilizing its ``U-shaped'' encoder-decoder architecture to generate predictions with sharper boundaries and finer structures. Furthermore, we propose a new pipeline to integrate CLIPUNetr into UIBVS and apply it to control robots in real-world environments. In experiments, our method improves boundary and structure measurements by an average of 120% and can successfully assist real-world UIBVS control in an unstructured manipulation environment.
cs.RO↗
Using Adamic-Adar Index Algorithm to Predict Volunteer Collaboration: Less is More
Social networks exhibit a complex graph-like structure due to the uncertainty surrounding potential collaborations among participants. Machine learning algorithms possess generic outstanding performance in multiple real-world prediction tasks. However, whether machine learning algorithms outperform specific algorithms designed for graph link prediction remains unknown to us. To address this issue, the Adamic-Adar Index (AAI), Jaccard Coefficient (JC) and common neighbour centrality (CNC) as representatives of graph-specific algorithms were applied to predict potential collaborations, utilizing data from volunteer activities during the Covid-19 pandemic in Shenzhen city, along with the classical machine learning algorithms such as random forest, support vector machine, and gradient boosting as single predictors and components of ensemble learning. This paper introduces that the AAI algorithm outperformed the traditional JC and CNC, and other machine learning algorithms in analyzing graph node attributes for this task.
cs.SI↗
Algebraic reverse Khovanskii--Teissier inequality via Okounkov bodies
Let $X$ be a projective variety of dimension $n$ over an algebraically closed field of arbitrary characteristic and let $A, B, C$ be nef divisors on $X$. We show that for any integer $1\leq k\leq n-1$, $$ (B^k\cdot A^{n-k})\cdot (A^k\cdot C^{n-k})\geq \frac{k!(n-k)!}{n!}(A^n)\cdot (B^k\cdot C^{n-k}). $$ The same inequality in the analytic setting was obtained by Lehmann and Xiao for compact Kähler manifolds using the Calabi--Yau theorem, while our approach is purely algebraic using (multipoint) Okounkov bodies. We also discuss applications of this inequality to Bézout-type inequalities and inequalities on degrees of dominant rational self-maps.
math.AG↗
On the anti-canonical geometry of weak $\mathbb{Q}$-Fano threefolds, III
For a terminal weak $\mathbb{Q}$-Fano $3$-fold $X$, we show that the $m$-th anti-canonical map defined by $|-mK_X|$ is birational for all $m\geq59$.
math.AG↗
A close-in giant planet escapes engulfment by its star
When main-sequence stars expand into red giants, they are expected to engulf close-in planets. Until now, the absence of planets with short orbital periods around post-expansion, core-helium-burning red giants has been interpreted as evidence that short-period planets around Sun-like stars do not survive the giant expansion phase of their host stars. Here we present the discovery that the giant planet 8 Ursae Minoris b orbits a core-helium-burning red giant. At a distance of only 0.5 au from its host star, the planet would have been engulfed by its host star, which is predicted by standard single-star evolution to have previously expanded to a radius of 0.7 au. Given the brief lifetime of helium-burning giants, the nearly circular orbit of the planet is challenging to reconcile with scenarios in which the planet survives by having a distant orbit initially. Instead, the planet may have avoided engulfment through a stellar merger that either altered the evolution of the host star or produced 8 Ursae Minoris b as a second-generation planet. This system shows that core-helium-burning red giants can harbour close planets and provides evidence for the role of non-canonical stellar evolution in the extended survival of late-stage exoplanetary systems.
astro-ph.SR↗
PDS-MAR: a fine-grained Projection-Domain Segmentation-based Metal Artifact Reduction method for intraoperative CBCT images with guidewires
Since the invention of modern CT systems, metal artifacts have been a persistent problem. Due to increased scattering, amplified noise, and insufficient data collection, it is more difficult to suppress metal artifacts in cone-beam CT, limiting its use in human- and robot-assisted spine surgeries where metallic guidewires and screws are commonly used. In this paper, we demonstrate that conventional image-domain segmentation-based MAR methods are unable to eliminate metal artifacts for intraoperative CBCT images with guidewires. To solve this problem, we present a fine-grained projection-domain segmentation-based MAR method termed PDS-MAR, in which metal traces are augmented and segmented in the projection domain before being inpainted using triangular interpolation. In addition, a metal reconstruction phase is proposed to restore metal areas in the image domain. The digital phantom study and real CBCT data study demonstrate that the proposed algorithm achieves significantly better artifact suppression than other comparing methods and has the potential to advance the use of intraoperative CBCT imaging in clinical spine surgeries.
physics.med-ph↗
An effective upper bound for anti-canonical volumes of singular Fano threefolds
For a real number $0<ε<1/3$, we show that the anti-canonical volume of an $ε$-klt Fano $3$-fold is at most $3200/ε^4$ and the order $O(1/ε^4)$ is sharp.
math.AG↗
Boundary-aware Backward-Compatible Representation via Adversarial Learning in Image Retrieval
Image retrieval plays an important role in the Internet world. Usually, the core parts of mainstream visual retrieval systems include an online service of the embedding model and a large-scale vector database. For traditional model upgrades, the old model will not be replaced by the new one until the embeddings of all the images in the database are re-computed by the new model, which takes days or weeks for a large amount of data. Recently, backward-compatible training (BCT) enables the new model to be immediately deployed online by making the new embeddings directly comparable to the old ones. For BCT, improving the compatibility of two models with less negative impact on retrieval performance is the key challenge. In this paper, we introduce AdvBCT, an Adversarial Backward-Compatible Training method with an elastic boundary constraint that takes both compatibility and discrimination into consideration. We first employ adversarial learning to minimize the distribution disparity between embeddings of the new model and the old model. Meanwhile, we add an elastic boundary constraint during training to improve compatibility and discrimination efficiently. Extensive experiments on GLDv2, Revisited Oxford (ROxford), and Revisited Paris (RParis) demonstrate that our method outperforms other BCT methods on both compatibility and discrimination. The implementation of AdvBCT will be publicly available at https://github.com/Ashespt/AdvBCT.
cs.CV↗
On numerical dimensions of Calabi--Yau varieties
Let $X$ be a Calabi--Yau variety of Picard number two with infinite birational automorphism group. We show that the numerical dimension $κ^{\mathbb{R}}_σ$ of the extremal rays of the closed movable cone of $X$ is $\dim X/2$. More generally, we investigate the relation between the two numerical dimensions $κ^{\mathbb{R}}_σ$ and $κ^{\mathbb{R}}_{\mathrm{vol}}$ for Calabi--Yau varieties. We also compute $κ^{\mathbb{R}}_σ$ for non-big divisors in the closed movable cone of a projective hyperkähler manifold.
math.AG↗
Revisiting the Red-giant Branch Hosts KOI-3886 and $ι$ Draconis. Detailed Asteroseismic Modeling and Consolidated Stellar Parameters
Asteroseismology is playing an increasingly important role in the characterization of red-giant host stars and their planetary systems. Here, we conduct detailed asteroseismic modeling of the evolved red-giant branch (RGB) hosts KOI-3886 and $ι$ Draconis, making use of end-of-mission Kepler (KOI-3886) and multi-sector TESS ($ι$ Draconis) time-series photometry. We also model the benchmark star KIC 8410637, a member of an eclipsing binary, thus providing a direct test to the seismic determination. We test the impact of adopting different sets of observed modes as seismic constraints. Inclusion of $\ell=1$ and 2 modes improves the precision on the stellar parameters, albeit marginally, compared to adopting radial modes alone, with $1.9$-$3.0\%$ (radius), $5$-$9\%$ (mass), and $19$-$25\%$ (age) reached when using all p-dominated modes as constraints. Given the very small spacing of adjacent dipole mixed modes in evolved RGB stars, the sparse set of observed g-dominated modes is not able to provide extra constraints, further leading to highly multimodal posteriors. Access to multi-year time-series photometry does not improve matters, with detailed modeling of evolved RGB stars based on (lower-resolution) TESS data sets attaining a precision commensurate with that based on end-of-mission Kepler data. Furthermore, we test the impact of varying the atmospheric boundary condition in our stellar models. We find mass and radius estimates to be insensitive to the description of the near-surface layers, at the expense of substantially changing both the near-surface structure of the best-fitting models and the values of associated parameters like the initial helium abundance, $Y_{\rm i}$. Attempts to measure $Y_{\rm i}$ from seismic modeling of red giants may thus be systematically dependent on the choice of atmospheric physics.
astro-ph.SR↗