.png){kind=icon}
.png){kind=icon}
Return
Scene Video Text Tracking With Graph Matching
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2018.2797181.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Video has become one of the dominant data resources with the development of the Internet. As a result, the structured sorting of videos, which can be used for storage and extraction, represents a growing concern in the community. In particular, the text within videos can carry rich semantic information, leading to many novel studies wherein text tracking and recognition are performed. One essential step in text tracking involves template matching. In general, the adjacent matrices are modeled to represent the extracted tracking object features. Then, often, the Hungarian algorithm is applied to find the correspondence pairs between consecutive frames. In many works, text features are extracted based on morphological features such as color histograms and aspect ratios. However, under those features, similar text objects are not sufficiently distinguishable to make a distinction between them. To address this issue, we regard the template matching task as a graph matching problem. The main novelty involves a graph matching approach that utilizes the relationship between two trajectories or two objects, whereby a graph matching solver can be readily used in our tracking system. By utilizing the content information, the mismatch between the same object among different frames is effectively reduced. The experimental results demonstrate that the tracker with the graph matching method tends to increase the valid correspondence of trajectories and candidate objects.
Keywords:
Text tracking
template matching
graph matching
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
No organization information available