arXiv subjects

Jie Hu

Publications and source records attributed to Jie Hu.

At least 235 records · Page 13Linked to original sources

arXiv2020

Robust Motion Averaging under Maximum Correntropy Criterion

Recently, the motion averaging method has been introduced as an effective means to solve the multi-view registration problem. This method aims to recover global motions from a set of relative motions, where the original method is sensitive to outliers due to using the Frobenius norm error in the optimization. Accordingly, this paper proposes a novel robust motion averaging method based on the maximum correntropy criterion (MCC). Specifically, the correntropy measure is used instead of utilizing Frobenius norm error to improve the robustness of motion averaging against outliers. According to the half-quadratic technique, the correntropy measure based optimization problem can be solved by the alternating minimization procedure, which includes operations of weight assignment and weighted motion averaging. Further, we design a selection strategy of adaptive kernel width to take advantage of correntropy. Experimental results on benchmark data sets illustrate that the new method has superior performance on accuracy and robustness for multi-view registration.

cs.CV↗

arXiv2020

H-AP Deployment for Joint Wireless Information and Energy Transfer in Smart Cities

With the wireless communication being more various in the future, it's becoming challenging to prolong the lifetime of many battery powered devices, since frequently replacing their batteries is a cumbersome job. An hybrid access point (H-AP) is capable of simultaneously operating wireless information transfer (WIT) and wireless energy transfer (WET) by exploiting the radio frequency (RF) signals. By jointly considering both the mobility of the user and the popularity of the sites, we focus on the design of the H-AP's deployment scheme. Specifically, a mobility model of the grid based city streets is exploited for characterising the users' movements. Based on this mobility model, the impact of the deployment site's popularity on the WIT and WET efficiencies is firstly analysed. Then, an H-AP deployment scheme for striking a balance between the WIT and the WET efficiencies is proposed, which is regarded as the B-deployment scheme. The simulation results demonstrate that the B-deployment scheme is more flexible for satisfying diverse requirement of the WIT and WET efficiencies.

eess.SY↗

arXiv2020

Joint Interleaver and Modulation Design For Multi-User SWIPT-NOMA

Radio frequency (RF) signals can be relied upon for conventional wireless information transfer (WIT) and for challenging wireless power transfer (WPT), which triggers the significant research interest in the topic of simultaneous wireless information and power transfer (SWIPT). By further exploiting the advanced non-orthogonal-multiple-access (NOMA) technique, we are capable of improving the spectrum efficiency of the resource-limited SWIPT system. In our SWIPT system, a hybrid access point (H-AP) superimposes the modulated symbols destined to multiple WIT users by exploiting the power-domain NOMA, while WPT users are capable of harvesting the energy carried by the superposition symbols. In order to maximise the amount of energy transferred to the WPT users, we propose a joint design of the energy interleaver and the constellation rotation based modulator in the symbol-block level by constructively superimposing the symbols destined to the WIT users in the power domain. Furthermore, a transmit power allocation scheme is proposed to guarantee the symbol-error-ratio (SER) of all the WIT users. By considering the sensitivity of practical energy harvesters, the simulation results demonstrate that our scheme is capable of substantially increasing the WPT performance without any remarkable degradation of the WIT performance.

eess.SP↗

arXiv2020

Interpretable Machine Learning Model for Early Prediction of Mortality in Elderly Patients with Multiple Organ Dysfunction Syndrome (MODS): a Multicenter Retrospective Study and Cross Validation

Background: Elderly patients with MODS have high risk of death and poor prognosis. The performance of current scoring systems assessing the severity of MODS and its mortality remains unsatisfactory. This study aims to develop an interpretable and generalizable model for early mortality prediction in elderly patients with MODS. Methods: The MIMIC-III, eICU-CRD and PLAGH-S databases were employed for model generation and evaluation. We used the eXtreme Gradient Boosting model with the SHapley Additive exPlanations method to conduct early and interpretable predictions of patients' hospital outcome. Three types of data source combinations and five typical evaluation indexes were adopted to develop a generalizable model. Findings: The interpretable model, with optimal performance developed by using MIMIC-III and eICU-CRD datasets, was separately validated in MIMIC-III, eICU-CRD and PLAGH-S datasets (no overlapping with training set). The performances of the model in predicting hospital mortality as validated by the three datasets were: AUC of 0.858, sensitivity of 0.834 and specificity of 0.705; AUC of 0.849, sensitivity of 0.763 and specificity of 0.784; and AUC of 0.838, sensitivity of 0.882 and specificity of 0.691, respectively. Comparisons of AUC between this model and baseline models with MIMIC-III dataset validation showed superior performances of this model; In addition, comparisons in AUC between this model and commonly used clinical scores showed significantly better performance of this model. Interpretation: The interpretable machine learning model developed in this study using fused datasets with large sample sizes was robust and generalizable. This model outperformed the baseline models and several clinical scores for early prediction of mortality in elderly ICU patients. The interpretative nature of this model provided clinicians with the ranking of mortality risk features.

physics.med-ph↗

arXiv2019

Information Competing Process for Learning Diversified Representations

Learning representations with diversified information remains as an open problem. Towards learning diversified representations, a new approach, termed Information Competing Process (ICP), is proposed in this paper. Aiming to enrich the information carried by feature representations, ICP separates a representation into two parts with different mutual information constraints. The separated parts are forced to accomplish the downstream task independently in a competitive environment which prevents the two parts from learning what each other learned for the downstream task. Such competing parts are then combined synergistically to complete the task. By fusing representation parts learned competitively under different conditions, ICP facilitates obtaining diversified representations which contain rich information. Experiments on image classification and image reconstruction tasks demonstrate the great potential of ICP to learn discriminative and disentangled representations in both supervised and self-supervised learning settings.

cs.LG↗

arXiv2019

Photonic hook generated by twin-ellipse microcylinder

Recently, two special photonic jets, photonic hooks and twin photonic jets, have been proposed to deal with complex conditions in nanoscale manipulation. Photonic hooks are generated by a single light plane wave and an asymmetric microparticle, while the twin photonic jets are produced by two incident light beams. In this letter, we presented and demonstrate a method to combine photonic hooks and twin photonic jets. A single light plane wave and a symmetric microparticle, twin-ellipse microcylinder, are used in this research. The curvature degree, length and maximum E2 filed enhancement of twin photonic hooks are varied significantly, with the change of refractive indices and shape of twin-ellipse microcylinder. And a liquid-immersed core-shell is built to achieve a flexible tunability.

physics.optics↗

arXiv2019

Photonic hooks from Janus microcylinders

Recently, a type of curved light beams, photonic hooks (PHs), was theoretically predicted and experimentally observed. The production of photonic hook (PH) is due to the breaking of structural symmetry of a plane-wave illuminated microparticle. Herein, we presented and implemented a new approach, of utilizing the symmetry-broken of the microparticles in material composition, for the generation of PHs from Janus microcylinders. Finite element method based numerical simulation and energy flow diagram represented theoretical analysis were used to investigate the field distribution characteristics and formation mechanism of the PHs. The full width at half-maximum (FWHM) of the PH (~0.29$λ$) is smaller than the FWHM of the photonic nanojet (~0.35$λ$) formed from a circular microcylinder with the same geometric radius. By changing the refractive index contrasts between upper and lower half-cylinders, or rotating the Janus microcylinder relative to the central axis, the shape profiles of the PHs can be efficiently modulated. The tunability of the PHs through simple stretching or compression operations, for the Janus microcylinder constituted by one solid inorganic half-cylinder and the other flexible polymer half-cylinder, was studied and discussed as well.

physics.optics↗

arXiv2019

Localization driven superradiant instability

The prominent Dicke superradiant phase arises from coupling an ensemble of atoms to cavity optical field when external optical pumping exceeds a threshold strength. Here we report a prediction of the superrandiant instability driven by Anderson localization, realized with a hybrid system of Dicke and Aubry-Andre (DAA) model for bosons trapped in a one-dimensional (1D) quasiperiodic optical lattice and coupled to a cavity. Our central finding is that for bosons condensed in localized phase given by the DAA model, the resonant superradiant scattering is induced, for which the critical optical pumping of superradiant phase transition approaches zero, giving an instability driven by Anderson localization. The superradiant phase for the DAA model with or without a mobility edge is investigated, showing that the localization driven superradiant instability is in sharp contrast to the superradiance as widely observed for Bose condensate in extended states, and should be insensitive to temperature of the system. This study unveils an insightful effect of localization on the Dicke superradiance, and is well accessible based on the current experiments.

cond-mat.quant-gas↗

arXiv2019

Squeeze-and-Excitation Networks

The central building block of convolutional neural networks (CNNs) is the convolution operator, which enables networks to construct informative features by fusing both spatial and channel-wise information within local receptive fields at each layer. A broad range of prior research has investigated the spatial component of this relationship, seeking to strengthen the representational power of a CNN by enhancing the quality of spatial encodings throughout its feature hierarchy. In this work, we focus instead on the channel relationship and propose a novel architectural unit, which we term the "Squeeze-and-Excitation" (SE) block, that adaptively recalibrates channel-wise feature responses by explicitly modelling interdependencies between channels. We show that these blocks can be stacked together to form SENet architectures that generalise extremely effectively across different datasets. We further demonstrate that SE blocks bring significant improvements in performance for existing state-of-the-art CNNs at slight additional computational cost. Squeeze-and-Excitation Networks formed the foundation of our ILSVRC 2017 classification submission which won first place and reduced the top-5 error to 2.251%, surpassing the winning entry of 2016 by a relative improvement of ~25%. Models and code are available at https://github.com/hujie-frank/SENet.

cs.CV↗

arXiv2019

Attribute Guided Unpaired Image-to-Image Translation with Semi-supervised Learning

Unpaired Image-to-Image Translation (UIT) focuses on translating images among different domains by using unpaired data, which has received increasing research focus due to its practical usage. However, existing UIT schemes defect in the need of supervised training, as well as the lack of encoding domain information. In this paper, we propose an Attribute Guided UIT model termed AGUIT to tackle these two challenges. AGUIT considers multi-modal and multi-domain tasks of UIT jointly with a novel semi-supervised setting, which also merits in representation disentanglement and fine control of outputs. Especially, AGUIT benefits from two-fold: (1) It adopts a novel semi-supervised learning process by translating attributes of labeled data to unlabeled data, and then reconstructing the unlabeled data by a cycle consistency operation. (2) It decomposes image representation into domain-invariant content code and domain-specific style code. The redesigned style code embeds image style into two variables drawn from standard Gaussian distribution and the distribution of domain label, which facilitates the fine control of translation due to the continuity of both variables. Finally, we introduce a new challenge, i.e., disentangled transfer, for UIT models, which adopts the disentangled representation to translate data less related with the training set. Extensive experiments demonstrate the capacity of AGUIT over existing state-of-the-art models.

cs.CV↗

arXiv2019

Combining RGB and Points to Predict Grasping Region for Robotic Bin-Picking

This paper focuses on a robotic picking tasks in cluttered scenario. Because of the diversity of objects and clutter by placing, it is much difficult to recognize and estimate their pose before grasping. Here, we use U-net, a special Convolution Neural Networks (CNN), to combine RGB images and depth information to predict picking region without recognition and pose estimation. The efficiency of diverse visual input of the network were compared, including RGB, RGB-D and RGB-Points. And we found the RGB-Points input could get a precision of 95.74%.

cs.RO↗

arXiv2019

Suction Grasp Region Prediction using Self-supervised Learning for Object Picking in Dense Clutter

This paper focuses on robotic picking tasks in cluttered scenario. Because of the diversity of poses, types of stack and complicated background in bin picking situation, it is much difficult to recognize and estimate their pose before grasping them. Here, this paper combines Resnet with U-net structure, a special framework of Convolution Neural Networks (CNN), to predict picking region without recognition and pose estimation. And it makes robotic picking system learn picking skills from scratch. At the same time, we train the network end to end with online samples. In the end of this paper, several experiments are conducted to demonstrate the performance of our methods.

cs.RO↗

arXiv2019

Towards Visual Feature Translation

Most existing visual search systems are deployed based upon fixed kinds of visual features, which prohibits the feature reusing across different systems or when upgrading systems with a new type of feature. Such a setting is obviously inflexible and time/memory consuming, which is indeed mendable if visual features can be "translated" across systems. In this paper, we make the first attempt towards visual feature translation to break through the barrier of using features across different visual search systems. To this end, we propose a Hybrid Auto-Encoder (HAE) to translate visual features, which learns a mapping by minimizing the translation and reconstruction errors. Based upon HAE, an Undirected Affinity Measurement (UAM) is further designed to quantify the affinity among different types of visual features. Extensive experiments have been conducted on several public datasets with sixteen different types of widely-used features in visual search systems. Quantitative results show the encouraging possibilities of feature translation. For the first time, the affinity among widely-used features like SIFT and DELF is reported.

cs.CV↗

arXiv2019

Gather-Excite: Exploiting Feature Context in Convolutional Neural Networks

While the use of bottom-up local operators in convolutional neural networks (CNNs) matches well some of the statistics of natural images, it may also prevent such models from capturing contextual long-range feature interactions. In this work, we propose a simple, lightweight approach for better context exploitation in CNNs. We do so by introducing a pair of operators: gather, which efficiently aggregates feature responses from a large spatial extent, and excite, which redistributes the pooled information to local features. The operators are cheap, both in terms of number of added parameters and computational complexity, and can be integrated directly in existing architectures to improve their performance. Experiments on several datasets show that gather-excite can bring benefits comparable to increasing the depth of a CNN at a fraction of the cost. For example, we find ResNet-50 with gather-excite operators is able to outperform its 101-layer counterpart on ImageNet with no additional learnable parameters. We also propose a parametric gather-excite operator pair which yields further performance gains, relate it to the recently-introduced Squeeze-and-Excitation Networks, and analyse the effects of these changes to the CNN feature activation statistics.

cs.CV↗

arXiv2018

Bayesian Detection of Abnormal ADS in Mutant Caenorhabditis elegans Embryos

Cell division timing is critical for cell fate specification and morphogenesis during embryogenesis. How division timings are regulated among cells during development is poorly understood. Here we focus on the comparison of asynchrony of division between sister cells (ADS) between wild-type and mutant individuals of Caenorhabditis elegans. Since the replicate number of mutant individuals of each mutated gene, usually one, is far smaller than that of wild-type, direct comparison of two distributions of ADS between wild-type and mutant type, such as Kolmogorov- Smirnov test, is not feasible. On the other hand, we find that sometimes ADS is correlated with the life span of corresponding mother cell in wild-type. Hence, we apply a semiparametric Bayesian quantile regression method to estimate the 95% confidence interval curve of ADS with respect to life span of mother cell of wild-type individuals. Then, mutant-type ADSs outside the corresponding confidence interval are selected out as abnormal one with a significance level of 0.05. Simulation study demonstrates the accuracy of our method and Gene Enrichment Analysis validates the results of real data sets.

q-bio.QM↗

arXiv2018

A simple numerical scheme for the 2D shallow-water system

This paper presents a simple numerical scheme for the two dimensional Shallow-Water Equations (SWEs). Inspired by the study of numerical approximation of the one dimensional SWEs Audusse et al. (2015), this paper extends the problem from 1D to 2D with the simplicity of application preserves. The new scheme is implemented into the code TELEMAC-2D [tel2d, 2014] and several tests are made to verify the scheme ability under an equilibrium state at rest and different types of flow regime (i.e., fluvial regime, transcritical flow from fluvial to torrential regime, transcritical flow with a hydraulic jump). The sensitivity analysis is conducted to exam the scheme convergence.

physics.comp-ph↗

arXiv2018

List strong edge-coloring of graphs with maximum degree 4

A strong edge-coloring of a graph $G$ is an edge-coloring such that any two edges on a path of length three receive distinct colors. We denote the strong chromatic index by $χ_{s}'(G)$ which is the minimum number of colors that allow a strong edge-coloring of $G$. Erdős and Nešetřil conjectured in 1985 that the upper bound of $χ_{s}'(G)$ is $\frac{5}{4}Δ^{2}$ when $Δ$ is even and $\frac{1}{4}(5Δ^{2}-2Δ+1)$ when $Δ$ is odd, where $Δ$ is the maximum degree of $G$. The conjecture is proved right when $Δ\leq3$. The best known upper bound for $Δ=4$ is 22 due to Cranston previously. In this paper we extend the result of Cranston to list strong edge-coloring, that is to say, we prove that when $Δ=4$ the upper bound of list strong chromatic index is 22.

math.CO↗

arXiv2017

A Bayesian statistical analysis of stochastic phenotypic plasticity model of cancer cells

The phenotypic plasticity of cancer cells has received special attention in recent years. Even though related models have been widely studied in terms of mathematical properties, a thorough statistical analysis on parameter estimation and model selection is still very lacking. In this study, we present a Bayesian approach on the relative frequencies of cancer stem cells (CSCs). Both Gibbs sampling and Metropolis-Hastings (MH) algorithm are used to perform point and interval estimations of cell-state transition rates between CSCs and non-CSCs. Extensive simulations demonstrate the validity of our model and algorithm. By applying this method to a published data on SW620 colon cancer cell line, the model selection favors the phenotypic plasticity model, relative to conventional hierarchical model of cancer cells. Moreover, it is found that the initial state of CSCs after cell sorting significantly influences the occurrence of phenotypic plasticity.

q-bio.CB↗