Number 20

Security over the years remains a major concern of all especially the law enforcement agencies. One way of arresting this concern is to be able to reliably detecting deception. Detecting deception remains a difficult task as no perfect method has been found for the detection. Past researches made use of a single cue (verbal or nonverbal), it was found that examining combinations of cues will detect deception better than examining a single cue. Since no single verbal or nonverbal cue is able to successfully detect deception the research proposes to use both the verbal and nonverbal cues to detect deception. Therefore, this research aims to develop a KNN model for classifying the extracted verbal, nonverbal and VerbNon features as deceptive or truthful. The system extracted desired features from the dataset of Perez-Rosas. The verbal cues capture the speech of the suspect while the nonverbal cues capture the facial expressions of the suspect. The verbal cues include the voice pitch (in terms of variations), frequency perturbation also known as jitters, pauses (voice or silent), and speechrate (is defined as the rate at which the suspect is speaking). The Praat (a tool for speech analysis) was used in

[1]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[2]  Joachim von zur Gathen,et al.  Algorithms for Exponentiation in Finite Fields , 2000, J. Symb. Comput..

[3]  Jonathan R. Agre,et al.  An Integrated Architecture for Cooperative Sensing Networks , 2000, Computer.

[4]  Vaduvur Bharghavan,et al.  Routing in ad-hoc networks using minimum connected dominating sets , 1997, Proceedings of ICC'97 - International Conference on Communications.

[5]  Joe Navarro,et al.  Detecting deception , 1997, Behavioral and Brain Sciences.

[6]  V.K. Bhargava,et al.  A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields , 1993, IEEE Trans. Computers.

[7]  Jiuqiang Liu,et al.  Maximal independent sets in bipartite graphs , 1993, J. Graph Theory.

[8]  A. Menezes,et al.  Applications of Finite Fields , 1992 .

[9]  P. Ekman An argument for basic emotions , 1992 .

[10]  Abraham Lempel,et al.  Self-Complementary Normal Bases in Finite Fields , 1988, SIAM J. Discret. Math..

[11]  Charles C. Wang,et al.  An Algorithm to Design Finite Field Multipliers Using a Self-Dual Normal Basis , 1987, IEEE Trans. Computers.

[12]  Anthony Ephremides,et al.  The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm , 1981, IEEE Trans. Commun..

[13]  Stephen T. Hedetniemi,et al.  Linear Algorithms on Recursive Representations of Trees , 1979, J. Comput. Syst. Sci..

[14]  S. Perlis,et al.  Normal bases of cyclic fields of prime-power degree , 1942 .

[15]  A. Vrij Telling and detecting lies as a function of raising the stakes , 2000 .

[16]  Takeo Kanade,et al.  A System for Video Surveillance and Monitoring , 2000 .

[17]  S. Hedetniemi,et al.  Domination in graphs : advanced topics , 1998 .

[18]  Shuhong Gao Normal Bases over Finite Fields , 1993 .

[19]  D. Gursky The Unschooled Mind. , 1991 .

[20]  M. Zuckerman Verbal and nonverbal communication of deception , 1981 .