Patent Abstract:
The present disclosure envisages a computer implemented system and method to derive a relationship between Elementary Cognitive Tasks (ECTs) and the underlying cognitive skills of individuals through Electroencephalogram (EEG) analysis. The aim is to evaluate or improve the perceptual-cognitive traits of a subject that comprises disintegrating a given task into elementary task that are further mapped to identified cognitive categories of Bloom&#39;s Taxonomy, upon which a cluster analysis is performed. The separation index between the clusters thereafter establishes that individuals have different thinking process which is characteristics of that subject.

Full Description:
CROSS REFERENCE TO RELATED APPLICATIONS 
       [0001]    This application is a U.S. National Stage Filing under 35 U.S.C. §371 and claims priority from International Application No. PCT/IB2016/051972, filed on Apr. 7, 2016, which application claims priority under 35 U.S.C. §119 from India Application No. 1444/MUM/2015, filed on Apr. 7, 2015. The entire contents of the aforementioned applications are incorporated herein by reference. 
     
    
     TECHNICAL FIELD 
       [0002]    This disclosure relates generally to the field of perceptual cognitive traits, and more particularly to a system and method of estimating and improvising perceptual-cognitive traits of a subject. 
       BACKGROUND 
       [0003]    Cognitive load, in general, is defined by the amount of short term memory used by an individual for a given task and primarily depends on how an individual perceives, assimilates and responds to an external stimulus. Usually, the actions of an individual are mediated and influenced by external environment and ability of an individual to understand and effectively interact with the environment is dependent on the cognitive traits of an individual. Hence in order to achieve the best results and exhibit best performance, the cognitive load on the individual should be optimum since too much cognitive load might result in stress, anxiety, etc. On the other hand, very less cognitive load is actually a un-utilization of one&#39;s cognitive capacity and ability. 
         [0004]    It will however be agreeable that optimum level of cognitive load may vary from one individual to another, and is basically dependent on inherent cognitive skills of an individual. Developing basic cognitive skills of an individual, however remains an ardent task, to which education has a supreme role to play. The process by which a person learns best is also different across different people. 
         [0005]    Bloom&#39;s taxonomy of learning domains is known to promote higher forms of thinking in education such as analyzing and evaluating concepts, processes, procedures, and principles. It majorly defines six major categories of cognitive skills that are arranged according to the increasing order of cognitive maturity as knowledge, comprehension, application, analysis, synthesis and evaluation. There are usually two measures of cognitive load: 
         [0006]    a) Subjective Measures of Cognitive Load—This domain has been well read by many to find that various instructional methods can be used to improve the short term memory operations 
         [0007]    b) Objective Measures of Cognitive Load—This includes estimation using different physiological signals and in order to measure the cognitive skills of an individual, particularly in the field of education area is relatively a new area of search. To make it more accessible, the sensing mechanism needs to be low cost and commercially available. 
         [0008]    Recently, there have been various works to analyze the cognitive load of an individual for a given task using commercial EEG devices. As part of the education psychology, the cognitive load is analyzed based on the continuous EEG signals during the learning from hypertext and multimedia contents. EEG signals are being used in diverse application areas like estimation of video quality, ease of reading texts, and scientific problem solving. Apart from EEG, other physiological parameters like eye tracking, skin conductance and heart-rate are also used to investigate the effect of stimulus on the mental stress. There has been an attempt in past to study the students&#39; learning trajectories and teachers&#39; effect on problem solving abilities, however there has been complete reliance on the students&#39; outcomes and never used brain signals. Many have also used Elementary Cognitive Tasks (ECTs) to investigate how the level of complexity (low and high cognitive load) manifests in the EEG and various physiological parameters. 
         [0009]    However, none of the above works objectively analyze the relationships between the various ECTs or focus on investigating the relationship between the ECTs and Bloom&#39;s categories. 
       OBJECTIVES 
       [0010]    In accordance with the present invention, the primary objective is to provide a system and method for analyzing elementary cognitive tasks with Bloom&#39;s Taxonomy using low cost commercial EEG device. 
         [0011]    Another objective of the invention is to provide a system and method to objectively analyze the relationship among various ECTs and also between various elementary cognitive tasks (ECTs) and Bloom&#39;s categories. 
         [0012]    Another objective of the invention is to provide a system and method to characterize an unknown stimulus and also derive various performance attributes of a subject. 
         [0013]    Yet another objective of the invention is to provide a method and system for estimating or improvising perceptual-cognitive traits of a subject by creating Electroencephalogram (EEG) models for the cognitive skills defined in the Bloom&#39;s taxonomy. 
         [0014]    A further object of this disclosure is to evaluate cognitive behavior of an individual using duster analysis of EEG features for different stimuli or tasks. 
         [0015]    Other objects and advantages of the present invention will be more apparent from the following non-restrictive description of illustrative embodiments thereof, when read in conjunction with the accompanying figures, which are not intended to limit the scope of the present disclosure. 
       SUMMARY 
       [0016]    Before the present methods, systems, and hardware enablement are described, it is to be understood that this invention in not limited to the particular systems, and methodologies described, as there can be multiple possible embodiments of the present invention which are not expressly illustrated in the present disclosure. It is also to be understood that the terminology used in the description is for the purpose of describing the particular versions or embodiments only, and is not intended to limit the scope of the present invention which will be limited only by the appended claims. 
         [0017]    Accordingly, in a preferred embodiment the disclosure provides a method for estimating or improvising perceptual-cognitive traits of a subject. The steps for estimating perceptual-cognitive traits of a subject comprise, firstly retrieving and pre-processing the data and associated metadata indicative of brainwave activity of the subject to obtain effect of a plurality of elementary cognitive tasks, followed by identification of cognitive categories within a cognitive domain of cognitive learning model. Next, plurality of elementary cognitive tasks to be performed by the subject are mapped with the identified cognitive categories and duster analysis on each of the mapped elementary cognitive tasks is performed. Further, separation index values are determined from cluster analysis in relation to the identified cognitive categories and finally metrics are generated from the separation index values to estimate the perceptual-cognitive traits of a subject. 
         [0018]    According to another embodiment of the disclosure, the data is electroencephalogram (EEG) signals captured using low resolution EEG devices. 
         [0019]    In one significant embodiment of the present disclosure, the system for estimating and improvising perceptual-cognitive traits of a subject is disclosed. The system broadly comprises a processor, a data bus coupled to said processor; and a computer-usable medium embodying computer code, said computer-usable medium being coupled to said data bus, said computer program code comprising instructions executable by said processor and configured for: 
         [0020]    retrieving and pre-processing data and associated metadata indicative of brainwave activity of the subject to obtain a plurality of elementary cognitive tasks; 
         [0021]    identifying cognitive categories within a cognitive domain of cognitive learning model; 
         [0022]    mapping plurality of elementary cognitive tasks to be performed by the subject with identified cognitive categories; 
         [0023]    performing duster analysis on each of the mapped elementary cognitive tasks and determining separation index values therefrom the cluster analysis in relation to the identified cognitive categories; and 
         [0024]    generating metrics from the separation index values for estimation or improvisation of perceptual-cognitive traits of the subject. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0025]    The foregoing summary, as well as the following detailed description of preferred embodiments, are better understood when read in conjunction with the appended drawings. For the purpose of illustrating the invention, there is shown in the drawings exemplary constructions of the invention; however, the invention is not limited to the specific methods and system disclosed. In the drawings: 
           [0026]      FIG. 1  of the present disclosure is a schematic functional block diagram of an exemplary architecture for the system, in accordance with one embodiment of present disclosure; 
           [0027]      FIG. 2  is a block diagram illustrating the flow of EEG signal processing, in accordance with one embodiment of present disclosure; 
           [0028]      FIG. 3  is a graph showing comparison of various feature components for F I   peak  F I   mean  in accordance with one preferred embodiment of present disclosure; and 
           [0029]      FIG. 4  is a graph showing result of Xie-Beni index variation among subjects for different feature combinations, in accordance with one embodiment of present disclosure. 
       
    
    
     DETAILED DESCRIPTION 
       [0030]    Some embodiments of this invention, illustrating all its features, will now be discussed in detail. 
         [0031]    The words “comprising,” “having,” “containing,” and “including,” and other forms thereof, are intended to be equivalent in meaning and be open ended in that an item or items following any one of these words is not meant to be an exhaustive listing of such item or items, or meant to be limited to only the listed item or items. 
         [0032]    It must also be noted that as used herein and in the appended claims, the singular forms “a,” “an,” and “the” include plural references unless the context clearly dictates otherwise. Although any systems and methods similar or equivalent to those described herein can be used in the practice or testing of embodiments of the present invention, the preferred, systems and methods are now described. 
         [0033]    The disclosed embodiments are merely exemplary of the invention, which may be embodied in various forms. 
         [0034]    The elements illustrated in the Figures interoperate as explained in more detail below. Before setting forth the detailed explanation, however, it is noted that all of the discussion below, regardless of the particular implementation being described, is exemplary in nature, rather than limiting. For example, although selected aspects, features, or components of the implementations are depicted as being stored in memories, all or part of the systems and methods consistent with the attrition warning system and method may be stored on, distributed across, or read from other machine-readable media. 
         [0035]    The techniques described above may be implemented in one or more computer programs executing on (or executable by) a programmable computer including any combination of any number of the following: a processor, a storage medium readable and/or writable by the processor (including, for example, volatile and non-volatile memory and/or storage elements), plurality of input units, and plurality of output devices. Program code may be applied to input entered using any of the plurality of input unit to perform the functions described and to generate an output displayed upon any of the plurality of output device. 
         [0036]    Each computer program within the scope of the claims below may be implemented in any programming language, such as assembly language, machine language, a high-level procedural programming language, or an object-oriented programming language. The programming language may, for example, be a compiled or interpreted programming language. Each such computer program may be implemented in a computer program product tangibly embodied in a machine-readable storage device for execution by a computer processor. 
         [0037]    Method steps of the invention may be performed by one or more computer processors executing a program tangibly embodied on a computer-readable medium to perform functions of the invention by operating on input and generating output. Suitable processors include, by way of example, both general and special purpose microprocessors. Generally, the processor receives (reads) instructions and data from a memory (such as a read-only memory and/or a random access memory) and writes (stores) instructions and data to the memory. Storage devices suitable for tangibly embodying computer program instructions and data include, for example, all forms of non-volatile memory, such as semiconductor memory devices, including EPROM, EEPROM, and flash memory devices; magnetic disks such as internal hard disks and removable disks; magneto-optical disks; and CD-ROMs. Any of the foregoing may be supplemented by, or incorporated in, specially-designed ASICs (application-specific integrated circuits) or FPGAs (Field-Programmable Gate Arrays). A computer can generally also receive (read) programs and data from, and write (store) programs and data to, a non-transitory computer-readable storage medium such as an internal disk (not shown) or a removable disk. 
         [0038]    Any data disclosed herein may be implemented, for example, in one or more data structures tangibly stored on a non-transitory computer-readable medium. Embodiments of the invention may store such data in such data structure(s) and read such data from such data structure(s). 
       Definitions 
       [0039]    Bloom&#39;s Taxonomy: Bloom&#39;s Taxonomy is an essential model for promoting higher forms of thinking in an individual by providing appropriate learning conditions. Bloom&#39;s taxonomy classifies different learning objectives into three domains, namely, Cognitive, Affective and Psychomotor, and the element of discussion for present disclosure is Cognitive domain that involves knowledge, comprehension, application, analysis and evaluation of a particular topic. 
         [0040]    Cognitive load primarily depends on how an individual perceives, assimilates and responds to an external stimulus. The present disclosure attempts to create Electroencephalogram (EEG) models for the cognitive skills defined in the Bloom&#39;s taxonomy using low cost, commercial EEG devices. 
         [0041]    The present disclosure comprises a system which may be used for estimating and improvising perceptual-cognitive traits of a subject. The embodiments of the present disclosure may be applied in educational psychology to provide individual assistance according to one&#39;s learning style and traits, although it should be understood that the scope of the present invention is in no way limited to these applications. 
         [0042]    In an embodiment of the present disclosure, as presented in  FIG. 1 , the system  100  comprises a processor  104 , a data bus  106  coupled to said processor  104 , and a computer-usable medium like a memory  102  embodying computer code and coupled to a data bus  106 , wherein the computer program code comprises instructions executable by said processor  104  and is configured to relate the brain signals generated by various cognitive tasks to different cognitive categories of Bloom&#39;s taxonomy. The actual modulations originating in brain are captured which in turn control the ultimate thinking process for each and every response/action, eventually enabling measurement of improvisation in cognitive skills of an individual. 
         [0043]    While different techniques may be used for reading and analyzing brain function, most widely used ones being—Electroencephalogram (EEG), functional magnetic resonance imaging (fMRI), functional near infra-red spectroscope (fNIRs), positron emission tomography (PET) etc. For the purposes of present disclosure, EEG has been selected as it is a non-invasive and relatively in-expensive method having excellent temporal resolution. More specifically, 14 lead EEG device from Emotiv has been used for capturing and analyzing brain signals. 
         [0044]    A set of Elementary Cognitive Tasks (hereinafter referred to as ECTs) focusing on visual perceptions and cognitive speed is recognized and defined as the stimulus as ECTs are directly linked with general mental ability and intelligence of an individual. As a non-limiting example, the factors that are being considered for visual perception includes speed of closure and flexibility of closure. 
         [0045]    In one exemplary embodiment, the stimulus is presented and EEG data and associated metadata is captured using python based capture tool. For EEG data collection a 14-lead Emotiv headset is used. The subject is presented with a set of questions that he is expected to answer using any of plurality of input devices  108  (referring to  FIG. 1 )—a cursor control, such as a mouse, a trackball, or cursor direction keys for communicating information and command selections to processor. After completion of questionnaire and data collection process, the subject is evaluated in terms of response time and accuracy and the result is displayed on the commonly known output device  110  (shown in  FIG. 1 ). 
         [0046]    The EEG signals and associated metadata are analyzed as depicted in  FIG. 2 . The metadata may include the time stamps for the EEG signals; presentation time of the stimulus, instruction and fixation slides; time stamps and the entries of the user responses. The relation between the accuracy and the response time of the subjects for each stimulus are analyzed. 
         [0047]    The raw EEG signal is preprocessed and segmented based on predefined markers and then analyzed in time-frequency domain for feature extraction and clustering as shown in  FIG. 2 . First in the pre-processing step, the signal is normalized to zero mean and fed to a low pass filter of predefined frequency range, e.g. 35 Hz to limit the signal to the frequency band of interest. EEG signal is vulnerable to different artifacts, the dominant of them being the eye blink related artifact. 
         [0048]    One of the described embodiments of the present disclosure, Hilbert-Huang Transform (HHT) based approach is used to remove the artifact. After that the clean data is segmented into baseline and trial epochs. Then these epochs are partitioned in windows of N seconds with 50% overlap. 
         [0049]    In one selected embodiment, N is selected to be 20 seconds for baseline epoch and 5 seconds for trial epochs. This is particularly done to examine multiple trial windows with a single baseline window. Both the trial and baseline windows are decomposed in the time-frequency domain using S-transform of N seconds with 50% overlap. From this decomposition the mean frequencies are computed using the following formula: 
         [0000]    
       
         
           
             
               
                 
                   
                     f 
                      
                     
                       ( 
                       ω 
                       ) 
                     
                   
                   = 
                   
                     
                       
                         ∑ 
                         
                           i 
                           = 
                           0 
                         
                         
                           n 
                           - 
                           1 
                         
                       
                        
                       
                           
                       
                        
                       
                         
                           I 
                           
                             ω 
                              
                             
                               ( 
                               i 
                               ) 
                             
                           
                         
                          
                         
                           f 
                           
                             ω 
                              
                             
                               ( 
                               i 
                               ) 
                             
                           
                         
                       
                     
                     
                       
                         ∑ 
                         
                           i 
                           = 
                           0 
                         
                         
                           n 
                           - 
                           1 
                         
                       
                        
                       
                         I 
                         
                           ω 
                            
                           
                             ( 
                             i 
                             ) 
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   1 
                   ) 
                 
               
             
           
         
       
     
         [0000]    Where ω is the frequency band under analysis, n is the number of frequency bins in ω, f i  is the frequency at bin i and I i  is the energy density of ω at frequency bin i 
         [0050]    In a single window, the maximum and average powers of all the mean frequencies are extracted for both trial and baseline. Finally the feature vector is computed with the peak and average energy shifts (ΔE Ii   max , ΔE Ii   avg ), the corresponding frequency shifts (Δf Ii   max , Δf Ii   avg ) between the baseline and trial in the frequency band i for channel I. Here both alpha (α) and theta (θ) bands are considered. The feature vectors used are given by (2), where F I   peak  and F I   mean  respectively denote the feature vectors comprising features computed from maximum and average powers of all the mean frequencies for channel I. 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         
                           
                             
                               F 
                               peak 
                               I 
                             
                             = 
                             
                               { 
                               
                                 
                                   Δ 
                                    
                                   
                                       
                                   
                                    
                                   
                                     E 
                                     max 
                                     
                                       I 
                                       , 
                                       a 
                                     
                                   
                                 
                                 , 
                                 
                                   Δ 
                                    
                                   
                                       
                                   
                                    
                                   
                                     f 
                                     max 
                                     
                                       I 
                                       , 
                                       a 
                                     
                                   
                                 
                                 , 
                                 
                                   Δ 
                                    
                                   
                                       
                                   
                                    
                                   
                                     E 
                                     max 
                                     
                                       I 
                                       , 
                                       θ 
                                     
                                   
                                 
                                 , 
                                 
                                   Δ 
                                    
                                   
                                       
                                   
                                    
                                   
                                     f 
                                     max 
                                     
                                       I 
                                       , 
                                       θ 
                                     
                                   
                                 
                                 , 
                                 
                                   L 
                                   max 
                                   I 
                                 
                               
                               } 
                             
                           
                         
                       
                       
                         
                           
                             
                               F 
                               mean 
                               I 
                             
                             = 
                             
                               { 
                               
                                 
                                   Δ 
                                    
                                   
                                       
                                   
                                    
                                   
                                     E 
                                     avg 
                                     
                                       I 
                                       , 
                                       a 
                                     
                                   
                                 
                                 , 
                                 
                                   Δ 
                                    
                                   
                                       
                                   
                                    
                                   
                                     f 
                                     avg 
                                     
                                       I 
                                       , 
                                       a 
                                     
                                   
                                 
                                 , 
                                 
                                   Δ 
                                    
                                   
                                       
                                   
                                    
                                   
                                     E 
                                     avg 
                                     
                                       I 
                                       , 
                                       θ 
                                     
                                   
                                 
                                 , 
                                 
                                   Δ 
                                    
                                   
                                       
                                   
                                    
                                   
                                     f 
                                     avg 
                                     
                                       I 
                                       , 
                                       θ 
                                     
                                   
                                 
                                 , 
                                 
                                   L 
                                   avg 
                                   I 
                                 
                               
                               } 
                             
                           
                         
                       
                     
                     } 
                   
                   , 
                   
                     1 
                     ≤ 
                     I 
                     ≤ 
                     14 
                   
                 
               
               
                 
                   ( 
                   2 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where L 1   max  or L 1   avg  is defined as the cognitive load, computed taking maximum or average powers respectively and 1≦I≦14 denotes the 14 leads of the Emotiv EEG device. The final feature vectors F peak  and F mean  are obtained by concatenating the vectors F I   peak  or F I   mean  respectively for all I. Feature selection is performed to select a subset of the above EEG features. If f is the number of features per channel of EEG data then the feature vectors from all 14 channels are concatenated to form R 14f  dimensional feature vector. 
         [0051]    The ECT or stimulus is categorized according to Bloom&#39;s categories; Table 1 below depicts mapping of stimulus or ECTs to identified Bloom&#39;s categories, namely Understand, Remember and Analyze. However, it has to be understood that the identification of three given Bloom&#39;s categories is only for exemplary purposes. Similar mapping can be done for Bloom&#39;s six categories namely remember, understand, apply, analyze, evaluate and create. 
         [0000]    
       
         
               
             
               
               
               
               
             
           
               
                 TABLE 1 
               
             
             
               
                   
               
               
                 Mapping Stimuli to Bloom&#39;s Categories 
               
             
          
           
               
                   
                   
                   
                 Relationship to 
               
               
                 Stimulus 
                 Task Details 
                 Measure 
                 Bloom&#39;s category 
               
               
                   
               
               
                 1. Scattered 
                 Find number of 
                 Perceptual 
                 Understand &amp; 
               
               
                 X&#39;s (SX) 
                 times ‘X’ 
                 Speed 
                 Remember 
               
               
                   
                 appears on 
               
               
                   
                 screen 
               
               
                 2. Finding A 
                 Count words 
                 Perceptual 
                 Analyze &amp; 
               
               
                 (FA) 
                 containing ‘a’ 
                 Speed 
                 Remember 
               
               
                   
                 from a full page 
               
               
                   
                 of words 
               
               
                 3. Hidden 
                 Find a target 
                 Flexibility of 
                 Analyze 
               
               
                 Pattern (HP) 
                 pattern from a 
                 closure 
               
               
                   
                 list of five 
               
               
                   
                 complex 
               
               
                   
                 patterns 
               
               
                 4. Visual 
                 Count the 
                 Perceptual 
                 Understand &amp; 
               
               
                 Pursuit (VP) 
                 number of 
                 Speed 
                 Remember 
               
               
                   
                 occurances of a 
               
               
                   
                 target image 
               
               
                   
                 from an array of 
               
               
                   
                 multiple 
               
               
                   
                 complex images 
               
               
                 5. Finding 
                 Count the non- 
                 Perceptual 
                 Understand &amp; 
               
               
                 Number 
                 matching 
                 Speed 
                 Remember 
               
               
                 (FN) 
                 number pairs 
               
               
                   
                 from a list of 
               
               
                   
                 number pairs 
               
               
                 6. Gestalt 
                 Look at an 
                 Speed of 
                 Understand 
               
               
                 closure test 
                 incomplete 
                 closure 
               
               
                 (GC) 
                 image and 
               
               
                   
                 identify the 
               
               
                   
                 object 
               
               
                   
               
             
          
         
       
     
         [0052]    The EEG signals are first cleaned from various artifacts and then analyzed using standard machine learning techniques. Having also identified the cognitive categories within the Bloom&#39;s taxonomy and mapped plurality of ECTs with identified cognitive domains of Bloom&#39;s taxonomy, a cluster analysis is performed on the features of EEG signals using K-means algorithm. An unsupervised approach has been adapted to objectively measure the effects of various ECTs on individual subjects. 
         [0053]    An optimum number of clusters for an individual are identified by performing K means based clustering on the EEG features. Referring to afore-given non limiting description of illustrative embodiment wherein 6ECTs have been identified, the K is varied from 2 to 10. The value of K that generates compact clusters and also separates the clusters well, is determined using the minimum Xie-Beni index, in accordance with one exemplary embodiment of present disclosure. Further, relationships between the dusters in terms of distance between the centroids and the insights with the Bloom&#39;s categories are determined. It should however be noted that the scope of the invention is in no way limited to this example, and alternative variations of this task or given ECTs are possible and included within the scope of the invention. 
         [0054]    Let, referring to above example, the maximum number of minimum time response is obtained in the task “Finding A” (FA) and maximum number of maximum time response is obtained in “Visual Pursuit” (VP) task. Similarly let maximum accuracy is achieved in FA and minimum accuracy is achieved for “Hidden Pattern” (HP). Thus FA provides maximum accuracy at minimum response time. 
         [0055]    For exemplary purposes, all the tasks are of comparable load with a slight variation in their spread. As all the ECTs impart similar levels of cognitive load upon the subjects, the choice for the stimuli is justified. 
         [0056]    Next, a feature selection is performed on the total feature list given in equation (2) above. Maximal Information Co-efficient (MIC) is used to choose the most appropriate feature subset among F I   peak  and F I   mean . The MIC score of the corresponding peak (F I   peak ) and mean (F I   mean ) feature ratios in logarithmic unit is shown in  FIG. 3 . The positive values indicate that F I   peak  is a better subset. Here individual features&#39; MIC values are averaged across all 14 channels and then summed over all the participants. 
         [0057]    While performing the duster analysis, firstly the effects of taking peak energy and frequency shifts, average energy and frequency shifts or both in the feature vector are analyzed. This is illustrated in  FIG. 4 . It can be observed that taking a five dimensional feature vector F peak  gives the best clustering performance (in terms of smaller Xie Beni Indices) compared to F mean  or a ten dimensional feature vector F both , where F both ={F peak , F mean )}. Hence all further analyses are carried out using only F peak  as feature. 
         [0058]    As can be seen from Table II below, results obtained from clustering analysis in terms of Xie-Beni indices have been summarized. 
         [0000]                                                                TABLE II                   XIE BENI INDEX FOR DIFFERENT SUBJECTS AND FEATURES            Subject   Features            (K min )   F1   F2   F3   F4   F5   F6   F7               S1 (6)   1.9786   1.0073   2.2869   0.9156   1.0671   0.8103   0.8366       S2 (6)   1.7380   0.7125   0.8235   0.8935   0.7652   0.6745   0.6413       S3 (6)   1.7120   0.6637   1.1722   0.8462   1.2651   0.9040   0.7244       S4 (6)   1.3938   0.3777   1.2208   0.4630   1.2085   0.5866   0.3305       S5 (6)   1.3834   0.7948   0.9361   0.5566   1.6100   0.6423   0.5830       S6 (6)   2.3961   1.0465   0.9508   0.7961   2.4843   0.9268   0.7878       S7 (2)   0.8770   0.1607   1.2089   0.1583   0.9118   0.6000   0.1648       S8 (6)   1.0398   0.4943   1.1652   0.8390   1.0400   0.7440   0.6183       S9 (6)   1.2961   0.9185   1.5184   0.9483   0.8828   0.7383   0.8391       S10 (6)   1.7442   0.6232   1.5616   0.6209   0.8355   0.7891   0.5216                    
Here F 1  to F 5 , denote the following features:
 
F 1 =L 1   max , F 2 =ΔE I,α   max , F 3 =Δf I,α   max , F 4 =ΔE I,θ   max , F 5 =Δf I,θ   max  
 
F 6  is a combination of the F 1  through F 5  while F 7  is a combination of F 2  and F 4 . It is found that 9 subjects show the best performance i.e. lowest Xie-Beni index for K=6 while only one shows better results with K=2. These are reported as K min  in Table II. Also it is found that compared to using the F 6 , only F 2  for subjects S3, S4, S8 and S10; or only F 4  for subjects S5, S6 and S7 gives better results. Thus feature F 7  is selected as it gives a better performance compared to F 6  for eight out of ten subjects.
 
         [0059]    Next the distance between cluster centroids for each ECTs is computed. Let, say that for K number of clusters,  K C 2  different combinations of distances between clusters are obtained. From the given number of combinations, the duster centers having minimum and maximum distance for each individual are identified. A study on these distance pairs with respect to relation with Bloom&#39;s categories is presented in Table III. Here the attempt is to group subjects with similar relative cognitive skills. As for example, it can be seen from the Table III that it can be inferred for S1, S2 and S3 the FN-HP pair is having minimum distance i.e. maximum similarity. Here, S7 is neglected as number of clusters with minimum Xie-Beni index is 2 which is different from all the remaining subjects. 
         [0000]    
       
         
               
             
               
               
               
             
           
               
                 TABLE III 
               
             
             
               
                   
               
               
                 Cluster centers with minimum and maximum distances 
               
             
          
           
               
                   
                 Pair with min/max 
                   
               
               
                   
                 distance between 
               
               
                 Subjects 
                 centroids 
                 Remarks 
               
               
                   
               
               
                 S1 
                 Min: FN-HP 
                 Min: Though they are from separate 
               
               
                   
                 Max: SX-VP 
                 categories, the subject treats number as 
               
               
                   
                   
                 a pattern. 
               
               
                   
                   
                 Max: Though both are in same category, 
               
               
                   
                   
                 the alphabets and shapes are treated 
               
               
                   
                   
                 differently. 
               
               
                 S2 
                 Min: FN-HP 
                 Min: Though they are from separate 
               
               
                   
                 Max: FN-GC 
                 categories, the subject treats number as 
               
               
                   
                   
                 a pattern. 
               
               
                   
                   
                 Max: Same categories but FN needs 
               
               
                   
                   
                 remembering also. 
               
               
                 S3 
                 Min: FN-HP 
                 Min: Though are from separate 
               
               
                   
                 Max: FN-GC 
                 categories, the subject treats number as 
               
               
                   
                   
                 a pattern. 
               
               
                   
                   
                 Max: Same categories but FN needs 
               
               
                   
                   
                 remembering also 
               
               
                 S4 
                 Min: FA-SX 
                 Min: Different category but, searching 
               
               
                   
                 Max: FN-GC 
                 “A” (in FA) is similar to searching 
               
               
                   
                   
                 “X” (in SX). 
               
               
                   
                   
                 Max: Same categories but FN needs 
               
               
                   
                   
                 remembering also 
               
               
                 S5 
                 Min: GC-VP 
                 Min: They are from same category and 
               
               
                   
                 Max: FN-VP 
                 are treated similarly as both are related 
               
               
                   
                   
                 to patterns. 
               
               
                   
                   
                 Max: Same category but the numbers 
               
               
                   
                   
                 and patterns are treated differently. 
               
               
                 S6 
                 Min: GC-VP 
                 Min: They are from same category and 
               
               
                   
                 Max: GC-HP 
                 are treated similarly as both are related 
               
               
                   
                   
                 to patterns. 
               
               
                   
                   
                 Max: Separate categories. 
               
               
                 S8 
                 Min: FN-VP 
                 Min: Same category - numbers and 
               
               
                   
                 Max: GC-HP 
                 patterns are treated similarly. 
               
               
                   
                   
                 Max: Separate categories. 
               
               
                 S9 
                 Min; FN-SX 
                 Min: Same category - numbers and 
               
               
                   
                 Max: FN-HP 
                 patterns are treated similarly. 
               
               
                   
                   
                 Max: Separate categories. 
               
               
                 S10 
                 Min: SX-VP 
                 Min: Same category - the “X” (in SX) is 
               
               
                   
                 Max: SX-GC 
                 treated as a pattern as in VP. 
               
               
                   
                   
                 Max: Same category but for SX, user 
               
               
                   
                   
                 needs to remember as well. 
               
               
                   
               
             
          
         
       
     
         [0060]    Following the unsupervised cluster analysis on the EEG features for segregating the cognitive categories, one or more metrics are introduced for EEG based identification of the Traits of Cognitive Perception (TCP) among different individuals. In one aspect of the disclosure, if C i  and C j  be the centers of the i th  and the j th  clusters respectively for a particular subject, the separation Index (SI i,j ) between these two clusters is given as (3), where ∥.∥ denotes the Euclidean Distance between them. 
         [0000]      SI i,j   =∥C   i   −C   j ∥  (3)
 
         [0000]    If, say there are N number of clusters formed,  N C 2  pair-wise SI i,j  values are obtained. Next, search is made for the pair of dusters that lead to the maximum and minimum separation index values SI min  and SI max  for each subject. Further, the ratio S r  of SI min  upon SI max  is computed as can be seen in equations. (4), (5) and (6) below. 
         [0000]      SI min =minimum( S   i,j )  (4)
 
         [0000]      SI max =maximum( S   i,j )  (5)
 
         [0000]        S   r =SI min /SI max   (6)
 
         [0061]    The above obtained SI min , SI max  and S r  values are used as metrics to identify the TCP of a particular subject. While, it is obvious that SI min  (or SI max ) determines the how similarly (or dissimilarly) a subject treats the pair of tasks, S r  determines the spread of cognitive perception. A value of S r  close to 1 indicates almost similar interpretation of all tasks by the subject. This pertains to the subject wise study of TCPs. Now, depending on the SI min , SI max  and S r  values across all subjects, they are grouped into different categories of TCPs. This amounts to the stimulus-wise study of TCPs across all subjects. 
         [0062]    Likewise, a similar approach can be used to analyze a new task (say T new ). In such a scenario a set of subjects are considered who belong to the same group of TCP. Then the EEG signal is captured by presenting the new task. The EEG signals are analyzed to understand the relative structure with respect to the C i . Assuming that there are N ECTs, then 1&lt;=i&lt;=N. The centroid of the EEG features for the T new  is C new . Then the weight of each ECT present in the new task is given by equation (7) as follows. 
         [0000]    
       
         
           
             
               
                 
                   
                     W 
                     i 
                   
                   = 
                   
                     1 
                     - 
                     
                       
                         
                           C 
                           i 
                         
                         - 
                         
                           C 
                           new 
                         
                       
                       
                         
                           ∑ 
                           
                             i 
                             = 
                             1 
                           
                           N 
                         
                          
                         
                             
                         
                          
                         
                           ( 
                           
                             
                               C 
                               i 
                             
                             - 
                             
                               C 
                               new 
                             
                           
                           ) 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   7 
                   ) 
                 
               
             
           
         
       
     
         [0063]    In the interest of clarity, not all of the routine features of the implementations of the perceptual-cognitive-system and method are shown and described. It will, of course, be appreciated that in the development of any such actual implementation of the perceptual-cognitive system and method, numerous implementation-specific decisions may need to be made in order to achieve the system specific goals, and that these specific goals will vary from one implementation to another and from one application area to another. 
         [0064]    It is to be understood that the invention is not limited in its application to the details of construction and parts illustrated in the accompanying drawings and described herein-above. The invention is capable of other embodiments and of being practiced in various ways. It is also to be understood that the phraseology or terminology used herein is for the purpose of description and not limitation. Hence, although the present invention has been described hereinabove by way of illustrative embodiments thereof, it can be modified at will, within the scope of the appended claims, without departing from the spirit, scope and nature of the subject invention.

Technology Classification (CPC): 6