Searcharxiv⌕ Search

arXiv subjects

Peng Wang

Publications and source records attributed to Peng Wang.

At least 595 records · Page 33Linked to original sources

Unraveling Intertwined Impacts between Lattice Vacancy and Substrate on Photonic Quasiparticles in Monolayer MoS$_2$

Lattice defects and interfacial absorbates represent two extrinsic but ubiquitous factors that exert profound impacts on the luminescent properties of semiconductors. However, their impacts are normally tangled and remain to be separately elucidated. Here, we clarify the individual roles of each factor by tracking the weight evolution of photonic quasiparticles by modulating the densities of sulfur vacancies in monolayer MoS$_2$ via ad hoc defect engineering. In particular, we perform atomistic analyses on the densities of sulfur vacancies by employing atomically resolved scanning transmission electron microscopy to quantitatively characterize the generation rates of sulfur vacancies in MoS$_2$ on two types of substrates with opposite surface hydrophobicity natures. We reveal that the generation rate of sulfur vacancies can even double on the hydrophilic substrates. More importantly, the impact of sulfur vacancies over the weight of trionic emission is closely associated with the substrate hydrophobicity, which is manifested noticeably in the hydrophobic substrates, but insignificant in the hydrophilic ones. The results represent an in-depth understanding on the roles of the extrinsic factors on the luminescent properties in atomically thin semiconductors.

cond-mat.mtrl-sci↗

Noninvasive Photodelamination of van der Waals Semiconductors for High-Performance Electronics

Atomically thin two-dimensional (2D) van der Waals semiconductors are promising candidate materials for post-silicon electronics. However, it remains challenging to attain completely uniform monolayer semiconductor wafers free of over-grown islands. Here, we report the observation of the energy funneling effect and ambient photodelamination phenomenon in inhomogeneous few-layer WS$_2$ flakes under low illumination fluencies down to several nW/$μ$m$^{2}$ and its potential as a non-invasive post-etching strategy for selectively stripping the local excessive overlying islands. Photoluminescent tracking on the photoetching traces reveals relatively fast etching rates around $0.3-0.8\,μ$m/min at varied temperatures and an activation energy of $1.7\,$eV. By using crystallographic and electronic characterization, we also confirm the non-invasive nature of the low-power photodelamination and the highly preserved lattice quality in the as-etched monolayer products, featuring a comparable average density of atomic defects (ca.$4.2\times 10^{13}\,$cm$^{-2}$) to pristine flakes and a high electron mobility up to $80\,$cm$^{2}\cdot$V$^{-1}\cdot$s$^{-1}$) at room temperature. This approach opens a non-invasive photoetching route for thickness uniformity management in 2D van der Waals semiconductor wafers for electronic applications.

cond-mat.mtrl-sci↗

Learning Conditional Attributes for Compositional Zero-Shot Learning

Compositional Zero-Shot Learning (CZSL) aims to train models to recognize novel compositional concepts based on learned concepts such as attribute-object combinations. One of the challenges is to model attributes interacted with different objects, e.g., the attribute ``wet" in ``wet apple" and ``wet cat" is different. As a solution, we provide analysis and argue that attributes are conditioned on the recognized object and input image and explore learning conditional attribute embeddings by a proposed attribute learning framework containing an attribute hyper learner and an attribute base learner. By encoding conditional attributes, our model enables to generate flexible attribute embeddings for generalization from seen to unseen compositions. Experiments on CZSL benchmarks, including the more challenging C-GQA dataset, demonstrate better performances compared with other state-of-the-art approaches and validate the importance of learning conditional attributes. Code is available at https://github.com/wqshmzh/CANet-CZSL

cs.CV↗

4D-Explorer: A visual software for 4D-STEM data processing and image reconstruction

With the development of high-speed electron detectors, four-dimensional scanning transmission electron microscopy (4D-STEM) has emerged as a powerful tool for characterizing microstructures in material science and life science. However, the complexity of 4D-STEM data processing necessitates an intuitive graphical user interface software for researchers. In this regard, we have developed 4D-Explorer, an open-source, lightweight and extensible software for processing 4D-STEM data. It offers a visual and interactive workflow, including data preparation, calibration, image reconstruction and generating quantitative results. Furthermore, during calibration, our software includes a novel algorithm for rotational offset correction that uses a defocused 4D-STEM dataset and its axial bright field image, which has lower experimental requirements than conventional methods. We anticipate that 4D-Explorer will help researchers harness the capabilities of 4D-STEM technology.

physics.ins-det↗

A Dynamic Feature Interaction Framework for Multi-task Visual Perception

Multi-task visual perception has a wide range of applications in scene understanding such as autonomous driving. In this work, we devise an efficient unified framework to solve multiple common perception tasks, including instance segmentation, semantic segmentation, monocular 3D detection, and depth estimation. Simply sharing the same visual feature representations for these tasks impairs the performance of tasks, while independent task-specific feature extractors lead to parameter redundancy and latency. Thus, we design two feature-merge branches to learn feature basis, which can be useful to, and thus shared by, multiple perception tasks. Then, each task takes the corresponding feature basis as the input of the prediction task head to fulfill a specific task. In particular, one feature merge branch is designed for instance-level recognition the other for dense predictions. To enhance inter-branch communication, the instance branch passes pixel-wise spatial information of each instance to the dense branch using efficient dynamic convolution weighting. Moreover, a simple but effective dynamic routing mechanism is proposed to isolate task-specific features and leverage common properties among tasks. Our proposed framework, termed D2BNet, demonstrates a unique approach to parameter-efficient predictions for multi-task perception. In addition, as tasks benefit from co-training with each other, our solution achieves on par results on partially labeled settings on nuScenes and outperforms previous works for 3D detection and depth estimation on the Cityscapes dataset with full supervision.

cs.CV↗

The Law of Parsimony in Gradient Descent for Learning Deep Linear Networks

Over the past few years, an extensively studied phenomenon in training deep networks is the implicit bias of gradient descent towards parsimonious solutions. In this work, we investigate this phenomenon by narrowing our focus to deep linear networks. Through our analysis, we reveal a surprising "law of parsimony" in the learning dynamics when the data possesses low-dimensional structures. Specifically, we show that the evolution of gradient descent starting from orthogonal initialization only affects a minimal portion of singular vector spaces across all weight matrices. In other words, the learning process happens only within a small invariant subspace of each weight matrix, despite the fact that all weight parameters are updated throughout training. This simplicity in learning dynamics could have significant implications for both efficient training and a better understanding of deep networks. First, the analysis enables us to considerably improve training efficiency by taking advantage of the low-dimensional structure in learning dynamics. We can construct smaller, equivalent deep linear networks without sacrificing the benefits associated with the wider counterparts. Second, it allows us to better understand deep representation learning by elucidating the linear progressive separation and concentration of representations from shallow to deep layers. We also conduct numerical experiments to support our theoretical results. The code for our experiments can be found at https://github.com/cjyaras/lawofparsimony.

cs.LG↗

Continuous and Noninvasive Measurement of Arterial Pulse Pressure and Pressure Waveform using an Image-free Ultrasound System

The local beat-to-beat local pulse pressure (PP) and blood pressure waveform of arteries, especially central arteries, are important indicators of the course of cardiovascular diseases (CVDs). Nevertheless, noninvasive measurement of them remains a challenge in the clinic. This work presents a three-element image-free ultrasound system with a low-computational method for real-time measurement of local pulse wave velocity (PWV) and diameter waveforms, enabling real-time and noninvasive continuous PP and blood pressure waveforms measurement without calibration. The developed system has been well-validated in vitro and in vivo. In in vitro cardiovascular phantom experiments, the results demonstrated high accuracy in the measurement of PP (error < 3 mmHg) and blood pressure waveform (root-mean-square-errors (RMSE) < 2 mmHg, correlation coefficient (r) > textgreater 0.99). In subsequent human carotid experiments, the system was compared with an arterial tonometer, which showed excellent PP accuracy (mean absolute error (MAE) = 3.7 +- 3.4 mmHg) and pressure waveform similarity (RMSE = 3.7 +- 1.6 mmHg, r = 0.98 +- 0.01). Furthermore, comparative experiments with the volume clamp device demonstrated the system's ability to accurately trace blood pressure changes (induced by deep breathing) over a period of one minute, with the MAE of DBP, MAP, and SBP within 5 +- 8 mmHg. The present results demonstrate the accuracy and reliability of the developed system for continuous and noninvasive measurement of arterial PP and blood pressure waveform measurements, with potential applications in the diagnosis and prevention of CVDs.

eess.SP↗

NeRO: Neural Geometry and BRDF Reconstruction of Reflective Objects from Multiview Images

We present a neural rendering-based method called NeRO for reconstructing the geometry and the BRDF of reflective objects from multiview images captured in an unknown environment. Multiview reconstruction of reflective objects is extremely challenging because specular reflections are view-dependent and thus violate the multiview consistency, which is the cornerstone for most multiview reconstruction methods. Recent neural rendering techniques can model the interaction between environment lights and the object surfaces to fit the view-dependent reflections, thus making it possible to reconstruct reflective objects from multiview images. However, accurately modeling environment lights in the neural rendering is intractable, especially when the geometry is unknown. Most existing neural rendering methods, which can model environment lights, only consider direct lights and rely on object masks to reconstruct objects with weak specular reflections. Therefore, these methods fail to reconstruct reflective objects, especially when the object mask is not available and the object is illuminated by indirect lights. We propose a two-step approach to tackle this problem. First, by applying the split-sum approximation and the integrated directional encoding to approximate the shading effects of both direct and indirect lights, we are able to accurately reconstruct the geometry of reflective objects without any object masks. Then, with the object geometry fixed, we use more accurate sampling to recover the environment lights and the BRDF of the object. Extensive experiments demonstrate that our method is capable of accurately reconstructing the geometry and the BRDF of reflective objects from only posed RGB images without knowing the environment lights and the object masks. Codes and datasets are available at https://github.com/liuyuan-pal/NeRO.

cs.CV↗

Gravitational Lensing by Born-Infeld Naked Singularities

We examine the gravitational lensing phenomenon caused by photon spheres in the Born-Infeld naked singularity spacetime, where gravity is coupled with Born-Infeld electrodynamics. Specifically, our focus lies on relativistic images originating from a point-like light source generated by strong gravitational lensing near photon spheres, as well as images of a luminous celestial sphere. It shows that Born-Infeld naked singularities consistently exhibit one or two photon spheres, which project onto one or two critical curves on the image plane. Interestingly, we discover that the nonlinearity nature of the Born-Infeld electrodynamics enables photons to traverse the singularity, leading to the emergence of new relativistic images within the innermost critical curve. Furthermore, the presence of two photon spheres doubles the number of relativistic images compared to the scenario with only a single photon sphere. Additionally, the transparency inherent to Born-Infeld naked singularities results in the absence of a central shadow in the images of celestial spheres.

gr-qc↗

A New Comprehensive Benchmark for Semi-supervised Video Anomaly Detection and Anticipation

Semi-supervised video anomaly detection (VAD) is a critical task in the intelligent surveillance system. However, an essential type of anomaly in VAD named scene-dependent anomaly has not received the attention of researchers. Moreover, there is no research investigating anomaly anticipation, a more significant task for preventing the occurrence of anomalous events. To this end, we propose a new comprehensive dataset, NWPU Campus, containing 43 scenes, 28 classes of abnormal events, and 16 hours of videos. At present, it is the largest semi-supervised VAD dataset with the largest number of scenes and classes of anomalies, the longest duration, and the only one considering the scene-dependent anomaly. Meanwhile, it is also the first dataset proposed for video anomaly anticipation. We further propose a novel model capable of detecting and anticipating anomalous events simultaneously. Compared with 7 outstanding VAD algorithms in recent years, our method can cope with scene-dependent anomaly detection and anomaly anticipation both well, achieving state-of-the-art performance on ShanghaiTech, CUHK Avenue, IITB Corridor and the newly proposed NWPU Campus datasets consistently. Our dataset and code is available at: https://campusvad.github.io.

cs.CV↗

ONE-PEACE: Exploring One General Representation Model Toward Unlimited Modalities

In this work, we explore a scalable way for building a general representation model toward unlimited modalities. We release ONE-PEACE, a highly extensible model with 4B parameters that can seamlessly align and integrate representations across vision, audio, and language modalities. The architecture of ONE-PEACE comprises modality adapters, shared self-attention layers, and modality FFNs. This design allows for the easy extension of new modalities by adding adapters and FFNs, while also enabling multi-modal fusion through self-attention layers. To pretrain ONE-PEACE, we develop two modality-agnostic pretraining tasks, cross-modal aligning contrast and intra-modal denoising contrast, which align the semantic space of different modalities and capture fine-grained details within modalities concurrently. With the scaling-friendly architecture and pretraining tasks, ONE-PEACE has the potential to expand to unlimited modalities. Without using any vision or language pretrained model for initialization, ONE-PEACE achieves leading results on a wide range of uni-modal and multi-modal tasks, including image classification (ImageNet), semantic segmentation (ADE20K), audio-text retrieval (AudioCaps, Clotho), audio classification (ESC-50, FSD50K, VGGSound), audio question answering (AVQA), image-text retrieval (MSCOCO, Flickr30K), and visual grounding (RefCOCO/+/g). Code is available at https://github.com/OFA-Sys/ONE-PEACE.

cs.CV↗

MALM: Mask Augmentation based Local Matching for Food-Recipe Retrieval

Image-to-recipe retrieval is a challenging vision-to-language task of significant practical value. The main challenge of the task lies in the ultra-high redundancy in the long recipe and the large variation reflected in both food item combination and food item appearance. A de-facto idea to address this task is to learn a shared feature embedding space in which a food image is aligned better to its paired recipe than other recipes. However, such supervised global matching is prone to supervision collapse, i.e., only partial information that is necessary for distinguishing training pairs can be identified, while other information that is potentially useful in generalization could be lost. To mitigate such a problem, we propose a mask-augmentation-based local matching network (MALM), where an image-text matching module and a masked self-distillation module benefit each other mutually to learn generalizable cross-modality representations. On one hand, we perform local matching between the tokenized representations of image and text to locate fine-grained cross-modality correspondence explicitly. We involve representations of masked image patches in this process to alleviate overfitting resulting from local matching especially when some food items are underrepresented. On the other hand, predicting the hidden representations of the masked patches through self-distillation helps to learn general-purpose image representations that are expected to generalize better. And the multi-task nature of the model enables the representations of masked patches to be text-aware and thus facilitates the lost information reconstruction. Experimental results on Recipe1M dataset show our method can clearly outperform state-of-the-art (SOTA) methods. Our code will be available at https://github.com/MyFoodChoice/MALM_Mask_Augmentation_based_Local_Matching-_for-_Food_Recipe_Retrieval

cs.CV↗

Longitudinal optical conductivities of tilted Weyl fermions in arbitrary dimensionality

The unified form of longitudinal optical conductivities (LOCs) in the tilted Weyl fermions for arbitrary spatial dimensionality are analytically calculated and expressed in terms of the joint density of state. The results are valid for both undoped and doped cases, both parallel and perpendicular components, and all the tilted phases. In addition, they reproduce analytical results of previous works for one-dimensional, two-dimensional, and three-dimensional tilted Weyl systems. The robust fixed point $Γ_χ^{(\mathrm{IB})}(ω=2μ,d\ge 2;μ,0<t\le 2)=1/2$ is universal for tilted Dirac bands in arbitrary spatial dimensionality. Our work provides not only a once-for-all method prior to the one-by-one calculation of the LOCs but also offer deep insights into the impacts of dimensionality in the tilted Weyl fermions.

cond-mat.mes-hall↗

Fast Blind Recovery of Linear Block Codes over Noisy Channels

This paper addresses the blind recovery of the parity check matrix of an (n,k) linear block code over noisy channels by proposing a fast recovery scheme consisting of 3 parts. Firstly, this scheme performs initial error position detection among the received codewords and selects the desirable codewords. Then, this scheme conducts Gaussian elimination (GE) on a k-by-k full-rank matrix and uses a threshold and the reliability associated to verify the recovered dual words, aiming to improve the reliability of recovery. Finally, it performs decoding on the received codewords with partially recovered dual words. These three parts can be combined into different schemes for different noise level scenarios. The GEV that combines Gaussian elimination and verification has a significantly lower recovery failure probability and a much lower computational complexity than an existing Canteaut-Chabaud-based algorithm, which relies on GE on n-by-n full-rank matrices. The decoding-aided recovery (DAR) and error-detection-&-codeword-selection-&-decoding-aided recovery (EDCSDAR) schemes can improve the code recovery performance over GEV for high noise level scenarios, and their computational complexities remain much lower than the Canteaut-Chabaud-based algorithm.

cs.IT↗

ViewFormer: View Set Attention for Multi-view 3D Shape Understanding

This paper presents ViewFormer, a simple yet effective model for multi-view 3d shape recognition and retrieval. We systematically investigate the existing methods for aggregating multi-view information and propose a novel ``view set" perspective, which minimizes the relation assumption about the views and releases the representation flexibility. We devise an adaptive attention model to capture pairwise and higher-order correlations of the elements in the view set. The learned multi-view correlations are aggregated into an expressive view set descriptor for recognition and retrieval. Experiments show the proposed method unleashes surprising capabilities across different tasks and datasets. For instance, with only 2 attention blocks and 4.8M learnable parameters, ViewFormer reaches 98.8% recognition accuracy on ModelNet40 for the first time, exceeding previous best method by 1.1% . On the challenging RGBD dataset, our method achieves 98.4% recognition accuracy, which is a 4.1% absolute improvement over the strongest baseline. ViewFormer also sets new records in several evaluation dimensions of 3D shape retrieval defined on the SHREC'17 benchmark.

cs.CV↗

Glocal Energy-based Learning for Few-Shot Open-Set Recognition

Few-shot open-set recognition (FSOR) is a challenging task of great practical value. It aims to categorize a sample to one of the pre-defined, closed-set classes illustrated by few examples while being able to reject the sample from unknown classes. In this work, we approach the FSOR task by proposing a novel energy-based hybrid model. The model is composed of two branches, where a classification branch learns a metric to classify a sample to one of closed-set classes and the energy branch explicitly estimates the open-set probability. To achieve holistic detection of open-set samples, our model leverages both class-wise and pixel-wise features to learn a glocal energy-based score, in which a global energy score is learned using the class-wise features, while a local energy score is learned using the pixel-wise features. The model is enforced to assign large energy scores to samples that are deviated from the few-shot examples in either the class-wise features or the pixel-wise features, and to assign small energy scores otherwise. Experiments on three standard FSOR datasets show the superior performance of our model.

cs.CV↗

AirBirds: A Large-scale Challenging Dataset for Bird Strike Prevention in Real-world Airports

One fundamental limitation to the research of bird strike prevention is the lack of a large-scale dataset taken directly from real-world airports. Existing relevant datasets are either small in size or not dedicated for this purpose. To advance the research and practical solutions for bird strike prevention, in this paper, we present a large-scale challenging dataset AirBirds that consists of 118,312 time-series images, where a total of 409,967 bounding boxes of flying birds are manually, carefully annotated. The average size of all annotated instances is smaller than 10 pixels in 1920x1080 images. Images in the dataset are captured over 4 seasons of a whole year by a network of cameras deployed at a real-world airport, covering diverse bird species, lighting conditions and 13 meteorological scenarios. To the best of our knowledge, it is the first large-scale image dataset that directly collects flying birds in real-world airports for bird strike prevention. This dataset is publicly available at https://airbirdsdata.github.io/.

cs.CV↗

CoT-MoTE: Exploring ConTextual Masked Auto-Encoder Pre-training with Mixture-of-Textual-Experts for Passage Retrieval

Passage retrieval aims to retrieve relevant passages from large collections of the open-domain corpus. Contextual Masked Auto-Encoding has been proven effective in representation bottleneck pre-training of a monolithic dual-encoder for passage retrieval. Siamese or fully separated dual-encoders are often adopted as basic retrieval architecture in the pre-training and fine-tuning stages for encoding queries and passages into their latent embedding spaces. However, simply sharing or separating the parameters of the dual-encoder results in an imbalanced discrimination of the embedding spaces. In this work, we propose to pre-train Contextual Masked Auto-Encoder with Mixture-of-Textual-Experts (CoT-MoTE). Specifically, we incorporate textual-specific experts for individually encoding the distinct properties of queries and passages. Meanwhile, a shared self-attention layer is still kept for unified attention modeling. Results on large-scale passage retrieval benchmarks show steady improvement in retrieval performances. The quantitive analysis also shows a more balanced discrimination of the latent embedding spaces.

cs.CL↗