open gaze and mouse analyzer

  •        92

Ogama allows recording and analyzing eye- and mouse-tracking data from slideshow eyetracking experiments in parallel. It´s developed in C#.NET and provides attention maps, AOIS, saliency, replay, levensthein distances and many more visualization tools.

http://ogama.codeplex.com/

Tags
Implementation
License
Platform

   




Related Projects

PolyMouse - Fusion of gaze and head tracking for fast & accurate hands-free pointing


PolyMouse is a fusion of gaze tracking and head tracking to achieve hands-free pointing. It aims to be competitive in both speed and accuracy with a traditional mouse. It is a product of my research at the University of Waterloo HCI lab.It does this by using eye gaze to quickly determine an imprecise area of interest and then uses small head movements to refine the position of the cursor onto a small target.

geomask - Google Maps tool to highlight areas of interest on a map


Google Maps tool to highlight areas of interest on a map

eshitsuji - Twitter bot used to monitor areas of interest.


Twitter bot used to monitor areas of interest.

mousewhirl - context-specific attempt at isolating mouse cages as regions of interest


context-specific attempt at isolating mouse cages as regions of interest

WWW-MySociety-Gaze - Release history of WWW-MySociety-Gaze


Release history of WWW-MySociety-Gaze



levenshtein - This is the Go implementation to calculate Levenshtein Distance.


The library is fully capable of working with non-ascii strings. But the strings are not normalized. That is left as a user-dependant use case. Please normalize the strings before passing it to the library if you have such a requirement.Words selected are - "levenshtein" and "frankenstein".

ITUGazeTrackingLib - I'm just tracking http://www.gazegroup.org/downloads/23-gazetracker here


I'm just tracking http://www.gazegroup.org/downloads/23-gazetracker here

RentItClient - The ITU client of the ITU/SMU RentIt collaboration.


The ITU client of the ITU/SMU RentIt collaboration.

closestmatch - Golang library for fuzzy matching within a set of strings :page_with_curl:


closestmatch is a simple and fast Go library for fuzzy matching an input string to a list of target strings. closestmatch is useful for handling input from a user where the input (which could be mispelled or out of order) needs to match a key in a database. closestmatch uses a bag-of-words approach to precompute character n-grams to represent each possible target string. The closest matches have highest overlap between the sets of n-grams. The precomputation scales well and is much faster and more accurate than Levenshtein for long strings.closestmatch is more accurate than Levenshtein for long strings (like in the test corpus).

bloofi - Bloofi: A java implementation of multidimensional Bloom filters


Bloom filters are probabilistic data structures commonly used for approximate membership problems in many areas of Computer Science (networking, distributed systems, databases, etc.). With the increase in data size and distribution of data, problems arise where a large number of Bloom filters are available, and all them need to be searched for potential matches. As an example, in a federated cloud environment, each cloud provider could encode the information using Bloom filters and share the Bloom filters with a central coordinator. The problem of interest is not only whether a given element is in any of the sets represented by the Bloom filters, but which of the existing sets contain the given element. This problem cannot be solved by just constructing a Bloom filter on the union of all the sets. Instead, we effectively have a multidimensional Bloom filter problem: given an element, we wish to receive a list of candidate sets where the element might be. To solve this problem, we consider 3 alternatives. Firstly, we can naively check many Bloom filters. Secondly, we propose to organize the Bloom filters in a hierarchical index structure akin to a B+ tree, that we call Bloofi. Finally, we propose another data structure that packs the Bloom filters in such a way as to exploit bit-level parallelism, which we call Flat-Bloofi. Our theoretical and experimental results show that Bloofi and Flat-Bloofi provide scalable and efficient solutions alternatives to search through a large number of Bloom filters.We build on an existing Bloom filter library (https://github.com/magnuss/java-bloomfilter) by Magnus Skjegstad which we embedded and modified. We also use junit and Hamcrest which we include as jar files for your convenience.

Mobile-Data-ITU - Release history of Mobile-Data-ITU


Release history of Mobile-Data-ITU

MySQL-Damerau-Levenshtein - MySQL implementation of the Damerau/Levenshtein distance


MySQL implementation of the Damerau/Levenshtein distance

levenshtein-distance - ruby implementation of levenshtein distance


ruby implementation of levenshtein distance

levenshtein - Some implementations of the Levenshtein distance algorighm


Some implementations of the Levenshtein distance algorighm

damerau-levenshtein - JavaScript implementation of the Damerau-Levenshtein edit distance algorithm


JavaScript implementation of the Damerau-Levenshtein edit distance algorithm

Text-Levenshtein - Release history of Text-Levenshtein


Release history of Text-Levenshtein

text-levenshtein - A implementation of the Levenshtein edit distance in Perl 6 ported from Perl 5.


A implementation of the Levenshtein edit distance in Perl 6 ported from Perl 5.

levenshtein - Our (modified) version of the levenshtein gem for calculating edit distance


Our (modified) version of the levenshtein gem for calculating edit distance

coreland-levenshtein - Implementation of Levenshtein distance algorithm


Implementation of Levenshtein distance algorithm

Levenshtein-distance - Implementation of Levenshtein distance in C++


Implementation of Levenshtein distance in C++