Linear Dilation-Erosion Perceptron for Binary Classification

In this work, we briefly revise the reduced dilation-erosion perceptron (r-DEP) models for binary classification tasks. Then, we present the so-called linear dilation-erosion perceptron (l-DEP), in which a linear transformation is applied before the application of the morphological operators. Furthermore, we propose to train the l-DEP classifier by minimizing a regularized hinge-loss function subject to concave-convex restrictions. A simple example is given for illustrative purposes.

READ FULL TEXT

page 1

page 2

research
11/11/2020

Linear Dilation-Erosion Perceptron Trained Using a Convex-Concave Procedure

Mathematical morphology (MM) is a theory of non-linear operators used fo...
research
03/04/2020

Reduced Dilation-Erosion Perceptron for Binary Classification

Dilation and erosion are two elementary operations from mathematical mor...
research
12/02/2019

Capacity of the covariance perceptron

The classical perceptron is a simple neural network that performs a bina...
research
09/14/2016

Very Simple Classifier: a Concept Binary Classifier toInvestigate Features Based on Subsampling and Localility

We propose Very Simple Classifier (VSC) a novel method designed to incor...
research
11/17/2020

Linear Separation via Optimism

Binary linear classification has been explored since the very early days...
research
04/02/2020

Numerical analysis of least squares and perceptron learning for classification problems

This work presents study on regularized and non-regularized versions of ...
research
02/22/2023

A Generalized Weighted Loss for SVC and MLP

Usually standard algorithms employ a loss where each error is the mere a...

Please sign up or login with your details

Forgot password? Click here to reset