图像多边形标注的快速切图方法和装置
By using a fast image slicing algorithm that finds the intersection of polygons and rectangles, the problem of low efficiency in polygon annotation and slicing of high-resolution images is solved, and efficient training of visual task algorithms is achieved.
CN117132614BActive Publication Date: 2026-07-17CHANGZHOU MICROINTELLIGENCE CO LTD
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- CHANGZHOU MICROINTELLIGENCE CO LTD
- Filing Date
- 2023-08-29
- Publication Date
- 2026-07-17
AI Technical Summary
Technical Problem
In existing technologies, the polygon annotation and slicing process for high-resolution images is inefficient, resulting in low training efficiency for visual task algorithms.
Method used
A fast image cropping algorithm is adopted to find the intersection of polygons and rectangles. By constructing a queue of minimum bounding rectangles, polygon images are dynamically cropped and then cropped using a fast intersection algorithm.
Benefits of technology
It enables fast image slicing with polygon annotations, improving the training efficiency of visual task algorithms.
✦ Generated by Eureka AI based on patent content.
Smart Images
Figure CN117132614B_ABST
Abstract
本发明提供了一种图像多边形标注的快速切图方法和装置，该方法包括：获取外接矩形框队列；判断外接矩形框队列中当前位置的最小外接矩形框的宽或高是否大于最大裁剪尺寸；如果是，则根据当前位置的最小外接矩形框生成目标裁剪区域，并根据裁剪矩形采用快速求交算法对目标裁剪区域进行动态裁剪，以获取相应的多边形图像；如果否，则根据当前位置的最小外接矩形框和相邻位置的最小外接矩形框生成候选裁剪区域，并判断候选裁剪区域是否大于最大裁剪尺寸；如果候选裁剪区域大于最大裁剪尺寸，则根据候选裁剪区域生成目标裁剪区域，并根据裁剪矩形采用快速求交算法对目标裁剪区域进行动态裁剪。由此，能够实现图像多边形标注的快速切图。
Need to check novelty before this filing date? Find Prior Art