Comparative Analysis of Illumination Normalizations on Principal Component Analysis Based Feature Extraction for Face Recognition

Principle Component Analysis (PCA) is an appearance-based technique for extraction of feature extraction that is commonly used in computer vision and image processing. This technique suffers from illumination variations, thus knowing which illumination control method to be used in PCA-based face recognition system is very important. This paper applies three selected normalization techniques; Discrete Cosine Transform (DCT), Adaptive Histogram Equalization (AHE) and Contrast Limited Adaptive Histogram Equalization (CLAHE) to normalize face images. PCA was further used to extract features from the normalized face images. Euclidean distance was used to classify extracted features. The best recognition accuracy of 91.84% was obtained in DCT for ORL Database, while the best accuracy of 76% was achieved in DCT for FERET Database. The highest FAR of 0.9 was achieved in DCT for ORL Database, while the highest FAR of 0.5 was obtained in DCT and AHE for FERET Database. The highest FRR of 0.2821 was achieved in CLAHE for ORL Database, while 0.3000 was obtained in AHE for FERET Database. It was concluded that illumination control approaches have predominant effect on PCA–based facial recognition system. Keywords— Adaptive Histogram Equalization, Contrast Adaptive Histogram Equalization, Discrete Cosine Transform Illumination Normalization, Principal Component Analysi

Empirical Analysis of Data Streaming and Batch Learning Models for Network Intrusion Detection

Network intrusion, such as denial of service, probing attacks, and phishing, comprises some of the complex threats that have put the online community at risk. The increase in the number of these attacks has given rise to a serious interest in the research community to curb the menace. One of the research efforts is to have an intrusion detection mechanism in place. Batch learning and data streaming are approaches used for processing the huge amount of data required for proper intrusion detection. Batch learning, despite its advantages, has been faulted for poor scalability due to the constant re-training of new training instances. Hence, this paper seeks to conduct a comparative study using selected batch learning and data streaming algorithms. The batch learning and data streaming algorithms considered are J48, projective adaptive resonance theory (PART), Hoeffding tree (HT) and OzaBagAdwin (OBA). Furthermore, binary and multiclass classification problems are considered for the tested algorithms. Experimental results show that data streaming algorithms achieved considerably higher performance in binary classification problems when compared with batch learning algorithms. Specifically, binary classification produced J48 (94.73), PART (92.83), HT (98.38), and OBA (99.67), and multiclass classification produced J48 (87.66), PART (87.05), HT (71.98), OBA (82.80) based on accuracy. Hence, the use of data streaming algorithms to solve the scalability issue and allow real-time detection of network intrusion is highly recommended

Empirical Analysis of Data Streaming and Batch Learning Models for Network Intrusion Detection

Network intrusion, such as denial of service, probing attacks, and phishing, comprises some of the complex threats that have put the online community at risk. The increase in the number of these attacks has given rise to a serious interest in the research community to curb the menace. One of the research efforts is to have an intrusion detection mechanism in place. Batch learning and data streaming are approaches used for processing the huge amount of data required for proper intrusion detection. Batch learning, despite its advantages, has been faulted for poor scalability due to the constant re-training of new training instances. Hence, this paper seeks to conduct a comparative study using selected batch learning and data streaming algorithms. The batch learning and data streaming algorithms considered are J48, projective adaptive resonance theory (PART), Hoeffding tree (HT) and OzaBagAdwin (OBA). Furthermore, binary and multiclass classification problems are considered for the tested algorithms. Experimental results show that data streaming algorithms achieved considerably higher performance in binary classification problems when compared with batch learning algorithms. Specifically, binary classification produced J48 (94.73), PART (92.83), HT (98.38), and OBA (99.67), and multiclass classification produced J48 (87.66), PART (87.05), HT (71.98), OBA (82.80) based on accuracy. Hence, the use of data streaming algorithms to solve the scalability issue and allow real-time detection of network intrusion is highly recommended