1st Place Solution for ICDAR 2021 Competition on Mathematical Formula Detection

• URL: http://arxiv.org/abs/2107.05534v1
• Date: Mon, 12 Jul 2021 16:03:16 GMT
• Title: 1st Place Solution for ICDAR 2021 Competition on Mathematical Formula Detection
• Authors: Yuxiang Zhong, Xianbiao Qi, Shanjun Li, Dengyi Gu, Yihao Chen, Peiyang Ning, Rong Xiao
• Abstract summary: We present our 1st place solution for the ICDAR 2021 competition on mathematical formula detection (MFD) The MFD task has three key challenges including a large scale span, large variation of the ratio between height and width, and rich character set and mathematical expressions. Considering these challenges, we used Generalized Focal Loss (GFL), an anchor-free method, instead of the anchor-based method.
• Score: 3.600275712225597
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this technical report, we present our 1st place solution for the ICDAR 2021 competition on mathematical formula detection (MFD). The MFD task has three key challenges including a large scale span, large variation of the ratio between height and width, and rich character set and mathematical expressions. Considering these challenges, we used Generalized Focal Loss (GFL), an anchor-free method, instead of the anchor-based method, and prove the Adaptive Training Sampling Strategy (ATSS) and proper Feature Pyramid Network (FPN) can well solve the important issue of scale variation. Meanwhile, we also found some tricks, e.g., Deformable Convolution Network (DCN), SyncBN, and Weighted Box Fusion (WBF), were effective in MFD task. Our proposed method ranked 1st in the final 15 teams.

Related papers

• Towards Universal Mesh Movement Networks [13.450178050669964]
  We introduce the Universal Mesh Movement Network (UM2N) UM2N can be applied in a non-intrusive, zero-shot manner to move meshes with different size distributions and structures. We evaluate our method on advection and Navier-Stokes based examples, as well as a real-world tsunami simulation case.
  arXiv  Detail & Related papers  (2024-06-29T09:35:12Z)
• Diffusion for Natural Image Matting [93.86689168212241]
  We present DiffMatte, a solution designed to overcome the challenges of image matting. First, DiffMatte decouples the decoder from the intricately coupled matting network design, involving only one lightweight decoder in the iterations of the diffusion process. Second, we employ a self-aligned training strategy with uniform time intervals, ensuring a consistent noise sampling between training and inference across the entire time domain.
  arXiv  Detail & Related papers  (2023-12-10T15:28:56Z)
• Faster Adaptive Federated Learning [84.38913517122619]
  Federated learning has attracted increasing attention with the emergence of distributed data. In this paper, we propose an efficient adaptive algorithm (i.e., FAFED) based on momentum-based variance reduced technique in cross-silo FL.
  arXiv  Detail & Related papers  (2022-12-02T05:07:50Z)
• High Resolution Multi-Scale RAFT (Robust Vision Challenge 2022) [0.6299766708197884]
  We present our optical flow approach, MS-RAFT+, that won the Robust Vision Challenge 2022. It is based on the MS-RAFT method, which successfully integrates several multi-scale concepts into single-scale RAFT. Our approach extends this method by exploiting an additional finer scale for estimating the flow, which is made feasible by on-demand cost computation.
  arXiv  Detail & Related papers  (2022-10-30T17:48:11Z)
• Extending nnU-Net is all you need [2.1729722043371016]
  We use nnU-Net to participate in the AMOS2022 challenge, which comes with a unique set of tasks. The dataset is one of the largest ever created and boasts 15 target structures. Our final ensemble achieves Dice scores of 90.13 for Task 1 (CT) and 89.06 for Task 2 (CT+MRI) in a 5-fold cross-validation.
  arXiv  Detail & Related papers  (2022-08-23T07:54:29Z)
• Versatile Weight Attack via Flipping Limited Bits [68.45224286690932]
  We study a novel attack paradigm, which modifies model parameters in the deployment stage. Considering the effectiveness and stealthiness goals, we provide a general formulation to perform the bit-flip based weight attack. We present two cases of the general formulation with different malicious purposes, i.e., single sample attack (SSA) and triggered samples attack (TSA)
  arXiv  Detail & Related papers  (2022-07-25T03:24:58Z)
• Low-Latency Federated Learning over Wireless Channels with Differential Privacy [142.5983499872664]
  In federated learning (FL), model training is distributed over clients and local models are aggregated by a central server. In this paper, we aim to minimize FL training delay over wireless channels, constrained by overall training performance as well as each client's differential privacy (DP) requirement.
  arXiv  Detail & Related papers  (2021-06-20T13:51:18Z)
• Recurrent Multi-view Alignment Network for Unsupervised Surface Registration [79.72086524370819]
  Learning non-rigid registration in an end-to-end manner is challenging due to the inherent high degrees of freedom and the lack of labeled training data. We propose to represent the non-rigid transformation with a point-wise combination of several rigid transformations. We also introduce a differentiable loss function that measures the 3D shape similarity on the projected multi-view 2D depth images.
  arXiv  Detail & Related papers  (2020-11-24T14:22:42Z)
• ASFD: Automatic and Scalable Face Detector [129.82350993748258]
  We propose a novel Automatic and Scalable Face Detector (ASFD) ASFD is based on a combination of neural architecture search techniques as well as a new loss design. Our ASFD-D6 outperforms the prior strong competitors, and our lightweight ASFD-D0 runs at more than 120 FPS with Mobilenet for VGA-resolution images.
  arXiv  Detail & Related papers  (2020-03-25T06:00:47Z)
• Alternating the Population and Control Neural Networks to Solve High-Dimensional Stochastic Mean-Field Games [9.909883019034613]
  We present an alternating population and agent control neural network for solving mean field games (MFGs) Our algorithm is geared toward high-dimensional instances of MFGs that are beyond reach with existing solution methods. We show the potential of our method on up to 100-dimensional MFG problems.
  arXiv  Detail & Related papers  (2020-02-24T08:24:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.