Bi model face recognition framework
•Download as PPTX, PDF•
0 likes•270 views
This document proposes a bi-modal face recognition framework that uses principal component analysis (PCA) and fisher linear discriminant analysis (FLDA) to build an expression invariant model. It first discusses treating expressions as either noise or extra features. It then outlines using PCA to reduce dimensionality and extract low-dimensional facial features, and FLDA to maximize discrimination between classes. The document provides walkthroughs of how PCA works by identifying patterns in data and reducing dimensions without much information loss. It explains that FLDA finds projections that maximize distance between class means while accounting for within-class scatter. Fusion of modalities is mentioned but not described in detail.
Report
Share
Report
Share
![Bi-model face recognition framework
[For expression invariant face recognition]](https://image.slidesharecdn.com/bi-modelfacerecognitionframework-130927003701-phpapp01/85/Bi-model-face-recognition-framework-1-320.jpg)
Recommended
Unsupervised learning: Clustering
Deepak George provides a presentation on unsupervised learning techniques including K-Means clustering, hierarchical clustering, and DBSCAN. He has experience in data science roles at companies like GE and Mu Sigma. Deepak earned degrees from IIM Bangalore and College of Engineering Trivandrum and lists passions in deep learning, photography, and football. The presentation covers key concepts in clustering algorithms and includes visual explanations and recommendations for applying clustering.
Decision tree
The document discusses decision tree induction, which is a popular tool for classification and prediction. It describes how decision trees work by having internal decision nodes that split the data into branches, which end at leaf nodes that provide a class label or prediction. It also covers different algorithms for building decision trees like ID3, C4.5, and CART. The key steps in decision tree induction include selecting attributes to split on using metrics like information gain or Gini index, and pruning the fully grown tree to avoid overfitting.
Decision tree
Decision trees are a type of supervised machine learning that use a tree-like model to predict target variables. They work by splitting data into smaller and smaller groups (branches) based on attribute values, continuing until the groups only contain similar target variable values or cannot be split further. The tree consists of decision nodes that test attributes, branches representing the outcome of the tests, and leaf nodes that represent classifications or predicted target values. The ID3 algorithm builds decision trees by selecting the attribute that creates the most information gain at each split in a greedy, top-down manner.
Decision tree
The document discusses decision tree algorithms. It begins with an introduction and example, then covers the principles of entropy and information gain used to build decision trees. It provides explanations of key concepts like evaluating decision trees using training and testing accuracy. The document concludes with strengths and weaknesses of decision tree algorithms.
Project 2
This document discusses computing eigenfaces for face recognition. It explains that eigenfaces are the principal components of the distribution of face images, which are the eigenvectors of the covariance matrix of images. The document shows the results of computing eigenfaces on a dataset, including visualizing the top 20 eigenfaces and testing eigenface reconstruction on sample images. It finds the eigenfaces capture most variation within 20 dimensions and reconstruct test images accurately in this reduced subspace.
Machine learning session9(clustering)
Intro to clustering and maths behind it. KMeans clustering and other clustering likes Hierarichal clustering along with comparison and applications.
Random forest
Random forests are an ensemble learning method that constructs multiple decision trees during training and outputs the class that is the mode of the classes of the individual trees. It improves upon decision trees by reducing variance. The algorithm works by:
1) Randomly sampling cases and variables to grow each tree.
2) Splitting nodes using the gini index or information gain on the randomly selected variables.
3) Growing each tree fully without pruning.
4) Aggregating the predictions of all trees using a majority vote. This reduces variance compared to a single decision tree.
Supervised and unsupervised learning
Supervised learning uses labeled training data to predict outcomes for new data. Unsupervised learning uses unlabeled data to discover patterns. Some key machine learning algorithms are described, including decision trees, naive Bayes classification, k-nearest neighbors, and support vector machines. Performance metrics for classification problems like accuracy, precision, recall, F1 score, and specificity are discussed.
Recommended
Unsupervised learning: Clustering
Deepak George provides a presentation on unsupervised learning techniques including K-Means clustering, hierarchical clustering, and DBSCAN. He has experience in data science roles at companies like GE and Mu Sigma. Deepak earned degrees from IIM Bangalore and College of Engineering Trivandrum and lists passions in deep learning, photography, and football. The presentation covers key concepts in clustering algorithms and includes visual explanations and recommendations for applying clustering.
Decision tree
The document discusses decision tree induction, which is a popular tool for classification and prediction. It describes how decision trees work by having internal decision nodes that split the data into branches, which end at leaf nodes that provide a class label or prediction. It also covers different algorithms for building decision trees like ID3, C4.5, and CART. The key steps in decision tree induction include selecting attributes to split on using metrics like information gain or Gini index, and pruning the fully grown tree to avoid overfitting.
Decision tree
Decision trees are a type of supervised machine learning that use a tree-like model to predict target variables. They work by splitting data into smaller and smaller groups (branches) based on attribute values, continuing until the groups only contain similar target variable values or cannot be split further. The tree consists of decision nodes that test attributes, branches representing the outcome of the tests, and leaf nodes that represent classifications or predicted target values. The ID3 algorithm builds decision trees by selecting the attribute that creates the most information gain at each split in a greedy, top-down manner.
Decision tree
The document discusses decision tree algorithms. It begins with an introduction and example, then covers the principles of entropy and information gain used to build decision trees. It provides explanations of key concepts like evaluating decision trees using training and testing accuracy. The document concludes with strengths and weaknesses of decision tree algorithms.
Project 2
This document discusses computing eigenfaces for face recognition. It explains that eigenfaces are the principal components of the distribution of face images, which are the eigenvectors of the covariance matrix of images. The document shows the results of computing eigenfaces on a dataset, including visualizing the top 20 eigenfaces and testing eigenface reconstruction on sample images. It finds the eigenfaces capture most variation within 20 dimensions and reconstruct test images accurately in this reduced subspace.
Machine learning session9(clustering)
Intro to clustering and maths behind it. KMeans clustering and other clustering likes Hierarichal clustering along with comparison and applications.
Random forest
Random forests are an ensemble learning method that constructs multiple decision trees during training and outputs the class that is the mode of the classes of the individual trees. It improves upon decision trees by reducing variance. The algorithm works by:
1) Randomly sampling cases and variables to grow each tree.
2) Splitting nodes using the gini index or information gain on the randomly selected variables.
3) Growing each tree fully without pruning.
4) Aggregating the predictions of all trees using a majority vote. This reduces variance compared to a single decision tree.
Supervised and unsupervised learning
Supervised learning uses labeled training data to predict outcomes for new data. Unsupervised learning uses unlabeled data to discover patterns. Some key machine learning algorithms are described, including decision trees, naive Bayes classification, k-nearest neighbors, and support vector machines. Performance metrics for classification problems like accuracy, precision, recall, F1 score, and specificity are discussed.
Mit102 data & file structures
Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601
Unsupervised learning clustering
This document discusses unsupervised learning and clustering. It defines unsupervised learning as modeling the underlying structure or distribution of input data without corresponding output variables. Clustering is described as organizing unlabeled data into groups of similar items called clusters. The document focuses on k-means clustering, describing it as a method that partitions data into k clusters by minimizing distances between points and cluster centers. It provides details on the k-means algorithm and gives examples of its steps. Strengths and weaknesses of k-means clustering are also summarized.
Machine Learning Unit 4 Semester 3 MSc IT Part 2 Mumbai University
Machine Learning Unit 1 Semester 3 MSc IT Part 2 Mumbai University AI Track. This is the ppt made by me for teaching ML in October 2020
Presentation on unsupervised learning
Supervised learning: discover patterns in the data that relate data attributes with a target (class) attribute.
These patterns are then utilized to predict the values of the target attribute in future data instances.
Unsupervised learning: The data have no target attribute.
We want to explore the data to find some intrinsic structures in them.
Fragmentation and types of fragmentation in Distributed Database
Definition,
Characteristics of Fragmentation,
Horizontal Fragmentation,
Vertical Fragmentation,
Mixed Fragmentation.,
Types of Horizontal fragmentation,
Primary Horizontal Fragmentation,
Derived horizontal fragmentation,
Complete horizontal fragmentation,
Disjoint horizontal fragmentation,
Reconstruction of original relation,
Complete vertical fragmentation,
Fragmentation aims to improve...
Lecture 8: Decision Trees & k-Nearest Neighbors
This document provides an overview of two machine learning algorithms: decision trees and k-nearest neighbors (k-NN). Decision trees use a hierarchical structure to classify instances based on the values of their features, splitting the data at each node based on tests of individual features. k-NN classifies new instances based on the majority class of its k nearest neighbors in the training data, where distance between instances is measured using a metric like overlap. The document discusses key aspects of both algorithms like decision criteria, parameters, and properties.
Machine Learning Decision Tree Algorithms
Details discussion about the Tree Algorithms like Gini, Information Gain, Chi-square for categorical and Reduction in variance for continuous variable. Let me know if anything is required. Happy to help. Enjoy machine learning! #bobrupakroy
Unsupervised learning (clustering)
This document discusses various unsupervised machine learning clustering algorithms. It begins with an introduction to unsupervised learning and clustering. It then explains k-means clustering, hierarchical clustering, and DBSCAN clustering. For k-means and hierarchical clustering, it covers how they work, their advantages and disadvantages, and compares the two. For DBSCAN, it defines what it is, how it identifies core points, border points, and outliers to form clusters based on density.
2 2 Bzca5e
This document discusses various topics relating to functions and their graphs, including increasing and decreasing functions, relative maxima and minima, even and odd functions, piecewise functions, and difference quotients. Examples are provided for each topic to illustrate key concepts such as identifying where a graph is increasing, decreasing, or constant, finding relative extrema, determining if a function is even or odd, interpreting piecewise functions, and simplifying difference quotient expressions.
Machine learning session 10
Machine learning is a method of data analysis that automates analytical model building. It is a branch of artificial intelligence based on the idea that systems can learn from data, identify patterns and make decisions with minimal human intervention.
Mca2020 advanced data structure
Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
help.mbaassignments@gmail.com
or
call us at : 08263069601
K Nearest Neighbor Algorithm
KNN algorithm is one of the simplest classification algorithm and it is one of the most used learning algorithms. KNN is a non-parametric, lazy learning algorithm. Its purpose is to use a database in which the data points are separated into several classes to predict the classification of a new sample point.
Dimension Reduction: What? Why? and How?
Process of converting data set having vast dimensions into data set with lesser dimensions ensuring that it conveys similar information concisely.
Concept
R code
Random forest algorithm
The document discusses the random forest algorithm. It introduces random forest as a supervised classification algorithm that builds multiple decision trees and merges them to provide a more accurate and stable prediction. It then provides an example pseudocode that randomly selects features to calculate the best split points to build decision trees, repeating the process to create a forest of trees. The document notes key advantages of random forest are that it avoids overfitting and can be used for both classification and regression tasks.
Recognition of unistroke gesture sequences
This document presents an approach for recognizing multiple gestures in a single stroke sequence using dynamic time warping. It extends the $1 recognizer to segment an input gesture sequence into its constituent gestures by finding the best match between templates and the input. The approach employs dynamic time warping to calculate distances between templates and input points without restrictions on sequence length or composition. It achieves good accuracy even with a small number of training samples by splicing off matched portions and repeating on remaining input.
Decision tree and random forest
The document discusses decision trees and random forest algorithms. It begins with an outline and defines the problem as determining target attribute values for new examples given a training data set. It then explains key requirements like discrete classes and sufficient data. The document goes on to describe the principles of decision trees, including entropy and information gain as criteria for splitting nodes. Random forests are introduced as consisting of multiple decision trees to help reduce variance. The summary concludes by noting out-of-bag error rate can estimate classification error as trees are added.
Radially-Distorted Conjugate Translations
This paper introduces the first minimal solvers that jointly solve for affine-rectification and radial lens distortion from coplanar repeated patterns. Even with imagery from moderately distorted lenses, plane rectification using the pinhole camera model is inaccurate or invalid. The proposed solvers incorporate lens distortion into the camera model and extend accurate rectification to wide-angle imagery, which is now common from consumer cameras. The solvers are derived from constraints induced by the conjugate translations of an imaged scene plane, which are integrated with the division model for radial lens distortion. The hidden-variable trick with ideal saturation is used to reformulate the constraints so that the solvers generated by the Grobner-basis method are stable, small and fast. Rectification and lens distortion are recovered from either one conjugately translated affine-covariant feature or two independently translated similarity-covariant features. The proposed solvers are used in a RANSAC-based estimator, which gives accurate rectifications after few iterations. The proposed solvers are evaluated against the state-of-the-art and demonstrate significantly better rectifications on noisy measurements. Qualitative results on diverse imagery demonstrate high-accuracy undistortions and rectifications. The source code is publicly available at https://github.com/prittjam/repeats.
Understandig PCA and LDA
This document summarizes dimensionality reduction techniques principal component analysis (PCA) and linear discriminant analysis (LDA). PCA seeks to reduce dimensionality while retaining as much variation in the data as possible. It finds the directions with the most variance by using the eigenvectors of the covariance matrix. LDA performs dimensionality reduction to best separate classes by maximizing between-class scatter while minimizing within-class scatter. It finds discriminatory directions by solving a generalized eigenvalue problem involving the between-class and within-class scatter matrices. Both techniques are useful for applications like face recognition by projecting high-dimensional images onto a lower-dimensional discriminative space.
Empirical Network Classification
Creates heuristic guidelines for classifying types of networks empirically through a series of network metrics. Introduces metrics and theoretical background of what those network metrics measure with respect to the graph.
WEKA: Data Mining Input Concepts Instances And Attributes
This document discusses concepts related to data mining input, including concepts, instances, and attributes. It also covers different types of learning in data mining like classification, numeric prediction, clustering, and association rules. Key steps to prepare data for mining are discussed, such as data assembly, integration, cleaning, and preparation. Formats for data like ARFF files and handling sparse data are also covered.
Machine learning & computer vision
Ever wondered how computers recognize and track human faces? Netlighter Saksham Gautam held a talk at Netlight Grand Edge Data Munich and dissected this seemingly complex problem of object recognition and tracking into digestible pieces. You will get a good understanding of what happens behind the scenes when, for instance, you walk through automatic passport control at the airport, or how Google's self driven car 'sees' the road signs. We will see how these generic algorithms and techniques can be applied to other machine learning and pattern recognition problems as well.
Robust face name graph matching for movie character identification - Final PPT
Robust face name graph matching for movie character identification - Final PPTPriyadarshini Dasarathan
The document proposes a robust face name graph matching system for movie character identification. It involves detecting faces accurately using clustering, representing them in a graph, and matching faces using an edit-operation based graph matching algorithm. The system aims to identify characters in low resolution or complex backgrounds. It analyzes existing limitations and proposes a two-scheme approach using external script resources and original graphs. The system architecture involves modules for login/authentication, detection, training, and recognition. It concludes the proposed schemes improve clustering and identification of faces from movies and discusses future work on optimal functions for genres and exploiting more character relationships.More Related Content
What's hot
Mit102 data & file structures
Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601
Unsupervised learning clustering
This document discusses unsupervised learning and clustering. It defines unsupervised learning as modeling the underlying structure or distribution of input data without corresponding output variables. Clustering is described as organizing unlabeled data into groups of similar items called clusters. The document focuses on k-means clustering, describing it as a method that partitions data into k clusters by minimizing distances between points and cluster centers. It provides details on the k-means algorithm and gives examples of its steps. Strengths and weaknesses of k-means clustering are also summarized.
Machine Learning Unit 4 Semester 3 MSc IT Part 2 Mumbai University
Machine Learning Unit 1 Semester 3 MSc IT Part 2 Mumbai University AI Track. This is the ppt made by me for teaching ML in October 2020
Presentation on unsupervised learning
Supervised learning: discover patterns in the data that relate data attributes with a target (class) attribute.
These patterns are then utilized to predict the values of the target attribute in future data instances.
Unsupervised learning: The data have no target attribute.
We want to explore the data to find some intrinsic structures in them.
Fragmentation and types of fragmentation in Distributed Database
Definition,
Characteristics of Fragmentation,
Horizontal Fragmentation,
Vertical Fragmentation,
Mixed Fragmentation.,
Types of Horizontal fragmentation,
Primary Horizontal Fragmentation,
Derived horizontal fragmentation,
Complete horizontal fragmentation,
Disjoint horizontal fragmentation,
Reconstruction of original relation,
Complete vertical fragmentation,
Fragmentation aims to improve...
Lecture 8: Decision Trees & k-Nearest Neighbors
This document provides an overview of two machine learning algorithms: decision trees and k-nearest neighbors (k-NN). Decision trees use a hierarchical structure to classify instances based on the values of their features, splitting the data at each node based on tests of individual features. k-NN classifies new instances based on the majority class of its k nearest neighbors in the training data, where distance between instances is measured using a metric like overlap. The document discusses key aspects of both algorithms like decision criteria, parameters, and properties.
Machine Learning Decision Tree Algorithms
Details discussion about the Tree Algorithms like Gini, Information Gain, Chi-square for categorical and Reduction in variance for continuous variable. Let me know if anything is required. Happy to help. Enjoy machine learning! #bobrupakroy
Unsupervised learning (clustering)
This document discusses various unsupervised machine learning clustering algorithms. It begins with an introduction to unsupervised learning and clustering. It then explains k-means clustering, hierarchical clustering, and DBSCAN clustering. For k-means and hierarchical clustering, it covers how they work, their advantages and disadvantages, and compares the two. For DBSCAN, it defines what it is, how it identifies core points, border points, and outliers to form clusters based on density.
2 2 Bzca5e
This document discusses various topics relating to functions and their graphs, including increasing and decreasing functions, relative maxima and minima, even and odd functions, piecewise functions, and difference quotients. Examples are provided for each topic to illustrate key concepts such as identifying where a graph is increasing, decreasing, or constant, finding relative extrema, determining if a function is even or odd, interpreting piecewise functions, and simplifying difference quotient expressions.
Machine learning session 10
Machine learning is a method of data analysis that automates analytical model building. It is a branch of artificial intelligence based on the idea that systems can learn from data, identify patterns and make decisions with minimal human intervention.
Mca2020 advanced data structure
Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
help.mbaassignments@gmail.com
or
call us at : 08263069601
K Nearest Neighbor Algorithm
KNN algorithm is one of the simplest classification algorithm and it is one of the most used learning algorithms. KNN is a non-parametric, lazy learning algorithm. Its purpose is to use a database in which the data points are separated into several classes to predict the classification of a new sample point.
Dimension Reduction: What? Why? and How?
Process of converting data set having vast dimensions into data set with lesser dimensions ensuring that it conveys similar information concisely.
Concept
R code
Random forest algorithm
The document discusses the random forest algorithm. It introduces random forest as a supervised classification algorithm that builds multiple decision trees and merges them to provide a more accurate and stable prediction. It then provides an example pseudocode that randomly selects features to calculate the best split points to build decision trees, repeating the process to create a forest of trees. The document notes key advantages of random forest are that it avoids overfitting and can be used for both classification and regression tasks.
Recognition of unistroke gesture sequences
This document presents an approach for recognizing multiple gestures in a single stroke sequence using dynamic time warping. It extends the $1 recognizer to segment an input gesture sequence into its constituent gestures by finding the best match between templates and the input. The approach employs dynamic time warping to calculate distances between templates and input points without restrictions on sequence length or composition. It achieves good accuracy even with a small number of training samples by splicing off matched portions and repeating on remaining input.
Decision tree and random forest
The document discusses decision trees and random forest algorithms. It begins with an outline and defines the problem as determining target attribute values for new examples given a training data set. It then explains key requirements like discrete classes and sufficient data. The document goes on to describe the principles of decision trees, including entropy and information gain as criteria for splitting nodes. Random forests are introduced as consisting of multiple decision trees to help reduce variance. The summary concludes by noting out-of-bag error rate can estimate classification error as trees are added.
Radially-Distorted Conjugate Translations
This paper introduces the first minimal solvers that jointly solve for affine-rectification and radial lens distortion from coplanar repeated patterns. Even with imagery from moderately distorted lenses, plane rectification using the pinhole camera model is inaccurate or invalid. The proposed solvers incorporate lens distortion into the camera model and extend accurate rectification to wide-angle imagery, which is now common from consumer cameras. The solvers are derived from constraints induced by the conjugate translations of an imaged scene plane, which are integrated with the division model for radial lens distortion. The hidden-variable trick with ideal saturation is used to reformulate the constraints so that the solvers generated by the Grobner-basis method are stable, small and fast. Rectification and lens distortion are recovered from either one conjugately translated affine-covariant feature or two independently translated similarity-covariant features. The proposed solvers are used in a RANSAC-based estimator, which gives accurate rectifications after few iterations. The proposed solvers are evaluated against the state-of-the-art and demonstrate significantly better rectifications on noisy measurements. Qualitative results on diverse imagery demonstrate high-accuracy undistortions and rectifications. The source code is publicly available at https://github.com/prittjam/repeats.
Understandig PCA and LDA
This document summarizes dimensionality reduction techniques principal component analysis (PCA) and linear discriminant analysis (LDA). PCA seeks to reduce dimensionality while retaining as much variation in the data as possible. It finds the directions with the most variance by using the eigenvectors of the covariance matrix. LDA performs dimensionality reduction to best separate classes by maximizing between-class scatter while minimizing within-class scatter. It finds discriminatory directions by solving a generalized eigenvalue problem involving the between-class and within-class scatter matrices. Both techniques are useful for applications like face recognition by projecting high-dimensional images onto a lower-dimensional discriminative space.
Empirical Network Classification
Creates heuristic guidelines for classifying types of networks empirically through a series of network metrics. Introduces metrics and theoretical background of what those network metrics measure with respect to the graph.
WEKA: Data Mining Input Concepts Instances And Attributes
This document discusses concepts related to data mining input, including concepts, instances, and attributes. It also covers different types of learning in data mining like classification, numeric prediction, clustering, and association rules. Key steps to prepare data for mining are discussed, such as data assembly, integration, cleaning, and preparation. Formats for data like ARFF files and handling sparse data are also covered.
What's hot (20)
Machine Learning Unit 4 Semester 3 MSc IT Part 2 Mumbai University
Machine Learning Unit 4 Semester 3 MSc IT Part 2 Mumbai University
Fragmentation and types of fragmentation in Distributed Database
Fragmentation and types of fragmentation in Distributed Database
WEKA: Data Mining Input Concepts Instances And Attributes
WEKA: Data Mining Input Concepts Instances And Attributes
Viewers also liked
Machine learning & computer vision
Ever wondered how computers recognize and track human faces? Netlighter Saksham Gautam held a talk at Netlight Grand Edge Data Munich and dissected this seemingly complex problem of object recognition and tracking into digestible pieces. You will get a good understanding of what happens behind the scenes when, for instance, you walk through automatic passport control at the airport, or how Google's self driven car 'sees' the road signs. We will see how these generic algorithms and techniques can be applied to other machine learning and pattern recognition problems as well.
Robust face name graph matching for movie character identification - Final PPT
Robust face name graph matching for movie character identification - Final PPTPriyadarshini Dasarathan
The document proposes a robust face name graph matching system for movie character identification. It involves detecting faces accurately using clustering, representing them in a graph, and matching faces using an edit-operation based graph matching algorithm. The system aims to identify characters in low resolution or complex backgrounds. It analyzes existing limitations and proposes a two-scheme approach using external script resources and original graphs. The system architecture involves modules for login/authentication, detection, training, and recognition. It concludes the proposed schemes improve clustering and identification of faces from movies and discusses future work on optimal functions for genres and exploiting more character relationships.Facial recognition locker for android
This document describes a facial recognition locker app for Android called FaceRecog. It allows users to unlock their phone, block calls, and replace the lock screen using facial recognition. The app requires one administrator who can unlock with a password in addition to trained faces. It gives users freedom to train their face in different conditions and set a confidence threshold. The app uses face detection and recognition approaches like LBP (Local Binary Patterns) and detects facial features to recognize faces. Future work includes improving performance and extending it to handle illumination and poses.
Face recognition
This document summarizes a student project on face recognition. It begins with an introduction to face recognition, its applications, and common challenges. It then reviews literature on existing face recognition methods and identifies problems related to tilted poses and variations in illumination and expression. The proposed method will work to improve recognition rates under these conditions in two phases - training and testing. The method aims to enhance the preprocessing and feature extraction steps to make the system more robust. A basic flowchart of the proposed approach is provided, and the document concludes with references.
Face Recognition using OpenCV
Describing face recognition API exposed by OpenCV for Android. This small API makes use of Android NDK to get the most from OpenCV library.
Face Detection and Recognition System
Face Detection and Recognition System (FDRS) is a physical characteristics recognition technology, using the inherent physiological features of humans for ID recognition. The technology does not need to be carried about and will not be lost, so it is convenient and safe for use
Face detection using template matching
Face detection involves classifying images as containing a human face or not. Template matching is used, where standard face patterns are stored and compared to regions of the input image. The document outlines the process, which includes skin segmentation to identify potential face regions, then template matching to those regions to detect faces. Challenges include handling various poses, expressions, rotations and image conditions. Front-view face detection can currently achieve 95% accuracy on 320x240 images at over 15 frames per second.
Face recognition technology
Face recognition technology uses machine learning algorithms to identify or verify a person's identity from digital images or video frames. The process involves detecting faces, applying preprocessing techniques like filtering and scaling, training classifiers using labeled face images, and then classifying new faces. Common machine learning algorithms used include K-nearest neighbors, naive Bayes, decision trees, and locally weighted learning. The proposed system detects faces, builds a tabular dataset from pixel values, trains classifiers, and evaluates performance on a test set. Software applies techniques like detection, alignment, normalization, and matching to encode faces for comparison. Face recognition has advantages like convenience and low cost, and applications in security, banking, and more.
Eigenface For Face Recognition
The document discusses the eigenface approach for face recognition. It provides an overview of eigenfaces, how they are calculated from a training set of faces, and how they can be used to identify faces by projecting faces onto the eigenface space. Major steps include calculating the eigenfaces from a training set, projecting new images into eigenface space to get weight coefficients, and comparing the weights to known individuals' weights or thresholds to classify faces as known or unknown. Advantages are ease of implementation and little preprocessing required, while limitations include sensitivity to head scale and only applicable to frontal views under controlled conditions.
Facial recognition powerpoint
Facial recognition systems use computer algorithms to identify or verify people from digital images or video by analyzing patterns in their faces. The document traces the development of these systems from early work in the 1970s to modern applications. It describes different types of facial recognition techniques and provides examples of software using the technology. The document also summarizes the results of an online survey about public awareness and interest in using facial recognition. It concludes by noting improvements in accuracy over time but also ongoing challenges regarding error rates, privacy, and changes to facial features.
Pattern recognition
The document discusses artificial intelligence and pattern recognition. It introduces various pattern recognition concepts including defining a pattern, examples of patterns in different domains, and approaches to pattern recognition. It also provides an example of using discriminative methods to classify fish into salmon and sea bass using optical sensing and extracted features.
Face recognition technology - BEST PPT
Face recognition technology may help solve problems with identity verification by analyzing facial features instead of passwords or pins. The document outlines the key stages of face recognition systems including data acquisition, input processing, and image classification. It also discusses advantages like convenience and ease of use, as well as limitations such as an inability to distinguish identical twins. Potential applications are identified in government, security, and commercial sectors.
Microsoft power point Face recognition
Learn basics of image processing and also learn how face recognition works.
Error on title side due to upload issue :it should be face
Viewers also liked (13)
Robust face name graph matching for movie character identification - Final PPT
Robust face name graph matching for movie character identification - Final PPT
Similar to Bi model face recognition framework
Machine Learning Foundations for Professional Managers
20180526@Taiwan AI Academy, Professional Managers Class.
Covering important concepts of classical machine learning, in preparation for deep learning topics to follow. Topics include regression (linear, polynomial, gaussian and sigmoid basis functions), dimension reduction (PCA, LDA, ISOMAP), clustering (K-means, GMM, Mean-Shift, DBSCAN, Spectral Clustering), classification (Naive Bayes, Logistic Regression, SVM, kNN, Decision Tree, Classifier Ensembles, Bagging, Boosting, Adaboost) and Semi-Supervised learning techniques. Emphasis on sampling, probability, curse of dimensionality, decision theory and classifier generalizability.
Fr pca lda
The document discusses principal component analysis (PCA) and linear discriminant analysis (LDA) for dimensionality reduction in pattern recognition and their application to face recognition. PCA finds the directions along which the data varies the most to reduce dimensionality while retaining variation. LDA seeks directions that maximize between-class variation and minimize within-class variation. Studies show LDA performs better than PCA for classification when the training set is large and representative of each class.
07 dimensionality reduction
07 April Stefano Cavuoti: The curse of dimensionality
On the challenges of very large descriptor spaces
Matrix Factorization In Recommender Systems
The document discusses matrix factorization techniques for recommender systems. It begins with an overview of recommender systems and their use of matrix factorization for dimensionality reduction. Principal component analysis and singular value decomposition are described as early linear algebra techniques used for this purpose. The document then focuses on how these techniques evolved into basic and extended matrix factorization methods in recommender systems, using the Netflix Prize competition as an example.
A WHIRLWIND TOUR OF ACADEMIC TECHNIQUES FOR REAL-WORLD SECURITY RESEARCHERS
This document provides an overview of various academic techniques that can be useful for security researchers, including mathematical objects, comparing objects, similarity searching, classification, clustering, and program analysis. It discusses representing problems as different objects like strings, vectors, and graphs and using techniques like n-grams, vector distances, and graph decomposition. Case studies of projects that applied these techniques are also summarized.
Principal Component Analysis (PCA) and LDA PPT Slides
Machine learning (ML) technique use for Dimension reduction, feature extraction and analyzing huge amount of data are Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) are easily and interactively explained with scatter plot graph , 2D and 3D projection of Principal components(PCs) for better understanding.
Dimensionality reduction
The document provides an overview of dimensionality reduction techniques. It discusses linear dimensionality reduction methods like principal component analysis (PCA) as well as non-linear dimensionality reduction techniques. For non-linear dimensionality reduction, it describes the concept of manifolds and manifold learning. Specific manifold learning algorithms covered include Isomap, locally linear embedding (LLE), and applications of manifold learning.
Dimensionality Reduction and feature extraction.pptx
Dimensionality reduction, or dimension reduction, is the transformation of data from a high-dimensional space into a low-dimensional space so that the low-dimensional representation retains some meaningful properties of the original data, ideally close to its intrinsic dimension.
Computer Vision descriptors
This document discusses feature descriptors and matching in computer vision. It covers three main components: 1) detecting interest points in images, 2) extracting feature descriptors around each interest point, and 3) determining correspondences between descriptors to match features across images. The document focuses on SIFT (Scale Invariant Feature Transform) descriptors, which are histograms of gradient orientations computed over localized patches that provide robust matching across changes in scale, rotation and illumination. SIFT descriptors have been widely and successfully used for applications like image stitching, 3D reconstruction, object recognition and augmented reality.
Moshe Guttmann's slides on eigenface
The document discusses two techniques for face recognition: Eigenfaces and Fisherfaces. Eigenfaces, developed in 1991, uses Principal Component Analysis (PCA) to reduce the dimensionality of face images and represent faces as linear combinations of eigenvectors. Fisherfaces, developed in 1997, uses Fisher's Linear Discriminant Analysis (LDA) which aims to maximize between-class separability and minimize within-class variance. It is shown to perform better than Eigenfaces for face recognition.
Resnet.pdf
ResNet, short for "Residual Network," is a type of deep neural network architecture that was introduced by Microsoft researchers in 2015. ResNet is designed to address the problem of vanishing gradients, which can occur in deep neural networks that are many layers deep.
The main innovation in ResNet is the use of residual connections, also known as skip connections. These connections allow information from earlier layers of the network to bypass some of the later layers and be directly fed into the later layers. This helps to ensure that the gradient signal from the output can propagate back through the network during training, which can help to prevent the vanishing gradient problem.
ResNet has been shown to be very effective at image recognition and other computer vision tasks. It has achieved state-of-the-art performance on a number of benchmark datasets, such as ImageNet. Since its introduction, many variations and improvements to the original ResNet architecture have been proposed, including ResNeXt, Wide ResNet, and Residual Attention Network (RANet).
Illustrative Introductory Neural Networks
An introductory/illustrative but precise slide on mathematics on neural networks (densely connected layers).
Please download it and see its animations with PowerPoint.
*This slide is not finished yet. If you like it, please give me some feedback to motivate me.
I made this slide as an intern in DATANOMIQ Gmbh
URL: https://www.datanomiq.de/
Resnet.pptx
ResNet (short for Residual Network) is a deep neural network architecture that has achieved significant advancements in image recognition tasks. It was introduced by Kaiming He et al. in 2015.
The key innovation of ResNet is the use of residual connections, or skip connections, that enable the network to learn residual mappings instead of directly learning the desired underlying mappings. This addresses the problem of vanishing gradients that commonly occurs in very deep neural networks.
In a ResNet, the input data flows through a series of residual blocks. Each residual block consists of several convolutional layers followed by batch normalization and rectified linear unit (ReLU) activations. The original input to a residual block is passed through the block and added to the output of the block, creating a shortcut connection. This addition operation allows the network to learn residual mappings by computing the difference between the input and the output.
By using residual connections, the gradients can propagate more effectively through the network, enabling the training of deeper models. This enables the construction of extremely deep ResNet architectures with hundreds of layers, such as ResNet-101 or ResNet-152, while still maintaining good performance.
ResNet has become a widely adopted architecture in various computer vision tasks, including image classification, object detection, and image segmentation. Its ability to train very deep networks effectively has made it a fundamental building block in the field of deep learning.
Recognition
This document discusses object recognition and summarizes several key concepts:
1. Object recognition includes tasks like verification, detection, identification, and categorization of objects and scenes.
2. Dimensionality reduction techniques like principal component analysis (PCA) can be used to reduce the dimensionality of image data and extract the most important variations, called eigenfaces, for face recognition.
3. A Bayesian framework can be used for probabilistic classification, where the posterior probability of a class is calculated using the likelihood, prior, and evidence to determine the most probable class.
fuzzy LBP for face recognition ppt
This document presents a novel fuzzy feature extraction method using Local Binary Patterns (LBP) for face recognition. It begins with an introduction to face recognition challenges and common approaches. It then describes using LBP to extract local features from divided image windows. Features are extracted by computing membership values based on pixel intensities and taking the product with central pixel value. Local and central pixel information values are combined as the total information for classification using Support Vector Machine (SVM) or K-Nearest Neighbor classifiers. Experimental results on two databases show the proposed approach achieves better recognition rates than other methods. The conclusion is that accounting for both central and neighborhood pixel information is effective for images with expression, illumination and pose variations.
Standard Statistical Feature analysis of Image Features for Facial Images usi...
This document compares Principal Component Analysis (PCA) and Independent Component Analysis (ICA) and their application to facial image analysis. It provides an introduction to both PCA and ICA, including their processes and differences. The document then summarizes previous literature comparing PCA and ICA, describes implementations of PCA for facial recognition on Japanese, African, and Asian datasets in MATLAB, and calculates statistical metrics for the original and recognized images. It concludes that PCA is effective for pattern recognition and dimensionality reduction in facial analysis applications.
PRML Chapter 4
This chapter discusses classification methods including linear discriminant functions and probabilistic generative and discriminative models. It covers linear decision boundaries, perceptrons, Fisher's linear discriminant, logistic regression, and the use of sigmoid and softmax activation functions. The key points are:
1) Classification involves dividing the input space into decision regions using linear or nonlinear boundaries.
2) Perceptrons and Fisher's linear discriminant find linear decision boundaries by updating weights to minimize misclassification.
3) Generative models like naive Bayes estimate joint probabilities while discriminative models like logistic regression directly model posterior probabilities.
4) Sigmoid and softmax functions are used to transform linear outputs into probabilities for binary and multiclass classification respectively.
WIA 2019 - Steering Model Selection with Visual Diagnostics
This document summarizes techniques for model selection and evaluation using visual diagnostics. It discusses using visualizations to analyze features, select algorithms, tune hyperparameters, and evaluate model performance. Key aspects covered include using visualizations to identify important and correlated features, determine the best number of clusters or regularization parameter value, and evaluate classifier performance metrics and regression error. The goal is to visually diagnose issues and identify the best modeling choices.
Steering Model Selection with Visual Diagnostics: Women in Analytics 2019
Machine learning is ultimately a search for the best combination of features, algorithm, and hyperparameters that result in the best performing model. Oftentimes, this leads us to stay in our algorithmic comfort zones, or to resort to automated processes such as grid searches and random walks. Whether we stick to what we know or try many combinations, we are sometimes left wondering if we have actually succeeded.
By enhancing model selection with visual diagnostics, data scientists can inject human guidance to steer the search process. Visualizing feature transformations, algorithmic behavior, cross-validation methods, and model performance allows us a peek into the high dimensional realm that our models operate. As we continue to tune our models, trying to minimize both bias and variance, these glimpses allow us to be more strategic in our choices. The result is more effective modeling, speedier results, and greater understanding of underlying processes.
Visualization is an integral part of the data science workflow, but visual diagnostics are directly tied to machine learning transformers and models. The Yellowbrick library extends the scikit-learn API providing a Visualizer object, an estimator that learns from data and produces a visualization as a result. In this tutorial, we will explore feature visualizers, visualizers for classification, clustering, and regression, as well as model analysis visualizers. We'll work through several examples and show how visual diagnostics steer model selection, making machine learning more informed, and more effective.
Similar to Bi model face recognition framework (20)
Machine Learning Foundations for Professional Managers
Machine Learning Foundations for Professional Managers
A WHIRLWIND TOUR OF ACADEMIC TECHNIQUES FOR REAL-WORLD SECURITY RESEARCHERS
A WHIRLWIND TOUR OF ACADEMIC TECHNIQUES FOR REAL-WORLD SECURITY RESEARCHERS
PYTHON ALGORITHMS, DATA STRUCTURE, SORTING TECHNIQUES
PYTHON ALGORITHMS, DATA STRUCTURE, SORTING TECHNIQUES
Principal Component Analysis (PCA) and LDA PPT Slides
Principal Component Analysis (PCA) and LDA PPT Slides
Dimensionality Reduction and feature extraction.pptx
Dimensionality Reduction and feature extraction.pptx
Standard Statistical Feature analysis of Image Features for Facial Images usi...
Standard Statistical Feature analysis of Image Features for Facial Images usi...
WIA 2019 - Steering Model Selection with Visual Diagnostics
WIA 2019 - Steering Model Selection with Visual Diagnostics
Steering Model Selection with Visual Diagnostics: Women in Analytics 2019
Steering Model Selection with Visual Diagnostics: Women in Analytics 2019
Recently uploaded
Generating privacy-protected synthetic data using Secludy and Milvus
During this demo, the founders of Secludy will demonstrate how their system utilizes Milvus to store and manipulate embeddings for generating privacy-protected synthetic data. Their approach not only maintains the confidentiality of the original data but also enhances the utility and scalability of LLMs under privacy constraints. Attendees, including machine learning engineers, data scientists, and data managers, will witness first-hand how Secludy's integration with Milvus empowers organizations to harness the power of LLMs securely and efficiently.
AI-Powered Food Delivery Transforming App Development in Saudi Arabia.pdf
In this blog post, we'll delve into the intersection of AI and app development in Saudi Arabia, focusing on the food delivery sector. We'll explore how AI is revolutionizing the way Saudi consumers order food, how restaurants manage their operations, and how delivery partners navigate the bustling streets of cities like Riyadh, Jeddah, and Dammam. Through real-world case studies, we'll showcase how leading Saudi food delivery apps are leveraging AI to redefine convenience, personalization, and efficiency.
HCL Notes und Domino Lizenzkostenreduzierung in der Welt von DLAU
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-und-domino-lizenzkostenreduzierung-in-der-welt-von-dlau/
DLAU und die Lizenzen nach dem CCB- und CCX-Modell sind für viele in der HCL-Community seit letztem Jahr ein heißes Thema. Als Notes- oder Domino-Kunde haben Sie vielleicht mit unerwartet hohen Benutzerzahlen und Lizenzgebühren zu kämpfen. Sie fragen sich vielleicht, wie diese neue Art der Lizenzierung funktioniert und welchen Nutzen sie Ihnen bringt. Vor allem wollen Sie sicherlich Ihr Budget einhalten und Kosten sparen, wo immer möglich. Das verstehen wir und wir möchten Ihnen dabei helfen!
Wir erklären Ihnen, wie Sie häufige Konfigurationsprobleme lösen können, die dazu führen können, dass mehr Benutzer gezählt werden als nötig, und wie Sie überflüssige oder ungenutzte Konten identifizieren und entfernen können, um Geld zu sparen. Es gibt auch einige Ansätze, die zu unnötigen Ausgaben führen können, z. B. wenn ein Personendokument anstelle eines Mail-Ins für geteilte Mailboxen verwendet wird. Wir zeigen Ihnen solche Fälle und deren Lösungen. Und natürlich erklären wir Ihnen das neue Lizenzmodell.
Nehmen Sie an diesem Webinar teil, bei dem HCL-Ambassador Marc Thomas und Gastredner Franz Walder Ihnen diese neue Welt näherbringen. Es vermittelt Ihnen die Tools und das Know-how, um den Überblick zu bewahren. Sie werden in der Lage sein, Ihre Kosten durch eine optimierte Domino-Konfiguration zu reduzieren und auch in Zukunft gering zu halten.
Diese Themen werden behandelt
- Reduzierung der Lizenzkosten durch Auffinden und Beheben von Fehlkonfigurationen und überflüssigen Konten
- Wie funktionieren CCB- und CCX-Lizenzen wirklich?
- Verstehen des DLAU-Tools und wie man es am besten nutzt
- Tipps für häufige Problembereiche, wie z. B. Team-Postfächer, Funktions-/Testbenutzer usw.
- Praxisbeispiele und Best Practices zum sofortigen Umsetzen
CAKE: Sharing Slices of Confidential Data on Blockchain
Presented at the CAiSE 2024 Forum, Intelligent Information Systems, June 6th, Limassol, Cyprus.
Synopsis: Cooperative information systems typically involve various entities in a collaborative process within a distributed environment. Blockchain technology offers a mechanism for automating such processes, even when only partial trust exists among participants. The data stored on the blockchain is replicated across all nodes in the network, ensuring accessibility to all participants. While this aspect facilitates traceability, integrity, and persistence, it poses challenges for adopting public blockchains in enterprise settings due to confidentiality issues. In this paper, we present a software tool named Control Access via Key Encryption (CAKE), designed to ensure data confidentiality in scenarios involving public blockchains. After outlining its core components and functionalities, we showcase the application of CAKE in the context of a real-world cyber-security project within the logistics domain.
Paper: https://doi.org/10.1007/978-3-031-61000-4_16
Ocean lotus Threat actors project by John Sitima 2024 (1).pptx
Ocean Lotus cyber threat actors represent a sophisticated, persistent, and politically motivated group that poses a significant risk to organizations and individuals in the Southeast Asian region. Their continuous evolution and adaptability underscore the need for robust cybersecurity measures and international cooperation to identify and mitigate the threats posed by such advanced persistent threat groups.
OpenID AuthZEN Interop Read Out - Authorization
During Identiverse 2024 and EIC 2024, members of the OpenID AuthZEN WG got together and demoed their authorization endpoints conforming to the AuthZEN API
Full-RAG: A modern architecture for hyper-personalization
Mike Del Balso, CEO & Co-Founder at Tecton, presents "Full RAG," a novel approach to AI recommendation systems, aiming to push beyond the limitations of traditional models through a deep integration of contextual insights and real-time data, leveraging the Retrieval-Augmented Generation architecture. This talk will outline Full RAG's potential to significantly enhance personalization, address engineering challenges such as data management and model training, and introduce data enrichment with reranking as a key solution. Attendees will gain crucial insights into the importance of hyperpersonalization in AI, the capabilities of Full RAG for advanced personalization, and strategies for managing complex data integrations for deploying cutting-edge AI solutions.
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slack
Discover the seamless integration of RPA (Robotic Process Automation), COMPOSER, and APM with AWS IDP enhanced with Slack notifications. Explore how these technologies converge to streamline workflows, optimize performance, and ensure secure access, all while leveraging the power of AWS IDP and real-time communication via Slack notifications.
UiPath Test Automation using UiPath Test Suite series, part 6
Welcome to UiPath Test Automation using UiPath Test Suite series part 6. In this session, we will cover Test Automation with generative AI and Open AI.
UiPath Test Automation with generative AI and Open AI webinar offers an in-depth exploration of leveraging cutting-edge technologies for test automation within the UiPath platform. Attendees will delve into the integration of generative AI, a test automation solution, with Open AI advanced natural language processing capabilities.
Throughout the session, participants will discover how this synergy empowers testers to automate repetitive tasks, enhance testing accuracy, and expedite the software testing life cycle. Topics covered include the seamless integration process, practical use cases, and the benefits of harnessing AI-driven automation for UiPath testing initiatives. By attending this webinar, testers, and automation professionals can gain valuable insights into harnessing the power of AI to optimize their test automation workflows within the UiPath ecosystem, ultimately driving efficiency and quality in software development processes.
What will you get from this session?
1. Insights into integrating generative AI.
2. Understanding how this integration enhances test automation within the UiPath platform
3. Practical demonstrations
4. Exploration of real-world use cases illustrating the benefits of AI-driven test automation for UiPath
Topics covered:
What is generative AI
Test Automation with generative AI and Open AI.
UiPath integration with generative AI
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Presentation of the OECD Artificial Intelligence Review of Germany
Consult the full report at https://www.oecd.org/digital/oecd-artificial-intelligence-review-of-germany-609808d6-en.htm
Your One-Stop Shop for Python Success: Top 10 US Python Development Providers
Simplify your search for a reliable Python development partner! This list presents the top 10 trusted US providers offering comprehensive Python development services, ensuring your project's success from conception to completion.
Microsoft - Power Platform_G.Aspiotis.pdf
Revolutionizing Application Development
with AI-powered low-code, presentation by George Aspiotis, Sr. Partner Development Manager, Microsoft
GraphRAG for Life Science to increase LLM accuracy
GraphRAG for life science domain, where you retriever information from biomedical knowledge graphs using LLMs to increase the accuracy and performance of generated answers
Essentials of Automations: The Art of Triggers and Actions in FME
In this second installment of our Essentials of Automations webinar series, we’ll explore the landscape of triggers and actions, guiding you through the nuances of authoring and adapting workspaces for seamless automations. Gain an understanding of the full spectrum of triggers and actions available in FME, empowering you to enhance your workspaces for efficient automation.
We’ll kick things off by showcasing the most commonly used event-based triggers, introducing you to various automation workflows like manual triggers, schedules, directory watchers, and more. Plus, see how these elements play out in real scenarios.
Whether you’re tweaking your current setup or building from the ground up, this session will arm you with the tools and insights needed to transform your FME usage into a powerhouse of productivity. Join us to discover effective strategies that simplify complex processes, enhancing your productivity and transforming your data management practices with FME. Let’s turn complexity into clarity and make your workspaces work wonders!
Building Production Ready Search Pipelines with Spark and Milvus
Spark is the widely used ETL tool for processing, indexing and ingesting data to serving stack for search. Milvus is the production-ready open-source vector database. In this talk we will show how to use Spark to process unstructured data to extract vector representations, and push the vectors to Milvus vector database for search serving.
“I’m still / I’m still / Chaining from the Block”
“An Outlook of the Ongoing and Future Relationship between Blockchain Technologies and Process-aware Information Systems.” Invited talk at the joint workshop on Blockchain for Information Systems (BC4IS) and Blockchain for Trusted Data Sharing (B4TDS), co-located with with the 36th International Conference on Advanced Information Systems Engineering (CAiSE), 3 June 2024, Limassol, Cyprus.
20240607 QFM018 Elixir Reading List May 2024
Everything I found interesting about the Elixir programming ecosystem in May 2024
Recently uploaded (20)
Generating privacy-protected synthetic data using Secludy and Milvus
Generating privacy-protected synthetic data using Secludy and Milvus
AI-Powered Food Delivery Transforming App Development in Saudi Arabia.pdf
AI-Powered Food Delivery Transforming App Development in Saudi Arabia.pdf
HCL Notes und Domino Lizenzkostenreduzierung in der Welt von DLAU
HCL Notes und Domino Lizenzkostenreduzierung in der Welt von DLAU
CAKE: Sharing Slices of Confidential Data on Blockchain
CAKE: Sharing Slices of Confidential Data on Blockchain
Ocean lotus Threat actors project by John Sitima 2024 (1).pptx
Ocean lotus Threat actors project by John Sitima 2024 (1).pptx
Full-RAG: A modern architecture for hyper-personalization
Full-RAG: A modern architecture for hyper-personalization
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slack
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slack
UiPath Test Automation using UiPath Test Suite series, part 6
UiPath Test Automation using UiPath Test Suite series, part 6
Presentation of the OECD Artificial Intelligence Review of Germany
Presentation of the OECD Artificial Intelligence Review of Germany
Your One-Stop Shop for Python Success: Top 10 US Python Development Providers
Your One-Stop Shop for Python Success: Top 10 US Python Development Providers
GraphRAG for Life Science to increase LLM accuracy
GraphRAG for Life Science to increase LLM accuracy
Essentials of Automations: The Art of Triggers and Actions in FME
Essentials of Automations: The Art of Triggers and Actions in FME
Building Production Ready Search Pipelines with Spark and Milvus
Building Production Ready Search Pipelines with Spark and Milvus
Bi model face recognition framework
- 1. Bi-model face recognition framework [For expression invariant face recognition]
- 2. Expressions: Two perspectives. 1) Noise?
- 3. Expressions 11) Extra features ? Essentially everyone has got a different smile here.
- 4. Outline Principal Component Analysis Reduce dimensionality. Extract low dimensional features from original facial appearance. Fisher Linear Discriminant Analysis To maximize the discrimination between different classes. Fusion of Modalities. Well we have not done much of work on this front yet.
- 5. Principal Component Analysis [PCA] What is it? A way to identify patterns in the data. Reduce or compress the data without loss of much information. In our case: introduce generalization. What happens when we increase number of neurons?
- 6. PCA : Walkthrough - 1 Get some data Subtract the mean [Data Adjust].
- 7. PCA : Walkthrough - 2 Data plotted on x-y
- 8. PCA : Walkthrough - 3 Calculate the covariance matrix Calculate the eigenvalues and eigenvectors The eigenvector with highest eigenvalue is Principal Component.
- 9. PCA : Walkthrough - 4
- 10. PCA : Walkthrough - 5
- 11. Fisher Linear Discriminant Analysis PCA finds the most accurate data representation for lower dimensional space. But directions of maximum variance may be useless for classification. #Fail
- 12. FLDA – Main idea Find projection to a line, or plane in case of higher dimension such that different classes are well separated.
- 13. FLDA - 1 Find vector such that the distance between the projection of classes is maximum along that vector. But how to define distance? Good along vertical axis, not so good along horizontal axis
- 14. FLDA - 2 The problem is that we did not consider *scatter* of the data. Ok, wait!! What is scatter? Scatter is variance multiplied by no. of elements.
- 15. FLDA - 3 Fisher solution : Normalize by scatter. Thus Fisher linear discriminant is to project on line in the direction of v which maximizes J(v) is the distance between mean values of two classes which are normalized by scatter. After performing few complicated looking simple vector algebraic steps we get
- 16. FLDA - Example PCA FLDA
- 17. Multiple Modalities Background Rest of the story during final presentation and demo.
- 18. Questions?
- 19. Thank You