EXTRACTING FLOW FEATURES USING BAG-OF-FEATURES AND SUPERVISED LEARNING TECHNIQUES

Measuring the similarity between two streamlines is fundamental to many important flow data analysis and visualization tasks such as feature detection, pattern querying and streamline clustering. This dissertation presents a novel streamline similarity measure inspired by the bag-of-features concept from computer vision. Different from other streamline similarity measures, the proposed one considers both the distribution of and the distances among features along a streamline. The proposed measure is tested in two common tasks in vector field exploration: streamline similarity query and streamline clustering. Compared with a recent streamline similarity measure, the proposed measure allows users to see the interesting features more clearly in a complicated vector field. In addition to focusing on similar streamlines through streamline similarity query or clustering, users sometimes want to group and see similar features from different streamlines. For example, it is useful to find all the spirals contained in different streamlines and present them to users. To this end, this dissertation proposes to segment each streamline into different features. This problem has not been studied extensively in flow visualization. For instance, many flow feature extraction techniques segment streamline based on simple heuristics such as accumulative curvature or arc length, and, as a result, the segments they found usually do not directly correspond to complete flow features. This dissertation proposes a machine learning-based streamline segmentation algorithm to segment each streamline into distinct features. It is shown that the proposed method can locate interesting features (e.g., a spiral in a streamline) more accurately than some other flow feature extraction methods. Since streamlines are space curves, the proposed method also serves as a general curve segmentation method and may be applied in other fields such as computer vision. Besides flow visualization, a pedagogical visualization tool DTEvisual for teaching access control is also discussed in this dissertation. Domain Type Enforcement (DTE) is a powerful abstraction for teaching students about modern models of access control in operating systems. With DTEvisual, students have an environment for visualizing a DTE-based policy using graphs, visually modifying the policy, and animating the common DTE queries in real time. A user study of DTEvisual suggests that the tool is helpful for students to understand DTE

The feasability of implementing a face recognition system based on Gabor filter and nearst nighbour techniques in an FPGA device for door control systems

Door access control systems based on face recognition are geared towards simplifying difficult face recognition problems in uncontrolled environments. Such systems are able to control illumination, offer neutral pose and improve the poor performance of many face recognition algorithms. Door access control systems control illumination and pose in order to overcome face recognition problems. While there have been significant improvements in the algorithms with increasing recognition accuracy, very little research has been conducted on implementing these in hardware devices. Most of the previous studies focused on implementing a simple principal component analysis in hardware with low recognition accuracy. In contrast, the use of a Gabor filter for feature extraction and the nearest neighbour method for classification were found to be better alternatives. Dramatic developments in field programmable gate arrays (FPGAs) have allowed designers to select various resources and functions to implement many complex designs. The aim of this paper is to present the feasibility of implementing Gabor filter and nearest neighbour face recognition algorithms in an FPGA device for face recognition. Our simulation using Xilinx FPGA platforms verified the feasibility of such a system with minimum hardware requirements

Similarity of Inference Face Matching On Angle Oriented Face Recognition

Face recognition is one of the wide applications of image processing technique. In this paper complete image of face recognition algorithm is proposed. In the prepared algorithm the local information is extracted using angle oriented discrete cosine transforms and invokes certain normalization techniques. To increase the Reliability of the Face detection process, neighborhood pixel information is incorporated into the proposed method. Discrete Cosine Transform (DCT) are renowned methods are implementing in the field of access control and security are utilizing the feature extraction capabilities. But these algorithms have certain limitations like poor discriminatory power and disability to handle large computational load. The face matching classification for the proposed system is done using various distance measure methods like Euclidean Distance, Manhattan Distance and Cosine Distance methods and the recognition rate were compared for different distance measures. The proposed method has been successfully tested on image database which is acquired under variable illumination and facial expressions. It is observed from the results that use of face matching like various method gives a recognition rate are high while comparing other methods. Also this study analyzes and compares the obtained results from the proposed Angle oriented face recognition with threshold based face detector to show the level of robustness using texture features in the proposed face detector. It was verified that a face recognition based on textual features can lead to an efficient and more reliable face detection method compared with KLT (Karhunen Loeve Transform), a threshold face detector. Keywords: Angle Oriented, Cosine Similarity, Discrete Cosine Transform, Euclidean Distance, Face Matching, Feature Extraction, Face Recognition, Image texture features

AN ENHANCED MULTIMODAL BIOMETRIC SYSTEM BASED ON CONVOLUTIONAL NEURAL NETWORK

Multimodal biometric system combines more than one biometric modality into a single method in order, to overcome the limitations of unimodal biometrics system. In multimodal biometrics system, the utilization of different algorithms for feature extraction, fusion at feature level and classification often to complexity and make fused biometrics features larger in dimensions. In this paper, we developed a face-iris multimodal biometric recognition system based on convolutional neural network for feature extraction, fusion at feature level, training and matching to reduce dimensionality, error rate and improve the recognition accuracy suitable for an access control. Convolutional Neural Network is based on deep supervised learning model and was employed for training, classification, and testing of the system. The images are preprocessed to a standard normalization and then flow into couples of convolutional layers. The developed multimodal biometrics system was evaluated on a dataset of 700 iris and facial images, the training database contain 600 iris and face images, 100 iris and face images were used for testing. Experimental result shows that at the learning rate of 0.0001, the multimodal system has a performance recognition accuracy (RA) of 98.33% and equal error rate (ERR) of 0.0006%

Secure Access To Authorized Resources Based On Fingerprint Authentication

The Internet makes it convenient for anyone to access publicly available information on the servers. The increased functionality of computers and other technological equipment makes the connectivity easier than ever before, and the need for security more and more important. Passwords are frequently used to control access to restricted functions. Unfortunately, password or personal identification number (PIN) verification suffers an inherent problem. It cannot ensure that the user is the claimed individual. Higher security systems have now veered towards biometric verification in conjunction with passwords. Fingerprints are a practical bodily characteristic to use, as they are unique to each individual and easily collected using image-capture systems. In this thesis, the methods of fingerprint recognition and classification are investigated. Then, the possible approaches to use are discussed while investigating the subject. The final choice combines a feature-based and correlation-based approach. The thesis proposes a novel method of allowing users access after authenticating them by their fingerprints. The method is based on a statistical approach, and is crafted in such a way that the authentication operations are inconspicuous to the user. All the required image processing techniques that make the extraction of the true fingerprint features easier are used: equalization, filtering, binarization and thinning. A new method for constructing a unique key from the fingerprint image is also presented, with the fingerprint database (fingerprint features, unique fingerprint key, public and private keys) created shown. The database can be manipulated (insertion, retrieving, and deletion) rapidly using the Adelson Velskii and Landis (AVL) tree searching technique. The A VL tree is used to increase the compression ratio as its compression algorithm works efficiently for all types of data. The security is maintained and enhanced by adding a public key system. Finally, a unique fingerprint based key is constructed using a user's fingerprint image and the key used to access and retrieve the private key. The method successfully recognizes the user fingerprint image even with noisy, translated or rotated images

Developing a comprehensive framework for multimodal feature extraction

Feature extraction is a critical component of many applied data science workflows. In recent years, rapid advances in artificial intelligence and machine learning have led to an explosion of feature extraction tools and services that allow data scientists to cheaply and effectively annotate their data along a vast array of dimensions---ranging from detecting faces in images to analyzing the sentiment expressed in coherent text. Unfortunately, the proliferation of powerful feature extraction services has been mirrored by a corresponding expansion in the number of distinct interfaces to feature extraction services. In a world where nearly every new service has its own API, documentation, and/or client library, data scientists who need to combine diverse features obtained from multiple sources are often forced to write and maintain ever more elaborate feature extraction pipelines. To address this challenge, we introduce a new open-source framework for comprehensive multimodal feature extraction. Pliers is an open-source Python package that supports standardized annotation of diverse data types (video, images, audio, and text), and is expressly with both ease-of-use and extensibility in mind. Users can apply a wide range of pre-existing feature extraction tools to their data in just a few lines of Python code, and can also easily add their own custom extractors by writing modular classes. A graph-based API enables rapid development of complex feature extraction pipelines that output results in a single, standardized format. We describe the package's architecture, detail its major advantages over previous feature extraction toolboxes, and use a sample application to a large functional MRI dataset to illustrate how pliers can significantly reduce the time and effort required to construct sophisticated feature extraction workflows while increasing code clarity and maintainability

Adaptive Multiscale Weighted Permutation Entropy for Rolling Bearing Fault Diagnosis

© 2020 The Author(s). This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.Bearing vibration signals contain non-linear and non-stationary features due to instantaneous variations in the operation of rotating machinery. It is important to characterize and analyze the complexity change of the bearing vibration signals so that bearing health conditions can be accurately identified. Entropy measures are non-linear indicators that are applicable to the time series complexity analysis for machine fault diagnosis. In this paper, an improved entropy measure, termed Adaptive Multiscale Weighted Permutation Entropy (AMWPE), is proposed. Then, a new rolling bearing fault diagnosis method is developed based on the AMWPE and multi-class SVM. For comparison, experimental bearing data are analyzed using the AMWPE, compared with the conventional entropy measures, where a multi-class SVM is adopted for fault type classification. Moreover, the robustness of different entropy measures is further studied for the analysis of noisy signals with various Signal-to-Noise Ratios (SNRs). The experimental results have demonstrated the effectiveness of the proposed method in fault diagnosis of rolling bearing under different fault types, severity degrees, and SNR levels.Peer reviewedFinal Accepted Versio