M Tech Dissertations

Permanent URI for this collectionhttp://drsr.daiict.ac.in/handle/123456789/3

Browse

Filters

2008 - 200912010 - 20111

Settings

Subject: search.filters.subject.Human-computer interaction

Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    ItemOpen Access
    Back-view based visual hand gesture recognition system
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2011) Sharma, Harish; Banerjee, Asim
    Gesture recognition is a fascinating area of research due to its applications to HCI (human computer interaction), entertainment, and communication between deaf/ mute people etc. Gesture can be dynamic or static depending upon the application. Static gestures can be called postures. Dynamic gestures are collection or sequence of postures. Our method is an attempt to classify various postures in American Sign Language (ASL) for a wearable computer device like “Sixth Sense” (developed at MIT media lab) [17]. We are working with new set of features including verticalhorizontal histogram of a posture-shape. We are using Linear Discriminant Analyzer (LDA) Classifier for the purpose of classification. Also, our work is an attempt to raise some issues regarding the kind of problem that can rise during posture-shape recognition and how a simple classification technique with a new feature set can give fairly good results.
  • Thumbnail Image
    ItemOpen Access
    Use of probabilistic context free grammar for natural language interface for an application
    (Dhirubhai Ambani Institute of Information and Communication Technology, 2008) Agarwal, Chetan; Jotwani, Naresh D.
    This thesis report deals with the development of a natural language interface for a database application (library system). This application uses Probabilistic Context Free Grammar as a computation model. The material presented in this thesis provides an overview to study the topics on Natural Language Processing, Probabilistic Context Free Grammar, Parsing and extracting the semantic from a pare tree. Probabilistic Context Free Grammar is a computational model which defines probabilistic relationships among a set of production rules for a given grammar. These probabilistic relationships among production rules have several advantages in natural language processing. The goal of natural language processing is to build computational models of Natural Languages for its analysis and generation. Application build takes a simple English sentence, parses the sentence, extracts the semantic and translates it into an SQL query. Application (library system) is coded in programming language JAVA. Though the given code is for a simple library system but can be modified according to requirements fulfilling the criteria of targeted task.