|
|
George Tom, Minesh Mathew, Sergi Garcia Bordils, Dimosthenis Karatzas and CV Jawahar. 2023. Reading Between the Lanes: Text VideoQA on the Road. 17th International Conference on Document Analysis and Recognition.137–154. (LNCS.)
Abstract: Text and signs around roads provide crucial information for drivers, vital for safe navigation and situational awareness. Scene text recognition in motion is a challenging problem, while textual cues typically appear for a short time span, and early detection at a distance is necessary. Systems that exploit such information to assist the driver should not only extract and incorporate visual and textual cues from the video stream but also reason over time. To address this issue, we introduce RoadTextVQA, a new dataset for the task of video question answering (VideoQA) in the context of driver assistance. RoadTextVQA consists of 3, 222 driving videos collected from multiple countries, annotated with 10, 500 questions, all based on text or road signs present in the driving videos. We assess the performance of state-of-the-art video question answering models on our RoadTextVQA dataset, highlighting the significant potential for improvement in this domain and the usefulness of the dataset in advancing research on in-vehicle support systems and text-aware multimodal question answering. The dataset is available at http://cvit.iiit.ac.in/research/projects/cvit-projects/roadtextvqa.
Keywords: VideoQA; scene text; driving videos
|
|
|
|
Gemma Sanchez, Josep Llados and K. Tombre. 2001. An Algorithm to Recognize Graphical Textured Symbols using String Representations..
|
|
|
|
Gemma Sanchez, Josep Llados and K. Tombre. 2001. An Error-Correction Graph Grammar to Recognize Textured Symbols..
|
|
|
|
Gemma Sanchez, Josep Llados and K. Tombre. 2002. A mean string algorithm to compute the average among a set of 2D shapes. PRL, 23(1-3), 203–214.
|
|
|
|
Gemma Sanchez, Josep Llados and K. Tombre. 2000. A mean string algorithm to compute the average among a set of 2D shapes.
|
|
|
|
Gemma Sanchez, Josep Llados and Enric Marti. 1997. A string-based method to recognize symbols and structural textures in architectural plans. 2nd IAPR Workshop on Graphics Recognition.91–103.
Abstract: This paper deals with the recognition of symbols and struc- tural textures in architectural plans using string matching techniques. A plan is represented by an attributed graph whose nodes represent characteristic points and whose edges represent segments. Symbols and textures can be seen as a set of regions, i.e. closed loops in the graph, with a particular arrangement. The search for a symbol involves a graph matching between the regions of a model graph and the regions of the graph representing the document. Discriminating a texture means a clus- tering of neighbouring regions of this graph. Both procedures involve a similarity measure between graph regions. A string codification is used to represent the sequence of outlining edges of a region. Thus, the simila- rity between two regions is defined in terms of the string edit distance between their boundary strings. The use of string matching allows the recognition method to work also under presence of distortion.
|
|
|
|
Gemma Sanchez, Josep Llados and Enric Marti. 1997. Segmentation and analysis of linial texture in plans. Actes de la conférence Artificielle et Complexité.. Paris.
Abstract: The problem of texture segmentation and interpretation is one of the main concerns in the field of document analysis. Graphical documents often contain areas characterized by a structural texture whose recognition allows both the document understanding, and its storage in a more compact way. In this work, we focus on structural linial textures of regular repetition contained in plan documents. Starting from an atributed graph which represents the vectorized input image, we develop a method to segment textured areas and recognize their placement rules. We wish to emphasize that the searched textures do not follow a predefined pattern. Minimal closed loops of the input graph are computed, and then hierarchically clustered. In this hierarchical clustering, a distance function between two closed loops is defined in terms of their areas difference and boundary resemblance computed by a string matching procedure. Finally it is noted that, when the texture consists of isolated primitive elements, the same method can be used after computing a Voronoi Tesselation of the input graph.
Keywords: Structural Texture, Voronoi, Hierarchical Clustering, String Matching.
|
|
|
|
Gemma Sanchez and Josep Llados. 2001. A Graph Grammar to Recognize Textured Symbols..
|
|
|
|
Gemma Sanchez and Josep Llados. 2003. Syntactic models to represent perceptually regular repetitive patterns in graphic documents.
|
|
|
|
Gemma Sanchez and Josep Llados. 2004. Syntactic models to represent perceptually regular repetitive patterns in graphic documents.
|
|
