[ieee 2008 chinese conference on pattern recognition - beijing, china (2008.10.22-2008.10.24)] 2008...

5
1 2 1 1. 100081; E_mail:[email protected] 2. 100081 : Image Classification Technology Based on Mining of Frequent Item sets Qing Nie 1 , Shou-yi Zhan 2 , Jing-xia Su 1 1. School of Information Science and Technology, Beijing Institute of Technology, Beijing 100081, China; E_mail:[email protected] 2. School of Computer Science, Beijing Institute of Technology, Beijing 100081,China. Abstract We propose a novel method to detect frequent and distinctive feature configuration on a class instance. Each neighborhood of a local feature is described by a list of nonzero indices, and generates a transaction. An efficient mining of frequent item sets algorithm is used to automatically find spatial configurations of local features occurring frequently on a class instance. These mined spatial configurations can be used as special words, incorporate into bag of features classification model. Through evaluation on PASCAL 2007 Visual Recognition Challenge dataset set, the test results show that this mining algorithm is computationally efficient and allows to process large training sets rapidly. Moreover, the mined feature configurations have higher discriminative power compare to individual features. Key Words: Frequent item sets, Image classification, Image recognition, Object Recognition 1 , [1 2 3 4 5 6 7] [8] Fergus [5] Lazebnik [9] Sivic and Zisserman [7] k Till Quack [10] tiles [7 9 10] 978-1-4244-2316-3/08/$25.00 ©2008 IEEE 1

Upload: jing-xia

Post on 09-Feb-2017

213 views

Category:

Documents


1 download

TRANSCRIPT

1 2 1

1. 100081;

E_mail:[email protected]

2. 100081

:

Image Classification Technology Based on Mining of Frequent Item sets

Qing Nie1, Shou-yi Zhan

2, Jing-xia Su

1

1. School of Information Science and Technology, Beijing Institute of Technology, Beijing 100081, China;

E_mail:[email protected]

2. School of Computer Science, Beijing Institute of Technology, Beijing 100081,China.

Abstract We propose a novel method to detect frequent and distinctive feature configuration on a class instance. Each

neighborhood of a local feature is described by a list of nonzero indices, and generates a transaction. An efficient mining of frequent

item sets algorithm is used to automatically find spatial configurations of local features occurring frequently on a class instance.

These mined spatial configurations can be used as special words, incorporate into bag of features classification model. Through

evaluation on PASCAL 2007 Visual Recognition Challenge dataset set, the test results show that this mining algorithm is

computationally efficient and allows to process large training sets rapidly. Moreover, the mined feature configurations have higher

discriminative power compare to individual features.

Key Words: Frequent item sets, Image classification, Image recognition, Object Recognition

1

,

[1

2 3 4 5 6 7]

[8]

Fergus [5]

Lazebnik [9]

Sivic and

Zisserman [7] k

Till Quack [10]

tiles

[7 9 10]

978-1-4244-2316-3/08/$25.00 ©2008 IEEE 1

[9]

[7]

2

2.1

90

{ }piiiI ...,, 21= p ,

T T I tid(T )

D = {T1 . . . Tn} tid {Ti}

A T T A

A D

}{ [ ]1,0|

)(sup ∈⊆∈

=D

TADTAp 1

supp(A) Minsup A

Minsup

A B A B = A

B

DBApBAp

|}TB)(A|D{T|)(sup)(sup

⊆∈==→ 2

A B

|}TA|D{T|

|}TB)(A|D{T|

)(sup

)(sup)(

⊆∈⊆∈==→

Ap

BApBAconf 3

D

Minsup

Minconf

web

2.2

DoG [11]

SIFT

[1]

3000

(1~3000)

dmin

( <5)

i = {cj | d(Ri, cj ) < dmin , j 1 . . . N}

N

Q Q

3 3 1~9 ,

1

0

1

2,5

316

1119

2

FP tree FP growth

[12]

3

conf (C object ) > Minconf

2

200

3200

(a) (b)

2.3

C

2.2 P

C P

⊂=

otherwise

PCifallitemPCm

0

sin1),(

1),( =PCm

C P

C 30002 50316 71119

P 30002 40009 50316 71119

3

patches

/

4

1 2.2

<5

2 2.2

2.3

3001 3200

3

4

5

4 boost

Winnow RVM

EM

:

EMD Earth Mover’s Distance

3

4

PASCAL2007

[13] PASCAL PASCAL

20

112 116 128 155 177

158

DoG

250000 700 2.2

250000

3

3

conf (C object ) 200

0

/ precision/recall

FNTP

TP

+ FPTP

TP

+TP TN FP FN

3 SIFT

5

40401

DoG SIFT

3 precision/recall

[1] S. Agarwal, A. Awan, and D. Roth. Learning to detect objects

in images via a sparse, part-based representation. In IEEE

Trans. PAMI, 26(11): 1475-1490, 2004.

[2] N. Dalal and B. Triggs. Histograms of oriented gradients for

human detection. Proc. CVPR 2005, San Diego, CA, 2005,

Vol.1, pp.886-893.

[3] C. Dance, J. Willamowski, L. Fan, C. Bray, and G. Csurka.

Visual categorization with bags of keypoints. Proc. ECCV

SLCV2004, Prague , Czech,2005,vol.1,pp456-463

[4] Feltzenswalb and D. Hutenlocher. Pictorial structures for

4

object recognition. International Journal of Computer Vision,

61(1):55-79, 2005.

[5] R. Fergus, P. Perona, and A. Zisserman. A sparse object

category model for efficient learning and exhaustive

recognition. Proc. CVPR 2005, San Diego, CA, 2005, Vol.1,

pp380-387.

[6] B. Leibe, E. Seemann, and B. Schiele. Pedestrian detection in

crowded scenes. Proc. CVPR 2005, San Diego, CA, 2005,

Vol.1, pp878-885

[7] J. Sivic and A. Zisserman. Video data mining using

configurations of viewpoint invariant regions. Proc. CVPR

2004, Washington, USA, 2004, Vol.1, pp.488-495

[8] R. Fergus, P. Perona, and A. Zisserman. Object class

recognition by unsupervised scale-invariant learning. Proc

CVPR2003, Madison, Wisconsin,USA, 2003, vol.2,pp. 264

-271

[9] S. Lazebnik, C. Schmid, and J. Ponce. Semi-local affine parts

for object recognition. Proc. BMVC2004, Kingston, UK, 2004,

vol. 2, pp. 959-968.

[10] Till Quack, Vittorio Ferrari, Bastian Leibe. Efficient Mining of

Frequent and Distinctive Feature Configurations. Proc ICCV

2007, Rio de Janeiro, 2007, pp.1-8.

[11] D. Lowe. Distinctive image features from scale-invariant

keypoints. International Journal of Computer Vision,

60(2):91~110, 2004

[12] Han J, Yiwen,Y. Mining Frequent Patterns without Candidate

Generation. Data Mining and Knowledge Discovery, 8(1) : 53

– 87,2004.

[13] The PASCAL Visual Object Classes Challenge 2007,

http://www.pascal-network.org/challenges/VOC/voc2007/

5