fiš„v3.dvi

Similar documents
3 2 2 (1) (2) (3) (4) 4 4 AdaBoost 2. [11] Onishi&Yoda [8] Iwashita&Stoica [5] 4 [3] 3. 3 (1) (2) (3)

1 Fig. 1 Extraction of motion,.,,, 4,,, 3., 1, 2. 2.,. CHLAC,. 2.1,. (256 ).,., CHLAC. CHLAC, HLAC. 2.3 (HLAC ) r,.,. HLAC. N. 2 HLAC Fig. 2

x T = (x 1,, x M ) x T x M K C 1,, C K 22 x w y 1: 2 2

(MIRU2008) HOG Histograms of Oriented Gradients (HOG)

IPSJ SIG Technical Report Vol.2010-CVIM-170 No /1/ Visual Recognition of Wire Harnesses for Automated Wiring Masaki Yoneda, 1 Ta

untitled

Optical Flow t t + δt 1 Motion Field 3 3 1) 2) 3) Lucas-Kanade 4) 1 t (x, y) I(x, y, t)

JFE.dvi

Convolutional Neural Network A Graduation Thesis of College of Engineering, Chubu University Investigation of feature extraction by Convolution

(a) 1 (b) 3. Gilbert Pernicka[2] Treibitz Schechner[3] Narasimhan [4] Kim [5] Nayar [6] [7][8][9] 2. X X X [10] [11] L L t L s L = L t + L s

xx/xx Vol. Jxx A No. xx 1 Fig. 1 PAL(Panoramic Annular Lens) PAL(Panoramic Annular Lens) PAL (2) PAL PAL 2 PAL 3 2 PAL 1 PAL 3 PAL PAL 2. 1 PAL

kut-paper-template.dvi

28 Horizontal angle correction using straight line detection in an equirectangular image

& 3 3 ' ' (., (Pixel), (Light Intensity) (Random Variable). (Joint Probability). V., V = {,,, V }. i x i x = (x, x,, x V ) T. x i i (State Variable),

On the Limited Sample Effect of the Optimum Classifier by Bayesian Approach he Case of Independent Sample Size for Each Class Xuexian HA, etsushi WAKA

(a) (b) (c) Canny (d) 1 ( x α, y α ) 3 (x α, y α ) (a) A 2 + B 2 + C 2 + D 2 + E 2 + F 2 = 1 (3) u ξ α u (A, B, C, D, E, F ) (4) ξ α (x 2 α, 2x α y α,

医系の統計入門第 2 版 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. このサンプルページの内容は, 第 2 版 1 刷発行時のものです.

4. C i k = 2 k-means C 1 i, C 2 i 5. C i x i p [ f(θ i ; x) = (2π) p 2 Vi 1 2 exp (x µ ] i) t V 1 i (x µ i ) 2 BIC BIC = 2 log L( ˆθ i ; x i C i ) + q

…p…^†[…fiflF”¯ Pattern Recognition

,,.,.,,.,.,.,.,,.,..,,,, i

fiš„v8.dvi

No. 3 Oct The person to the left of the stool carried the traffic-cone towards the trash-can. α α β α α β α α β α Track2 Track3 Track1 Track0 1

2007/8 Vol. J90 D No. 8 Stauffer [7] 2 2 I 1 I 2 2 (I 1(x),I 2(x)) 2 [13] I 2 = CI 1 (C >0) (I 1,I 2) (I 1,I 2) Field Monitoring Server

例題ではじめる部分空間法 - パターン認識へのいざない -

130 Oct Radial Basis Function RBF Efficient Market Hypothesis Fama ) 4) 1 Fig. 1 Utility function. 2 Fig. 2 Value function. (1) (2)


1 Kinect for Windows M = [X Y Z] T M = [X Y Z ] T f (u,v) w 3.2 [11] [7] u = f X +u Z 0 δ u (X,Y,Z ) (5) v = f Y Z +v 0 δ v (X,Y,Z ) (6) w = Z +

untitled

IPSJ SIG Technical Report Vol.2017-SLP-115 No /2/18 1,a) 1 1,2 Sakriani Sakti [1][2] [3][4] [5][6][7] [8] [9] 1 Nara Institute of Scie

VRSJ-SIG-MR_okada_79dce8c8.pdf

fi¡ŒØ.dvi

Vol. 44 No. SIG 9(CVIM 7) ) 2) 1) 1 2) 3 7) 1) 2) 3 3) 4) 5) (a) (d) (g) (b) (e) (h) No Convergence? End (f) (c) Yes * ** * ** 1


Computational Semantics 1 category specificity Warrington (1975); Warrington & Shallice (1979, 1984) 2 basic level superiority 3 super-ordinate catego

untitled

本文6(599) (Page 601)

24 Depth scaling of binocular stereopsis by observer s own movements

258 5) GPS 1 GPS 6) GPS DP 7) 8) 10) GPS GPS ) GPS Global Positioning System

Vol.-CVIM-7 No.7 /3/8 NLPCA kernel PCA KPCA 4),) NLPCA KPCA NLPCA KPCA principle curve principle surface KPCA ) ),),6),8),),3) ) Jacobian KPCA PCA ) P

2 (March 13, 2010) N Λ a = i,j=1 x i ( d (a) i,j x j ), Λ h = N i,j=1 x i ( d (h) i,j x j ) B a B h B a = N i,j=1 ν i d (a) i,j, B h = x j N i,j=1 ν i

,.,. NP,., ,.,,.,.,,, (PCA)...,,. Tipping and Bishop (1999) PCA. (PPCA)., (Ilin and Raiko, 2010). PPCA EM., , tatsukaw

Fig. 3 Flow diagram of image processing. Black rectangle in the photo indicates the processing area (128 x 32 pixels).

fiš„v5.dvi

IPSJ SIG Technical Report Vol.2017-MUS-116 No /8/24 MachineDancing: 1,a) 1,b) 3 MachineDancing MachineDancing MachineDancing 1 MachineDan

三石貴志.indd

a) Extraction of Similarities and Differences in Human Behavior Using Singular Value Decomposition Kenichi MISHIMA, Sayaka KANATA, Hiroaki NAKANISHI a

IS1-09 第 回画像センシングシンポジウム, 横浜,14 年 6 月 2 Hough Forest Hough Forest[6] Random Forest( [5]) Random Forest Hough Forest Hough Forest 2.1 Hough Forest 1 2.2

20 Method for Recognizing Expression Considering Fuzzy Based on Optical Flow


光学

IPSJ SIG Technical Report Vol.2012-CG-149 No.13 Vol.2012-CVIM-184 No /12/4 3 1,a) ( ) DB 3D DB 2D,,,, PnP(Perspective n-point), Ransa

2003/3 Vol. J86 D II No Fig. 1 An exterior view of eye scanner. CCD [7] CCD PC USB PC PC USB RS-232C PC

yasi10.dvi

149 (Newell [5]) Newell [5], [1], [1], [11] Li,Ryu, and Song [2], [11] Li,Ryu, and Song [2], [1] 1) 2) ( ) ( ) 3) T : 2 a : 3 a 1 :

Input image Initialize variables Loop for period of oscillation Update height map Make shade image Change property of image Output image Change time L

[1] SBS [2] SBS Random Forests[3] Random Forests ii


11) 13) 11),12) 13) Y c Z c Image plane Y m iy O m Z m Marker coordinate system T, d X m f O c X c Camera coordinate system 1 Coordinates and problem

14 2 5

Gaze Head Eye (a) deg (b) 45 deg (c) 9 deg 1: - 1(b) - [5], [6] [7] Stahl [8], [9] Fang [1], [11] Itti [12] Itti [13] [7] Fang [1],

IPSJ SIG Technical Report 1,a) 1,b) 1,c) 1,d) 2,e) 2,f) 2,g) 1. [1] [2] 2 [3] Osaka Prefecture University 1 1, Gakuencho, Naka, Sakai,

Haiku Generation Based on Motif Images Using Deep Learning Koki Yoneda 1 Soichiro Yokoyama 2 Tomohisa Yamashita 2 Hidenori Kawamura Scho

Sobel Canny i

IPSJ SIG Technical Report GPS LAN GPS LAN GPS LAN Location Identification by sphere image and hybrid sensing Takayuki Katahira, 1 Yoshio Iwai 1


IPSJ SIG Technical Report Vol.2013-CVIM-187 No /5/30 1,a) 1,b), 1,,,,,,, (DNN),,,, 2 (CNN),, 1.,,,,,,,,,,,,,,,,,, [1], [6], [7], [12], [13]., [

Microsoft PowerPoint - SSII_harada pptx

Bulletin of JSSAC(2014) Vol. 20, No. 2, pp (Received 2013/11/27 Revised 2014/3/27 Accepted 2014/5/26) It is known that some of number puzzles ca

1(a) (b),(c) - [5], [6] Itti [12] [13] gaze eyeball head 2: [time] [7] Stahl [8], [9] Fang [1], [11] 3 -

kato-kuriki-2012-jjas-41-1.pdf

IPSJ SIG Technical Report Vol.2012-CG-148 No /8/29 3DCG 1,a) On rigid body animation taking into account the 3D computer graphics came

情報処理学会研究報告 IPSJ SIG Technical Report Vol.2013-CVIM-186 No /3/15 EMD 1,a) SIFT. SIFT Bag-of-keypoints. SIFT SIFT.. Earth Mover s Distance

Vol1-CVIM-172 No.7 21/5/ Shan 1) 2 2)3) Yuan 4) Ancuti 5) Agrawal 6) 2.4 Ben-Ezra 7)8) Raskar 9) Image domain Blur image l PSF b / = F(

(a) (b) 2 2 (Bosch, IR Illuminator 850 nm, UFLED30-8BD) ( 7[m] 6[m]) 3 (PointGrey Research Inc.Grasshopper2 M/C) Hz (a) (b

bag-of-words bag-of-keypoints Web bagof-keypoints Nearest Neighbor SVM Nearest Neighbor SIFT Nearest Neighbor bag-of-keypoints Nearest Neighbor SVM 84

研究シリーズ第40号

Microsoft Word - toyoshima-deim2011.doc

IPSJ SIG Technical Report Vol.2014-HCI-158 No /5/22 1,a) 2 2 3,b) Development of visualization technique expressing rainfall changing conditions

yoo_graduation_thesis.dvi

IR0036_62-3.indb

スケーリング理論とはなにか? - --尺度を変えて見えること--

xia2.dvi

22_05.dvi

1 (PCA) 3 2 P.Viola 2) Viola AdaBoost 1 Viola OpenCV 3) Web OpenCV T.L.Berg PCA kpca LDA k-means 4) Berg 95% Berg Web k-means k-means

DPA,, ShareLog 3) 4) 2.2 Strino Strino STRain-based user Interface with tacticle of elastic Natural ObjectsStrino 1 Strino ) PC Log-Log (2007 6)

IPSJ SIG Technical Report Vol.2009-CVIM-167 No /6/10 Real AdaBoost HOG 1 1 1, 2 1 Real AdaBoost HOG HOG Real AdaBoost HOG A Method for Reducing

Isogai, T., Building a dynamic correlation network for fat-tailed financial asset returns, Applied Network Science (7):-24, 206,

,,,,,,,,,,,,,,,,,,, 976%, i

L. S. Abstract. Date: last revised on 9 Feb translated to Japanese by Kazumoto Iguchi. Original papers: Received May 13, L. Onsager and S.

29 jjencode JavaScript

Stepwise Chow Test * Chow Test Chow Test Stepwise Chow Test Stepwise Chow Test Stepwise Chow Test Riddell Riddell first step second step sub-step Step

Computer Security Symposium October ,a) 1,b) Microsoft Kinect Kinect, Takafumi Mori 1,a) Hiroaki Kikuchi 1,b) [1] 1 Meiji U

Abstract This paper concerns with a method of dynamic image cognition. Our image cognition method has two distinguished features. One is that the imag

& Vol.5 No (Oct. 2015) TV 1,2,a) , Augmented TV TV AR Augmented Reality 3DCG TV Estimation of TV Screen Position and Ro

26 Development of Learning Support System for Fixation of Basketball Shoot Form

B_01田中.indd

it-ken_open.key

ばらつき抑制のための確率最適制御

19 Systematization of Problem Solving Strategy in High School Mathematics for Improving Metacognitive Ability

23 Fig. 2: hwmodulev2 3. Reconfigurable HPC 3.1 hw/sw hw/sw hw/sw FPGA PC FPGA PC FPGA HPC FPGA FPGA hw/sw hw/sw hw- Module FPGA hwmodule hw/sw FPGA h

Transcription:

(2001) 49 1 23 42 2000 10 16 2001 4 23 NTT * 1. 1.1 1998 * 104 0033 1 21 2 7F

24 49 1 2001 1999 70 91 MIT M. Turk Recognition Using Eigenface (Turk and Pentland (1991)). 1998 IC 1 CPU (Jain and Waller (1978), Raudys (1981)) 1997 Chellapa et al. 1995 Pentland and T. Choudbury 2000

25 1.2 CCD CRT x Gabor filter x x 2 2 NTTdata NTT 79 10 10 16 12

26 49 1 2001 1. NTTdata 2. UMIST 1 UMIST (Graham and Allinson (1998)). 20 40 60 15 10 3 50 15 15 2

27 2. 2.1 (Jain et al. (2000)) M. Turk Eigenface Turk M X all = { x 1,..., x i,..., x M } C all = 1 M µ all = 1 M MX MX j=1 MX x i ( µ x i )( µ x j ) T (2.1) C all v = λ v λ j v j j all m X k = { x k 1,..., x k i,..., x k m} d η = { v 1,..., v d } d { ξ k 1,..., ξ k m} µ k k ID x ξ µ k (2.2) D 2 = µ k ξ 2

28 49 1 2001 1. (NTTdata 1) k 1 10 1) 2) (Belhumer and Kriegman (1996)) 3 10 20 2.2 k 90 SVM (Support Vector Machine) Duda et al. 2001 Watanabe (Watanabe and Pakvasa (1973)).

29 1986. 1996 1989 Watanabe CLAFIC CLAFIC r X k = { x k 1,..., x k i,..., x k r} C k = 1 r µ k = 1 r rx rx rx j=1 x k i x k i x kt j (2.3) C k v k = λ k v k λ k j v j k q k ID j CLAFIC s (2.4) s = 1 x qx ( v i x) q UMIST 2

30 49 1 2001 2. (UMIST) 1 100 3. 3.1 1997 1985 v i CLAFIC s s = 1 x qx v i x q v j (3.1) X ij = qx l=1 ( v i v l )( v l v j ) (3.2) λ x = X ij x 1985

31 3 3.2 Nayar 1994 1995 Gnanadesikan 1977, Saito and Kariya 1988, (Diamantaras and Kung (1996), Oja (1982)), EM (Frey et al. (1998)) Turk Eigenface Bar et al. (1998) Moghaddam (1999) Schölkopf et al. (1998) Schölkopf Kernel PCA 1999 1 Schölkopf et al. (1998) SVM SVM

32 49 1 2001 1978 k m { x k 1,..., x k j,..., x k m} x (3.3) s k = k( x k i, x) s k Mercer (3.4) k(x, y) = X ψ i (x)ψ i (y) λ i 1953 (3.5) k(x, y) = X ψ i (x)ψ i (y) λ i = X ψ i (x) ψ i (y) =(Ψ(x) Ψ(y)) λi λi Schölkopf (3.6) Ψ : R N F, x X F (3.7) C = 1 m j=1 (Ψ( x j )Ψ( x j ) T ) F Ψ( x j )Ψ( x j ) T F (3.8) X Ψ( x j )(Ψ( x j ) X) F L 2 (3.9) > (Ψ( x) Ψ( x)) F V F\{0} C (3.10) λv = CV R N (3.11) λ(ψ( x k ) V )=(Ψ( x k ) CV ) α (3.12) V = α i Ψ( x i )

33 (3.11)(3.12) (3.13) λ m m α i (Ψ( x k ) Ψ( x i )) = 1 m α i ψψ( x k ) (3.14) K ij =(Ψ( x i ) Ψ( x j )) (3.13) (3.15) λ α i K ki = 1 m = 1 m α i ψψ( x k ) j=1 j=1 j=1 α i K kj K ji Ψ( x j )(Ψ( x j ) Ψ( x i )) Ψ( x j )K ji! α i (3.16) mλαk = αk 2 K 1 (3.17) mλα = αk α α x V (3.18) V Ψ( x) = 1 λ α i (Ψ( x i ) Ψ( x)) Ψ( ) Ψ( x) Ψ( y ) Ψ( ) (3.5) Ψ( x) Ψ( y ) k( x, y ) (3.19) V Ψ( x) = 1 λ α i k( x i, x) V k(x i,x j ) x i x j k( x i, x j )=r( x i x j ) x i x j ij = p 2(1 r( x i x j )) (Williams (2001)) Williams kernel MDS kernel MultiDimensional Scaling;!

34 49 1 2001 (1999) (1999) V λ x i x W ν V W V W (V W ) (V W ) F (3.12) V W (3.20) W = (3.21) V W = = Xm j=1 (3.5) (3.22) V W = Xm j=1 α jψ( x j) α i Ψ( x i ) Xm j=1 α jψ( x j) α i α j(ψ( x i ) Ψ( x j)) Xm j=1 α i α jk( x i, x j) (3.1)(3.2) (3.22) 1999 2001 SVM (Radial Basis Function; RBF) x y 2 (3.23) k( x, y ) = exp, σ 2 (3.24) k( x, y )=(1+ x y ) m, (3.25) k( x, y )=( x y ) m

35 3. σ,m UMIST (1999) (2001) 3 UMIST 1 2 2 2 4 5 2 4 3 4 1 100 5 outlier 1 1

36 49 1 2001 4. 5. 5

37 3.3 1. 2. 3 3. 1. Adini et al. 1997. 2 3 3 D. Marr 3 1999 Georghiades Illumination cone (Georghiades et al. (1998)). 3 Lambert (3.26) I = ρ( n l ) I l n Shashua (Shashua (1992)) Belhumeur and Kriegman (1996) Lambert I(4) 3

38 49 1 2001 6. 3 I(1),I(2),I(3) (3.27) I(4) = max ψ 3 X j=1 a(j)i(j), 0 6 a(j) 3 Î(1), Î(2), Î(3) Belhumeur and Kriegman (1998) Illumination cone Georghiades Illumination cone 3 3 Î(1), Î(2), Î(3) Illumination cone 3 k m I k (1),...,I k (m) 3 Î k (1), Î k (2), Î k (3) I Illumination cone (3.28) (s k ) 2 = I 2 3X j (Îk (j) I) 2 k Georghiades!

39 100 Illumination cone 3 2 3 Tomasi and Kanade 1992 1999 1998 3 F P P F 2P W W = R S R 3 R 2P 3 Illumination cone 3 Illumination cone Illumination cone (1998) Maki et al. (1998) Geotensity 4. UMIST Allinson NTT NTT

40 49 1 2001 Adini, Y., Moses, Y. and Ullman, S. (1997). Face recognition: The problem of compensating for changes in illumination direction, IEEE Trans. Pattern Analysis and Machine Intelligence, 19, 721 732. M. A., E. M., L. I. (1978). (1997). J80 D II(8), 2031 2046. Bar, S. D., Edelman, S., Howell, A. J. and Buxton, H. (1998). A similarity based method for generalization of face recognition over pose and expression, Proceedings of IEEE Automatic Recognition of Face and Gesture 98, 118 123. Belhumeur, P. B. and Kriegman, D. (1996). What is the set of images of an object under all possible illumination conditions?, Proceedings of International Conference of Computer Vision, 1053 1059. Belhumeur, P. B. and Kriegman, D. (1998). What is the set of images of an object under all possible illumination conditions?, International Journal of Computer Vision, 28(3), 245 260. Belhumeur, P. B., Hespanha, J. P. and Kriegman, D. J. (1997). Eigenface vs. Fisharfaces: Recognition using class specific linear projection, IEEE Trans. Pattern Analysis and Machine Intelligence, 19, 711 720. Chellapa, R., Wilson, C. J. and Sirohey, S. (1995). Human and machine recognition of face: A survey, Proceedings of IEEE, 83(5), 704 740. Diamantaras, K. I. and Kung, S. Y. (1996). Principal Component Neural Networks, Wiley, New York. Duda, R. O., Hart, P. E. and Stork, D. G. (2001). Pattern Classification, 2nd ed., Wiley, New York. Frey, B. J., Colmenarez, A. and Huang, T. S. (1998). Mixtures of local linear subspaces for face recognition, Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, 32 37. Georghiades, A. S., Kriegman, D. J. and Belhumeur, P. N. (1998). Illumination cones for recognition under variable lighting: Faces, Proceedings of Computer Vision and Pattern Recognition, 52 58. Gnanadesikan, R. (1977). Methods for Statistical Data Analysis of Multivariate Observations, Wiley, New York. 1979. Graham, D. B. and Allinson, N. S. (1998). Characterizing virtual eigensignatures for general purpose face recognition, Face Recognition: From Theory to Applications (eds. H. Wechsler et al.), p. 446, Springer, Berlin. (1998). PRMU98 134. (1989).. (1998). Jain, A. K. and Waller, W. G. (1978). On the optimal number of features in the classification multivariate Gaussian data, Pattern Recognition, 10, 365 374. Jain, A. K., Duin, R. P. W. and Mao, J. (2000). Statistical pattern recognition: A review, IEEE Trans. Pattern Analysis and Machine Intelligence, 22, 4 37. (1999). (1953)..

41 (1996). PRU96 104. (1999). (D II), J82 D II(4), 600 612. (1985). (D), J68 D(3), 345 352. Maki, A., Watanabe, M. and Wiles, C. (1998). Geotensity: Combining motion and lighting for 3D surface reconstruction, Proceedings of International Conference of Computer Vision 98, 1053 1060. (1998). Moghaddam, B. (1999). Principal manifolds and Bayesian subspaces for visual recognition, Proceedings of International Conference of Computer Vision, 1131 1136. (1995). CVCV WG (VI) CV97 9, 59 66. Nayar, S. K. (1994). 2 3 J77 D II(11), 2179 2187. (1998). PRMU98 90. Oja, E. (1982). A simplified neuron model as a principal component analyser, J. Math. Biol., 15, 267 273. (1986).. Pentland, A. and Choudbury, T. (2000). Face recognition for smart environments, IEEE Computer, 33, p. 50. Raudys, S. J. (1981). Determination of optimal dimensionality in statistical pattern recognition, Pattern Recognition, 11, 263 270. Saito, T. and Kariya, T. (1988). A generalization of principal component analysis, J. Japan Statist. Soc., 18(2), 187 193. (1999). PRMU99 29. (1999). PRMU99 116. (2001). J84 D II(8) Schölkopf, B., Smola, A. and Müller, K. R. (1998). Nonlinear component analysis as a kernel eigenvalue problem, Neural Computation, 10, 1299 1319. Shashua, Ammon (1992). Illumination and view position in 3D visual recognition, Advances in Neural Information Processing, 4, 404 411. Tomasi, C. and Kanade, T. (1992). Shape and motion from image stream under orthography: A factorization method, International Journal of Computer Vision, 9(2), 137 154. (1999). (D II), J82 D II(4), 592 599. Turk, M. and Pentland, A. (1991). Face recognition using eigenfaces, Proceedings of Computer Vision and Pattern Recognition, 568 591. Watanabe, S. and Pakvasa, N. (1973). Subspace method of pattern recognition, Proceedings of 1st International Joint Conference of Pattern Recognition, 25 32. Williams, C. K. I. (2001). On a connection between kernel PCA and metric multidimensional scaling, Advances in Neural Information Processing Systems 13 (eds. T. K. Leen, T. G. Diettrich and V. Tresp), MIT Press, Cambridge, Massachusetts (to appear). (1997). PRMU97 50.

42 Proceedings of the Institute of Statistical Mathematics Vol. 49, No. 1, 23 42 (2001) Principal Component Analysis in Pattern Recognition From the Viewpoint of Facial Image Recognition Hitoshi Sakano (NTT Data Corporation) In this article, we introduce How to use the principal component analysis in facial image recognition. We also introduce some improvement in the fields. First, we describe the role of principal component analysis in image recognition technology. And we point out some difficulties in facial image recognition technology, for example image change caused by illumination change, nonlinear distribution caused by head pose change. Finally, we introduce some improvement of principal component analysis and how to solve the problems. Key words: Pattern recognition, computer vision, principal component analysis, facial image recognition.