Ziqi Wei

Dr. Ziqi Wei

orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 January 2022 in Computers in Biology and Medicine
Verified
Journal Article
Closed access
PZPeiliang Zhang
Peiliang Zhang
ZWZiqi Wei
Ziqi Wei
CCChao Che
Chao Che
BJBo Jin
Bo Jin

30 March 2021 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
HMHaiyang Mei
Haiyang Mei
YLYuanyuan Liu
Yuanyuan Liu
ZWZiqi Wei
Ziqi Wei
DZDongsheng Zhou
Dongsheng Zhou
XWXiaopeng Wei
Xiaopeng Wei
XYXin Yang
Xin Yang
Contexts play an important role in salient object detection (SOD). High-level contexts describe the relations between different parts/objects and thus are helpful for discovering the specific locations of salient objects while low-level contexts could provide the fine detail information for delineating the boundary of the salient objects. However, the way of perceiving/leveraging rich contexts has not been fully investigated by existing SOD works. The common context extraction strategies ( e.g. , leveraging convolutions with large kernels or atrous convolutions with large dilation rates) do not consider the effectiveness and efficiency simultaneously and may cause sub-optimal solutions. In this paper, we devote to exploring an effective and efficient way to learn rich contexts for accurate SOD. Specifically, we first build a dense context exploration (DCE) module to capture dense multi-scale contexts and further leverage the learned contexts to enhance the features discriminability. Then, we embed multiple DCE modules in an encoder-decoder architecture to harvest dense contexts of different levels. Furthermore, we propose an attentive skip-connection to transmit useful features from the encoder part to the decoder part for better dense context exploration. Finally, extensive experiments demonstrate that the proposed method achieves more superior detection results on the six benchmark datasets than 18 state-of-the-art SOD methods.

1 April 2022 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
LYLetian Yu
Letian Yu
HMHaiyang Mei
Haiyang Mei
WDWen Dong
Wen Dong
ZWZiqi Wei
Ziqi Wei
LZLi Zhu
Li Zhu
XYXin Yang
Xin Yang
Glass is very common in the real world. Influenced by the uncertainty about the glass region and the varying complex scenes behind the glass, the existence of glass poses severe challenges to many computer vision tasks, making glass segmentation as an important computer vision task. Glass does not have its own visual appearances but only transmit/reflect the appearances of its surroundings, making it fundamentally different from other common objects. To address such a challenging task, existing methods typically explore and combine useful cues from different levels of features in the deep network. As there exists a characteristic gap between level-different features, i.e. , deep layer features embed more high-level semantics and are better at locating the target objects while shallow layer features have larger spatial sizes and keep richer and more detailed low-level information, fusing these features naively thus would lead to a sub-optimal solution. In this paper, we approach the effective features fusion towards accurate glass segmentation in two steps. First, we attempt to bridge the characteristic gap between different levels of features by developing a Discriminability Enhancement (DE) module which enables level-specific features to be a more discriminative representation, alleviating the features incompatibility for fusion. Second, we design a Focus-and-Exploration Based Fusion (FEBF) module to richly excavate useful information in the fusion process by highlighting the common and exploring the difference between level-different features. Combining these two steps, we construct a P rogressive G lass S egmentation Net work ( PGSNet ) which uses multiple DE and FEBF modules to progressively aggregate features from high-level to low-level, implementing a coarse-to-fine glass segmentation. In addition, we build the first home-scene-oriented glass segmentation dataset for advancing household robot applications and in-depth research on this topic. Extensive experiments demonstrate that our method outperforms 26 cutting-edge models on three challenging datasets under four standard metrics. The code and dataset will be made publicly available.

4 January 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
PWPengfei Wang
Pengfei Wang
CLChi Lin
Chi Lin
MOMohammad S. Obaidat
Mohammad S. Obaidat
ZYZhen Yu
Zhen Yu
ZWZiqi Wei
Ziqi Wei
QZQiang Zhang
Qiang Zhang
Governments of the world have invested a lot of manpower and material resources to combat COVID-19 this year. At this moment, the most efficient way that could stop the epidemic is to leverage the contact tracing system to monitor people’s daily contact information and isolate the close contacts of COVID-19. However, the contact tracing data usually contains people’s sensitive information that they do not want to share with the contact tracing system and government. Conversely, the contact tracing system could perform better when it obtains more detailed contact tracing data. In this article, we treat the process of collecting contact tracing data from a crowdsourcing perspective in order to motivate users to contribute more contact tracing data and propose the incentive algorithm named CovidCrowd. Different from previous works where they ask users to contribute their data voluntarily, the government offers some reward to users who upload their contact tracing data to reimburse the privacy and data processing cost. We formulate the problem as a Stackelberg game and show there exists a Nash equilibrium for any user given the fixed reward value. Then, CovidCrowd computes the optimal reward value which could maximize the utility of the system. Finally, we conduct a large-scale simulation with thousands of users and evaluation with real-world data set. Both results show that CovidCrowd outperforms the benchmarks, e.g., the user participating level is improved by at least 13.2% for all evaluation scenarios.

6 February 2023 in ACM Transactions on Multimedia Computing, Communications, and Applications
Verified
Journal Article
Open access
YQYu Qiao
Yu Qiao
YLYuhao Liu
Yuhao Liu
ZWZiqi Wei
Ziqi Wei
YWYuxin Wang
Yuxin Wang
QCQiang Cai
Qiang Cai
XYXin Yang
Xin Yang
Most matting researches resort to advanced semantics to achieve high-quality alpha mattes, and direct low-level features combination is usually explored to complement alpha details. However, we argue that appearance-agnostic integration can only provide biased foreground details and alpha mattes require different-level feature aggregation for better pixel-wise opacity perception. In this paper, we propose an end-to-end Hierarchical and Progressive Attention Matting Network (HAttMatting++), which can better predict the opacity of the foreground from single RGB images without additional input. Specifically, we utilize channel-wise attention to distill pyramidal features and employ spatial attention at different levels to filter appearance cues. This progressive attention mechanism can estimate alpha mattes from adaptive semantics and semantics-indicated boundaries. We also introduce a hybrid loss function fusing Structural SIMilarity (SSIM), Mean Square Error (MSE), Adversarial loss, and sentry supervision to guide the network to further improve the overall foreground structure. Besides, we construct a large-scale and challenging image matting dataset comprised of 59,600 training images and 1000 test images (a total of 646 distinct foreground alpha mattes), which can further improve the robustness of our hierarchical and progressive aggregation model. Extensive experiments demonstrate that the proposed HAttMatting++ can capture sophisticated foreground structures and achieve state-of-the-art performance with single RGB images as input.

3 May 2024 in Knowledge-Based Systems
Verified
Journal Article
Closed access
CDChenming Duan
Chenming Duan
ZWZhichao Wu
Zhichao Wu
LZLi Zhu
Li Zhu
XXXirong Xu
Xirong Xu
JZJianmin Zhu
Jianmin Zhu
XYXin Yang
Xin Yang