arXiv subjects

Zhenhua Wang

Publications and source records attributed to Zhenhua Wang.

At least 73 records · Page 4Linked to original sources

arXiv2020

Refined operator inequalities for relative operator entropies

In this paper, we investigate the relative operator entropies in the more general settings of C*-algebras, real C*-algebras and JC-algebras. We show that all the operator inequalities on relative operator entropies still hold in these broader settings. In addition, we improve the lower and upper bounds of the relative operator $(α, β)$-entropy established by Nikoufar which refined the bounds for the relative operator entropy obtained by Fujii and Kamei.

math.OA↗

arXiv2020

Graph Attention Tracking

Siamese network based trackers formulate the visual tracking task as a similarity matching problem. Almost all popular Siamese trackers realize the similarity learning via convolutional feature cross-correlation between a target branch and a search branch. However, since the size of target feature region needs to be pre-fixed, these cross-correlation base methods suffer from either reserving much adverse background information or missing a great deal of foreground information. Moreover, the global matching between the target and search region also largely neglects the target structure and part-level information. In this paper, to solve the above issues, we propose a simple target-aware Siamese graph attention network for general object tracking. We propose to establish part-to-part correspondence between the target and the search region with a complete bipartite graph, and apply the graph attention mechanism to propagate target information from the template feature to the search feature. Further, instead of using the pre-fixed region cropping for template-feature-area selection, we investigate a target-aware area selection mechanism to fit the size and aspect ratio variations of different objects. Experiments on challenging benchmarks including GOT-10k, UAV123, OTB-100 and LaSOT demonstrate that the proposed SiamGAT outperforms many state-of-the-art trackers and achieves leading performance. Code is available at: https://git.io/SiamGAT

cs.CV↗

arXiv2019

SiamCAR: Siamese Fully Convolutional Classification and Regression for Visual Tracking

By decomposing the visual tracking task into two subproblems as classification for pixel category and regression for object bounding box at this pixel, we propose a novel fully convolutional Siamese network to solve visual tracking end-to-end in a per-pixel manner. The proposed framework SiamCAR consists of two simple subnetworks: one Siamese subnetwork for feature extraction and one classification-regression subnetwork for bounding box prediction. Our framework takes ResNet-50 as backbone. Different from state-of-the-art trackers like Siamese-RPN, SiamRPN++ and SPM, which are based on region proposal, the proposed framework is both proposal and anchor free. Consequently, we are able to avoid the tricky hyper-parameter tuning of anchors and reduce human intervention. The proposed framework is simple, neat and effective. Extensive experiments and comparisons with state-of-the-art trackers are conducted on many challenging benchmarks like GOT-10K, LaSOT, UAV123 and OTB-50. Without bells and whistles, our SiamCAR achieves the leading performance with a considerable real-time speed.

cs.CV↗

arXiv2019

Extreme nonlinear Raman interaction of an ultrashort nitrogen ion laser with an impulsively excited molecular wavepacket

We report generation of cascaded rotational Raman scattering up to 58th orders in coherently excited CO_2 molecules. The high-order Raman scattering, which produces a quasiperiodic frequency comb with more than 600 sidebands, is obtained using an intense femtosecond laser to impulsively excite rotational coherence and the femtosecond-laser-induced N_2^+ lasing to generate cascaded Raman signals. The novel configuration allows this experiment to be performed with a single femtosecond laser beam at free-space standoff locations. It is revealed that the efficient spectral extension of Raman signals is attributed to the specific spectra-temporal structures of N_2^+ lasing, the ideal spatial overlap of femtosecond laser and N2+ lasing, and the guiding effect of molecular alignment. The Raman spectrum extending above 2000 cm^-1 naturally corresponds to a femtosecond pulse train due to the periodic revivals of molecular rotational wavepackets.

physics.optics↗

arXiv2019

Freeform microfluidic networks encapsulated in laser printed three-dimensional macro-scale glass objects

Large-scale microfluidic microsystems with complex three-dimensional (3D) configurations are highly in demand by both fundamental research and industrial application, holding the potentials for fostering a wide range of innovative applications such as lab-on-a-chip and organ-on-a-chip as well as continuous-flow manufacturing of fine chemicals. However, freeform fabrication of such systems remains challenging for most of the current fabrication techniques in terms of fabrication resolution, flexibility, and achievable footprint size. Here, we report ultrashort pulse laser microfabrication of freeform microfluidic circuits with high aspect ratios and tunable diameters embedded in 3D printed glass objects. We achieve uniform microfluidic channel diameter by carefully distributing a string of extra access ports along the microfluidic channels for avoiding the over-etching in the thin microfluidic channels. After the chemical etching is completed, the extra access ports are sealed using carbon dioxide laser induced localized glass melting. We demonstrate a model hand of fused silica with a size of ~3 cm * 2.7 cm * 1.1 cm in which the whole blood vessel system is encapsulated.

physics.app-ph↗

arXiv2019

The coin-turning walk and its scaling limit

Let $S$ be the random walk obtained from "coin turning" with some sequence $\{p_n\}_{n\ge 1}$, as introduced in [6]. In this paper we investigate the scaling limits of $S$ in the spirit of the classical Donsker invariance principle, both for the heating and for the cooling dynamics. We prove that an invariance principle, albeit with a non-classical scaling, holds for "not too small" sequences, the order const$\cdot n^{-1}$ (critical cooling regime) being the threshold. At and below this critical order, the scaling behavior is dramatically different from the one above it. The same order is also the critical one for the Weak Law of Large Numbers to hold. In the critical cooling regime, an interesting process emerges: it is a continuous, piecewise linear, recurrent process, for which the one-dimensional marginals are Beta-distributed. We also investigate the recurrence of the walk and its scaling limit, as well as the ergodicity and mixing of the $n$th step of the walk.

math.PR↗

arXiv2019

Room temperature 2D ferromagnetism in few-layered 1$T$-CrTe$_{2}$

Spin-related electronics using two dimensional (2D) van der Waals (vdW) materials as a platform are believed to hold great promise for revolutionizing the next generation spintronics. Although many emerging new phenomena have been unravelled in 2D electronic systems with spin long-range orderings, the scarcely reported room temperature magnetic vdW material has thus far hindered the related applications. Here, we show that intrinsic ferromagnetically aligned spin polarization can hold up to 316 K in a metallic phase of 1$T$-CrTe$_{2}$ in the few-layer limit. This room temperature 2D long range spin interaction may be beneficial from an itinerant enhancement. Spin transport measurements indicate an in-plane room temperature negative anisotropic magnetoresistance (AMR) in few-layered CrTe$_{2}$, but a sign change in the AMR at lower temperature, with -0.6$\%$ at 300 K and +5$\%$ at 10 K, respectively. This behavior may originate from the specific spin polarized band structure of CrTe$_{2}$. Our findings provide insights into magnetism in few-layered CrTe$_{2}$, suggesting potential for future room temperature spintronic applications of such 2D vdW magnets.

cond-mat.mes-hall↗

arXiv2019

Involutive operator algebras

Examples of operator algebras with involution include the operator $*$-algebras occurring in noncommutative differential geometry studied recently by Mesland, Kaad, Lesch, and others, several classical function algebras, triangular matrix algebras, (complexifications) of real operator algebras, and an operator algebraic version of the {\em complex symmetric} operators studied by Garcia, Putinar, Wogen and others. We investigate the general theory of involutive operator algebras, and give many applications.

math.OA↗

arXiv2019

End-to-end feature fusion siamese network for adaptive visual tracking

According to observations, different visual objects have different salient features in different scenarios. Even for the same object, its salient shape and appearance features may change greatly from time to time in a long-term tracking task. Motivated by them, we proposed an end-to-end feature fusion framework based on Siamese network, named FF-Siam, which can effectively fuse different features for adaptive visual tracking. The framework consists of four layers. A feature extraction layer is designed to extract the different features of the target region and search region. The extracted features are then put into a weight generation layer to obtain the channel weights, which indicate the importance of different feature channels. Both features and the channel weights are utilized in a template generation layer to generate a discriminative template. Finally, the corresponding response maps created by the convolution of the search region features and the template are applied with a fusion layer to obtain the final response map for locating the target. Experimental results demonstrate that the proposed framework achieves state-of-the-art performance on the popular Temple-Color, OTB50 and UAV123 benchmarks.

cs.CV↗

arXiv2018

DCI: Discriminative and Contrast Invertible Descriptor

Local feature descriptors have been widely used in fine-grained visual object search thanks to their robustness in scale and rotation variation and cluttered background. However, the performance of such descriptors drops under severe illumination changes. In this paper, we proposed a Discriminative and Contrast Invertible (DCI) local feature descriptor. In order to increase the discriminative ability of the descriptor under illumination changes, a Laplace gradient based histogram is proposed. A robust contrast flipping estimate is proposed based on the divergence of a local region. Experiments on fine-grained object recognition and retrieval applications demonstrate the superior performance of DCI descriptor to others.

cs.CV↗

arXiv2018

Polarization-insensitive space-selective etching in fused silica induced by picosecond laser irradiation

It is well known that when the fused silica is irradiated with focused femtosecond laser beams, space selective chemical etching can be achieved. The etching rate depends sensitively on the polarization of the laser. Surprisingly, we observe that by chirping the Fourier-transform-limited femtosecond laser pulses to picosecond pulses, the polarization dependence of the etching rate disappears, whereas an efficient etching rate can still be maintained. Observation with a scanning electron microscope reveals that the chirped pulses can induce interconnected nanocracks in the irradiated areas which facilitates efficient introduction of the etchant into the microchannel. The reported technology is of great use for fabrication of three-dimensional (3D) microfluidic systems and glass-based 3D printing.

physics.optics↗

arXiv2018

Jordan operator algebras revisited

Jordan operator algebras are norm-closed spaces of operators on a Hilbert space with a^2 in A for all a in A. In two recent papers by the authors and Neal, a theory for these spaces was developed. It was shown there that much of the theory of associative operator algebras, in particularly surprisingly much of the associative theory from several recent papers of the first author and coauthors, generalizes to Jordan operator algebras. In the present paper we complete this task, giving several results which generalize the associative case in these papers, relating to unitizations, real positivity, hereditary subalgebras, and a couple of other topics. We also solve one of the three open problems stated at the end of our earlier joint paper on Jordan operator algebras.

math.OA↗

arXiv2018

ALIGNet: Partial-Shape Agnostic Alignment via Unsupervised Learning

The process of aligning a pair of shapes is a fundamental operation in computer graphics. Traditional approaches rely heavily on matching corresponding points or features to guide the alignment, a paradigm that falters when significant shape portions are missing. These techniques generally do not incorporate prior knowledge about expected shape characteristics, which can help compensate for any misleading cues left by inaccuracies exhibited in the input shapes. We present an approach based on a deep neural network, leveraging shape datasets to learn a shape-aware prior for source-to-target alignment that is robust to shape incompleteness. In the absence of ground truth alignments for supervision, we train a network on the task of shape alignment using incomplete shapes generated from full shapes for self-supervision. Our network, called ALIGNet, is trained to warp complete source shapes to incomplete targets, as if the target shapes were complete, thus essentially rendering the alignment partial-shape agnostic. We aim for the network to develop specialized expertise over the common characteristics of the shapes in each dataset, thereby achieving a higher-level understanding of the expected shape space to which a local approach would be oblivious. We constrain ALIGNet through an anisotropic total variation identity regularization to promote piecewise smooth deformation fields, facilitating both partial-shape agnosticism and post-deformation applications. We demonstrate that ALIGNet learns to align geometrically distinct shapes, and is able to infer plausible mappings even when the target shape is significantly incomplete. We show that our network learns the common expected characteristics of shape collections, without over-fitting or memorization, enabling it to produce plausible deformations on unseen data during test time.

cs.GR↗

arXiv2018

Electronic quantum coherence induced by strong field molecular ionization

The existence of electronic coherence can fundamentally change the scenario of nonlinear interaction of light with quantum systems such as atoms and molecules, which, however, has escaped from observation in the investigations of strong field nonlinear optics in the past several decades. Here, we report on the generation of electronic quantum coherence by strong field ionization of nitrogen molecules in an intense 800 nm laser field. The coherence is experimentally revealed by observing a resonant four-wave mixing process in which the two pump pulses centered at 800 nm and 1580 nm wavelengths are temporally separated from each other. The experimental observation is further reproduced by calculating the nonlinear polarization response of N_2^+ ions using a three-level quantum model. Our result suggests that strong field ionization provides a unique approach to generating a fully coherent molecular wavepacket encapsulating the rotational, vibrational, and electronic states.

physics.optics↗

arXiv2017

Jordan operator algebras: Basic theory

Jordan operator algebras are norm-closed spaces of operators on a Hilbert space which are closed under the Jordan product. The discovery of the present paper is that there exists a huge and tractable theory of possibly nonselfadjoint Jordan operator algebras; they are far more similar to associative operator algebras than was suspected. We initiate the theory of such algebras.

math.OA↗

arXiv2017

Neuron-level Selective Context Aggregation for Scene Segmentation

Contextual information provides important cues for disambiguating visually similar pixels in scene segmentation. In this paper, we introduce a neuron-level Selective Context Aggregation (SCA) module for scene segmentation, comprised of a contextual dependency predictor and a context aggregation operator. The dependency predictor is implicitly trained to infer contextual dependencies between different image regions. The context aggregation operator augments local representations with global context, which is aggregated selectively at each neuron according to its on-the-fly predicted dependencies. The proposed mechanism enables data-driven inference of contextual dependencies, and facilitates context-aware feature learning. The proposed method improves strong baselines built upon VGG16 on challenging scene segmentation datasets, which demonstrates its effectiveness in modeling context information.

cs.CV↗

arXiv2017

Recent Advances in Convolutional Neural Networks

In the last few years, deep learning has led to very good performance on a variety of problems, such as visual recognition, speech recognition and natural language processing. Among different types of deep neural networks, convolutional neural networks have been most extensively studied. Leveraging on the rapid growth in the amount of the annotated data and the great improvements in the strengths of graphics processor units, the research on convolutional neural networks has been emerged swiftly and achieved state-of-the-art results on various tasks. In this paper, we provide a broad survey of the recent advances in convolutional neural networks. We detailize the improvements of CNN on different aspects, including layer design, activation function, loss function, regularization, optimization and fast computation. Besides, we also introduce various applications of convolutional neural networks in computer vision, speech and natural language processing.

cs.CV↗

arXiv2017

Learning Fine-grained Features via a CNN Tree for Large-scale Classification

We propose a novel approach to enhance the discriminability of Convolutional Neural Networks (CNN). The key idea is to build a tree structure that could progressively learn fine-grained features to distinguish a subset of classes, by learning features only among these classes. Such features are expected to be more discriminative, compared to features learned for all the classes. We develop a new algorithm to effectively learn the tree structure from a large number of classes. Experiments on large-scale image classification tasks demonstrate that our method could boost the performance of a given basic CNN model. Our method is quite general, hence it can potentially be used in combination with many other deep learning models.

cs.CV↗