Abstract

This work aims to enhance the matching and retrieval performance over image datasets which have similar spatial structures that occur very frequently. Instead of treating images as bags of features, we try to encode the spatial relationships in the representation. This process would help to resolve the ambiguity when two classes of images have similar sets of features although in different spatial arrangements. To demonstrate the fact a sizeable dataset of license plate images is used. We have proposed a method to use graphs to encode the spatial relationships among features. The problem of image matching thus turns to finding the maximum similarity between labelled graphs. It is shown that the precision of the retrieved results increases with this matching scheme since most of the false matches are eliminated.

Abstract

Biometrics traits such as fingerprints, hand geometry, face and voice verification provide a reliable alternative for identity verification and are gaining commercial and high user acceptibilty rate. Hand geometry based biometric verification has proven to be the most suitable and acceptable biometric trait for medium and low security application. Geometric measurements of the human hand have been used for identity authentication in a number of commercial systems. However not much research has been done in the area of selection of the optimal discriminating features for hand-gemetry based authentication system. In this paper, We argue that the biometric verification problem can be best posed as the single-class problem. We propose to apply Biased Discriminant Analysis and Nonparametric Discriminant Analysis in order to transform the features into a new space where the samples are well separated.

Abstract

In this paper, we present a novel boosted robot vision control algorithm. This method utilizes on-line boosting to produce a strong vision-based robot control starting from two weak algorithms. These weak methods are image-based and position-based visual servoing algorithms. The notion of weak and strong algorithms have been presented in the context of robot vision control. Appropriate error functions are defined for the weak algorithms to evaluate their suitability in the task. The integrated algorithm has superior performance both in image and Cartesian spaces. Experiments validate this claim.

Abstract

In this paper we present a novel real time algorithm to sequentially solve a class of multi-view geometry problems. The triangulation problem is considered as study case. The problem concerns with the estimation of 3D point coordinates given its images as well as the matrices of the concern cameras used in the imaging process. The algorithm has direct application to real time systems like virtual reality, visual SLAM, and visual servoing. Application to visual servoing is considered in detail. Experiments have been carried out for the general triangulation problem as well as the application to visual servoing.

Abstract

Image-based navigation paradigms have recently emerged as an interesting alternative to conventional modelbased methods in mobile robotics. In this paper, we augment the existing image-based navigation approaches by presenting a novel image-based exploration algorithm. The algorithm facilitates a mobile robot equipped only with a monocular pan-tilt camera to autonomously explore a typical indoor environment. The algorithm infers frontier information directly from the images and displaces the robot towards regions that are informative for navigation. The frontiers are detected using a geometric context-based segmentation scheme that exploits the natural scene structure in indoor environments. In the due process, a topological graph of the workspace is built in terms of images which can be subsequently utilised for the tasks of localisation, path planning and navigation. Experimental results on a mobile robot in an unmodified laboratory and corridor environments demonstrate the validity of the approach.

Abstract

In this paper we present a novel approach to robust visual servoing. This method removes the feature tracking step from a typical visual servoing algorithm. We do not need correspondences of the features for deriving the control signal. This is achieved by modeling the image features as a Mixture of Gaussians in the current as well as desired images. Using Lyapunov theory, a control signal is derived to minimize a distance function between the two Gaussian mixtures. The distance function is given in a closed form, and its gradient can be efficiently computed and used to control the system. For simplicity, we first consider the 2D motion case. Then, the general case is presented by introducing the depth distribution of the features to control the six degrees of freedom. Experiments are conducted within a simulation framework to validate our proposed method.

Abstract

Video completion algorithms have concentrated on obtaining visually consistent solutions to fill-in the missing portions, without any emphasis on the physical correctness of the video. Resulting solutions thus use texture or image structure based cues and are limited in the situations they can handle. In this paper we take a model based signal processing approach to video completion [1]. Completion of the video is then defined as satisfying the given model by detecting and removing the error (selected parts of the video to be replaced). Given a probabilistic model, video completion then becomes an unsupervised learning algorithm with the input video giving a “noisy” version. Dense completion is the automatic inferencing of the “noise-less” or “true” video from the input. This approach finds a solution that satisfies visual coherence and is applicable to a wide variety of scenarios. We demonstrate the efficacy of our approach and its wide applicability using two scenarios.

Abstract

Restoration of documents has critical applications in document understanding as well as in digital libraries (for example as in book readers). This paper presents a method for restoration of document images, using a Maximum a Posteriori formulation. The advantage of our method is that the prior need not be learned from the training images. The extraction of a single high-quality enhanced text image from a set of degraded images can benefit from a strong prior knowledge, typical of text images. The restoration process should allow for discontinuities but at the same time discourage oscillations. These properties were represented in a total variation based prior model. Results indicate that our method is appropriate for document image restoration, where resolution enhancement is an added gain.

Abstract

This paper presents an edge-directed super-resolution algorithm for document images without using any training set. This technique creates an image with smooth regions in both the foreground and the background, while allowing sharp discontinuities across and smoothness along the edges. Our method preserves sharp corners in text images by using the local edge direction, which is computed first by evaluating the gradient field and then taking its tangent. Super-resolution of document images is characterized by bimodality, smoothness along the edges as well as subsampling consistency. These characteristics are enforced in a Markov Random Field (MRF) framework by defining an appropriate energy function. In our method, subsampling of super-resolution image will return the original lowresolution one, proving the correctness of the method. The super-resolution image, is generated by iteratively reducing this energy function. Experimental results on a variety of input images, demonstrate the effectiveness of our method for document image super-resolution.

Abstract

As large quantity of document images is getting archived by the digital libraries, there is a need for an efficient search strategies to make them available as per users information need. In this paper, we propose an effective word image matching scheme that achieves high performance in the presence of script variability, printing variation, degradation and word-form variants. A novel partial matching algorithm is designed for morphological matching of word form variants in a language. We formulate feature extraction scheme that extracts local features by scanning vertical strips of the word image and combining them automatically based on their discriminatory potential. We present detailed performance analysis of the proposed approach on English, Amharic and Hindi documents.