Polygon Pixel IoU: Similarity Metric between Polygons with Different Number of Vertices for Arbitrary-Shaped Text Spotting

Existing arbitrary-shaped text (ArT) spotting models have used coordinate-based error (CBE) loss to optimize polygon region detection. Optimization using CBE loss requires a fine-grained ground truth (FineGT), which is a fixed-length list of polygon vertices. However, not all datasets have FineGT, and creating FineGT is costly. In this paper, we propose Polygon Pixel Intersection over Union (PPIoU), which shows the similarity of polygon regions and can be used for neural network training without FineGT. Unlike CBE loss, PPIoU loss represents the region-based error for polygons and is not affected by the number of polygon vertices. PPIoU loss allows the use of multiple datasets containing polygons with different numbers of vertices, making it easy to increase the amount of training data. This is a useful feature since more training data generally improves accuracy. We show that the PPIoU loss can easily improve the accuracy of existing text spotting models.

Authors

Institutions

Publication Details

Published
2025-03-12
DOI
https://doi.org/10.1109/icassp49660.2025.10890127
Primary Topic
Handwritten Text Recognition Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Polygon Pixel IoU: Similarity Metric between Polygons with Different Number of Vertices for Arbitrary-Shaped Text Spotting

Rei Endo, Taro Miyazaki, Yoshihiko Kawai, Takahiro Mochizuki
Handwritten Text Recognition Techniques
article

Polygon Pixel IoU: Similarity Metric between Polygons with Different Number of Vertices for Arbitrary-Shaped Text Spotting

Rei Endo, Taro Miyazaki, Yoshihiko Kawai, Takahiro Mochizuki
article en

Abstract

Existing arbitrary-shaped text (ArT) spotting models have used coordinate-based error (CBE) loss to optimize polygon region detection. Optimization using CBE loss requires a fine-grained ground truth (FineGT), which is a fixed-length list of polygon vertices. However, not all datasets have FineGT, and creating FineGT is costly. In this paper, we propose Polygon Pixel Intersection over Union (PPIoU), which shows the similarity of polygon regions and can be used for neural network training without FineGT. Unlike CBE loss, PPIoU loss represents the region-based error for polygons and is not affected by the number of polygon vertices. PPIoU loss allows the use of multiple datasets containing polygons with different numbers of vertices, making it easy to increase the amount of training data. This is a useful feature since more training data generally improves accuracy. We show that the PPIoU loss can easily improve the accuracy of existing text spotting models.

NHK Spring (Japan) (JP)
Openalex Percentile: Top 97%
Handwritten Text Recognition Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Polygon Pixel IoU: Similarity Metric between Polygons with Different Number of Vertices for Arbitrary-Shaped Text Spotting — Rei Endo, Taro Miyazaki, et al. · (2025) | TGRS Research Map | TGRS