Searcharxiv⌕ Search

arXiv subjects

Jun Zhang

Publications and source records attributed to Jun Zhang.

At least 883 records · Page 49Linked to original sources

EPI-based Oriented Relation Networks for Light Field Depth Estimation

Light field cameras record not only the spatial information of observed scenes but also the directions of all incoming light rays. The spatial and angular information implicitly contain geometrical characteristics such as multi-view or epipolar geometry, which can be exploited to improve the performance of depth estimation. An Epipolar Plane Image (EPI), the unique 2D spatial-angular slice of the light field, contains patterns of oriented lines. The slope of these lines is associated with the disparity. Benefiting from this property of EPIs, some representative methods estimate depth maps by analyzing the disparity of each line in EPIs. However, these methods often extract the optimal slope of the lines from EPIs while ignoring the relationship between neighboring pixels, which leads to inaccurate depth map predictions. Based on the observation that an oriented line and its neighboring pixels in an EPI share a similar linear structure, we propose an end-to-end fully convolutional network (FCN) to estimate the depth value of the intersection point on the horizontal and vertical EPIs. Specifically, we present a new feature-extraction module, called Oriented Relation Module (ORM), that constructs the relationship between the line orientations. To facilitate training, we also propose a refocusing-based data augmentation method to obtain different slopes from EPIs of the same scene point. Extensive experiments verify the efficacy of learning relations and show that our approach is competitive to other state-of-the-art methods. The code and the trained models are available at https://github.com/lkyahpu/EPI_ORM.git.

cs.CV↗

Do Not Disturb Me: Person Re-identification Under the Interference of Other Pedestrians

In the conventional person Re-ID setting, it is widely assumed that cropped person images are for each individual. However, in a crowded scene, off-shelf-detectors may generate bounding boxes involving multiple people, where the large proportion of background pedestrians or human occlusion exists. The representation extracted from such cropped images, which contain both the target and the interference pedestrians, might include distractive information. This will lead to wrong retrieval results. To address this problem, this paper presents a novel deep network termed Pedestrian-Interference Suppression Network (PISNet). PISNet leverages a Query-Guided Attention Block (QGAB) to enhance the feature of the target in the gallery, under the guidance of the query. Furthermore, the involving Guidance Reversed Attention Module and the Multi-Person Separation Loss promote QGAB to suppress the interference of other pedestrians. Our method is evaluated on two new pedestrian-interference datasets and the results show that the proposed method performs favorably against existing Re-ID methods.

cs.CV↗

TextureWGAN: Texture Preserving WGAN with MLE Regularizer for Inverse Problems

Many algorithms and methods have been proposed for inverse problems particularly with the recent surge of interest in machine learning and deep learning methods. Among all proposed methods, the most popular and effective method is the convolutional neural network (CNN) with mean square error (MSE). This method has been proven effective in super-resolution, image de-noising, and image reconstruction. However, this method is known to over-smooth images due to the nature of MSE. MSE based methods minimize Euclidean distance for all pixels between a baseline image and a generated image by CNN and ignore the spatial information of the pixels such as image texture. In this paper, we proposed a new method based on Wasserstein GAN (WGAN) for inverse problems. We showed that the WGAN-based method was effective to preserve image texture. It also used a maximum likelihood estimation (MLE) regularizer to preserve pixel fidelity. Maintaining image texture and pixel fidelity is the most important requirement for medical imaging. We used Peak Signal to Noise Ratio (PSNR) and Structure Similarity (SSIM) to evaluate the proposed method quantitatively. We also conducted first-order and second-order statistical image texture analysis to assess image texture.

eess.IV↗

Metallic Microswimmers Driven up the Wall by Gravity

As a natural and functional behavior, various microorganisms exhibit gravitaxis by orienting and swimming upwards against gravity. Swimming autophoretic nanomotors described herein, comprising bimetallic nanorods, preferentially orient upwards and swim up along a wall, when tail-heavy (i.e. when the density of one of the metals is larger than the other). Through experiment and theory, two mechanisms were identified that contribute to this gravitactic behavior. First, a buoyancy or gravitational torque acts on these rods to align them upwards. Second, hydrodynamic interactions of the rod with the inclined wall induce a fore-aft drag asymmetry on the rods that reinforces their orientation bias and promotes their upward motion.

cond-mat.soft↗

Flow Field Reconstructions with GANs based on Radial Basis Functions

Nonlinear sparse data regression and generation have been a long-term challenge, to cite the flow field reconstruction as a typical example. The huge computational cost of computational fluid dynamics (CFD) makes it much expensive for large scale CFD data producing, which is the reason why we need some cheaper ways to do this, of which the traditional reduced order models (ROMs) were promising but they couldn't generate a large number of full domain flow field data (FFD) to realize high-precision flow field reconstructions. Motivated by the problems of existing approaches and inspired by the success of the generative adversarial networks (GANs) in the field of computer vision, we prove an optimal discriminator theorem that the optimal discriminator of a GAN is a radial basis function neural network (RBFNN) while dealing with nonlinear sparse FFD regression and generation. Based on this theorem, two radial basis function-based GANs (RBF-GAN and RBFC-GAN), for regression and generation purposes, are proposed. Three different datasets are applied to verify the feasibility of our models. The results show that the performance of the RBF-GAN and the RBFC-GAN are better than that of GANs/cGANs by means of both the mean square error (MSE) and the mean square percentage error (MSPE). Besides, compared with GANs/cGANs, the stability of the RBF-GAN and the RBFC-GAN improve by 34.62% and 72.31%, respectively. Consequently, our proposed models can be used to generate full domain FFD from limited and sparse datasets, to meet the requirement of high-precision flow field reconstructions.

eess.SP↗

Data-driven Computational Social Science: A Survey

Social science concerns issues on individuals, relationships, and the whole society. The complexity of research topics in social science makes it the amalgamation of multiple disciplines, such as economics, political science, and sociology, etc. For centuries, scientists have conducted many studies to understand the mechanisms of the society. However, due to the limitations of traditional research methods, there exist many critical social issues to be explored. To solve those issues, computational social science emerges due to the rapid advancements of computation technologies and the profound studies on social science. With the aids of the advanced research techniques, various kinds of data from diverse areas can be acquired nowadays, and they can help us look into social problems with a new eye. As a result, utilizing various data to reveal issues derived from computational social science area has attracted more and more attentions. In this paper, to the best of our knowledge, we present a survey on data-driven computational social science for the first time which primarily focuses on reviewing application domains involving human dynamics. The state-of-the-art research on human dynamics is reviewed from three aspects: individuals, relationships, and collectives. Specifically, the research methodologies used to address research challenges in aforementioned application domains are summarized. In addition, some important open challenges with respect to both emerging research topics and research methods are discussed.

cs.SI↗

Robust Ego and Object 6-DoF Motion Estimation and Tracking

The problem of tracking self-motion as well as motion of objects in the scene using information from a camera is known as multi-body visual odometry and is a challenging task. This paper proposes a robust solution to achieve accurate estimation and consistent track-ability for dynamic multi-body visual odometry. A compact and effective framework is proposed leveraging recent advances in semantic instance-level segmentation and accurate optical flow estimation. A novel formulation, jointly optimizing SE(3) motion and optical flow is introduced that improves the quality of the tracked points and the motion estimation accuracy. The proposed approach is evaluated on the virtual KITTI Dataset and tested on the real KITTI Dataset, demonstrating its applicability to autonomous driving applications. For the benefit of the community, we make the source code public.

cs.RO↗

Black Hole Gravitational Waves in the Effective Field Theory of Gravity

We investigate the propagation of gravitational waves on a black hole background within the low energy effective field theory of gravity, where effects from heavy fields are captured by higher dimensional curvature operators. Depending on the spin of the particles integrated out, the speed of gravitational waves at low energy can be either superluminal or subluminal as compared to the causal structure observed by other species. Interestingly however, gravitational waves are always exactly luminal at the black hole horizon, implying that the horizon is identically defined for all species. We further compute the corrections on quasinormal frequencies caused by the higher dimensional curvature operators and highlight the corrections arising from the low energy effective field.

hep-th↗

Rational points on complete symmetric hypersurfaces over finite fields

For any affine hypersurface defined by a complete symmetric polynomial in $k\geq 3$ variables of degree $m$ over the finite field $\mathbb{F}_{q}$ of $q$ elements, a special case of our theorem says that this hypersurface has at least $6q^{k-3}$ rational points over $\mathbb{F}_{q}$ if $1\leq m \leq q-3$ and $q$ is odd. A key ingredient in our proof is Segre's classical theorem on ovals in finite projective planes.

math.NT↗

Complete Dictionary Learning via $\ell_p$-norm Maximization

Dictionary learning is a classic representation learning method that has been widely applied in signal processing and data analytics. In this paper, we investigate a family of $\ell_p$-norm ($p>2,p \in \mathbb{N}$) maximization approaches for the complete dictionary learning problem from theoretical and algorithmic aspects. Specifically, we prove that the global maximizers of these formulations are very close to the true dictionary with high probability, even when Gaussian noise is present. Based on the generalized power method (GPM), an efficient algorithm is then developed for the $\ell_p$-based formulations. We further show the efficacy of the developed algorithm: for the population GPM algorithm over the sphere constraint, it first quickly enters the neighborhood of a global maximizer, and then converges linearly in this region. Extensive experiments will demonstrate that the $\ell_p$-based approaches enjoy a higher computational efficiency and better robustness than conventional approaches and $p=3$ performs the best.

cs.LG↗

InGaAs/InP single-photon detectors with 60% detection efficiency at 1550 nm

InGaAs/InP single-photon detectors (SPDs) are widely used for near-infrared photon counting in practical applications. Photon detection efficiency (PDE) is one of the most important parameters for SPD characterization, and therefore increasing PDE consistently plays a central role in both industrial development and academic research. Here we present the implementation of high-frequency gating InGaAs/InP SPD with a PDE as high as 60% at 1550 nm. On one hand, we optimize the structure design and device fabrication of InGaAs/InP single-photon avalanche diode with an additional dielectric-metal reflection layer to relatively increase the absorption efficiency of incident photons by ~ 20%. On the other hand, we develop a monolithic readout circuit of weak avalanche extraction to minimize the parasitic capacitance for the suppression of the afterpulsing effect. With 1.25 GHz sine wave gating and optimized gate amplitude and operation temperature, the SPD is characterized to reach a PDE of 60% with a dark count rate (DCR) of 340 kcps. For practical use, given 3 kcps DCR as a reference the PDE reaches ~ 40% PDE with an afterpulse probability of 5.5%, which can significantly improve the performance for the near-infrared SPD based applications.

physics.app-ph↗

Measuring the integrated Sachs-Wolfe effect from the low-density regions of the universe

The integrated Sachs-Wolfe (ISW) effect is caused by the decay of cosmological gravitational potential, and is therefore a unique probe of dark energy. However, its robust detection is still problematic. Various tensions between different data sets, different large scale structure (LSS) tracers, and between data and the $Λ$CDM theory prediction, exist. We propose a novel method of ISW measurement by cross correlating CMB and the LSS traced by "low-density-position" (LDP, \citet{2019ApJ...874....7D}). It isolates the ISW effect generated by low-density regions of the universe, but insensitive to selection effects associated with voids. We apply it to the DR8 galaxy catalogue of the DESI Legacy imaging surveys, and obtain the LDPs at $z\leq 0.6$ over $\sim$ 20000 $deg^2$ sky coverage. We then cross correlate with the Planck temperature map, and detect the ISW effect at $3.2σ$. We further compare the measurement with numerical simulations of the concordance $Λ$CDM cosmology, and find the ISW amplitude parameter $A_{ISW}=1.14\pm0.38$ when we adopt a LDP definition radius $R_s=3^{'}$, fully consistent with the prediction of the standard $Λ$CDM cosmology ($A_{ISW}=1$). This agreement with $Λ$CDM cosmology holds for all the galaxy samples and $R_s$ that we have investigated. Furthermore, the S/N is comparable to that of galaxy ISW measurement. These results demonstrate the LDP method as a competitive alternative to existing ISW measurement methods, and provide independent checks to existing tensions.

astro-ph.CO↗

Coronal Mini-jets in an Activated Solar Tornado-like Prominence

High-resolution observations from the $Interface~Region~Imaging~Spectrometer$ ($IRIS$) reveal the existence of a particular type of small solar jets, which arose singly or in clusters from a tornado-like prominence suspended in the corona. In this study, we perform a detailed statistical analysis of 43 selected mini-jets in the tornado event. Our results show that the mini-jets typically have: (1) a projected length of 1.0-6.0 Mm, (2) a width of 0.2-1.0 Mm, (3) a lifetime of 10-50 s, (4) a velocity of 100-350 km s$^{-1}$, and (5) an acceleration of 3-20 km s$^{-2}$. Based on spectral diagnostics and EM-Loci analysis, these jets seem to be multi-thermal small-scale plasma ejections with an estimated average electron density of $\sim$2.4 $\times$ 10$^{10}$ cm$^{-3}$ and an approximate mean temperature of $\sim$2.6 $\times$ 10$^{5}$ K. Their mean kinetic energy density, thermal energy density and dissipated magnetic field strength are roughly estimated to be $\sim$9 erg cm$^{-3}$, 3 erg cm$^{-3}$, and 16 G, respectively. The accelerations of the mini-jets, the UV and EUV brightenings at the footpoints of some mini-jets, and the activation of the host prominence suggest that the tornado mini-jets are probably created by fine-scale external or internal magnetic reconnections (a) between the prominence field and the enveloping or background field or (b) between twisted or braided flux tubes within the prominence. The observations provide insight into the geometry of such reconnection events in the corona and have implications for the structure of the prominence magnetic field and the instability that is responsible for the eruption of prominences and coronal mass ejections.

astro-ph.SR↗

GATCluster: Self-Supervised Gaussian-Attention Network for Image Clustering

We propose a self-supervised Gaussian ATtention network for image Clustering (GATCluster). Rather than extracting intermediate features first and then performing the traditional clustering algorithm, GATCluster directly outputs semantic cluster labels without further post-processing. Theoretically, we give a Label Feature Theorem to guarantee the learned features are one-hot encoded vectors, and the trivial solutions are avoided. To train the GATCluster in a completely unsupervised manner, we design four self-learning tasks with the constraints of transformation invariance, separability maximization, entropy analysis, and attention mapping. Specifically, the transformation invariance and separability maximization tasks learn the relationships between sample pairs. The entropy analysis task aims to avoid trivial solutions. To capture the object-oriented semantics, we design a self-supervised attention mechanism that includes a parameterized attention module and a soft-attention loss. All the guiding signals for clustering are self-generated during the training process. Moreover, we develop a two-step learning algorithm that is memory-efficient for clustering large-size images. Extensive experiments demonstrate the superiority of our proposed method in comparison with the state-of-the-art image clustering benchmarks. Our code has been made publicly available at https://github.com/niuchuangnn/GATCluster.

cs.CV↗

BottleNet++: An End-to-End Approach for Feature Compression in Device-Edge Co-Inference Systems

The emergence of various intelligent mobile applications demands the deployment of powerful deep learning models at resource-constrained mobile devices. The device-edge co-inference framework provides a promising solution by splitting a neural network at a mobile device and an edge computing server. In order to balance the on-device computation and the communication overhead, the splitting point needs to be carefully picked, while the intermediate feature needs to be compressed before transmission. Existing studies decoupled the design of model splitting, feature compression, and communication, which may lead to excessive resource consumption of the mobile device. In this paper, we introduce an end-to-end architecture, named BottleNet++, that consists of an encoder, a non-trainable channel layer, and a decoder for more efficient feature compression and transmission. The encoder and decoder essentially implement joint source-channel coding via convolutional neural networks (CNNs), while explicitly considering the effect of channel noise. By exploiting the strong sparsity and the fault-tolerant property of the intermediate feature in a deep neural network (DNN), BottleNet++ achieves a much higher compression ratio than existing methods. Furthermore, by providing the channel condition to the encoder as an input, our method enjoys a strong generalization ability in different channel conditions. Compared with merely transmitting intermediate data without feature compression, BottleNet++ achieves up to 64x bandwidth reduction over the additive white Gaussian noise channel and up to 256x bit compression ratio in the binary erasure channel, with less than 2% reduction in accuracy. With a higher compression ratio, BottleNet++ enables splitting a DNN at earlier layers, which leads to up to 3x reduction in on-device computation compared with other compression methods.

cs.LG↗

A Non-uniform Time-stepping Convex Splitting Scheme for the Time-fractional Cahn-Hilliard Equation

In this paper, a non-uniform time-stepping convex-splitting numerical algorithm for solving the widely used time-fractional Cahn-Hilliard equation is introduced. The proposed numerical scheme employs the $L1^+$ formula for discretizing the time-fractional derivative and a second-order convex-splitting technique to deal with the non-linear term semi-implicitly. Then the pseudospectral method is utilized for spatial discretization. As a result, the fully discrete scheme has several advantages: second-order accurate in time, spectrally accurate in space, uniquely solvable, mass preserving, and unconditionally energy stable. Rigorous proofs are given, along with several numerical results to verify the theoretical results, and to show the accuracy and effectiveness of the proposed scheme. Also, some interesting phase separation dynamics of the time-fractional Cahn-Hilliard equation has been investigated.

math.NA↗

Accelerating Physics-Informed Neural Network Training with Prior Dictionaries

Physics-Informed Neural Networks (PINNs) can be regarded as general-purpose PDE solvers, but it might be slow to train PINNs on particular problems, and there is no theoretical guarantee of corresponding error bounds. In this manuscript, we propose a variant called Prior Dictionary based Physics-Informed Neural Networks (PD-PINNs). Equipped with task-dependent dictionaries, PD-PINNs enjoy enhanced representation power on the tasks, which helps to capture features provided by dictionaries so that the proposed neural networks can achieve faster convergence in the process of training. In various numerical simulations, compared with existing PINN methods, combining prior dictionaries can significantly enhance convergence speed. In terms of theory, we obtain the error bounds applicable to PINNs and PD-PINNs for solving elliptic partial differential equations of second order. It is proved that under certain mild conditions, the prediction error made by neural networks can be bounded by expected loss of PDEs and boundary conditions.

cs.LG↗

A Note on Self-Dual Generalized Reed-Solomon Codes

A linear code is called an MDS self-dual code if it is both an MDS code and a self-dual code with respect to the Euclidean inner product. The parameters of such codes are completely determined by the code length. In this paper, we consider new constructions of MDS self-dual codes via generalized Reed-Solomon (GRS) codes and their extended codes. The critical idea of our constructions is to choose suitable evaluation points such that the corresponding (extended) GRS codes are self-dual. The evaluation set of our constructions is consists of a subgroup of finite fields and its cosets in a bigger subgroup. Four new families of MDS self-dual codes are obtained and they have better parameters than previous results in certain region. Moreover, by the Mobius action over finite fields, we give a systematic way to construct self-dual GRS codes with different evaluation points provided any known self-dual GRS codes. Specially, we prove that all the self-dual extended GRS codes over $\mathbb{F}_{q}$ with length $n< q+1$ can be constructed from GRS codes with the same parameters.

cs.IT↗