arXiv subjects

Jie Huang

Publications and source records attributed to Jie Huang.

At least 181 records · Page 10Linked to original sources

arXiv2022

CNSNet: A Cleanness-Navigated-Shadow Network for Shadow Removal

The key to shadow removal is recovering the contents of the shadow regions with the guidance of the non-shadow regions. Due to the inadequate long-range modeling, the CNN-based approaches cannot thoroughly investigate the information from the non-shadow regions. To solve this problem, we propose a novel cleanness-navigated-shadow network (CNSNet), with a shadow-oriented adaptive normalization (SOAN) module and a shadow-aware aggregation with transformer (SAAT) module based on the shadow mask. Under the guidance of the shadow mask, the SOAN module formulates the statistics from the non-shadow region and adaptively applies them to the shadow region for region-wise restoration. The SAAT module utilizes the shadow mask to precisely guide the restoration of each shadowed pixel by considering the highly relevant pixels from the shadow-free regions for global pixel-wise restoration. Extensive experiments on three benchmark datasets (ISTD, ISTD+, and SRD) show that our method achieves superior de-shadowing performance.

cs.CV↗

arXiv2022

An SBR Based Ray Tracing Channel Modeling Method for THz and Massive MIMO Communications

Terahertz (THz) communication and the application of massive multiple-input multiple-output (MIMO) technology have been proved significant for the sixth generation (6G) communication systems, and have gained global interests. In this paper, we employ the shooting and bouncing ray (SBR) method integrated with acceleration technology to model THz and massive MIMO channel. The results of ray tracing (RT) simulation in this paper, i.e., angle of departure (AoD), angle of arrival (AoA), and power delay profile (PDP) under the frequency band supported by the commercial RT software Wireless Insite (WI) are in agreement with those produced by WI. Based on the Kirchhoff scattering effect on material surfaces and atmospheric absorption loss showing at THz frequency band, the modified propagation models of Fresnel reflection coefficients and free-space attenuation are consistent with the measured results. For massive MIMO, the channel capacity and the stochastic power distribution are analyzed. The results indicate the applicability of SBR method for building deterministic models of THz and massive MIMO channels with extensive functions and acceptable accuracy.

eess.SP↗

arXiv2022

A Weighted Random Forest Based PositioningAlgorithm for 6G Indoor Communications

Due to the indoor none-line-of-sight (NLoS) propagation and multi-access interference (MAI), it is a great challenge to achieve centimeter-level positioning accuracy in indoor scenarios. However, the sixth generation (6G) wireless communications provide a good opportunity for the centimeter-level positioning. In 6G, the millimeter wave (mmWave) and terahertz (THz) communications have ultra-broad bandwidth so that the channel state information (CSI) will have a high resolution. In this paper, a weighted random forest (WRF) based indoor positioning algorithm using CSI based channel fingerprint feature is proposed to achieve high-precision positioning for 6G indoor communications. In addition, ray-tracing (RT) is used to improve the efficiency of establishing channel fingerprint database. The simulation results demonstrate the accuracy and robustness of the proposed algorithm. It is shown that the positioning accuracy of the algorithm is stable within 6 cm in different indoor scenarios with the channel fingerprint database established at 0.2 m intervals.

eess.SP↗

arXiv2022

An Improved Ray Tracing Acceleration Algorithm Based on Bounding Volume Hierarchies

Ray tracing is an efficient channel modeling method. However, the traditional ray tracing method has high computation complexity. To solve this problem, an improved bounding volume hierarchies (BVH) algorithm is proposed in this paper. Based on surface area heuristic (SAH) and spatial distance, the proposed algorithm can effectively reduce the number of unnecessary intersection tests between ray and triangular facets. In addition, the algorithm fully considers the influence of ray action range, which can not only make up for the defects of spatial division based on uniform grid method and k-dimensional (KD) tree, but also solve the problem of unsatisfactory spatial division based on traditional BVH algorithm. The simulation results show that compared with the traditional BVH algorithm, the proposed algorithm can improve the computation efficiency by 20% to 35% while ensuring the computation accuracy.

eess.SP↗

arXiv2022

An Improved Equiangular Division Algorithm for SBR based Ray Tracing Channel Modeling

Compared with image method (IM) based ray tracing (RT), shooting and bouncing ray (SBR) method is characterized by fast speed but low accuracy. In this paper, an iterative precise algorithm based on equiangular division is proposed to make rough paths accurate, allowing SBR to calculate exact channel information. Different ray launching methods are compared to obtain a better launching method. By using equiangular division, rays are launched more uniformly from transmitter (Tx) compared with the current equidistant division method. With the proposed iterative precise algorithm, error of angle of departure (AOD) and angle of arrival (AOA) is below 0.01 degree. The relationship between the number of iterations and error reduction is also given. It is illustrated that the proposed method has the same accuracy as IM by comparing the power delay profile (PDP) and angle distribution of paths. This can solve the problem of low accuracy brougth by SBR.

eess.SP↗

arXiv2022

Enhancement by Your Aesthetic: An Intelligible Unsupervised Personalized Enhancer for Low-Light Images

Low-light image enhancement is an inherently subjective process whose targets vary with the user's aesthetic. Motivated by this, several personalized enhancement methods have been investigated. However, the enhancement process based on user preferences in these techniques is invisible, i.e., a "black box". In this work, we propose an intelligible unsupervised personalized enhancer (iUPEnhancer) for low-light images, which establishes the correlations between the low-light and the unpaired reference images with regard to three user-friendly attributions (brightness, chromaticity, and noise). The proposed iUP-Enhancer is trained with the guidance of these correlations and the corresponding unsupervised loss functions. Rather than a "black box" process, our iUP-Enhancer presents an intelligible enhancement process with the above attributions. Extensive experiments demonstrate that the proposed algorithm produces competitive qualitative and quantitative results while maintaining excellent flexibility and scalability. This can be validated by personalization with single/multiple references, cross-attribution references, or merely adjusting parameters.

cs.CV↗

arXiv2022

Source-Free Domain Adaptation for Real-world Image Dehazing

Deep learning-based source dehazing methods trained on synthetic datasets have achieved remarkable performance but suffer from dramatic performance degradation on real hazy images due to domain shift. Although certain Domain Adaptation (DA) dehazing methods have been presented, they inevitably require access to the source dataset to reduce the gap between the source synthetic and target real domains. To address these issues, we present a novel Source-Free Unsupervised Domain Adaptation (SFUDA) image dehazing paradigm, in which only a well-trained source model and an unlabeled target real hazy dataset are available. Specifically, we devise the Domain Representation Normalization (DRN) module to make the representation of real hazy domain features match that of the synthetic domain to bridge the gaps. With our plug-and-play DRN module, unlabeled real hazy images can adapt existing well-trained source networks. Besides, the unsupervised losses are applied to guide the learning of the DRN module, which consists of frequency losses and physical prior losses. Frequency losses provide structure and style constraints, while the prior loss explores the inherent statistic property of haze-free images. Equipped with our DRN module and unsupervised loss, existing source dehazing models are able to dehaze unlabeled real hazy images. Extensive experiments on multiple baselines demonstrate the validity and superiority of our method visually and quantitatively.

cs.CV↗

arXiv2022

Reconfigurable intelligent surfaces: Channel characterization and modeling

Reconfigurable intelligent surfaces (RISs) are two dimensional (2D) metasurfaces which can intelligently manipulate electromagnetic waves by low-cost near passive reflecting elements. RIS is viewed as a potential key technology for the sixth generation (6G) wireless communication systems mainly due to its advantages in tuning wireless signals, thus smartly controlling propagation environments. In this paper, we aim at addressing channel characterization and modeling issues of RIS-assisted wireless communication systems. At first, the concept, principle, and potential applications of RIS are given. An overview of RIS based channel measurements and experiments is presented by classifying frequency bands, scenarios, system configurations, RIS constructions, experiment purposes, and channel observations. Then, RIS based channel characteristics are studied, including reflection and transmission, Doppler effect and multipath fading mitigation, channel reciprocity, channel hardening, rank improvement, far field and near field, etc. RIS based channel modeling works are investigated, including largescale path loss models and small-scale multipath fading models. At last, future research directions related to RIS-assisted channels are also discussed.

eess.SP↗

arXiv2022

Domain Representative Keywords Selection: A Probabilistic Approach

We propose a probabilistic approach to select a subset of a \textit{target domain representative keywords} from a candidate set, contrasting with a context domain. Such a task is crucial for many downstream tasks in natural language processing. To contrast the target domain and the context domain, we adapt the \textit{two-component mixture model} concept to generate a distribution of candidate keywords. It provides more importance to the \textit{distinctive} keywords of the target domain than common keywords contrasting with the context domain. To support the \textit{representativeness} of the selected keywords towards the target domain, we introduce an \textit{optimization algorithm} for selecting the subset from the generated candidate distribution. We have shown that the optimization algorithm can be efficiently implemented with a near-optimal approximation guarantee. Finally, extensive experiments on multiple domains demonstrate the superiority of our approach over other baselines for the tasks of keyword summary generation and trending keywords selection.

cs.CL↗

arXiv2022

Three-dimensional instantaneous orbit map for rotor-bearing system based on a novel multivariate complex variational mode decomposition algorithm

Full spectrum and holospectrum are homogenous information fusion technology developed for the fault diagnosis of rotating machinery, which is extensively exploited in the analysis of the orbits of rotor-bearing systems. However, they are not adapted for non-stationary signals, nor can they be used for fusion analysis of vibrations of multiple bearing sections. By drawing inspiration from the multivariate variational mode decomposition (MVMD) and the complex-valued signal decomposition, we propose a method called multivariate complex variational mode decomposition (MCVMD). It can simultaneously extract the forward and backward components of multiple bearing sections and realize non-stationary complex signal decomposition of multiple bearing sections of the rotor. To achieve the visualization goal of condition monitoring, we propose the three-dimensional instantaneous orbit map (3D-IOM). It enables more features of shaft vibration of a rotor system to be displayed and offers a new way for the fusion analysis of vibration signals of multiple bearing sections of rotating machinery. Furthermore, making the most of the joint information, we also provide a high-resolution time-full spectrum (Time-FS) to display the forward and backward frequency components of multiple bearing sections. The effectiveness of the proposed method through both the simulated experiment and the real-life complex-valued signals is demonstrated in this paper.

eess.SP↗

arXiv2022

An unsupervised approach for semantic place annotation of trajectories based on the prior probability

Semantic place annotation can provide individual semantics, which can be of great help in the field of trajectory data mining. Most existing methods rely on annotated or external data and require retraining following a change of region, thus preventing their large-scale applications. Herein, we propose an unsupervised method denoted as UPAPP for the semantic place annotation of trajectories using spatiotemporal information. The Bayesian Criterion is specifically employed to decompose the spatiotemporal probability of the candidate place into spatial probability, duration probability, and visiting time probability. Spatial information in ROI and POI data is subsequently adopted to calculate the spatial probability. In terms of the temporal probabilities, the Term Frequency Inverse Document Frequency weighting algorithm is used to count the potential visits to different place types in the trajectories, and generates the prior probabilities of the visiting time and duration. The spatiotemporal probability of the candidate place is then combined with the importance of the place category to annotate the visited places. Validation with a trajectory dataset collected by 709 volunteers in Beijing showed that our method achieved an overall and average accuracy of 0.712 and 0.720, respectively, indicating that the visited places can be annotated accurately without any external data.

cs.LG↗

arXiv2022

A Novel 3D Non-Stationary Channel Model for 6G Indoor Visible Light Communication Systems

The visible light communication (VLC) technology has attracted much attention in the research of the sixth generation (6G) communication systems. In this paper, a novel three dimensional (3D) space-time-frequency non-stationary geometry-based stochastic model (GBSM) is proposed for indoor VLC channels. The proposed VLC GBSM can capture unique indoor VLC channel characteristics such as the space-time-frequency non-stationarity caused by large light-emitting diode (LED) arrays in indoor scenarios, long travelling paths, and large bandwidths of visible light waves, respectively. In addition, the proposed model can support special radiation patterns of LEDs, 3D translational and rotational motions of the optical receiver (Rx), and can be applied to angle diversity receivers (ADRs). Key channel properties are simulated and analyzed, including the space-time-frequency correlation function (STFCF), received power, root mean square (RMS) delay spread, and path loss (PL). Simulation results verify the space-time-frequency non-stationarity in indoor VLC channels. Finally, the accuracy and practicality of the proposed model are validated by comparing the simulation result of channel 3dB bandwidth with the existing measurement data. The proposed channel model will play a supporting role in the design of future 6G VLC systems.

eess.SP↗

arXiv2022

Open Relation Modeling: Learning to Define Relations between Entities

Relations between entities can be represented by different instances, e.g., a sentence containing both entities or a fact in a Knowledge Graph (KG). However, these instances may not well capture the general relations between entities, may be difficult to understand by humans, even may not be found due to the incompleteness of the knowledge source. In this paper, we introduce the Open Relation Modeling problem - given two entities, generate a coherent sentence describing the relation between them. To solve this problem, we propose to teach machines to generate definition-like relation descriptions by letting them learn from defining entities. Specifically, we fine-tune Pre-trained Language Models (PLMs) to produce definitions conditioned on extracted entity pairs. To help PLMs reason between entities and provide additional relational knowledge to PLMs for open relation modeling, we incorporate reasoning paths in KGs and include a reasoning path selection mechanism. Experimental results show that our model can generate concise but informative relation descriptions that capture the representative characteristics of entities.

cs.CL↗

arXiv2021

A machine learning model to classify dynamic processes in liquid water

The dynamics of water molecules plays a vital role in understanding water. We combined computer simulation and deep learning to study the dynamics of H-bonds between water molecules. Based on ab initio molecular dynamics simulations and a newly defined directed Hydrogen (H-) bond population operator, we studied a typical dynamic process in bulk water: interchange, in which the H-bond donor reverses roles with the acceptor. By designing a recurrent neural network-based model, we have successfully classified the interchange and breakage processes in water. We have found that the ratio between them is approximately 1:4, and it hardly depends on temperatures from 280 to 360 K. This work implies that deep learning has the great potential to help distinguish complex dynamic processes containing H-bonds in other systems.

cond-mat.dis-nn↗

arXiv2021

Multi-Frequency Wireless Channel Measurements and Characteristics Analysis in Indoor Corridor Scenarios

In this paper, we conduct wireless channel measurements in indoor corridor scenarios at 2.4, 5 and 6 GHz bands with bandwidth of 320 MHz. The measurement results of channel characteristics at different frequency bands such as average power delay profile (APDP), path loss (PL), delay spread (DS), and Ricean K factor (KF) are presented and analyzed. It is found that the PL exponent (PLE) and PL offset βin the floating-intercept (FI) model tend to increase with the increase of frequency. The DS and KF values of the three frequency bands in line of sight (LOS) scenario are basically the same. These results are significant for the design of communication systems.

eess.SP↗

arXiv2021

A Novel 3D Non-Stationary GBSM for 6G THz Ultra-Massive MIMO Wireless Systems

Terahertz (THz) communication is now being considered as one of possible technologies for the sixth generation (6G) wireless communication systems. In this paper, a novel three-dimensional (3D) space-time-frequency non-stationary theoretical channel model is first proposed for 6G THz wireless communication systems employing ultra-massive multiple-input multiple-output (MIMO) technologies with long traveling paths. Considering frequency-dependent diffuse scattering, which is a special property of THz channels different from millimeter wave (mmWave) channels, the relative angles and delays of rays within one cluster will evolve in the frequency domain. Then, a corresponding simulation model is proposed with discrete angles calculated using the method of equal area (MEA). The statistical properties of the proposed theoretical and simulation models are derived and compared, showing good agreements. The accuracy and flexibility of the proposed simulation model are demonstrated by comparing the simulation results of the relative angle spread and root mean square (RMS) delay spread with corresponding measurements.

eess.SP↗

arXiv2021

Measuring Fine-Grained Domain Relevance of Terms: A Hierarchical Core-Fringe Approach

We propose to measure fine-grained domain relevance - the degree that a term is relevant to a broad (e.g., computer science) or narrow (e.g., deep learning) domain. Such measurement is crucial for many downstream tasks in natural language processing. To handle long-tail terms, we build a core-anchored semantic graph, which uses core terms with rich description information to bridge the vast remaining fringe terms semantically. To support a fine-grained domain without relying on a matching corpus for supervision, we develop hierarchical core-fringe learning, which learns core and fringe terms jointly in a semi-supervised manner contextualized in the hierarchy of the domain. To reduce expensive human efforts, we employ automatic annotation and hierarchical positive-unlabeled learning. Our approach applies to big or small domains, covers head or tail terms, and requires little human effort. Extensive experiments demonstrate that our methods outperform strong baselines and even surpass professional human performance.

cs.CL↗

arXiv2021

EDPN: Enhanced Deep Pyramid Network for Blurry Image Restoration

Image deblurring has seen a great improvement with the development of deep neural networks. In practice, however, blurry images often suffer from additional degradations such as downscaling and compression. To address these challenges, we propose an Enhanced Deep Pyramid Network (EDPN) for blurry image restoration from multiple degradations, by fully exploiting the self- and cross-scale similarities in the degraded image.Specifically, we design two pyramid-based modules, i.e., the pyramid progressive transfer (PPT) module and the pyramid self-attention (PSA) module, as the main components of the proposed network. By taking several replicated blurry images as inputs, the PPT module transfers both self- and cross-scale similarity information from the same degraded image in a progressive manner. Then, the PSA module fuses the above transferred features for subsequent restoration using self- and spatial-attention mechanisms. Experimental results demonstrate that our method significantly outperforms existing solutions for blurry image super-resolution and blurry image deblocking. In the NTIRE 2021 Image Deblurring Challenge, EDPN achieves the best PSNR/SSIM/LPIPS scores in Track 1 (Low Resolution) and the best SSIM/LPIPS scores in Track 2 (JPEG Artifacts).

cs.CV↗