scispace - formally typeset
Search or ask a question

Showing papers by "Gaurav Harit published in 2016"


Journal ArticleDOI
TL;DR: A functional unobtrusive Indian sign language recognition system was implemented and tested on real world data and proposes a method for a novel, low-cost and easy-to-use application, for Indian Sign Language recognition, using the Microsoft Kinect camera.
Abstract: People with speech disabilities communicate in sign language and therefore have trouble in mingling with the able-bodied. There is a need for an interpretation system which could act as a bridge between them and those who do not know their sign language. A functional unobtrusive Indian sign language recognition system was implemented and tested on real world data. A vocabulary of 140 symbols was collected using 18 subjects, totalling 5041 images. The vocabulary consisted mostly of two-handed signs which were drawn from a wide repertoire of words of technical and daily-use origins. The system was implemented using Microsoft Kinect which enables surrounding light conditions and object colour to have negligible effect on the efficiency of the system. The system proposes a method for a novel, low-cost and easy-to-use application, for Indian Sign Language recognition, using the Microsoft Kinect camera. In the fingerspelling category of our dataset, we achieved above 90% recognition rates for 13 signs and 100% recognition for 3 signs with overall 16 distinct alphabets (A, B, D, E, F, G, H, K, P, R, T, U, W, X, Y, Z) recognised with an average accuracy rate of 90.68%.

49 citations


Proceedings ArticleDOI
01 Dec 2016
TL;DR: A framework for the matching and retrieval of similar architectural floorplans under the query by example paradigm is proposed and a novel graph spectral embedding feature is proposed to uniquely represent the layout of the architectural floorplan.
Abstract: An automatic lookup tool, which matches and retrieves similar floorplans from a large repository of digitized architectural floorplans can prove to be of immense help for the architects while designing new projects. In this paper, we have proposed a framework for the matching and retrieval of similar architectural floorplans under the query by example paradigm. We propose a room layout segmentation and adjacent room detection algorithm to represent layouts as an undirected graph. We have also proposed a novel graph spectral embedding feature to uniquely represent the layout of the architectural floorplan. This helps in effective and efficient matching of the room layouts. Room semantics in terms of both the room structures and room decor is used to retrieve similar floorplans from the repository. To match the semantic similarity between a pair of floorplans, we have proposed a two stage matching technique. We have validated the effectiveness of our proposed framework by performing experiments on publicly available floorplan dataset and achieved high retrieval accuracy.

19 citations


Proceedings ArticleDOI
18 Dec 2016
TL;DR: An algorithm is proposed that assesses how well a person practices Sun Salutation in terms of grace and consistency and introduces a dataset for Sun Saluting videos comprising 30 sequences of perfect Sun Salutations performed by seven experts to train the system.
Abstract: There are many exercises which are repetitive in nature and are required to be done with perfection to derive maximum benefits. Sun Salutation or Surya Namaskar is one of the oldest yoga practice known. It is a sequence of ten actions or 'asanas' where the actions are synchronized with breathing and each action and its transition should be performed with minimal jerks. Essentially, it is important that this yoga practice be performed with Grace and Consistency. In this context, Grace is the ability of a person to perform an exercise with smoothness i.e. without sudden movements or jerks during the posture transition and Consistency measures the repeatability of an exercise in every cycle. We propose an algorithm that assesses how well a person practices Sun Salutation in terms of grace and consistency. Our approach works by training individual HMMs for each asana using STIP features[11] followed by automatic segmentation and labeling of the entire Sun Salutation sequence using a concatenated-HMM. The metric of grace and consistency are then laid down in terms of posture transition times. The assessments made by our system are compared with the assessments of the yoga trainer to derive the accuracy of the system. We introduce a dataset for Sun Salutation videos comprising 30 sequences of perfect Sun Salutation performed by seven experts and used this dataset to train our system. While Sun Salutation can be judged on multiple parameters, we focus mainly on judging Grace and Consistency.

9 citations


Proceedings ArticleDOI
18 Dec 2016
TL;DR: A non-parametric data driven generation scheme able to mimic the variation observed in handwritten glyph samples to synthesize natural looking synthetic glyphs that can find application in text personalization, or in generation of synthetic data for recognition systems.
Abstract: We propose a framework for synthesis of natural semi cursive handwritten Latin script that can find application in text personalization, or in generation of synthetic data for recognition systems. Our method is based on the generation of synthetic n-gram letter glyphs and their subsequent concatenation. We propose a non-parametric data driven generation scheme that is able to mimic the variation observed in handwritten glyph samples to synthesize natural looking synthetic glyphs. These synthetic glyphs are then stitched together to form complete words, using a spline based concatenation scheme. Further, as a refinement, our method is able to generate pen-lifts, giving our results a natural semi-cursive look. Through subjective experiments and detailed analysis of the results, we demonstrate the effectiveness of our formulation in being able to generate natural looking synthetic script.

1 citations


Posted Content
TL;DR: An efficient graph-based matching algorithm, integrated with hash-based indexing, to prune a possibly large search space, and handles cases of segmentation pre-processing errors with a symmetry maximization-based strategy and accounting for multiple domain-specific plausible segmentation hypotheses.
Abstract: Layouts and sub-layouts constitute an important clue while searching a document on the basis of its structure, or when textual content is unknown/irrelevant. A sub-layout specifies the arrangement of document entities within a smaller portion of the document. We propose an efficient graph-based matching algorithm, integrated with hash-based indexing, to prune a possibly large search space. A user can specify a combination of sub-layouts of interest using sketch-based queries. The system supports partial matching for unspecified layout entities. We handle cases of segmentation pre-processing errors (for text/non-text blocks) with a symmetry maximization-based strategy, and accounting for multiple domain-specific plausible segmentation hypotheses. We show promising results of our system on a database of unstructured entities, containing 4776 newspaper images.

Book ChapterDOI
19 Dec 2016
TL;DR: This work makes use of allographic features at sub-word level to exploit the discriminative properties of features that belong to the same cluster, in a supervised approach, to achieve writer identification rates close to 63% on the handwritten words drawn from a dataset by 10 writers.
Abstract: In this work we present a framework for recognizing writer for a handwritten word. We make use of allographic features at sub-word level. Our work is motivated by previous techniques which make use of a codebook. However, instead of encoding the features using the codewords, we exploit the discriminative properties of features that belong to the same cluster, in a supervised approach. We are able to achieve writer identification rates close to 63% on the handwritten words drawn from a dataset by 10 writers. Our work has application in scenarios where multiple writers write/annotate on the same page.