Searcharxiv⌕ Search

arXiv subjects

Tong Shen

Publications and source records attributed to Tong Shen.

52 records · Page 3Linked to original sources

Classes Matter: A Fine-grained Adversarial Approach to Cross-domain Semantic Segmentation

Despite great progress in supervised semantic segmentation,a large performance drop is usually observed when deploying the model in the wild. Domain adaptation methods tackle the issue by aligning the source domain and the target domain. However, most existing methods attempt to perform the alignment from a holistic view, ignoring the underlying class-level data structure in the target domain. To fully exploit the supervision in the source domain, we propose a fine-grained adversarial learning strategy for class-level feature alignment while preserving the internal structure of semantics across domains. We adopt a fine-grained domain discriminator that not only plays as a domain distinguisher, but also differentiates domains at class level. The traditional binary domain labels are also generalized to domain encodings as the supervision signal to guide the fine-grained feature alignment. An analysis with Class Center Distance (CCD) validates that our fine-grained adversarial strategy achieves better class-level alignment compared to other state-of-the-art methods. Our method is easy to implement and its effectiveness is evaluated on three classical domain adaptation tasks, i.e., GTA5 to Cityscapes, SYNTHIA to Cityscapes and Cityscapes to Cross-City. Large performance gains show that our method outperforms other global feature alignment based and class-wise alignment based counterparts. The code is publicly available at https://github.com/JDAI-CV/FADA.

cs.CV↗

Regional Robust Secure Precise Wireless Transmission Design for Multi-user UAV Broadcasting System

In this paper, two regional robust secure precise wireless transmission (SPWT) schemes for multi-user unmanned aerial vehicle (UAV) :1) regional signal-to-leakage-and-noise ratio (SLNR) and artificial-noise-to-leakage-and-noise ratio (ANLNR) (R-SLNR-ANLNR) maximization and 2) point SLNR and ANLNR (P-SLNR-ANLNR) maximization, are proposed to tackle with the estimation errors of the target users' location. In SPWT system, the estimation error for SPWT can not be ignored. However the conventional robust methods in secure wireless communications optimize the beamforming vector in the desired positions only in statistical means and can not guarantee the security for each symbol. Proposed regional robust schemes are designed for optimizing the secrecy performance in the whole error region around the estimated location. Specifically, with known maximal estimation error, we define target region and wiretap region. Then design an optimal beamforming vector and an artificial noise projection matrix, which achieve the confidential signal in the target area having the maximal power while only few signal power is conserved in the potential wiretap region. Instead of considering the statistical distributions of the estimated errors into optimization, we optimize the SLNR and ANLNR of the whole target area, which significantly decreases the complexity. Moreover, the proposed schemes can ensure that the desired users are located in the optimized region, which are more practical than conventional methods. Simulation results show that our proposed regional robust SPWT design is capable of substantially improving the secrecy rate compared to the conventional non-robust method. The P-SLNR-ANLNR maximization-based method has the comparable secrecy performance with a lower complexity than that of the R-SLNR-ANLNR maximization-based method.

eess.SP↗

The influence of high-energy local orbitals and electron-phonon interactions on the band gaps and optical spectra of hexagonal boron nitride

We report $ab$ $initio$ band diagram and optical absorption spectra of hexagonal boron nitride ($h$-BN), focusing on unravelling how the completeness of basis set for $GW$ calculations and how electron-phonon interactions (EPIs) impact on them. The completeness of basis set, an issue which was seldom discussed in previous optical spectra calculations of $h$-BN, is found crucial in providing converged quasiparticle band gaps. In the comparison among three different codes, we demonstrate that by including high-energy local orbitals in the all-electron linearized augmented plane waves based $GW$ calculations, the quasiparticle direct and fundamental indirect band gaps are widened by $\sim$0.2 eV, giving values of 6.81 eV and 6.25 eV respectively at the $GW_0$ level. EPIs, on the other hand, reduce them to 6.62 eV and 6.03 eV respectively at 0 K, and 6.60 eV and 5.98 eV respectively at 300 K. With clamped crystal structure, the first peak of the absorption spectrum is at 6.07 eV, originating from the direct exciton contributed by electron transitions around $K$ in the Brillouin zone. After including the EPIs-renormalized quasiparticles in the Bethe-Salpeter equation, the exciton-phonon coupling shifts the first peak to 5.83 eV at 300 K, lower than the experimental value of $\sim$6.00 eV. This accuracy is acceptable to an $ab$ $initio$ description of excited states with no fitting parameter.

cond-mat.mtrl-sci↗

Two High-Performance Amplitude Beamforming Schemes for Secure Precise Communication and Jamming with Phase Alignment

To severely weaken the eavesdropper's ability to intercept confidential message (CM), a precise jamming (PJ) idea is proposed by making use of the concept of secure precise wireless transmission (SPWT). Its basic idea is to focus the transmit energy of artificial noise (AN) onto the neighborhood of eavesdropper (Eve) by using random subcarrier selection (RSS), directional modulation, phase alignment (PA), and amplitude beamforming (AB). By doing so, Eve will be seriously interfered with AN. Here, the conventional joint optimization of phase and amplitude is converted into two independent phase and amplitude optimization problems. Considering PJ and SPWT require PA, the joint optimization problem reduces to an amplitude optimization problem. Then, two efficient AB schemes are proposed: leakage and maximizing receive power(Max-RP). With existing equal AB (EAB) as a performance reference, simulation results show that the proposed Max-RP and leakage AB methods perform much better than conventional method in terms of both bit-error-rate (BER) and secrecy rate (SR) at medium and high signal-to-noise ratio regions. The performance difference between the two proposed leakage and Max-RP amplitude beamformers is trivial. Additionally, we also find the fact that all three AB schemes EA, Max-RP, and leakage can form two main peaks of AN and CM around Eve and the desired receiver (Bob), respectively. This is what we call PJ and SPWT.

cs.IT↗

Zooming into Face Forensics: A Pixel-level Analysis

The stunning progress in face manipulation methods has made it possible to synthesize realistic fake face images, which poses potential threats to our society. It is urgent to have face forensics techniques to distinguish those tampered images. A large scale dataset "FaceForensics++" has provided enormous training data generated from prominent face manipulation methods to facilitate anti-fake research. However, previous works focus more on casting it as a classification problem by only considering a global prediction. Through investigation to the problem, we find that training a classification network often fails to capture high quality features, which might lead to sub-optimal solutions. In this paper, we zoom in on the problem by conducting a pixel-level analysis, i.e. formulating it as a pixel-level segmentation task. By evaluating multiple architectures on both segmentation and classification tasks, We show the superiority of viewing the problem from a segmentation perspective. Different ablation studies are also performed to investigate what makes an effective and efficient anti-fake model. Strong baselines are also established, which, we hope, could shed some light on the field of face forensics.

cs.CV↗

Low-Complexity Leakage-based Secure Precise Wireless Transmission with Hybrid Beamforming

In conventional secure precise wireless transmission (SPWT), fully digital beamforming (FDB) has a high secrecy performance in transmit antenna system, but results in a huge RF-chain circuit budget for medium-scale and large-scale systems. To reduce the complexity, this letter considers a hybrid digital and analog (HDA) structure with random frequency mapped into the RF-chains to achieve SPWT. Then, a hybrid SPWT scheme based on maximizing signal-to-leakage-and-noise ratio (SLNR) and artificial-noise-to-leakage-and-noise ratio (ANLNR) (M-SLNR-ANLNR) is proposed. Compared to the FDB scheme, the proposed scheme reduces the circuit budget with low computational complexity and comparable secrecy performance.

eess.SP↗

RVH: Range-Vector Hash for Fast Online Packet Classification

Packet classification according to multi-field ruleset is a key component for many network applications. Emerging software defined networking and cloud computing need to update the rulesets frequently for flexible policy configuration. Their success depends on the availability of the new generation of classifiers that can support both fast ruleset updating and high-speed packet classification. However, existing packet classification approaches focus either on high-speed packet classification or fast rule update, but no known scheme meets both requirements. In this paper, we propose Range-vector Hash (RVH) to effectively accelerate the packet classification with a hash-based algorithm while ensuring the fast rule update. RVH is built on our key observation that the number of distinct combinations of each field prefix lengths is not evenly distributed. To reduce the number of hash tables for fast classification, we introduce a novel concept range-vector with each specified the length range of each field prefix of the projected rules. RVH can overcome the major obstacle that hinders hash-based packet classification by balancing the number of hash tables and the probability of hash collision. Experimental results demonstrate that RVH can achieve the classification speed up to 15.7 times and the update speed up to 2.3 times that of the state-of-the-art algorithms on average, while only consuming 44% less memory.

cs.NI↗

Two Efficient Beamformers for Secure Precise Jamming and Communication with Phase Alignment

To achieve a better effect of interference on eavesdropper with an enhanced security, a secure precise jamming (PJ) and communication (SPJC) is proposed and its basic idea is to force the transmit energy of artificial noise (AN) and confidential message into the neighborhoods of Eve and Bob by using random subcarrier selection (RSS), directional modulation, and beamforming under phase alignment (PA) constraint (PAC). Here, we propose two high-performance beamforming schemes: minimum transmit power (Min-TP) and minimum regularized transmit power (Min-RTP) to achieve SPJC under PAC and orthogonal constraint (OC), where OC means that AN and CM are projected onto the null-spaces of the desired and eavesdropping channels, respectively. Simulation results show that the proposed Min-TP and Min-RTP methods perform much better than existing equal amplitude (EA) method in terms of both bit-error-rate (BER) and secrecy rate (SR) at medium and high signal-to-noise ratio regions. The SR performance difference between the proposed two methods becomes trivial as the number of transmit antennas approaches large-scale. More importantly, we also find the fact that all three schemes including EA, Min-TP, and Min-RTP can form two main peaks of AN and CM around Eve and Bob, respectively. This achieves both PJ and secure precise wireless transmission (SPWT), called SPJC.

eess.SP↗

Regularizing Proxies with Multi-Adversarial Training for Unsupervised Domain-Adaptive Semantic Segmentation

Training a semantic segmentation model requires a large amount of pixel-level annotation, hampering its application at scale. With computer graphics, we can generate almost unlimited training data with precise annotation. However,a deep model trained with synthetic data usually cannot directly generalize well to realistic images due to domain shift. It has been observed that highly confident labels for the unlabeled real images may be predicted relying on the labeled synthetic data. To tackle the unsupervised domain adaptation problem, we explore the possibilities to generate high-quality labels as proxy labels to supervise the training on target data. Specifically, we propose a novel proxy-based method using multi-adversarial training. We first train the model using synthetic data (source domain). Multiple discriminators are used to align the features be-tween the source and target domain (real images) at different levels. Then we focus on obtaining and selecting high-quality proxy labels by incorporating both the confidence of the class predictor and that from the adversarial discriminators. Our discriminators not only work as a regularizer to encourage feature alignment but also provide an alternative confidence measure for generating proxy labels. Relying on the generated high-quality proxies, our model can be trained in a "supervised manner" on the target do-main. On two major tasks, GTA5->Cityscapes and SYNTHIA->Cityscapes, our method achieves state-of-the-art results, outperforming the previous by a large margin.

cs.CV↗

Everyone is a Cartoonist: Selfie Cartoonization with Attentive Adversarial Networks

Selfie and cartoon are two popular artistic forms that are widely presented in our daily life. Despite the great progress in image translation/stylization, few techniques focus specifically on selfie cartoonization, since cartoon images usually contain artistic abstraction (e.g., large smoothing areas) and exaggeration (e.g., large/delicate eyebrows). In this paper, we address this problem by proposing a selfie cartoonization Generative Adversarial Network (scGAN), which mainly uses an attentive adversarial network (AAN) to emphasize specific facial regions and ignore low-level details. More specifically, we first design a cycle-like architecture to enable training with unpaired data. Then we design three losses from different aspects. A total variation loss is used to highlight important edges and contents in cartoon portraits. An attentive cycle loss is added to lay more emphasis on delicate facial areas such as eyes. In addition, a perceptual loss is included to eliminate artifacts and improve robustness of our method. Experimental results show that our method is capable of generating different cartoon styles and outperforms a number of state-of-the-art methods.

cs.CV↗

Two Practical Random-Subcarrier-Selection Methods for Secure Precise Wireless Transmission

In secure precise directional modulation (DM) networks, two practical random-subcarrier-selection (RSS) methods are proposed to transmit confidential message to the desired user per orthogonal frequency division multiplexing (OFDM) symbol with only single receive power peak formed by constructing random subcarrier set and performing a randomization procedure. This scheme completely addresses the crucial problem facing secure precise wireless transmission (SPWT), how to achieve the SPWT per OFDM symbol while the traditional SPWT holds only in statistically average sense. Several necessary conditions for SPWT per OFDM is derived and proposed: randomly distributed, sparse, and distinct subcarrier distance between two pair of adjacent antennas. Two random subcarrier sets (RSSs), quadratic subcarrier set (QSS) and prime subcarrier set (PSS), are constructed, where the former means the subcarrier index associated with any antennas is the square of antenna index, and the latter implies that the subcarrier indices over all antennas are prime numbers. Subsequently, following those conditions for SPWT per OFDM, a random factor is defined, and a randomization procedure (RP) is proposed. Its detailed process includes the following steps: integer mod, ordering, blocking, and block interleaving where BI is repeated until the random factor is greater than the predefined threshold. This yields a single main receive energy peak (SMREP) at the desired position with other positions, outside the SMREP, harvesting only weak receive energy seriously corrupted by AN.

cs.IT↗

Directional Modulation: A Secure Solution to 5G and Beyond Mobile Networks

Directional modulation (DM), as an efficient secure transmission way, offers security through its directive property and is suitable for line-of-propagation (LoP) channels such as millimeter wave (mmWave) massive multiple-input multiple-output (MIMO), satellite communication, unmanned aerial vehicle (UAV), and smart transportation. If the direction angle of the desired received is known, the desired channel gain vector is obtainable. Thus, in advance, the DM transmitter knows the values of directional angles of desired user and eavesdropper, or their direction of arrival (DOAs) because the beamforming vector of confidential messages and artificial noise (AN) projection matrix is mainly determined by directional angles of desired user and eavesdropper. For a DM transceiver, working as a receiver, the first step is to measure the DOAs of desired user and eavesdropper. Then, in the second step, using the measured DOAs, the beamforming vector of confidential messages and AN projection matrix is designed. In this paper, we describe the DOA measurement methods, power allocation, and beamforming in DM networks. A machine learning-based DOA measurement method is proposed to make a substantial SR performance gain compared to single-snapshot measurement without machine learning for a given null-space projection beamforming scheme. However, for a conventional DM network, there still exists a serious secure issue: the eavesdropper moves inside the main beam of the desired user and may intercept the confidential messages intended to the desired users because the beamforming vector of confidential messages and AN projection matrix are only angle-dependence. To address this problem, we present a new concept of secure and precise transmission, where the transmit waveform has two-dimensional even three-dimensional dependence by using DM, random frequency selection, and phase alignment at DM transmitter.

cs.IT↗

Decoupled Spatial Neural Attention for Weakly Supervised Semantic Segmentation

Weakly supervised semantic segmentation receives much research attention since it alleviates the need to obtain a large amount of dense pixel-wise ground-truth annotations for the training images. Compared with other forms of weak supervision, image labels are quite efficient to obtain. In our work, we focus on the weakly supervised semantic segmentation with image label annotations. Recent progress for this task has been largely dependent on the quality of generated pseudo-annotations. In this work, inspired by spatial neural-attention for image captioning, we propose a decoupled spatial neural attention network for generating pseudo-annotations. Our decoupled attention structure could simultaneously identify the object regions and localize the discriminative parts which generates high-quality pseudo-annotations in one forward path. The generated pseudo-annotations lead to the segmentation results which achieve the state-of-the-art in weakly-supervised semantic segmentation.

cs.CV↗

Statistical Challenges in Modeling Big Brain Signals

Brain signal data are inherently big: massive in amount, complex in structure, and high in dimensions. These characteristics impose great challenges for statistical inference and learning. Here we review several key challenges, discuss possible solutions, and highlight future research directions.

stat.ME↗

Weakly Supervised Semantic Segmentation Based on Web Image Co-segmentation

Training a Fully Convolutional Network (FCN) for semantic segmentation requires a large number of masks with pixel level labelling, which involves a large amount of human labour and time for annotation. In contrast, web images and their image-level labels are much easier and cheaper to obtain. In this work, we propose a novel method for weakly supervised semantic segmentation with only image-level labels. The method utilizes the internet to retrieve a large number of images and uses a large scale co-segmentation framework to generate masks for the retrieved images. We first retrieve images from search engines, e.g. Flickr and Google, using semantic class names as queries, e.g. class names in the dataset PASCAL VOC 2012. We then use high quality masks produced by co-segmentation on the retrieved images as well as the target dataset images with image level labels to train segmentation networks. We obtain an IoU score of 56.9 on test set of PASCAL VOC 2012, which reaches the state-of-the-art performance.

cs.CV↗

Learning Multi-level Region Consistency with Dense Multi-label Networks for Semantic Segmentation

Semantic image segmentation is a fundamental task in image understanding. Per-pixel semantic labelling of an image benefits greatly from the ability to consider region consistency both locally and globally. However, many Fully Convolutional Network based methods do not impose such consistency, which may give rise to noisy and implausible predictions. We address this issue by proposing a dense multi-label network module that is able to encourage the region consistency at different levels. This simple but effective module can be easily integrated into any semantic segmentation systems. With comprehensive experiments, we show that the dense multi-label can successfully remove the implausible labels and clear the confusion so as to boost the performance of semantic segmentation systems.

cs.CV↗