EDBT 2026 Demo / reviewers in the wild / expert
Anand Mishra 0001
dblp:26/2579
· DBLP profile ↗
8ranked-venue papers in the field
2as first author
3since 2021 · last 2025
—ORCID · conflict
Domains — venue-derived; a paper can count in several
Other / Interdisciplinary · 8 (2 first)
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | AI-Generated Lecture Slides for Improving Slide Element Detection and Retrieval
Suyash Maniyar, Vishvesh Trivedi, Ajoy Mondal, Anand Mishra 0001, C. V. Jawahar |
ICDAR (1) | 4 |
| 2023 | Towards Making Flowchart Images Machine Interpretable
Shreya Shukla, Prajwal Gatti, Yogesh Kumar 0004, Vikash Yadav, Anand Mishra 0001 |
ICDAR (5) | 5 |
| 2021 | Look, Read and Ask: Learning to Ask Questions by Reading Text in Images
Soumya Jahagirdar, Shankar Gangisetty, Anand Mishra 0001 |
ICDAR (1) | 3 |
| 2019 | OCR-VQA: Visual Question Answering by Reading Text in ImagesabstractThe problem of answering questions about an image is popularly known as visual question answering (or VQA in short). It is a well-established problem in computer vision. However, none of the VQA methods currently utilize the text often present in the image. These "texts in images" provide additional useful cues and facilitate better understanding of the visual content. In this paper, we introduce a novel task of visual question answering by reading text in images, i.e., by optical character recognition or OCR. We refer to this problem as OCR-VQA. To facilitate a systematic way of studying this new problem, we introduce a large-scale dataset, namely OCRVQA-200K. This dataset comprises of 207,572 images of book covers and contains more than 1 million question-answer pairs about these images. We judiciously combine well-established techniques from OCR and VQA domains to present a novel baseline for OCR-VQA-200K. The experimental results and rigorous analysis demonstrate various challenges present in this dataset leaving ample scope for the future research. We are optimistic that this new task along with compiled dataset will open-up many exciting research avenues both for the document image analysis and the VQA communities. Anand Mishra 0001, Shashank Shekhar 0006, Ajeet Kumar Singh, Anirban Chakraborty 0001 |
ICDAR | 1 |
| 2016 | A Simple and Effective Solution for Script Identification in the WildabstractWe present an approach for automatically identifying the script of the text localized in the scene images. Our approach is inspired by the advancements in mid-level features. We represent the text images using mid-level features which are pooled from densely computed local features. Once text images are represented using the proposed mid-level feature representation, we use an off-the-shelf classifier to identify the script of the text image. Our approach is efficient and requires very less labeled data. We evaluate the performance of our method on a recently introduced CVSI dataset, demonstrating that the proposed approach can correctly identify script of 96.70% of the text images. In addition, we also introduce and benchmark a more challenging Indian Language Scene Text (ILST) dataset for evaluating the performance of our method. Ajeet Kumar Singh, Anand Mishra 0001, Pranav Dabral, C. V. Jawahar |
DAS | 2 |
| 2013 | Whole is Greater than Sum of Parts: Recognizing Scene Text WordsabstractRecognizing text in images taken in the wild is a challenging problem that has received great attention in recent years. Previous methods addressed this problem by first detecting individual characters, and then forming them into words. Such approaches often suffer from weak character detections, due to large intra-class variations, even more so than characters from scanned documents. We take a different view of the problem and present a holistic word recognition framework. In this, we first represent the scene text image and synthetic images generated from lexicon words using gradient-based features. We then recognize the text in the image by matching the scene and synthetic image features with our novel weighted Dynamic Time Warping (wDTW) approach. We perform experimental analysis on challenging public datasets, such as Street View Text and ICDAR 2003. Our proposed method significantly outperforms our earlier work in Mishra et al. (CVPR 2012), as well as many other recent works, such as Novikova et al. (ECCV 2012), Wang et al. al.(ICPR 2012), Wang et al.(ICCV 2011). Vibhor Goel, Anand Mishra 0001, Karteek Alahari, C. V. Jawahar |
ICDAR | 2 |
| 2013 | Sparse Document Image Coding for RestorationabstractSparse representation based image restoration techniques have shown to be successful in solving various inverse problems such as denoising, in painting, and super-resolution, etc. on natural images and videos. In this paper, we explore the use of sparse representation based methods specifically to restore the degraded document images. While natural images form a very small subset of all possible images admitting the possibility of sparse representation, document images are significantly more restricted and are expected to be ideally suited for such a representation. However, the binary nature of textual document images makes dictionary learning and coding techniques unsuitable to be applied directly. We leverage the fact that different characters possess similar strokes, curves, and edges, and learn a dictionary that gives sparse decomposition for patches. Experimental results show significant improvement in image quality and OCR performance on documents collected from a variety of sources such as magazines and books. This method is therefore, ideally suited for restoring highly degraded images in repositories such as digital libraries. Vijay Kumar 0004, Amit Bansal, Goutam Hari Tulsiyan, Anand Mishra 0001, Anoop M. Namboodiri, C. V. Jawahar |
ICDAR | 4 |
| 2011 | An MRF Model for Binarization of Natural Scene TextabstractInspired by the success of MRF models for solving object segmentation problems, we formulate the binarization problem in this framework. We represent the pixels in a document image as random variables in an MRF, and introduce a new energy (or cost) function on these variables. Each variable takes a foreground or background label, and the quality of the binarization (or labelling) is determined by the value of the energy function. We minimize the energy function, i.e. find the optimal binarization, using an iterative graph cut scheme. Our model is robust to variations in foreground and background colours as we use a Gaussian Mixture Model in the energy function. In addition, our algorithm is efficient to compute, and adapts to a variety of document images. We show results on word images from the challenging ICDAR 2003 dataset, and compare our performance with previously reported methods. Our approach shows significant improvement in pixel level accuracy as well as OCR accuracy. Anand Mishra 0001, Karteek Alahari, C. V. Jawahar |
ICDAR | 1 |