Searcharxiv⌕ Search

arXiv subjects

Sheng Jin

Publications and source records attributed to Sheng Jin.

At least 73 records · Page 4Linked to original sources

Domain Generalization via Balancing Training Difficulty and Model Capability

Domain generalization (DG) aims to learn domain-generalizable models from one or multiple source domains that can perform well in unseen target domains. Despite its recent progress, most existing work suffers from the misalignment between the difficulty level of training samples and the capability of contemporarily trained models, leading to over-fitting or under-fitting in the trained generalization model. We design MoDify, a Momentum Difficulty framework that tackles the misalignment by balancing the seesaw between the model's capability and the samples' difficulties along the training process. MoDify consists of two novel designs that collaborate to fight against the misalignment while learning domain-generalizable models. The first is MoDify-based Data Augmentation which exploits an RGB Shuffle technique to generate difficulty-aware training samples on the fly. The second is MoDify-based Network Optimization which dynamically schedules the training samples for balanced and smooth learning with appropriate difficulty. Without bells and whistles, a simple implementation of MoDify achieves superior performance across multiple benchmarks. In addition, MoDify can complement existing methods as a plug-in, and it is generic and can work for different visual recognition tasks.

cs.CV↗

Prompt Ensemble Self-training for Open-Vocabulary Domain Adaptation

Traditional domain adaptation assumes the same vocabulary across source and target domains, which often struggles with limited transfer flexibility and efficiency while handling target domains with different vocabularies. Inspired by recent vision-language models (VLMs) that enable open-vocabulary visual recognition by reasoning on both images and texts, we study open-vocabulary domain adaptation (OVDA), a new unsupervised domain adaptation framework that positions a pre-trained VLM as the source model and transfers it towards arbitrary unlabelled target domains. To this end, we design a Prompt Ensemble Self-training (PEST) technique that exploits the synergy between vision and language to mitigate the domain discrepancies in image and text distributions simultaneously. Specifically, PEST makes use of the complementary property of multiple prompts within and across vision and language modalities, which enables joint exploitation of vision and language information and effective learning of image-text correspondences in the unlabelled target domains. Additionally, PEST captures temporal information via temporal prompt ensemble which helps memorize previously learnt target information. Extensive experiments show that PEST outperforms the state-of-the-art consistently across 10 image recognition tasks.

cs.CV↗

Aligning Bag of Regions for Open-Vocabulary Object Detection

Pre-trained vision-language models (VLMs) learn to align vision and language representations on large-scale datasets, where each image-text pair usually contains a bag of semantic concepts. However, existing open-vocabulary object detectors only align region embeddings individually with the corresponding features extracted from the VLMs. Such a design leaves the compositional structure of semantic concepts in a scene under-exploited, although the structure may be implicitly learned by the VLMs. In this work, we propose to align the embedding of bag of regions beyond individual regions. The proposed method groups contextually interrelated regions as a bag. The embeddings of regions in a bag are treated as embeddings of words in a sentence, and they are sent to the text encoder of a VLM to obtain the bag-of-regions embedding, which is learned to be aligned to the corresponding features extracted by a frozen VLM. Applied to the commonly used Faster R-CNN, our approach surpasses the previous best results by 4.6 box AP50 and 2.8 mask AP on novel categories of open-vocabulary COCO and LVIS benchmarks, respectively. Code and models are available at https://github.com/wusize/ovdet.

cs.CV↗

Mapping Protoplanetary Disk Vertical Structure with CO Isotopologue Line Emission

High spatial resolution observations of CO isotopologue line emission in protoplanetary disks at mid-inclinations (${\approx}$30-75°) allow us to characterize the gas structure in detail, including radial and vertical substructures, emission surface heights and their dependencies on source characteristics, and disk temperature profiles. By combining observations of a suite of CO isotopologues, we can map the 2D (r, z) disk structure from the disk upper atmosphere, as traced by CO, to near the midplane, as probed by less abundant isotopologues. Here, we present high angular resolution (${\lesssim}$0."1 to ${\approx}$0."2; ${\approx}$15-30 au) observations of CO, $^{13}$CO, and C$^{18}$O in either or both J=2-1 and J=3-2 lines in the transition disks around DM Tau, Sz 91, LkCa 15, and HD 34282. We derived line emission surfaces in CO for all disks and in $^{13}$CO for the DM Tau and LkCa 15 disks. With these observations, we do not resolve the vertical structure of C$^{18}$O in any disk, which is instead consistent with C$^{18}$O emission originating from the midplane. Both the J=2-1 and J=3-2 lines show similar heights. Using the derived emission surfaces, we computed radial and vertical gas temperature distributions for each disk, including empirical temperature models for the DM Tau and LkCa 15 disks. After combining our sample with literature sources, we find that $^{13}$CO line emitting heights are also tentatively linked with source characteristics, e.g., stellar host mass, gas temperature, disk size, and show steeper trends than seen in CO emission surfaces.

astro-ph.EP↗

ZoomNAS: Searching for Whole-body Human Pose Estimation in the Wild

This paper investigates the task of 2D whole-body human pose estimation, which aims to localize dense landmarks on the entire human body including body, feet, face, and hands. We propose a single-network approach, termed ZoomNet, to take into account the hierarchical structure of the full human body and solve the scale variation of different body parts. We further propose a neural architecture search framework, termed ZoomNAS, to promote both the accuracy and efficiency of whole-body pose estimation. ZoomNAS jointly searches the model architecture and the connections between different sub-modules, and automatically allocates computational complexity for searched sub-modules. To train and evaluate ZoomNAS, we introduce the first large-scale 2D human whole-body dataset, namely COCO-WholeBody V1.0, which annotates 133 keypoints for in-the-wild images. Extensive experiments demonstrate the effectiveness of ZoomNAS and the significance of COCO-WholeBody V1.0.

cs.CV↗

PoseTrans: A Simple Yet Effective Pose Transformation Augmentation for Human Pose Estimation

Human pose estimation aims to accurately estimate a wide variety of human poses. However, existing datasets often follow a long-tailed distribution that unusual poses only occupy a small portion, which further leads to the lack of diversity of rare poses. These issues result in the inferior generalization ability of current pose estimators. In this paper, we present a simple yet effective data augmentation method, termed Pose Transformation (PoseTrans), to alleviate the aforementioned problems. Specifically, we propose Pose Transformation Module (PTM) to create new training samples that have diverse poses and adopt a pose discriminator to ensure the plausibility of the augmented poses. Besides, we propose Pose Clustering Module (PCM) to measure the pose rarity and select the "rarest" poses to help balance the long-tailed distribution. Extensive experiments on three benchmark datasets demonstrate the effectiveness of our method, especially on rare poses. Also, our method is efficient and simple to implement, which can be easily integrated into the training pipeline of existing pose estimation models.

cs.CV↗

3D Interacting Hand Pose Estimation by Hand De-occlusion and Removal

Estimating 3D interacting hand pose from a single RGB image is essential for understanding human actions. Unlike most previous works that directly predict the 3D poses of two interacting hands simultaneously, we propose to decompose the challenging interacting hand pose estimation task and estimate the pose of each hand separately. In this way, it is straightforward to take advantage of the latest research progress on the single-hand pose estimation system. However, hand pose estimation in interacting scenarios is very challenging, due to (1) severe hand-hand occlusion and (2) ambiguity caused by the homogeneous appearance of hands. To tackle these two challenges, we propose a novel Hand De-occlusion and Removal (HDR) framework to perform hand de-occlusion and distractor removal. We also propose the first large-scale synthetic amodal hand dataset, termed Amodal InterHand Dataset (AIH), to facilitate model training and promote the development of the related research. Experiments show that the proposed method significantly outperforms previous state-of-the-art interacting hand pose estimation approaches. Codes and data are available at https://github.com/MengHao666/HDR.

cs.CV↗

Pose for Everything: Towards Category-Agnostic Pose Estimation

Existing works on 2D pose estimation mainly focus on a certain category, e.g. human, animal, and vehicle. However, there are lots of application scenarios that require detecting the poses/keypoints of the unseen class of objects. In this paper, we introduce the task of Category-Agnostic Pose Estimation (CAPE), which aims to create a pose estimation model capable of detecting the pose of any class of object given only a few samples with keypoint definition. To achieve this goal, we formulate the pose estimation problem as a keypoint matching problem and design a novel CAPE framework, termed POse Matching Network (POMNet). A transformer-based Keypoint Interaction Module (KIM) is proposed to capture both the interactions among different keypoints and the relationship between the support and query images. We also introduce Multi-category Pose (MP-100) dataset, which is a 2D pose dataset of 100 object categories containing over 20K instances and is well-designed for developing CAPE algorithms. Experiments show that our method outperforms other baseline approaches by a large margin. Codes and data are available at https://github.com/luminxu/Pose-for-Everything.

cs.CV↗

CHES: a space-borne astrometric mission for the detection of habitable planets of the nearby solar-type stars

The Closeby Habitable Exoplanet Survey (CHES) mission is proposed to discover habitable-zone Earth-like planets of the nearby solar-type stars ($\sim 10~\mathrm{pc}$ away from our solar system) via micro-arcsecond relative astrometry. The major scientific objectives of CHES are: to search for Earth Twins or terrestrial planets in habitable zones orbiting 100 FGK nearby stars; further to conduct a comprehensive survey and extensively characterize the nearby planetary systems. The primary payload is a high-quality, low-distortion, high-stability telescope. The optical subsystem is a coaxial three-mirror anastigmat (TMA) with a $1.2 \mathrm{~m}$-aperture, $0.44^{\circ} \times 0.44^{\circ}$ field of view and $500 \mathrm{~nm}-900 \mathrm{~nm}$ working waveband. The camera focal plane is composed of 81 MOSAIC scientific CMOS detectors each with $4 \mathrm{~K} \times 4 \mathrm{~K}$ pixels. The heterodyne laser interferometric calibration technology is employed to ensure micro-arcsecond level (1 $μ$as) relative astrometry precision to meet the requirements for detection of Earth-like planets. CHES satellite operates at the Sun-Earth L2 point and observes the entire target stars for 5 years. CHES will offer the first direct measurements of true masses and inclinations of Earth Twins and super-Earths orbiting our neighbor stars based on micro-arcsecond astrometry from space. This will definitely enhance our understanding of the formation of diverse nearby planetary systems and the emergence of other worlds for solar-type stars, and finally to reflect the evolution of our own solar system.

astro-ph.EP↗

Not All Tokens Are Equal: Human-centric Visual Analysis via Token Clustering Transformer

Vision transformers have achieved great successes in many computer vision tasks. Most methods generate vision tokens by splitting an image into a regular and fixed grid and treating each cell as a token. However, not all regions are equally important in human-centric vision tasks, e.g., the human body needs a fine representation with many tokens, while the image background can be modeled by a few tokens. To address this problem, we propose a novel Vision Transformer, called Token Clustering Transformer (TCFormer), which merges tokens by progressive clustering, where the tokens can be merged from different locations with flexible shapes and sizes. The tokens in TCFormer can not only focus on important areas but also adjust the token shapes to fit the semantic concept and adopt a fine resolution for regions containing critical details, which is beneficial to capturing detailed information. Extensive experiments show that TCFormer consistently outperforms its counterparts on different challenging human-centric tasks and datasets, including whole-body pose estimation on COCO-WholeBody and 3D human mesh reconstruction on 3DPW. Code is available at https://github.com/zengwang430521/TCFormer.git

cs.CV↗

Pseudo-Labeled Auto-Curriculum Learning for Semi-Supervised Keypoint Localization

Localizing keypoints of an object is a basic visual problem. However, supervised learning of a keypoint localization network often requires a large amount of data, which is expensive and time-consuming to obtain. To remedy this, there is an ever-growing interest in semi-supervised learning (SSL), which leverages a small set of labeled data along with a large set of unlabeled data. Among these SSL approaches, pseudo-labeling (PL) is one of the most popular. PL approaches apply pseudo-labels to unlabeled data, and then train the model with a combination of the labeled and pseudo-labeled data iteratively. The key to the success of PL is the selection of high-quality pseudo-labeled samples. Previous works mostly select training samples by manually setting a single confidence threshold. We propose to automatically select reliable pseudo-labeled samples with a series of dynamic thresholds, which constitutes a learning curriculum. Extensive experiments on six keypoint localization benchmark datasets demonstrate that the proposed approach significantly outperforms the previous state-of-the-art SSL approaches.

cs.CV↗

Temporal Action Proposal Generation with Background Constraint

Temporal action proposal generation (TAPG) is a challenging task that aims to locate action instances in untrimmed videos with temporal boundaries. To evaluate the confidence of proposals, the existing works typically predict action score of proposals that are supervised by the temporal Intersection-over-Union (tIoU) between proposal and the ground-truth. In this paper, we innovatively propose a general auxiliary Background Constraint idea to further suppress low-quality proposals, by utilizing the background prediction score to restrict the confidence of proposals. In this way, the Background Constraint concept can be easily plug-and-played into existing TAPG methods (e.g., BMN, GTAD). From this perspective, we propose the Background Constraint Network (BCNet) to further take advantage of the rich information of action and background. Specifically, we introduce an Action-Background Interaction module for reliable confidence evaluation, which models the inconsistency between action and background by attention mechanisms at the frame and clip levels. Extensive experiments are conducted on two popular benchmarks, i.e., ActivityNet-1.3 and THUMOS14. The results demonstrate that our method outperforms state-of-the-art methods. Equipped with the existing action classifier, our method also achieves remarkable performance on the temporal action localization task.

cs.CV↗

Nii: a Bayesian orbit retrieval code applied to differential astrometry

Here we present an open source Python-based Bayesian orbit retrieval code (Nii) that implements an automatic parallel tempering Markov chain Monte Carlo (APT-MCMC) strategy. Nii provides a module to simulate the observations of a space-based astrometry mission in the search for exoplanets, a signal extraction process for differential astrometric measurements using multiple reference stars, and an orbital parameter retrieval framework using APT-MCMC. We further verify the orbit retrieval ability of the code through two examples corresponding to a single-planet system and a dual-planet system. In both cases, efficient convergence on the posterior probability distribution can be achieved. Although this code specifically focuses on the orbital parameter retrieval problem of differential astrometry, Nii can also be widely used in other Bayesian analysis applications.

astro-ph.IM↗

Utility Maximization for Multihop Wireless Networks Employing BATS Codes

BATS (BATched Sparse) codes are a class of efficient random linear network coding variation that has been studied for multihop wireless networks mostly in scenarios of a single communication flow. Towards sophisticated multi-flow network communications, we formulate a network utility maximization (NUM) problem that jointly optimizes the BATS code parameters of all the flows and network scheduling. The NUM problem adopts a batch-wise packet loss model that can be obtained from the network local statistics without any constraints on packet loss patterns. Moreover, the NUM problem allows a different number of recoded packets to be transmitted for different batches in a flow, which is called adaptive recoding. Due to both the probably nonconcave objective and the BATS code-related variables, the algorithms developed for the existing flow optimization problems cannot be applied directly to solve our NUM problem. We introduce a two-step algorithm to solve our NUM problem, where the first step solves the problem with nonadaptive recoding schemes, and the second step optimizes adaptive recoding hop-by-hop from upstream to downstream in each flow. We perform various numerical evaluations and simulations to verify the effectiveness and efficiency of the algorithm.

cs.IT↗

Graph-Based 3D Multi-Person Pose Estimation Using Multi-View Images

This paper studies the task of estimating the 3D human poses of multiple persons from multiple calibrated camera views. Following the top-down paradigm, we decompose the task into two stages, i.e. person localization and pose estimation. Both stages are processed in coarse-to-fine manners. And we propose three task-specific graph neural networks for effective message passing. For 3D person localization, we first use Multi-view Matching Graph Module (MMG) to learn the cross-view association and recover coarse human proposals. The Center Refinement Graph Module (CRG) further refines the results via flexible point-based prediction. For 3D pose estimation, the Pose Regression Graph Module (PRG) learns both the multi-view geometry and structural relations between human joints. Our approach achieves state-of-the-art performance on CMU Panoptic and Shelf datasets with significantly lower computation complexity.

cs.CV↗

ViPNAS: Efficient Video Pose Estimation via Neural Architecture Search

Human pose estimation has achieved significant progress in recent years. However, most of the recent methods focus on improving accuracy using complicated models and ignoring real-time efficiency. To achieve a better trade-off between accuracy and efficiency, we propose a novel neural architecture search (NAS) method, termed ViPNAS, to search networks in both spatial and temporal levels for fast online video pose estimation. In the spatial level, we carefully design the search space with five different dimensions including network depth, width, kernel size, group number, and attentions. In the temporal level, we search from a series of temporal feature fusions to optimize the total accuracy and speed across multiple video frames. To the best of our knowledge, we are the first to search for the temporal feature fusion and automatic computation allocation in videos. Extensive experiments demonstrate the effectiveness of our approach on the challenging COCO2017 and PoseTrack2018 datasets. Our discovered model family, S-ViPNAS and T-ViPNAS, achieve significantly higher inference speed (CPU real-time) without sacrificing the accuracy compared to the previous state-of-the-art methods.

cs.CV↗

When Human Pose Estimation Meets Robustness: Adversarial Algorithms and Benchmarks

Human pose estimation is a fundamental yet challenging task in computer vision, which aims at localizing human anatomical keypoints. However, unlike human vision that is robust to various data corruptions such as blur and pixelation, current pose estimators are easily confused by these corruptions. This work comprehensively studies and addresses this problem by building rigorous robust benchmarks, termed COCO-C, MPII-C, and OCHuman-C, to evaluate the weaknesses of current advanced pose estimators, and a new algorithm termed AdvMix is proposed to improve their robustness in different corruptions. Our work has several unique benefits. (1) AdvMix is model-agnostic and capable in a wide-spectrum of pose estimation models. (2) AdvMix consists of adversarial augmentation and knowledge distillation. Adversarial augmentation contains two neural network modules that are trained jointly and competitively in an adversarial manner, where a generator network mixes different corrupted images to confuse a pose estimator, improving the robustness of the pose estimator by learning from harder samples. To compensate for the noise patterns by adversarial augmentation, knowledge distillation is applied to transfer clean pose structure knowledge to the target pose estimator. (3) Extensive experiments show that AdvMix significantly increases the robustness of pose estimations across a wide range of corruptions, while maintaining accuracy on clean data in various challenging benchmark datasets.

cs.CV↗

Relative occurrence rates of terrestrial planets orbiting FGK stars

This paper aims to derive a map of relative planet occurrence rates that can provide constraints on the overall distribution of terrestrial planets around FGK stars. Based on the planet candidates in the Kepler DR25 data release, I first generate a continuous density map of planet distribution using a Gaussian kernel model and correct the geometric factor that the discovery space of a transit event decreases along with the increase of planetary orbital distance. Then I fit two exponential decay functions of detection efficiency along with the increase of planetary orbital distance and the decrease of planetary radius. Finally, the density map of planet distribution is compensated for the fitted exponential decay functions of detection efficiency to obtain a relative occurrence rate distribution of terrestrial planets. The result shows two regions with planet abundance: one corresponds to planets with radii between 0.5 and 1.5 R_Earth within 0.2 AU, the other corresponds to planets with radii between 1.5 and 3 R_Earth beyond 0.5 AU. It also confirms the features that may be caused by atmospheric evaporation: there is a vacancy of planets of sizes between 2.0 and 4.0 R_Earth inside of ~ 0.5 AU, and a valley with relatively low occurrence rates between 0.2 and 0.5 AU for planets with radii between 1.5 and 3.0 R_Earth.

astro-ph.EP↗