Video Region Annotation with Sparse Bounding Boxes
نویسندگان
چکیده
Video analysis has been moving towards more detailed interpretation (e.g., segmentation) with encouraging progress. These tasks, however, increasingly rely on densely annotated training data both in space and time. Since such annotation is labor-intensive, few video region boundaries exist. This work aims to resolve this dilemma by learning automatically generate for all frames of a from sparsely bounding boxes target regions. We achieve Volumetric Graph Convolutional Network (VGCN), which learns iteratively find keypoints the using spatio-temporal volume surrounding appearance motion. show that global optimization VGCN leads accurate generalizes better. Experimental results three latest datasets (two real one synthetic), including ablation studies, demonstrate effectiveness superiority our method.
منابع مشابه
Knowledge Leverage from Contours to Bounding Boxes: A Concise Approach to Annotation
In the class based image segmentation problem, one of the major concerns is to provide large training data for learning complex graphical models. To alleviate the labeling effort, a concise annotation approach working on bounding boxes is introduced. The main idea is to leverage the knowledge learned from a few object contours for the inference of unknown contours in bounding boxes. To this end...
متن کاملFinding the Best-Fit Bounding-Boxes
The bounding-box of a geometric shape in 2D is the rectangle with the smallest area in a given orientation (usually upright) that complete contains the shape. The best-fit bounding-box is the smallest bounding-box among all the possible orientations for the same shape. In the context of document image analysis, the shapes can be characters (individual components) or paragraphs (component groups...
متن کاملBounding Boxes for Compact Sets in E
We define pseudocompact topological spaces and prove that every compact space is pseudocompact. We also solve an exercise from [16] p.225 that the for a topological space X the following are equivalent: • Every continuous real map from X is bounded (i.e. X is pseudocompact). • Every continuous real map from X attains minimum. • Every continuous real map from X attains maximum. Finally, for a co...
متن کاملDynamic Collision Detection using Oriented Bounding Boxes
2 Oriented Bounding Boxes 5 2.1 Separation of OBBs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.2 Testing for Intersection of OBBs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.2.1 Stationary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.2.2 Constant Velocities . . . . . . . . . . . . ...
متن کاملCollision Detection Using Bounding Boxes: Convexity Helps
We consider the use of bounding boxes to detect collisions among a set of convex objects in R d. We derive tight bounds on the ratio between the number of box intersections and the number of object intersections. Connrming intuition, we show that the performance of bounding boxes improves signiicantly when the underlying objects are all convex. In particular, the ratio is (1?1=d 1=2 box) if eac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Vision
سال: 2022
ISSN: ['0920-5691', '1573-1405']
DOI: https://doi.org/10.1007/s11263-022-01719-0