most citedYou Only Train Once: Learning a General Anomaly Enhancement Network with Random Masks for Hyperspectral Anomaly Detection

59 citations · 69 across the 5 of their papers we have counts for

collaborators

5 papers

cs.CV20231 cited

OccCasNet: Occlusion-aware Cascade Cost Volume for Light Field Depth Estimation

Wentao Chao, Fuqing Duan, Xuechun Wang +2

Light field (LF) depth estimation is a crucial task with numerous practical applications. However, mainstream methods based on the multi-view stereo (MVS) are resource-intensive an…

cs.CV20234 cited

NTIRE 2023 Challenge on Light Field Image Super-Resolution: Dataset, Methods and Results

Yingqian Wang, Longguang Wang, Zhengyu Liang +3

In this report, we summarize the first NTIRE challenge on light field (LF) image super-resolution (SR), which aims at super-resolving LF images under the standard bicubic degradati…

cs.CV20232 cited

Monte Carlo Linear Clustering with Single-Point Supervision is Enough for Infrared Small Target Detection

Boyang Li, Yingqian Wang, Longguang Wang +5

Single-frame infrared small target (SIRST) detection aims at separating small targets from clutter backgrounds on infrared images. Recently, deep learning based methods have achiev…

eess.IV202359 cited

You Only Train Once: Learning a General Anomaly Enhancement Network with Random Masks for Hyperspectral Anomaly Detection

Zhaoxu Li, Yingqian Wang, Chao Xiao +3

In this paper, we introduce a new approach to address the challenge of generalization in hyperspectral anomaly detection (AD). Our method eliminates the need for adjusting paramete…

math.CO20203 cited

(1,0,0)-colorability of planar graphs without cycles of length 4 or 6

Ligang Jin, Yingli Kang, Peipei Liu +1

A graph is -colorable if the vertex set can be partitioned into three subsets and such that for , the induced graph $G[V_i]…