IIITH

Retrieval from document image collections

International Workshop on Document Analysis Systems, DAS, 2006

Core Rank : B Google Rank :-

Abs PDF bibTex

@inproceedings{bib_Retr_2006, AUTHOR = {Balasubramanian, A. and MESHESHA, MILLION and V, Jawahar C }, TITLE = {Retrieval from document image collections}, BOOKTITLE = {International Workshop on Document Analysis Systems}. YEAR = {2006}}

Retrieval from document image collections

Abstract

This paper presents a system for retrieval of relevant documents from large document image collections. We achieve effective search and retrieval from a large collection of printed document images by matching image features at word-level. For representations of the words, profile-based and shape-based features are employed. A novel DTWbased partial matching scheme is employed to take care of morphologically variant words. This is useful for grouping together similar words during the indexing process. The system supports cross-lingual search using OM-Trans transliteration and a dictionary-based approach. Systemlevel issues for retrieval (eg. scalability, effective delivery etc.) are addressed in this paper.

Digitizing a million books: Challenges for document analysis

International Workshop on Document Analysis Systems, DAS, 2006

Core Rank : B Google Rank :-

Abs PDF bibTex

@inproceedings{bib_Digi_2006, AUTHOR = {Kompalli, Pramod Sankar and Ambati, Vamshi and AASRITHA, P LAKSHMI and V, Jawahar C }, TITLE = {Digitizing a million books: Challenges for document analysis}, BOOKTITLE = {International Workshop on Document Analysis Systems}. YEAR = {2006}}

Digitizing a million books: Challenges for document analysis

Abstract

This paper describes the challenges for document image analysis community for building large digital libraries with diverse document categories. The challenges are identified from the experience of the on-going activities toward digitizing and archiving one million books. Smooth workflow has been established for archiving large quantity of books, with the help of efficient image processing algorithms. However, much more research is needed to address the challenges arising out of the diversity of the content in digital libraries.

A semi-automatic adaptive OCR for digital libraries

International Workshop on Document Analysis Systems, DAS, 2006

Core Rank : B Google Rank :-

Abs PDF bibTex

@inproceedings{bib_A_se_2006, AUTHOR = {RAWAT, SACHIN KUMAR and KUMAR, K S SESH and MESHESHA, MILLION and SIKDAR, INDRANEEL DEB and Balasubramanian, A. and V, Jawahar C }, TITLE = {A semi-automatic adaptive OCR for digital libraries}, BOOKTITLE = {International Workshop on Document Analysis Systems}. YEAR = {2006}}

A semi-automatic adaptive OCR for digital libraries

Abstract

. This paper presents a novel approach for designing a semi-automatic adaptive OCR for large document image collections in digital libraries. We describe an interactive system for continuous improvement of the results of the OCR. In this paper a semi-automatic and adaptive system is implemented. Applicability of our design for the recognition of Indian Languages is demonstrated. Recognition errors are used to train the OCR again so that it adapts and learns for improving its accuracy. Limited human intervention is allowed for evaluating the output of the system and take corrective actions during the recognition process.

Homography estimation from planar contours

International Symposium on 3D Data Processing Visualization and Transmission, 3DPVT, 2006

Core Rank : - Google Rank :-

Abs PDF DOI bibTex

@inproceedings{bib_Homo_2006, AUTHOR = {JAIN, PARESH KUMAR and V, Jawahar C }, TITLE = {Homography estimation from planar contours}, BOOKTITLE = {International Symposium on 3D Data Processing Visualization and Transmission}. YEAR = {2006}}

Homography estimation from planar contours

Abstract

Homography estimation is an important step in many computer vision algorithms. Most existing algorithms estimate the homography from point or line correspondences which are difficult to reliably obtain in many real-life situations. In this paper we propose a technique based on correspondences of contours. Homography estimation is carried out in Fourier domain. Starting from an affine estimate, the proposed algorithm computes the projective homography in an iterative manner. This technique does not require explicit point to point correspondences; in fact such point correspondences are a by-product of the proposed algorithm. Experimental results and applications validate the use of our technique.

Target model estimation using particle filters for visual servoing

International conference on Pattern Recognition, ICPR, 2006

Core Rank : B Google Rank :56

Abs PDF DOI bibTex

@inproceedings{bib_Targ_2006, AUTHOR = {Hafez, A. H. Abdul and V, Jawahar C }, TITLE = {Target model estimation using particle filters for visual servoing}, BOOKTITLE = {International conference on Pattern Recognition}. YEAR = {2006}}

Target model estimation using particle filters for visual servoing

Abstract

In this paper, we present a novel method for model estimation for visual servoing. This method employs a particle filter algorithm to estimate the depth of the image features online. A Gaussian probabilistic model is employed to model the object points in the current camera frame. A set of 3D samples drawn from the model is projected into the image space in the next frame. The 3D sample that maximizes the likelihood is the most probable real-world 3D point. The variance value of the depth density function converges to very small value within a few iterations. Results show accurate estimate of the depth/model and a high level of stability in the visual servoing process

Visual servoing in presence of non-rigid motion

International conference on Pattern Recognition, ICPR, 2006

Core Rank : B Google Rank :56

Abs PDF DOI bibTex

@inproceedings{bib_Visu_2006, AUTHOR = {D, SANTOSH KUMAR and V, Jawahar C }, TITLE = {Visual servoing in presence of non-rigid motion}, BOOKTITLE = {International conference on Pattern Recognition}. YEAR = {2006}}

Visual servoing in presence of non-rigid motion

Abstract

Most robotic vision algorithms have been proposed by envisaging robots operating in industrial environments, where the world is assumed to be static and rigid. These algorithms cannot be used in environments where the assumption of a rigid world does not hold. In this paper, we study the problem of visual servoing in presence of nonrigid objects and analyze the design of servoing strategies needed to perform optimally even in unconventional environments. We also propose a servoing algorithm that is robust to non-rigidity. The algorithm extracts invariant features of the non-rigid object and uses these features in the servoing process. We validate the technique with experiments and demonstrate the applicability

Efficient region based indexing and retrieval for images with elastic bucket tries

International conference on Pattern Recognition, ICPR, 2006

Core Rank : B Google Rank :56

Abs PDF DOI bibTex

@inproceedings{bib_Effi_2006, AUTHOR = {KARTHIK, PATHAPATI SUMAN and V, Jawahar C }, TITLE = {Efficient region based indexing and retrieval for images with elastic bucket tries}, BOOKTITLE = {International conference on Pattern Recognition}. YEAR = {2006}}

Efficient region based indexing and retrieval for images with elastic bucket tries

Abstract

Retrieval and indexing in multimedia databases has been an active topic both in the Information Retrieval and computer vision communities for a long time. In this paper we propose a novel region based indexing and retrieval scheme for images. First we present our virtual textual description using which, images are converted to text documents containing keywords. Then we look at how these documents can be indexed and retrieved using modified elastic bucket tries and show that our approach is one order better than standard spatial indexing approaches. We also show various operations required for dealing with complex features like relevance feedback. Finally we analyze the method comparatively and and validate our approach.

Learning mixtures of offline and online features for handwritten stroke recognition

International conference on Pattern Recognition, ICPR, 2006

Core Rank : B Google Rank :56

Abs PDF DOI bibTex

@inproceedings{bib_Lear_2006, AUTHOR = {ALAHARI, KARTEEK and PUTREVU, SATYA LAHARI and V, Jawahar C }, TITLE = {Learning mixtures of offline and online features for handwritten stroke recognition}, BOOKTITLE = {International conference on Pattern Recognition}. YEAR = {2006}}

Learning mixtures of offline and online features for handwritten stroke recognition

Abstract

In this paper we propose a novel scheme to combine offline and online features of handwritten strokes. The stateof-the-art methods in handwritten stroke recognition have used a pre-determined combination of these features, which is not optimal in all situations. The proposed model addresses this issue by learning mixtures of offline and online characteristics from a set of exemplars. Each stroke is represented as a probabilistic sequence of substrokes with varying compositions of these features. The model adapts to any stroke and chooses the feature composition that best characterizes it. The superiority of the method is demonstrated on handwritten numeral and character strokes.

Integration framework for improved visual servoing in image and cartesian spaces

International Conference on Intelligent Robots and Systems, IROS, 2006

Core Rank : A Google Rank :86

Abs PDF DOI bibTex

@inproceedings{bib_Inte_2006, AUTHOR = {Hafez, A. H. Abdul and V, Jawahar C }, TITLE = {Integration framework for improved visual servoing in image and cartesian spaces}, BOOKTITLE = {International Conference on Intelligent Robots and Systems}. YEAR = {2006}}

Integration framework for improved visual servoing in image and cartesian spaces

Abstract

In this paper, we present a new integration method for improving the performance of visual servoing. The method integrates both image-based visual servoing (IBVS) and positionbased visual servoing (PBVS) to satisfy the requirements of the visual servoing process. We define a probabilistic integration rule for IBVS and PBVS controllers. Density functions that determine the probability of each controller are defined to satisfy the above constraints. We prove that this integration method provides global stability, and avoids local minima. The new integration method is validated on positioning tasks, and compared with other switching methods. I. I

Synthesis of online handwriting in indian languages

International Workshop on Frontiers in Handwriting Recognition, IWFHR, 2006

Core Rank : - Google Rank :-

Abs PDF bibTex

@inproceedings{bib_Synt_2006, AUTHOR = {V, Jawahar C and A.Balasubramanian, }, TITLE = {Synthesis of online handwriting in indian languages}, BOOKTITLE = {International Workshop on Frontiers in Handwriting Recognition}. YEAR = {2006}}

Synthesis of online handwriting in indian languages

Abstract

Synthesis of handwriting has a variety of applications including generation of personalized documents, study of writing styles, automatic generation of data for training recognizers, and matching of handwritten data for retrieval. Most of the existing algorithms for handwriting synthesis deal with English, where the spatial layout of the components are relatively simple, while the cursiveness of the script introduces many challenges. In this paper, we present a synthesis model for generating handwritten data for Indian languages, where the layout of characters is complex while the script is fundamentally non-cursive. The algorithm learns from annotated data and improves its representation with feedback.