open gaze and mouse analyzer

  •        0

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

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

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.

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.

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

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


Release history of Mobile-Data-ITU

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


Implementation of Levenshtein distance in C++

Packinon: Polyhedra, Packing, Spheres


Programs for the algorithmic distribution of points, especially in or on spheres, and the analysis and display of these distributions. Areas of interest include ball packs, shell packs, polyhedra and cellular automata.

XRNS-PHP


XRNS-PHP (was) a collection of command-line scripts for Renoise - http://www.renoise.com/ is contemporary music composition tool with XML-based file formats; making it possible to develop PHP scripts for various areas of interest.

optic.io


Mouse controlled by facial gestures and gaze tracking (currently not useful; don't open this repository)