Search arXiv⌕ Search

arXiv subjects

Tao Han

Publications and source records attributed to Tao Han.

At least 163 records · Page 9Linked to original sources

Domain-adaptive Crowd Counting via High-quality Image Translation and Density Reconstruction

Recently, crowd counting using supervised learning achieves a remarkable improvement. Nevertheless, most counters rely on a large amount of manually labeled data. With the release of synthetic crowd data, a potential alternative is transferring knowledge from them to real data without any manual label. However, there is no method to effectively suppress domain gaps and output elaborate density maps during the transferring. To remedy the above problems, this paper proposes a Domain-Adaptive Crowd Counting (DACC) framework, which consists of a high-quality image translation and density map reconstruction. To be specific, the former focuses on translating synthetic data to realistic images, which prompts the translation quality by segregating domain-shared/independent features and designing content-aware consistency loss. The latter aims at generating pseudo labels on real scenes to improve the prediction quality. Next, we retrain a final counter using these pseudo labels. Adaptation experiments on six real-world datasets demonstrate that the proposed method outperforms the state-of-the-art methods.

cs.CV↗

LDC-Net: A Unified Framework for Localization, Detection and Counting in Dense Crowds

The rapid development in visual crowd analysis shows a trend to count people by positioning or even detecting, rather than simply summing a density map. It also enlightens us back to the essence of the field, detection to count, which can give more abundant crowd information and has more practical applications. However, some recent work on crowd localization and detection has two limitations: 1) The typical detection methods can not handle the dense crowds and a large variation in scale; 2) The density map heuristic methods suffer from performance deficiency in position and box prediction, especially in high density or large-size crowds. In this paper, we devise a tailored baseline for dense crowds location, detection, and counting from a new perspective, named as LDC-Net for convenience, which has the following features: 1) A strong but minimalist paradigm to detect objects by only predicting a location map and a size map, which endows an ability to detect in a scene with any capacity ($0 \sim 10,000+$ persons); 2) Excellent cross-scale ability in facing a large variation, such as the head ranging in $0 \sim 100,000+$ pixels; 3) Achieve superior performance in location and box prediction tasks, as well as a competitive counting performance compared with the density-based methods. Finally, the source code and pre-trained models will be released.

cs.CV↗

Constraint-Aware Deep Reinforcement Learning for End-to-End Resource Orchestration in Mobile Networks

Network slicing is a promising technology that allows mobile network operators to efficiently serve various emerging use cases in 5G. It is challenging to optimize the utilization of network infrastructures while guaranteeing the performance of network slices according to service level agreements (SLAs). To solve this problem, we propose SafeSlicing that introduces a new constraint-aware deep reinforcement learning (CaDRL) algorithm to learn the optimal resource orchestration policy within two steps, i.e., offline training in a simulated environment and online learning with the real network system. On optimizing the resource orchestration, we incorporate the constraints on the statistical performance of slices in the reward function using Lagrangian multipliers, and solve the Lagrangian relaxed problem via a policy network. To satisfy the constraints on the system capacity, we design a constraint network to map the latent actions generated from the policy network to the orchestration actions such that the total resources allocated to network slices do not exceed the system capacity. We prototype SafeSlicing on an end-to-end testbed developed by using OpenAirInterface LTE, OpenDayLight-based SDN, and CUDA GPU computing platform. The experimental results show that SafeSlicing reduces more than 20% resource usage while meeting SLAs of network slices as compared with other solutions.

cs.NI↗

Higgs to charm quarks in vector boson fusion plus a photon

Experimentally probing the charm-Yukawa coupling in the LHC experiments is important, but very challenging due to an enormous QCD background. We study a new channel that can be used to search for the Higgs decay $H\to c\bar c$, using the vector boson fusion (VBF) mechanism with an associated photon. In addition to suppressing the QCD background, the photon gives an effective trigger handle. We discuss the trigger implications of this final state that can be utilized in ATLAS and CMS. We propose a novel search strategy for $H\to c\bar c$ in association with VBF jets and a photon, where we find a projected sensitivity of about 13 times the SM charm-Yukawa coupling at 95$\%$ $\text{CL}_s$ at High Luminosity LHC (HL-LHC). Our result is comparable and complementary to existing projections at the HL-LHC. We also discuss the implications of increasing the center of mass collision energy to 30 TeV and 100 TeV.

hep-ph↗

Unveiling Hidden Physics at the LHC

The field of particle physics is at the crossroads. The discovery of a Higgs-like boson completed the Standard Model (SM), but the lacking observation of convincing resonances Beyond the SM (BSM) offers no guidance for the future of particle physics. On the other hand, the motivation for New Physics has not diminished and is, in fact, reinforced by several striking anomalous results in many experiments. Here we summarise the status of the most significant anomalies, including the most recent results for the flavour anomalies, the multi-lepton anomalies at the LHC, the Higgs-like excess at around 96 GeV, and anomalies in neutrino physics, astrophysics, cosmology, and cosmic rays. While the LHC promises up to 4/ab of integrated luminosity and far-reaching physics programmes to unveil BSM physics, we consider the possibility that the latter could be tested with present data, but that systemic shortcomings of the experiments and their search strategies may preclude their discovery for several reasons, including: final states consisting in soft particles only, associated production processes, QCD-like final states, close-by SM resonances, and SUSY scenarios where no missing energy is produced. New search strategies could help to unveil the hidden BSM signatures, devised by making use of the CERN open data as a new testing ground. We discuss the CERN open data with its policies, challenges, and potential usefulness for the community. We showcase the example of the CMS collaboration, which is the only collaboration regularly releasing some of its data. We find it important to stress that individuals using public data for their own research does not imply competition with experimental efforts, but rather provides unique opportunities to give guidance for further BSM searches by the collaborations. Wide access to open data is paramount to fully exploit the LHCs potential.

hep-ph↗

VisDrone-CC2020: The Vision Meets Drone Crowd Counting Challenge Results

Crowd counting on the drone platform is an interesting topic in computer vision, which brings new challenges such as small object inference, background clutter and wide viewpoint. However, there are few algorithms focusing on crowd counting on the drone-captured data due to the lack of comprehensive datasets. To this end, we collect a large-scale dataset and organize the Vision Meets Drone Crowd Counting Challenge (VisDrone-CC2020) in conjunction with the 16th European Conference on Computer Vision (ECCV 2020) to promote the developments in the related fields. The collected dataset is formed by $3,360$ images, including $2,460$ images for training, and $900$ images for testing. Specifically, we manually annotate persons with points in each video frame. There are $14$ algorithms from $15$ institutes submitted to the VisDrone-CC2020 Challenge. We provide a detailed analysis of the evaluation results and conclude the challenge. More information can be found at the website: \url{http://www.aiskyeye.com/}.

cs.CV↗

Supervised Contrastive Learning for Accented Speech Recognition

Neural network based speech recognition systems suffer from performance degradation due to accented speech, especially unfamiliar accents. In this paper, we study the supervised contrastive learning framework for accented speech recognition. To build different views (similar "positive" data samples) for contrastive learning, three data augmentation techniques including noise injection, spectrogram augmentation and TTS-same-sentence generation are further investigated. From the experiments on the Common Voice dataset, we have shown that contrastive learning helps to build data-augmentation invariant and pronunciation invariant representations, which significantly outperforms traditional joint training methods in both zero-shot and full-shot settings. Experiments show that contrastive learning can improve accuracy by 3.66% (zero-shot) and 3.78% (full-shot) on average, comparing to the joint training method.

cs.SD↗

WIMPs at High Energy Muon Colliders

The Weakly Interacting Massive Particle (WIMP) paradigm is one of the most compelling scenarios for particle dark matter (DM). We show in this paper that a high energy muon collider can make decisive statements about the WIMP DM, and this should serve as one of its main physics driver cases. We demonstrate this by employing the DM as the lightest member of an electroweak (EW) multiplet, which is a simple, yet one of the most challenging WIMP scenarios given its minimal collider signature and high thermal target mass scale of 1 TeV$-$23 TeV. We perform a first study of the reach of high energy muon colliders, focusing on the simple, inclusive and conservative signals with large missing mass, through the mono-photon, VBF di-muon and a novel mono-muon channel. Using these inclusive signals, it is possible to cover the thermal targets of doublet and triplet with a 10 TeV muon collider. Higher energies, 14 TeV$-$75 TeV, would ensure a $5 σ$ reach above the thermal targets for the higher EW multiplets. We also estimate the reach of a search for disappearing tracks, demonstrating the potential significant enhancement of the sensitivity.

hep-ph↗

Electroweak Phase Transition with an SU(2) Dark Sector

We consider a non-Abelian dark SU(2)$_{\rm D}$ model where the dark sector couples to the Standard Model (SM) through a Higgs portal. We investigate two different scenarios of the dark sector scalars with $Z_2$ symmetry, with Higgs portal interactions that can introduce mixing between the SM Higgs boson and the SM singlet scalars in the dark sector. We utilize the existing collider results of the Higgs signal rate, direct heavy Higgs searches, and electroweak precision observables to constrain the model parameters. The $\text{SU(2)}_{\text{D}}$ partially breaks into $\text{U(1)}_{\text{D}}$ gauge group by the scalar sector. The resulting two stable massive dark gauge bosons and pseudo-Goldstone bosons can be viable cold dark matter candidates, while the massless gauge boson from the unbroken $\text{U(1)}_{\text{D}}$ subgroup is a dark radiation and can introduce long-range attractive dark matter (DM) self-interaction, which can alleviate the small-scale structure issues. We study in detail the pattern of strong first-order phase transition and gravitational wave (GW) production triggered by the dark sector symmetry breaking, and further evaluate the signal-to-noise ratio for several proposed space interferometer missions. We conclude that the rich physics in the dark sector may be observable with the current and future measurements at colliders, DM experiments, and GW interferometers.

hep-ph↗

Scalar and tensor neutrino interactions

We constrain general Dirac neutrino interactions based on the Standard Model Effective Field Theory framework extended with right-handed neutrinos $N$ (SMNEFT) using deep inelastic and coherent elastic neutrino scattering, nuclear beta decay, and meson decay data, and high energy electron-proton and proton-proton collider data. We compute the one-loop anomalous dimensions of the low-energy effective field theory (LEFT) below the electroweak scale and of SMNEFT above the electroweak scale. The tree-level matching between LEFT and SMNEFT is performed at the electroweak scale. Currently, the most stringent limits on scalar and tensor interactions arise from pseudoscalar meson decays and the LHC measurements at the per mille level. In the future, the upcoming High-Luminosity LHC (HL-LHC) has the potential to reach the $10^{-4}$ level and LHeC can play an important role under certain theoretical assumptions.

hep-ph↗

References of References: How Far is the Knowledge Ancestry

Scientometrics studies have extended from direct citations to high-order citations, as simple citation count is found to tell only part of the story regarding scientific impact. This extension is deemed to be beneficial in scenarios like research evaluation, science history modeling, and information retrieval. In contrast to citations of citations (forward citation generations), references of references (backward citation generations) as another side of high-order citations, is relatively less explored. We adopt a series of metrics for measuring the unfolding of backward citations of a focal paper, tracing back to its knowledge ancestors generation by generation. Two sub-fields in Physics are subject to such analysis on a large-scale citation network. Preliminary results show that (1) most papers in our dataset can be traced to their knowledge ancestry; (2) the size distribution of backward citation generations presents a decreasing-and-then-increasing shape; and (3) citations more than one generation away are still relevant to the focal paper, from either a forward or backward perspective; yet, backward citation generations are higher in topic relevance to the paper of interest. Furthermore, the backward citation generations shed lights for literature recommendation, science evaluation, and sociology of science studies.

cs.DL↗

Neuron Linear Transformation: Modeling the Domain Shift for Crowd Counting

Cross-domain crowd counting (CDCC) is a hot topic due to its importance in public safety. The purpose of CDCC is to alleviate the domain shift between the source and target domain. Recently, typical methods attempt to extract domain-invariant features via image translation and adversarial learning. When it comes to specific tasks, we find that the domain shifts are reflected on model parameters' differences. To describe the domain gap directly at the parameter-level, we propose a Neuron Linear Transformation (NLT) method, exploiting domain factor and bias weights to learn the domain shift. Specifically, for a specific neuron of a source model, NLT exploits few labeled target data to learn domain shift parameters. Finally, the target neuron is generated via a linear transformation. Extensive experiments and analysis on six real-world datasets validate that NLT achieves top performance compared with other domain adaptation methods. An ablation study also shows that the NLT is robust and more effective than supervised and fine-tune training. Code is available at: \url{https://github.com/taohan10200/NLT}.

cs.CV↗

LiveMap: Real-Time Dynamic Map in Automotive Edge Computing

Autonomous driving needs various line-of-sight sensors to perceive surroundings that could be impaired under diverse environment uncertainties such as visual occlusion and extreme weather. To improve driving safety, we explore to wirelessly share perception information among connected vehicles within automotive edge computing networks. Sharing massive perception data in real time, however, is challenging under dynamic networking conditions and varying computation workloads. In this paper, we propose LiveMap, a real-time dynamic map, that detects, matches, and tracks objects on the road with crowdsourcing data from connected vehicles in sub-second. We develop the data plane of LiveMap that efficiently processes individual vehicle data with object detection, projection, feature extraction, object matching, and effectively integrates objects from multiple vehicles with object combination. We design the control plane of LiveMap that allows adaptive offloading of vehicle computations, and develop an intelligent vehicle scheduling and offloading algorithm to reduce the offloading latency of vehicles based on deep reinforcement learning (DRL) techniques. We implement LiveMap on a small-scale testbed and develop a large-scale network simulator. We evaluate the performance of LiveMap with both experiments and simulations, and the results show LiveMap reduces 34.1% average latency than the baseline solution.

cs.NI↗

Off-shell Higgs Couplings in $H^*\to ZZ\to \ell\ellνν$

We explore the new physics reach for the off-shell Higgs boson measurement in the ${pp \to H^* \rightarrow Z(\ell^{+}\ell^{-})Z(ν\barν)}$ channel at the high-luminosity LHC. The new physics sensitivity is parametrized in terms of the Higgs boson width, effective field theory framework, and a non-local Higgs-top coupling form factor. Adopting Machine-learning techniques, we demonstrate that the combination of a large signal rate and a precise phenomenological probe for the process energy scale, due to the transverse $ZZ$ mass, leads to significant sensitivities beyond the existing results in the literature for the new physics scenarios considered.

hep-ph↗

Type-I 2HDM under the Higgs and Electroweak Precision Measurements

We explore the extent to which future precision measurements of the Standard Model (SM) observables at the proposed $Z$-factories and Higgs factories may have impacts on new physics beyond the Standard Model, as illustrated by studying the Type-I Two-Higgs-doublet model (Type-I 2HDM). We include the contributions from the heavy Higgs bosons at the tree-level and at the one-loop level in a full model-parameter space. While only small $\tanβ$ region is strongly constrained at tree level, the large $\tanβ$ region gets constrained at loop level due to $\tanβ$ enhanced tri-Higgs couplings. We perform a multiple variable global fit with non-alignment and non-degenerate masses. We find that the allowed parameter ranges could be tightly constrained by the future Higgs precision measurements, especially for small and large values of $\tanβ$. Indirect limits on the masses of heavy Higgs bosons can be obtained, which can be complementary to the direct searches of the heavy Higgs bosons at hadron colliders. We also find that the expected accuracies at the $Z$-pole and at a Higgs factory are quite complementary in constraining mass splittings of heavy Higgs bosons. The typical results are $|\cos(β-α)| < 0.05, |Δm_Φ| < 200\ {\rm GeV}$, and $\tanβ\gtrsim 0.3$. The reaches from CEPC, FCCee and ILC are also compared, for both Higgs and $Z$-pole precision measurements. Comparing to the Type-II 2HDM, the 95\% C.L. allowed range of $\cos(β-α)$ is larger, especially for large values of $\tanβ$.

hep-ph↗

Answer-checking in Context: A Multi-modal FullyAttention Network for Visual Question Answering

Visual Question Answering (VQA) is challenging due to the complex cross-modal relations. It has received extensive attention from the research community. From the human perspective, to answer a visual question, one needs to read the question and then refer to the image to generate an answer. This answer will then be checked against the question and image again for the final confirmation. In this paper, we mimic this process and propose a fully attention based VQA architecture. Moreover, an answer-checking module is proposed to perform a unified attention on the jointly answer, question and image representation to update the answer. This mimics the human answer checking process to consider the answer in the context. With answer-checking modules and transferred BERT layers, our model achieves the state-of-the-art accuracy 71.57\% using fewer parameters on VQA-v2.0 test-standard split.

cs.CV↗

Unsupervised Semantic Aggregation and Deformable Template Matching for Semi-Supervised Learning

Unlabeled data learning has attracted considerable attention recently. However, it is still elusive to extract the expected high-level semantic feature with mere unsupervised learning. In the meantime, semi-supervised learning (SSL) demonstrates a promising future in leveraging few samples. In this paper, we combine both to propose an Unsupervised Semantic Aggregation and Deformable Template Matching (USADTM) framework for SSL, which strives to improve the classification performance with few labeled data and then reduce the cost in data annotating. Specifically, unsupervised semantic aggregation based on Triplet Mutual Information (T-MI) loss is explored to generate semantic labels for unlabeled data. Then the semantic labels are aligned to the actual class by the supervision of labeled data. Furthermore, a feature pool that stores the labeled samples is dynamically updated to assign proxy labels for unlabeled data, which are used as targets for cross-entropy minimization. Extensive experiments and analysis across four standard semi-supervised learning benchmarks validate that USADTM achieves top performance (e.g., 90.46$\%$ accuracy on CIFAR-10 with 40 labels and 95.20$\%$ accuracy with 250 labels). The code is released at https://github.com/taohan10200/USADTM.

cs.CV↗

Finding the Evidence: Localization-aware Answer Prediction for Text Visual Question Answering

Image text carries essential information to understand the scene and perform reasoning. Text-based visual question answering (text VQA) task focuses on visual questions that require reading text in images. Existing text VQA systems generate an answer by selecting from optical character recognition (OCR) texts or a fixed vocabulary. Positional information of text is underused and there is a lack of evidence for the generated answer. As such, this paper proposes a localization-aware answer prediction network (LaAP-Net) to address this challenge. Our LaAP-Net not only generates the answer to the question but also predicts a bounding box as evidence of the generated answer. Moreover, a context-enriched OCR representation (COR) for multimodal fusion is proposed to facilitate the localization task. Our proposed LaAP-Net outperforms existing approaches on three benchmark datasets for the text VQA task by a noticeable margin.

cs.CV↗