A NEW EFFICIENT SVM-BASED

EDGE DETECTION METHOD

AUTHOR: SHENG ZHENG*, JIAN LIU, JIN WEN TIAN

Representative: Toan Minh Hoang

StudentId: 2014126929

Contents
1.
2.
3.
4.
5.

Introduction
SVM and LS-SVM
Proposed theory and algorithm
Result and discussion
References

6/5/15

1.

Introduction
Edge detection
Considered as a key issue in image processing, computer vision, and pattern

recognition

Why SVM?
Maps input data into a high dimensional feature space where it may become

linearly separable.
Was designed to minimize structural risk => often performs better than earlier
methods
Usually less vulnerable to overfitting problem.

6/5/15

Contents
1.
2.
3.
4.
5.

Introduction
SVM and LS-SVM
Proposed theory and algorithm
Result and discussion
References

6/5/15

2.

SVM and LS-SVM

2.1. SVM
The
original SVM classifier satisfies the following conditions
or equivalently
where:

6/5/15

: is the ith input vector with known binary target ,

: known binary target,
: is the feature map mapping the input space to a usually high dimensional feature
space where the data points become linearly separable by a hyperplane defined by the
pair (

2.

SVM and LS-SVM

2.2. LS-SVM (1)
The
Vapniks standard SVM classifier has been modified as
or equivalently

The corresponding Lagrangian for Eq. is

where:
: is the Lagrange multipliers

6/5/15

2.

SVM and LS-SVM

2.2. LS-SVM (2)
The
optimality condition leads to the following (N+1)x(N+1) linear
system
where:

6/5/15

Contents
1.
2.
3.
4.
5.

Introduction
SVM and LS-SVM
Proposed theory and algorithm
Result and discussion
References

6/5/15

3.

Proposed theory and algorithm

3.1. Gray level intensity surface
In
SVM, the underlying image intensity surface f of a small
neighborhood in image can be approximated by a combination of a
set of support vector
In LS-SVM form, f can be represented as
where:

where:

6/5/15

3.

Proposed theory and algorithm

3.1. Gray level intensity surface(2)
We have

For the two dimensional images, let R and C be the index sets of the
neighborhood that satisfy the symmetric conditions => when the
kernel function and its parameters are known, set values A and B
define over RxC
Project to

6/5/15

10

3.

Proposed theory and algorithm

3.2. Derivatives of the intensity surface

Purposed
method use the Gaussian radial basis function (RBF) kernel

: can be constant in the image processing within the limited error tolerance
: in LS-SVM controls the solution insensitivity to the error, when the is infinite,

a solution with least squared error is attained.

Let S be a symmetric 2-D neighborhood defined on RxC,and f(r,c) be

the observed intensity value at (r,c)S

Evaluating the first and second row and column partial derivatives at point (r,c)

6/5/15

11

3.

Proposed theory and algorithm

3.2. Derivatives of the intensity surface(2)

where:

6/5/15

12

Contents
1.
2.
3.
4.
5.

Introduction
SVM and LS-SVM
Proposed theory and algorithm
Result and discussion
References

6/5/15

13

4.

Result and discussion

Ability of edge extraction with data smoothing

6/5/15

14

4.

Result and discussion

6/5/15

15

4.

Result and discussion

Efficiency
of edge detector

Present edge detectors: (E.D.1: R={-1 0 1}, C={-1 0 1}, m=2, 1; E.D.2:
R={-3 -2 -1 0 1 2 3}, C={-3 -2 -1 0 1 2 3}, m=2, ).
6/5/15

16

Contents
1.
2.
3.
4.
5.

Introduction
SVM and LS-SVM
Proposed theory and algorithm
Result and discussion
References

6/5/15

17

5. References
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.

Burges, C.J.C., 1998. A tutorial on support vector machines for pattern recognition. Knowl. Discovery
Data Min. 2 (2), 121-167.
Canny, J., 1986. A computational approach to edge detection. IEEE Trans. Pattern Anal. Mach. Intell.
PAMI-8, 679-698
Cortes, C., Vapnik, V., 1995. Support vector networks. Mach. Learn. 20, 273-297.
Hou, Z.J.m Koh, T.S., 2003. Robust edge detection. Pattern Recognit. 35(3), 689-700.
Kuhn, H.W., Tucker, A.W., 1951. Nonlinear programming. In Proc. 2nd Berkley Symposium on
Mathematical Statistics and Probabilistics, Berkeley. University of California Press, pp.481-492.
Peli, T.m Malah, D., 1982. A sutdy of edge detection algorithms. Comput. Graphics Image Process 20,
1-21.
Suykens, J.A.K., Vandewalle, J., 1000. Least squares support vector machine classifiers. Neural
Process. Lett. 9(3), 293-300.
Vapnik, V., 1995. The Nature of Statistical Learning Theory. Springer-Verlag, New York.
Vapnik, V., 1998a. Statistical Learning Theory. John Willey, New York.
Vapnik, V., 1998b. The support vector method of function estimation. In: Suykens, J.A.K.,
Vandewalle, J. (Eds.). Kluwer Academic Publishers, Boston, pp.55-85.

6/5/15

18

Thank you for listening!

6/5/15

19