Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Save more on your purchases now! discount-offer-chevron-icon
Savings automatically calculated. No voucher code required.
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Machine Learning for OpenCV

You're reading from   Machine Learning for OpenCV Intelligent image processing with Python

Arrow left icon
Product type Paperback
Published in Jul 2017
Publisher Packt
ISBN-13 9781783980284
Length 382 pages
Edition 1st Edition
Languages
Tools
Arrow right icon
Authors (2):
Arrow left icon
Michael Beyeler Michael Beyeler
Author Profile Icon Michael Beyeler
Michael Beyeler
Michael Beyeler (USD) Michael Beyeler (USD)
Author Profile Icon Michael Beyeler (USD)
Michael Beyeler (USD)
Arrow right icon
View More author details
Toc

Table of Contents (13) Chapters Close

Preface 1. A Taste of Machine Learning 2. Working with Data in OpenCV and Python FREE CHAPTER 3. First Steps in Supervised Learning 4. Representing Data and Engineering Features 5. Using Decision Trees to Make a Medical Diagnosis 6. Detecting Pedestrians with Support Vector Machines 7. Implementing a Spam Filter with Bayesian Learning 8. Discovering Hidden Structures with Unsupervised Learning 9. Using Deep Learning to Classify Handwritten Digits 10. Combining Different Algorithms into an Ensemble 11. Selecting the Right Model with Hyperparameter Tuning 12. Wrapping Up

Dealing with nonlinear decision boundaries

What if the data cannot be optimally partitioned using a linear decision boundary? In such a case, we say the data is not linearly separable.

The basic idea to deal with data that is not linearly separable is to create nonlinear combinations of the original features. This is the same as saying we want to project our data to a higher-dimensional space (for example, from 2D to 3D) in which the data suddenly becomes linearly separable. This concept is illustrated in the following figure:

Finding linear hyperplanes in higher-dimensional spaces

If data in its original input space (left) cannot be linearly separated, we can apply a mapping function Ï•(.) that projects the data from 2D into a 3D plane. In this higher-dimensional space, we may find that there is now a linear decision boundary (which, in 3D, is a plane) that can separate...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime