Vision Mouse. Saurabh Sarkar a* University of Cincinnati, Cincinnati, USA ABSTRACT 1. INTRODUCTION



Similar documents
The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis

A DATA MINING APPLICATION IN A STUDENT DATABASE

A Multi-Camera System on PC-Cluster for Real-time 3-D Tracking

Descriptive Models. Cluster Analysis. Example. General Applications of Clustering. Examples of Clustering Applications

What is Candidate Sampling

Causal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting

Face Verification Problem. Face Recognition Problem. Application: Access Control. Biometric Authentication. Face Verification (1:1 matching)

Vehicle Detection, Classification and Position Estimation based on Monocular Video Data during Night-time

A Multi-mode Image Tracking System Based on Distributed Fusion

Tracking with Non-Linear Dynamic Models

An Interest-Oriented Network Evolution Mechanism for Online Communities

Gender Classification for Real-Time Audience Analysis System

Frequency Selective IQ Phase and IQ Amplitude Imbalance Adjustments for OFDM Direct Conversion Transmitters

Automated Mobile ph Reader on a Camera Phone

An Enhanced Super-Resolution System with Improved Image Registration, Automatic Image Selection, and Image Enhancement

Recurrence. 1 Definitions and main statements

Conversion between the vector and raster data structures using Fuzzy Geographical Entities

VEHICLE DETECTION BY USING REAR PARTS AND TRACKING SYSTEM

A Simple Approach to Clustering in Excel

1. Measuring association using correlation and regression

MACHINE VISION SYSTEM FOR SPECULAR SURFACE INSPECTION: USE OF SIMULATION PROCESS AS A TOOL FOR DESIGN AND OPTIMIZATION

How To Calculate The Accountng Perod Of Nequalty

An interactive system for structure-based ASCII art creation

Support Vector Machines

Vehicle Detection and Tracking in Video from Moving Airborne Platform

Inter-Ing INTERDISCIPLINARITY IN ENGINEERING SCIENTIFIC INTERNATIONAL CONFERENCE, TG. MUREŞ ROMÂNIA, November 2007.

Exploiting Recommendation on Social Media Networks

The OC Curve of Attribute Acceptance Plans

Applied Research Laboratory. Decision Theory and Receiver Design

A Perfect QoS Routing Algorithm for Finding the Best Path for Dynamic Networks

Learning with Imperfections A Multi-Agent Neural-Genetic Trading System. with Differing Levels of Social Learning

Feature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College

Adaptive Fractal Image Coding in the Frequency Domain

Real-Time Whiteboard Capture and Processing Using a Video Camera for Teleconferencing

Extending Probabilistic Dynamic Epistemic Logic

Simple Interest Loans (Section 5.1) :

Loop Parallelization

A Secure Password-Authenticated Key Agreement Using Smart Cards

CHAPTER 14 MORE ABOUT REGRESSION

On-Line Fault Detection in Wind Turbine Transmission System using Adaptive Filter and Robust Statistical Features

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Fast Fuzzy Clustering of Web Page Collections

Sketching Sampled Data Streams

Section 5.3 Annuities, Future Value, and Sinking Funds

Abstract. Dublin City University

An Algorithm for Data-Driven Bandwidth Selection

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).

Distributed Multi-Target Tracking In A Self-Configuring Camera Network

Using Mean-Shift Tracking Algorithms for Real-Time Tracking of Moving Images on an Autonomous Vehicle Testbed Platform

APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT

Logistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification

CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK. Sample Stability Protocol

A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm

Realistic Image Synthesis

Enterprise Master Patient Index

Data Visualization by Pairwise Distortion Minimization

the Manual on the global data processing and forecasting system (GDPFS) (WMO-No.485; available at

Conferencing protocols and Petri net analysis

1 Example 1: Axis-aligned rectangles

An Empirical Study of Search Engine Advertising Effectiveness

The Application of Fractional Brownian Motion in Option Pricing

Detecting Global Motion Patterns in Complex Videos

Parallel Numerical Simulation of Visual Neurons for Analysis of Optical Illusion

Rotation Kinematics, Moment of Inertia, and Torque

A Hierarchical Anomaly Network Intrusion Detection System using Neural Network Classification

Biometric Signature Processing & Recognition Using Radial Basis Function Network

Lecture 3: Annuity. Study annuities whose payments form a geometric progression or a arithmetic progression.

ECE544NA Final Project: Robust Machine Learning Hardware via Classifier Ensemble

Forecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network

21 Vectors: The Cross Product & Torque

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) , info@teltonika.

A Fast Incremental Spectral Clustering for Large Data Sets

Luby s Alg. for Maximal Independent Sets using Pairwise Independence

Article received on July 15, 2008; accepted on April 03, 2009

Mining Multiple Large Data Sources

Network Aware Load-Balancing via Parallel VM Migration for Data Centers

A heuristic task deployment approach for load balancing

Forecasting the Direction and Strength of Stock Market Movement

M-applications Development using High Performance Project Management Techniques

QUANTIZATION. Outlines. Joseph RONSIN. Definition Scalar quantization. Vector quantization. Definition Distortion Non uniform quantization

Lecture 2: Single Layer Perceptrons Kevin Swingler

PERRON FROBENIUS THEOREM

Georey E. Hinton. University oftoronto. Technical Report CRG-TR May 21, 1996 (revised Feb 27, 1997) Abstract

Web Object Indexing Using Domain Knowledge *

FREQUENCY OF OCCURRENCE OF CERTAIN CHEMICAL CLASSES OF GSR FROM VARIOUS AMMUNITION TYPES

Finite Math Chapter 10: Study Guide and Solution to Problems

How To Know The Components Of Mean Squared Error Of Herarchcal Estmator S

Human Tracking by Fast Mean Shift Mode Seeking

Transcription:

Vson Mouse Saurabh Sarkar a* a Unversty of Cncnnat, Cncnnat, USA ABSTRACT The report dscusses a vson based approach towards trackng of eyes and fngers. The report descrbes the process of locatng the possble regons of nterest n the lve feed from the camera. It s done usng a probablty equaton and flterng t on a certan threshold probablty. Clusterng approach s used to locate eyes or the fngers. The report further dscusses how a neural network can be utlzed to control a robot hand and other potental applcatons. Keywords: Machne Vson, Clusterng, K-Mean, Artfcal Neural Network. 1. INTRODUCTION Computer mouse or joystck has become part of every computer we buy today. Despte ther popularty they have certan constrans. They are restrcted to a two dmensonal space. The user also needs to develop a hand eye coordnaton to effectvely control them. If we could control the objects n the computer wth our hands lke we control the objects n the real world, t would gve us a whole new level of computer operatng experence. The report here descrbes an attempt to capture the moton of human fngers and eyes to generate trackng data of ther moton. In past few years people have tred to solve ths problem through varous approaches 1,2. The system dscussed here takes n lve feed from a webcam and then usng a code wrtten n Matlab the computer tres to fnd out where the person s lookng. In another extenson of the code the system tres to trace the moton of human hand. In future the moton of the three fngers can be used to control the moton of a robot grpper wth three fngers. It s also possble to defne a plane n a three dmensonal space usng these three ponts. In the same way usng the relatve locaton of three fngers, we can defne a plane. Ths would enable us to work n three dmensonal envronments nstead of two. Fgure 1. Scence fcton move Mnorty Report depcts a futurstc computer nterface. Here actor Tom Cruse s usng hs hands to manpulate the mages on the screen. * Further author nformaton: (S correspondence to Saurabh Sarkar.) sarkarsh@emal.uc.edu

2. SYSTEM DETAIL Ths system descrbes the detal archtecture of the system. The mage processng whch nvolves flterng out of regons of nterest, clusterng the regons nto dfferent groups, tracng ther movement, are descrbed n ths secton. 2.1. Hardware Archtecture The system utlzes Image Acquston Toolbox (IAT) of Matlab. The IAT connects to a Wndows Meda Devce (WMD) whch s a webcam to acqure real tme mages. The System on whch the code s tested s Celeron laptop wth 512MB ram. The webcam used to acqure mages s a low of-the-self product wth a resoluton of 320 * 240 pxel mage sze. 2.2. Probablstc Estmaton of Regons of Interest The frames acqured from the camera s transformed nto a two dmensonal array contanng the probablty value of the locaton beng a part of object we are trackng. Ths done usng a multvarate probablty equaton: P(x,y) : Probablty matrx I (x,y) : Color value at x,y P( x, y) 3 ( = 1 = e ( I ( x, y) µ ) / 2σ )) (1) µ : Mean of color n th color doman σ : Standard devaton n th color doman Fgure 2. The mage on the left s a sample frame from the webcam. The mage n the mddle s the probablty plot of the locaton of eye. And one on the rght s the fltered mage wth the selected data ponts. The two dmenson array contanng probablty values s then fltered agan a certan threshold value to mnmze the nose and fnd out data ponts healthy to be passed on to the nest secton of the algorthm. 2.3. Clusterng The selected data ponts from the prevous secton of the algorthm are then clustered usng K-mean Clusterng algorthm. K-mean s a fast algorthm clusters objects based on attrbutes nto k-parttons. It assumes that the object attrbutes form the vector space. It tres to mnmze total ntra-cluster varance. V = K I = 1 X j S X j µ (2) 2 where there are k clusters S, = 1,2,...,k and µ s the centrod or mean pont of all the ponts. Depng of the number of objects we are trackng we change the K-mean clusterng parameter. For example where we track the eyes we use two clusters and where we track three fngers we use three clusters. The system uses the

[center,u,obj_fcn] = fcm(data, 2) command to locate the centrod of the ndvdual clusters. The centers are stored n the varable center. Fgure 3. The mage here has been clustered nto two clusters. The centers have been marked wth small crosses. 2.4. Artfcal Neural Network Approach to Fndng the Locaton of Gaze The author proposes an artfcal neural network approach to calculate the locaton of where the user s currently lookng at. The center of the gaze can be found out by averagng the x and y values of both the centers of the clusters. Feedng ths nput nto a neural network we can get the locaton of the orgnal gaze. 2.5. Three Pont Trackng of Fngers In ths system nstead of trackng eyes the system tracks three fngers of the user. The algorthm used to track the eyes s same here. The only varatons are color the algorthm looks for and number of clusters. Fgure 4. The mage on the left s a frame from the feed of camera and the mage on rght shows the output of the system. The small red crosses denote the locaton of the fngers found by the algorthm. 3. FUTURE APPLICATIONS The eye trackng system can help us mprove our flexblty of how use our computers today. We can replace the computer pontng devces lke mouse wth ths system. The cursor would smply pont where we look. Ths system can also be used as a feedback system. Where we can know where user has been lookng and for how much tme. The system can alert the user f he msses some mportant stuff dsplayed on the computer. The fnger trackng system wll open up more dmensons to how we use and nteract wth computers today. Today computers nterfaces are largely two dmensonal envronments. By trackng three or more fngers we can have three dmensonal nterfaces. Ths would open up new ways of lookng at data and nformaton n three dmensons. Ths concept can further be exted to tele-robotcs. The moton of the fngers captured by the system can be transmtted over nternet to a remote robotc three fnger robotcs hand.

REFERENCES 1. Baluja, S. & Pomerleau, D.A. Non-Intrusve Gaze Trackng Usng Artfcal Neural Networks, Advances n Neural Informaton Processng Systems (NIPS) 6. Cowan J.D., Tesauro, G. & Alspector, J. (eds.) Morgan Kaufmann Publshers, San Francsco, CA., 1994. 2. P. Ftzpatrck, Detectng head orentaton, MIT APPENDIX A. MATLAB CODE clc; clear all; vd = vdeonput('wnvdeo', 1); prevew(vd); pause(2); for z=1:900 data=getsnapshot(vd); I=double(data); J=exp(-1*(((I(:,:,1)-14).^2)/(800)+((I(:,:,2)-51).^2)/(800)+((I(:,:,3)-7).^2)/(800)))*100; sz=sze(j); c=0; X=J; data=0; for =1:sz(1) for j=1:sz(2) f(j(,j)>70) X(,j)=20; c=c+1; data(c,1)=; data(c,2)=j; else X(,j)=0; [center,u,obj_fcn] = fcm(data, 2); for =1:2 for j=-5:5 x=round(center(,1))+j; y=round(center(,2)); f (x<0) x=0; X(x,y)=200;

for j=-5:5 x=round(center(,1)); y=round(center(,2))+j; f (y<1) y=1; X(x,y)=200; D=X; for =1:sz(1) dy=round((center(1,2)+center(2,2))/2); f (dy<1) dy=1; D(,dy)=100; for =1:sz(2) dy=round((center(1,1)+center(2,1))/2); f (dy<1) dy=1; D(dy,)=100; mage(d); clear center; clear U; clear obj_fcn;