Haoyu Ma

Haoyu Ma

Auto-generated profile, based on publicly available information

Haoyu Ma

Tsinghua Shenzhen International Graduate School, Shenzhen, China

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
26 August 2020 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
HMHaoyu Ma
Haoyu Ma
QLQingmin Liao
Qingmin Liao
JZJuncheng Zhang
Juncheng Zhang
SLShaojun Liu
Shaojun Liu
JXJing-Hao Xue
Jing-Hao Xue
Capturing an all-in-focus image with a single camera is difficult since the depth of field of the camera is usually limited. An alternative method to obtain the all-in-focus image is to fuse several images that are focused at different depths. However, existing multi-focus image fusion methods cannot obtain clear results for areas near the focused/defocused boundary (FDB). In this paper, a novel α-matte boundary defocus model is proposed to generate realistic training data with the defocus spread effect precisely modeled, especially for areas near the FDB. Based on this α-matte defocus model and the generated data, a cascaded boundary-aware convolutional network termed MMF-Net is proposed and trained, aiming to achieve clearer fusion results around the FDB. Specifically, the MMF-Net consists of two cascaded subnets for initial fusion and boundary fusion. These two subnets are designed to first obtain a guidance map of FDB and then refine the fusion near the FDB. Experiments demonstrate that with the help of the new α-matte boundary defocus model, the proposed MMF-Net outperforms the state-of-the-art methods both qualitatively and quantitatively.

18 November 2021 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
HMHaoyu Ma
Haoyu Ma
SLShaojun Liu
Shaojun Liu
QLQingmin Liao
Qingmin Liao
JZJuncheng Zhang
Juncheng Zhang
JXJing-Hao Xue
Jing-Hao Xue
Different from the object motion blur, the defocus blur is caused by the limitation of the cameras’ depth of field. The defocus amount can be characterized by the parameter of point spread function and thus forms a defocus map. In this paper, we propose a new network architecture called Defocus Image Deblurring Auxiliary Learning Net (DID-ANet), which is specifically designed for single image defocus deblurring by using defocus map estimation as auxiliary task to improve the deblurring result. To facilitate the training of the network, we build a novel and large-scale dataset for single image defocus deblurring, which contains the defocus images, the defocus maps and the all-sharp images. To the best of our knowledge, the new dataset is the first large-scale defocus deblurring dataset for training deep networks. Moreover, the experimental results demonstrate that the proposed DID-ANet outperforms the state-of-the-art methods for both tasks of defocus image deblurring and defocus map estimation, both quantitatively and qualitatively. The dataset, code, and model is available on GitHub: https://github.com/xytmhy/DID-ANet-Defocus-Deblurring .

8 January 2024 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
JZJuncheng Zhang
Juncheng Zhang
QLQingmin Liao
Qingmin Liao
HMHaoyu Ma
Haoyu Ma
JXJing-Hao Xue
Jing-Hao Xue
Wenming YangWenming Yang
Wenming Yang
SLShaojun Liu
Shaojun Liu
Multi-focus image fusion is a technique to fuse the images focused on different depth ranges to generate an all-in-focus image. Existing deep learning approaches to multi-focus image fusion can be categorized as end-to-end methods and decision map based methods. End-to-end methods can generate natural fusion near the focus-defocus boundaries (FDB), but the output is often inconsistent with the input in the areas far from the boundaries (FFB). On the contrary, decision map based methods can preserve original images in the FFB areas, but often generate artifacts near the FDB. In this paper, we propose a dual-branch network for multi-focus image fusion (DB-MFIF) to exploit the best of both worlds, achieving better results in both FDB and FFB areas, i.e. with naturally sharper FDB areas and more consistent FFB areas with the inputs. In our DB-MFIF, an end-to-end branch and a decision map based branch are proposed to mutually assist each other. In addition, to this end, two map-based loss functions are also proposed. Experiments show that our method surpasses existing algorithms on multiple datasets, both qualitatively and quantitatively, and achieves the state-of-the-art performance. The code and model is available on GitHub: https://github.com/Zancelot/DB-MFIF .

1 June 2020 in Electrochimica Acta
Verified
Journal Article
Closed access
SYShuang Yin
Shuang Yin
Peng SongPeng Song
Peng Song
HWHao Wang
Hao Wang
HMHaoyu Ma
Haoyu Ma
ZWZhan Wang
Zhan Wang
YYYanmin Yu
Yanmin Yu

19 November 2022 in arXiv
Verified
Preprint
Open access
PDF file
ZKZhenglun Kong
Zhenglun Kong
HMHaoyu Ma
Haoyu Ma
GYGeng Yuan
Geng Yuan
MSMengshu Sun
Mengshu Sun
YXYanyue Xie
Yanyue Xie
YWYanzhi Wang
Yanzhi Wang
Vision transformers (ViTs) have recently obtained success in many applications, but their intensive computation and heavy memory usage at both training and inference time limit their generalization. Previous compression algorithms usually start from the pre-trained dense models and only focus on efficient inference, while time-consuming training is still unavoidable. In contrast, this paper points out that the million-scale training data is redundant, which is the fundamental reason for the tedious training. To address the issue, this paper aims to introduce sparsity into data and proposes an end-to-end efficient training framework from three sparse perspectives, dubbed Tri-Level E-ViT. Specifically, we leverage a hierarchical data redundancy reduction scheme, by exploring the sparsity under three levels: number of training examples in the dataset, number of patches (tokens) in each example, and number of connections between tokens that lie in attention weights. With extensive experiments, we demonstrate that our proposed technique can noticeably accelerate training for various ViT architectures while maintaining accuracy. Remarkably, under certain ratios, we are able to improve the ViT accuracy rather than compromising it. For example, we can achieve 15.2% speedup with 72.6% (+0.4) Top-1 accuracy on Deit-T, and 15.7% speedup with 79.9% (+0.1) Top-1 accuracy on Deit-S. This proves the existence of data redundancy in ViT.

11 October 2021 in arXiv
Verified
Preprint
Open access
PDF file
AJAjay Kumar Jaiswal
Ajay Kumar Jaiswal
HMHaoyu Ma
Haoyu Ma
Tianlong ChenTianlong Chen
Tianlong Chen
YDYing Ding
Ying Ding
ZWZhangyang (Atlas) Wang
Zhangyang (Atlas) Wang
Lottery Ticket Hypothesis (LTH) suggests that a dense neural network contains a sparse sub-network that can match the performance of the original dense network when trained in isolation from scratch. Most works retrain the sparse sub-network with the same training protocols as its dense network, such as initialization, architecture blocks, and training recipes. However, till now it is unclear that whether these training protocols are optimal for sparse networks. In this paper, we demonstrate that it is unnecessary for spare retraining to strictly inherit those properties from the dense network. Instead, by plugging in purposeful "tweaks" of the sparse subnetwork architecture or its training recipe, its retraining can be significantly improved than the default, especially at high sparsity levels. Combining all our proposed "tweaks" can yield the new state-of-the-art performance of LTH, and these modifications can be easily adapted to other sparse training algorithms in general. Specifically, we have achieved a significant and consistent performance gain of1.05% - 4.93% for ResNet18 on CIFAR-100 over vanilla-LTH. Moreover, our methods are shown to generalize across datasets (CIFAR10, CIFAR100, TinyImageNet) and architectures (Vgg16, ResNet-18/ResNet-34, MobileNet). All codes will be publicly available.