Chapter 1: Introduction

• 1.1. This manual
• 1.2. Introduction to PRSD Studio
• 1.2.1. Versions
• 1.2.2. System requirements
• 1.2.3. Useful general commands
• 1.2.3.1. Displaying PRSD Studio version and license information
• 1.2.3.2. Demo examples
• 1.2.3.3. Provide direct feedback to PR Sys Design
• 1.2.3.4. Control messages displayed by PRSD Studio
• 1.3. Release notes

• 2.1. Installing free PRSD Studio Lite
• 2.2. Installing commercial personal version (hardware dongle)

• 3.1. Loading data
• 3.2. Training a fruit classifier
• 3.3. Executing the classifier on new data
• 3.4. Performing crisp decisions
• 3.5. Building a fruit detector
• 3.6. Creating a detector/classifier cascade
• 3.7. Executing the classifier in application outside of Matlab

• 4.1. Introduction
• 4.2. Basic handling of labels
• 4.3. Creating labels
• 4.3.1. Providing per-sample class names
• 4.3.2. Consecutive labeling
• 4.3.3. One entry per class
• 4.3.4. Using label list
• 4.4. Operations on labels
• 4.4.1. Accessing label information
• 4.4.2. Retrieving class sizes and priors
• 4.4.3. Searching for samples with specific labels
• 4.4.4. Subsets of labels
• 4.4.5. Relabeling: Changing class names and defining meta-classes
• 4.4.6. Concatenating label sets
• 4.5. Creating label lists
• 4.5.1. From list of class names
• 4.5.2. Using string prefix
• 4.6. Operations on label lists
• 4.6.1. Accessing list content
• 4.6.2. Converting between names and indices

• 5.1. Introduction
• 5.2. Constructing data sets
• 5.3. Basic operations of data sets
• 5.3.1. Accessing samples, feature, and classes
• 5.3.2. Accessing raw data
• 5.3.3. Accessing class labels
• 5.4. Data set properties
• 5.4.1. Displaying available properties
• 5.4.2. Retrieving properties
• 5.4.3. Setting properties
• 5.4.3.1. Sample properties
• 5.4.3.2. Feature properties
• 5.4.3.3. Data properties
• 5.4.4. Testing presence of a property
• 5.4.5. Removing properties
• 5.5. Multiple sets of labels
• 5.6. Selecting data subsets by property values
• 5.7. Selecting data subsets randomly
• 5.7.1. Splitting data for training and testing
• 5.7.2. Fixing the random state
• 5.8. Renaming classes and defining meta-classes
• 5.8.1. Adding prefix or suffix to all class names

• 6.1. Interactive scatter plot
• 6.1.1. Legend
• 6.1.2. Changing features
• 6.1.3. Sample inspector
• 6.1.4. Switching between different sets of labels
• 6.1.5. Visualizing subsets of samples
• 6.1.6. Bringing class to top, z-order of classes
• 6.1.7. Hand-painting class labels
• 6.1.8. Renaming classes
• 6.1.9. Visualizing live feature distributions in scatter plot
• 6.2. Interactive image view
• 6.2.1. Hand-painting class labels
• 6.2.2. Saving hand-painted labels
• 6.2.3. Connecting sdimage and sdscatter

• 7.1. Introduction
• 7.1.1. Training a statistical model
• 7.2. Working with pipelines
• 7.2.1. Pipeline output types
• 7.2.2. Pipeline labels
• 7.2.3. Pipeline list
• 7.2.4. Executing the trained model on new data
• 7.2.5. Visualizing model outputs using sdscatter
• 7.3. Pipeline objects
• 7.3.1. Training a pipeline
• 7.3.2. Inspecting pipeline structure and parameters
• 7.3.3. Constructing pipelines manually

• 8.1. Introduction
• 8.2. Default operating point
• 8.2.1. Visualization of decisions in multi dimensional feature space
• 8.3. Defining operating points
• 8.4. Using operating points
• 8.4.1. Example on weighting-based decision
• 8.4.2. Example on thresholding-based decision
• 8.5. Setting specific operating points
• 8.6. Confusion matrices
• 8.6.1. Normalized confusion matrices
• 8.6.2. Storing confusion matrices as strings
• 8.6.3. Rectangular confusion matrices
• 8.6.4. Confusion matrices for a set of operating points
• 8.6.5. Visualization of the per class errors

• 9.1. Introduction
• 9.2. Using sdroc objects
• 9.2.1. Setting the current operating point
• 9.2.2. Performing decisions based on ROC
• 9.2.3. Interactive visualization of ROC decisions
• 9.2.4. Interactive visualization of confusion matrices
• 9.2.5. Accessing operating points
• 9.2.6. Accessing the estimated performances
• 9.2.7. Using different performance measures
• 9.3. Multi-class ROC Analysis
• 9.4. ROC Analysis using target thresholding (detection)
• 9.5. Selecting application-specific operating point
• 9.5.1. Applying performance constraints
• 9.5.2. Constraints using the low-level methods
• 9.5.3. Cost-sensitive optimization
• 9.5.4. Applying multiple performance constraints
• 9.6. Rejection
• 9.6.1. Adding reject option to a trained pipeline
• 9.6.2. Reject curve for distance-based rejection
• 9.6.3. Reject curve for rejection close to the decision boundary
• 9.6.4. Adding reject option to a specific operating point
• 9.7. Estimating ROC with variances

• 10.1. Feature extraction
• 10.1.1. Principal Component Analysis (PCA)
• 10.1.2. Linear Discriminant Analysis (LDA)
• 10.2. Feature selection
• 10.2.1. Individual feature selection (feature ranking)
• 10.2.2. Random feature selection
• 10.2.3. Forward search
• 10.2.4. Backward search
• 10.2.5. Floating search
• 10.2.6. Initialization of the selection searches

• 11.1. Detectors
• 11.1.1. Setting the detector operating point via thresholding
• 11.1.2. Detector for the all data
• 11.1.3. Setting the detector operating point via ROC analysis
• 11.1.4. Visualizing detector decisions on the image data
• 11.2. Discriminants
• 11.2.1. Nearest mean classifier
• 11.2.2. Linear classifier assuming normal densities
• 11.2.3. Quadratic classifier assuming normal densities
• 11.2.4. Gaussian mixture models
• 11.2.5. k-NN classifier
• 11.2.5.1. Prototype selection
• 11.2.5.2. Using large data sets
• 11.2.6. Parzen classifier
• 11.2.7. Neural network
• 11.2.8. Naive Bayes classifier
• 11.2.9. Decision tree classifier
• 11.2.10. Support Vector Machine
• 11.2.10.1. Grid search for sigma and C parameters
• 11.2.10.2. Multi-class support vector machines
• 11.2.10.3. Accessing support vectors
• 11.3. Classifier combining
• 11.3.1. Fixed combiners
• 11.4. Hierarchical classifiers

• 12.1. Introduction
• 12.1.1. Algorithm function
• 12.1.2. Algorithm training and execution
• 12.1.3. Converting algorithms into pipelines for out-of-Matlab execution

• 13.1. Introduction
• 13.1.1. Cross-validation by rotation
• 13.1.2. How are the errors computed
• 13.1.3. Setting random seed
• 13.2. Accessing algorithms trained in cross-validation
• 13.3. Accessing per-fold data sets
• 13.4. Cross-validation by randomization
• 13.5. Leave-one-out evaluation
• 13.5.1. Leave-one-out over property

• 14.1. Introduction

• A.1. Pattern Recognition Books