h(n) x(n) s(n) S (ω) = H(ω)X(ω) (5 1) H(ω) H(ω) = F[h(n)] (5 2) F X(ω) x(n) X(ω) = F[x(n)] (5 3) S (ω) s(n) S (ω) = F[s(n)] (5
|
|
|
- ゆきさ さくもと
- 5 years ago
- Views:
Transcription
1 N. Wiener FFT Norbert Wiener MIT c /(12)
2 h(n) x(n) s(n) S (ω) = H(ω)X(ω) (5 1) H(ω) H(ω) = F[h(n)] (5 2) F X(ω) x(n) X(ω) = F[x(n)] (5 3) S (ω) s(n) S (ω) = F[s(n)] (5 4) (5 1) S (ω) Ŝ (ω) E(ω) = S (ω) Ŝ (ω) = S (ω) H(ω)X(ω) (5 5) E[ E(ω) 2 ] = E[ S (ω) H(ω)X(ω) 2 ] (5 6) E[ ] (5 6) H(ω) E[ (ω) 2 ] H(ω) = 2H(ω)P XX (ω) 2P XS (ω) (5 7) P XX (ω) P XS (ω) P XX (ω) = E[ X(ω) 2 ] (5 8) P XS (ω) = E[X(ω)S (ω)] (5 9) P XX (ω) c /(12)
3 P X S (ω) (5 7) 0 (5 6) H(ω) (5 7) 2H(ω)P XX (ω) 2P XS (ω) = 0 (5 10) H(ω) = P XS (ω) P XX (ω) (5 11) (5 11) X(ω) S (ω) W(ω) = F[w(n)] (5 12) S (ω) X(ω) P XX (ω) = P S S (ω) + P WW (ω) (5 13) X(ω) S (ω) P XS = E[(S (ω) + W(ω))S (ω)] = E[ S (ω) 2 ] = P S S (ω) (5 14) S (ω) (5 13) (5 14) (5 11) H(ω) = P S S (ω) P S S (ω) + P WW (ω) (5 15) (5 15) 2) [ ] (5 15) ˆP S S (ω) = S (ω) 2 (5 16) ( ) c /(12)
4 ˆP WW (ω) = W(ω) 2 (5 17) (5 16)(5 17) (5 15) S (ω) H(ω) = 2 (5 18) S (ω) 2 + W(ω) 2 (5 18) S (ω) 2 S (ω) 2 X(ω) 2 (5 19) 3) 1) S (ω) 2 2) S (ω) 2 = X(ω) 2 W(ω) 2 (5 20) W(ω) 2 X(ω) 2 (5 20) (5 18) H(ω) = X(ω) 2 W(ω) 2 X(ω) 2 (5 21) Spectral Subtraction : SS SS kHz 10kHz 3.4kHz 10kHz 51.2ms 1/2 SS X(ω) (5 1) H(ω) S (ω) (5 21) c /(12)
5 H(ω) = X(ω) 2 W(ω) 2 X(ω) 2 (5 22) (5 22) X(ω) 2 < W(ω) 2 (5 23) 0 H(ω) 1 (5 24) (5 22) H(ω) H R (ω) = H(ω) + H(ω) 2 (5 25) (5 23) SS 5 1 SS c /(12)
6 1) S.F. Boll, Suppression of Acoustic Noise in Speech Using Spectral Subtraction, IEEE Trans. Acoustics, Speech and Signal Processing, vol.assp-27, no.7, pp , ) S.V. Vaseghi, Advanced Digital Signal Processing and Noise Reduction, Second Edition, Wiley, ) J.S. Lim and A.V. Oppenheim, Enhancement and bandwidth cpmpression of noisy speech, Proc. IEEE, vol.67, no.12, pp , c /(12)
7 ) WF WF WF WF N x y y y = Bx + n (5 26) B n n x WF x ˆx ˆx = Ay (5 27) E[ x ˆx 2 ] E[( )] ( ) ( ) ( ) A 2) A = RB T (BRB T + Q) 1 (5 28) ( ) T ( ) ( ) 1 ( ) R Q R = E[xx T ] Q = E[nn T ] (5 29) (5 30) B Q (5 28) WF R R WF WF 1 WF x n WF 2-D DFT 2-D DCT c /(12)
8 2-D DFT B x n X Y 2-D DFT U U U H U H U U H U = UU H = I I (5 27) (5 28) 2-D DFT 3) ˆX = ΩY Ω = UAU H = ΛD H (DΛD H + Γ) 1 (5 31) (5 32) a 2-D DFT A = Ua D = UBU H Λ = URU H Γ = UQU H Ω WF ω DFT (k) ω DFT (k) = λ(k)d H (k) ; k = 1, 2,, N λ(k) d(k) 2 + γ(k) (5 33) d(k) 2 λ(k) γ(k) D 2 Λ Γ k ˆx = U H ˆX B X Y 2-D DFT 2-D DCT 2 2-D DWT WF 2-D DWT 2-D DWT 2-D DWT WF (5 33) WF WF 2-D DWT β(k) ω DWT (k) = β(k) + σ ; k = 1, 2,, N (5 34) 2 β(k) 2-D DWT σ 2 3 FIR-WF 4) x x S y S WF FIR-WF FIR-WF WF WF x ˆx ˆx = a T y S (5 35) a E[(x ˆx) 2 ] a 5) a = C 1 c (5 36) c /(12)
9 C c y S y S x C = E[y S y T S ] c = E[y S x] (5 37) (5 38) (5 36) a WF 1 a = C 1 c + C T C 1 1 (1 1T C 1 c) (5 39) WF WF WF 6) (5 28) WF (5 28) 0 Q B WF B B WF 1 WF 2 WF 1 WF WF Tichonov 2) d H (k) ω DFT (k) = d(k) 2 + ɛ ; k = 1, 2,, N (5 40) 2 ɛ 2 (5 33) WF λ(k) γ(k) 5 WF MMSE 5) ˆx = E[x y] (5 41) E[x y] y x x n MMSE WF 5) WF (4) WF WF c /(12)
10 1 WF WF 7) D DWT 2-D DCT 2 1 WF a 2-D DWT 2-D DWT (5 34) β(k) 2 W 1 2-D DWT 2-D DWT X ˆX 1 W 2 X ˆX 2 = W 2 W1 T ˆX 1 (5 34) β(k) ˆX 2 2 (k) ˆX 2 (k) ˆX 2 k W 2 2-D DWT β(k) (5 34) WF 7) b 2-D DCT 2-D DCT 2-D DCT 8) 2 WF 1 2-D DCT WF 2 1 WF 8) 2 x f (x) y f (x y) x ˆx(y) L[x, ˆx(y)] L[x, ˆx(y)] L[x, ˆx(y)] = x ˆx(y) 2 (5 42) x x L[x, ˆx(y)] E[L[x, ˆx(y)] x] f (x) EE[L[x, ˆx(y)] x] EE[L[x, ˆx(y)] y] f (y) f (x y) E[L[x, ˆx(y)] y] 2 ˆx(y) = E[x y] MMSE 5) WF MMSE c /(12)
11 f (x) 9) 3 GMM 4) x L GMM M f (x L ) = P(s i )N(x L 0, R i ) i=1 (5 43) f ( ) M P(s) s N( µ, R) µ R ( ) GMM M E[ x ˆx 2 ] = N E[(x ˆx) 2 s i ]P(s i ) i=1 (5 44) E[(x ˆx) 2 s i ] WF FIR WF 10) GMM 11) WF WF a DWT DWT Λ L DWT Λ LO Λ L Γ L GMM [z i : i = 1, 2,, M] i z i Λ LO + Γ L GSM 10) b GMM EM 12) P(s i ), R i : i = 1, 2, M GMM (5) WF MMSE GMM WF MMSE 1) A. Jain, Fundamentals of Digital Image Processing. Englewood Cliffs, NJ: Prentice-Hall, c /(12)
12 2), II, vol.71, no.6, pp , June ) Richard A. Haddad, Thomas W. Parsons, Digital Signal Processing, NY: Computer Science Press, ) P.A. Maragos, R.W. Shafer and R.M. Mersereau, Two-Dimensional Linear Prediction and Its Application to Adaptive Predictive Coding of Images, IEEE Trans. Acoust. Speech & Signal Processing, vol. ASSP 32, no.6, pp , Dec ) Louis L. Scharf, Statistical Signal Processing, MA: Addison-Wesley Publishing Company, ) R. Neelamani, H. Choi, and R.G. Baraniuk, ForWaRD: Fourier wavelet regularized deconvolution for ill-conditioned systems, IEEE Trans. Signal Process., vol.52, no.2, pp , Feb ) S. Ghael, A. Sayeed, R. Baraniuk, Improved wavelet denoising via empirical wiener filtering, Proceedings of SPIE, San Diego, July ) Foi, A., V. Katkovnik, and K. Egiazarian, Pointwise Shape-Adaptive DCT for High-Quality Denoising and Deblocking of Grayscale and Color Images, IEEE Trans. Image Process., vol.16, no.5, pp , May ) Jose M. Bioucas-Dias, Bayesian Wavelet-Based Image Deconvolution:A GEM Algorithm Exploiting a Class of Heavy-Tailed Priors, IEEE Trans. Image Process., vol.15, no.4, April ) Javier Portilla, Vasily Strela, Martin J. Wainwright, and Eero P. Simoncelli, Image Denoising Using Scale Mixtures of Gaussians in the Wavelet Domain, IEEE Trans. Image Process, vol.12, no.11, Nov ) Yamane et. al., Image Restoration Using a Universal GMM Learning and Adaptive Wiener Filter, IEICE Trans. A, vol.92-a, no.10, Oct ) A. Dempster, N. Laird and D. Rubin, Maximum likelihood from incomplete data via the EM algorithm, J. Roy. Statist. Soc. B, vol.39, pp.1-38, c /(12)
IPSJ SIG Technical Report 1, Instrument Separation in Reverberant Environments Using Crystal Microphone Arrays Nobutaka ITO, 1, 2 Yu KITANO, 1
1, 2 1 1 1 Instrument Separation in Reverberant Environments Using Crystal Microphone Arrays Nobutaka ITO, 1, 2 Yu KITANO, 1 Nobutaka ONO 1 and Shigeki SAGAYAMA 1 This paper deals with instrument separation
pp d 2 * Hz Hz 3 10 db Wind-induced noise, Noise reduction, Microphone array, Beamforming 1
72 12 2016 pp. 739 748 739 43.60.+d 2 * 1 2 2 3 2 125 Hz 0.3 0.8 2 125 Hz 3 10 db Wind-induced noise, Noise reduction, Microphone array, Beamforming 1. 1.1 PSS [1] [2 4] 2 Wind-induced noise reduction
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
![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](/thumbs/91/107223763.jpg "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")
a) Change Detection Using Joint Intensity Histogram Yasuyo KITA a) 2 (0 255) (I 1 (x),i 2 (x)) I 2 = CI 1 (C>0) (I 1,I 2 ) (I 1,I 2 ) 2 1. [1] 2 [2] [3] [5] [6] [8] Intelligent Systems Research Institute,
1 -- 9 -- 3 3--1 LMS NLMS 2009 2 LMS Least Mean Square LMS Normalized LMS NLMS 3--1--1 3 1 AD 3 1 h(n) y(n) d(n) FIR w(n) n = 0, 1,, N 1 N N = 2 3--1-
1 -- 9 3 2009 2 LMS NLMS RLS FIR IIR 3-1 3-2 3-3 3-4 c 2011 1/(13) 1 -- 9 -- 3 3--1 LMS NLMS 2009 2 LMS Least Mean Square LMS Normalized LMS NLMS 3--1--1 3 1 AD 3 1 h(n) y(n) d(n) FIR w(n) n = 0, 1,, N
4 4 2 RAW 4 4 4 (PCA) 4 4 4 4 RAW RAW [5] 4 RAW 4 Park [12] Park 2 RAW RAW 2 RAW y = Mx + n. (1) y RAW x RGB M CFA n.. R G B σr 2, σ2 G, σ2 B D n ( )
![4 4 2 RAW 4 4 4 (PCA) 4 4 4 4 RAW RAW [5] 4 RAW 4 Park [12] Park 2 RAW RAW 2 RAW y = Mx + n. (1) y RAW x RGB M CFA n.. R G B σr 2, σ2 G, σ2 B D n ( )](/thumbs/40/20574692.jpg "4 4 2 RAW 4 4 4 (PCA) 4 4 4 4 RAW RAW [5] 4 RAW 4 Park [12] Park 2 RAW RAW 2 RAW y = Mx + n. (1) y RAW x RGB M CFA n.. R G B σr 2, σ2 G, σ2 B D n ( )")
RAW 4 E-mail: hakiyama@ok.ctrl.titech.ac.jp Abstract RAW RAW RAW RAW RAW 4 RAW RAW RAW 1 (CFA) CFA Bayer CFA [1] RAW CFA 1 2 [2, 3, 4, 5]. RAW RAW RAW RAW 3 [2, 3, 4, 5] (AWGN) [13, 14] RAW 2 RAW RAW RAW
2 DS SS (SS+DS) Fig. 2 Separation algorithm for motorcycle sound by combining DS and SS (SS+DS). 3. [3] DS SS 2 SS+DS 1 1 B SS SS 4. NMF 4. 1 (NMF) Y
![2 DS SS (SS+DS) Fig. 2 Separation algorithm for motorcycle sound by combining DS and SS (SS+DS). 3. [3] DS SS 2 SS+DS 1 1 B SS SS 4. NMF 4. 1 (NMF) Y](/thumbs/49/25425602.jpg "2 DS SS (SS+DS) Fig. 2 Separation algorithm for motorcycle sound by combining DS and SS (SS+DS). 3. [3] DS SS 2 SS+DS 1 1 B SS SS 4. NMF 4. 1 (NMF) Y")
a) Separation of Motorcycle Sound by Near Field Microphone Array and Nonnegative Matrix Factorization Chisaki YOSHINAGA, Nonmember, Yosuke TATEKURA a), Member, Kazuaki HAMADA, and Tetsuya KIMURA, Nonmembers
(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 α,
[II] Optimization Computation for 3-D Understanding of Images [II]: Ellipse Fitting 1. (1) 2. (2) (edge detection) (edge) (zero-crossing) Canny (Canny operator) (3) 1(a) [I] [II] [III] [IV ] E-mail sugaya@iim.ics.tut.ac.jp
H(ω) = ( G H (ω)g(ω) ) 1 G H (ω) (6) 2 H 11 (ω) H 1N (ω) H(ω)= (2) H M1 (ω) H MN (ω) [ X(ω)= X 1 (ω) X 2 (ω) X N (ω) ] T (3)
![H(ω) = ( G H (ω)g(ω) ) 1 G H (ω) (6) 2 H 11 (ω) H 1N (ω) H(ω)= (2) H M1 (ω) H MN (ω) [ X(ω)= X 1 (ω) X 2 (ω) X N (ω) ] T (3)](/thumbs/92/108069141.jpg "H(ω) = ( G H (ω)g(ω) ) 1 G H (ω) (6) 2 H 11 (ω) H 1N (ω) H(ω)= (2) H M1 (ω) H MN (ω) [ X(ω)= X 1 (ω) X 2 (ω) X N (ω) ] T (3)")
72 12 2016 pp. 777 782 777 * 43.60.Pt; 43.38.Md; 43.60.Sx 1. 1 2 [1 8] Flexible acoustic interface based on 3D sound reproduction. Yosuke Tatekura (Shizuoka University, Hamamatsu, 432 8561) 2. 2.1 3 M
2005 1
2005 1 1 1 2 2 2.1....................................... 2 2.2................................... 5 2.3 VSWR................................. 6 2.4 VSWR 2............................ 7 2.5.......................................
2003/3 Vol. J86 D II No.3 2.3. 4. 5. 6. 2. 1 1 Fig. 1 An exterior view of eye scanner. CCD [7] 640 480 1 CCD PC USB PC 2 334 PC USB RS-232C PC 3 2.1 2
![2003/3 Vol. J86 D II No.3 2.3. 4. 5. 6. 2. 1 1 Fig. 1 An exterior view of eye scanner. CCD [7] 640 480 1 CCD PC USB PC 2 334 PC USB RS-232C PC 3 2.1 2](/thumbs/42/22941906.jpg "2003/3 Vol. J86 D II No.3 2.3. 4. 5. 6. 2. 1 1 Fig. 1 An exterior view of eye scanner. CCD [7] 640 480 1 CCD PC USB PC 2 334 PC USB RS-232C PC 3 2.1 2")
Curved Document Imaging with Eye Scanner Toshiyuki AMANO, Tsutomu ABE, Osamu NISHIKAWA, Tetsuo IYODA, and Yukio SATO 1. Shape From Shading SFS [1] [2] 3 2 Department of Electrical and Computer Engineering,
1.indd
14 15 6 april 6 16 17 18 april 18 april 18 19 28 april 20 21 28 april 22 23 21 may 24 25 10 june 21 may 26 27 10 june 28 29 12 june 30 31 12 25 june 32 33 25 34 35 4 july 37 36 38 39 25 july 25 july 40
) ] [ h m x + y + + V x) φ = Eφ 1) z E = i h t 13) x << 1) N n n= = N N + 1) 14) N n n= = N N + 1)N + 1) 6 15) N n 3 n= = 1 4 N N + 1) 16) N n 4
![) ] [ h m x + y + + V x) φ = Eφ 1) z E = i h t 13) x << 1) N n n= = N N + 1) 14) N n n= = N N + 1)N + 1) 6 15) N n 3 n= = 1 4 N N + 1) 16) N n 4](/thumbs/92/107866707.jpg ") ] [ h m x + y + + V x) φ = Eφ 1) z E = i h t 13) x << 1) N n n= = N N + 1) 14) N n n= = N N + 1)N + 1) 6 15) N n 3 n= = 1 4 N N + 1) 16) N n 4")
1. k λ ν ω T v p v g k = π λ ω = πν = π T v p = λν = ω k v g = dω dk 1) ) 3) 4). p = hk = h λ 5) E = hν = hω 6) h = h π 7) h =6.6618 1 34 J sec) hc=197.3 MeV fm = 197.3 kev pm= 197.3 ev nm = 1.97 1 3 ev
ds2.dvi
1 Fourier 2 : Fourier s(t) Fourier S(!) = s(t) = 1 s(t)e j!t dt (1) S(!)e j!t d! (2) 1 1 s(t) S(!) S(!) =S Λ (!) Λ js T (!)j 2 P (!) = lim T!1 T S T (!) = T=2 T=2 (3) s(t)e j!t dt (4) T P (!) Fourier P
, [g/cm 3 ] [m/s] 1 6 [kg m 2 s 1 ] ,58 1, ,56 1, , ,58 1,
![, [g/cm 3 ] [m/s] 1 6 [kg m 2 s 1 ] ,58 1, ,56 1, , ,58 1,](/thumbs/70/63326930.jpg ", [g/cm 3 ] [m/s] 1 6 [kg m 2 s 1 ] ,58 1, ,56 1, , ,58 1,")
264 72 5 216 pp. 264 272 * 43.3. k, Yj; 43.38.Hz 1. 2. 2.1 1 4.8 1 2 [kg m 2 s 1 ] 1.2 1 3 [g/cm 3 ] 34 [m/s] 1.48 1 6 [kg m 2 s 1 ] 1 [g/cm 3 ] 1,48 [m/s] 1, 1 4 1 2,5 1 Tutorial on the underwater or
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 +
![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 +](/thumbs/81/83701592.jpg "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 +")
3 3D 1,a) 1 1 Kinect (X, Y) 3D 3D 1. 2010 Microsoft Kinect for Windows SDK( (Kinect) SDK ) 3D [1], [2] [3] [4] [5] [10] 30fps [10] 3 Kinect 3 Kinect Kinect for Windows SDK 3 Microsoft 3 Kinect for Windows
untitled
1 SS 2 2 (DS) 3 2.1 DS................................ 3 2.2 DS................................ 4 2.3.................................. 4 2.4 (channel papacity)............................ 6 2.5........................................
No. 3 Oct The person to the left of the stool carried the traffic-cone towards the trash-can. α α β α α β α α β α Track2 Track3 Track1 Track0 1
ACL2013 TACL 1 ACL2013 Grounded Language Learning from Video Described with Sentences (Yu and Siskind 2013) TACL Transactions of the Association for Computational Linguistics What Makes Writing Great?
Optical Flow t t + δt 1 Motion Field 3 3 1) 2) 3) Lucas-Kanade 4) 1 t (x, y) I(x, y, t)
http://wwwieice-hbkborg/ 2 2 4 2 -- 2 4 2010 9 3 3 4-1 Lucas-Kanade 4-2 Mean Shift 3 4-3 2 c 2013 1/(18) http://wwwieice-hbkborg/ 2 2 4 2 -- 2 -- 4 4--1 2010 9 4--1--1 Optical Flow t t + δt 1 Motion Field
10_08.dvi
476 67 10 2011 pp. 476 481 * 43.72.+q 1. MOS Mean Opinion Score ITU-T P.835 [1] [2] [3] Subjective and objective quality evaluation of noisereduced speech. Takeshi Yamada, Shoji Makino and Nobuhiko Kitawaki
2.2 (a) = 1, M = 9, p i 1 = p i = p i+1 = 0 (b) = 1, M = 9, p i 1 = 0, p i = 1, p i+1 = 1 1: M 2 M 2 w i [j] w i [j] = 1 j= w i w i = (w i [ ],, w i [
![2.2 (a) = 1, M = 9, p i 1 = p i = p i+1 = 0 (b) = 1, M = 9, p i 1 = 0, p i = 1, p i+1 = 1 1: M 2 M 2 w i [j] w i [j] = 1 j= w i w i = (w i [ ],, w i [](/thumbs/93/111684107.jpg "2.2 (a) = 1, M = 9, p i 1 = p i = p i+1 = 0 (b) = 1, M = 9, p i 1 = 0, p i = 1, p i+1 = 1 1: M 2 M 2 w i [j] w i [j] = 1 j= w i w i = (w i [ ],, w i [")
RI-002 Encoding-oriented video generation algorithm based on control with high temporal resolution Yukihiro BANDOH, Seishi TAKAMURA, Atsushi SHIMIZU 1 1T / CMOS [1] 4K (4096 2160 /) 900 Hz 50Hz,60Hz 240Hz
1 -- 9 -- 6 6--1 (DFT) 009 DFT: Discrete Fourier Transform 6--1--1 N x[n] DFT N 1 X[k] = x[n]wn kn, k = 0, 1,, N 1 (6 ) n=0 1) W N = e j π N W N twidd
![1 -- 9 -- 6 6--1 (DFT) 009 DFT: Discrete Fourier Transform 6--1--1 N x[n] DFT N 1 X[k] = x[n]wn kn, k = 0, 1,, N 1 (6 ) n=0 1) W N = e j π N W N twidd](/thumbs/42/23059160.jpg "1 -- 9 -- 6 6--1 (DFT) 009 DFT: Discrete Fourier Transform 6--1--1 N x[n] DFT N 1 X[k] = x[n]wn kn, k = 0, 1,, N 1 (6 ) n=0 1) W N = e j π N W N twidd")
1 -- 9 6 009 (DFT) 6-1 DFT 6- DFT FFT 6-3 DFT 6-4 6-5 c 011 1/(0) 1 -- 9 -- 6 6--1 (DFT) 009 DFT: Discrete Fourier Transform 6--1--1 N x[n] DFT N 1 X[k] = x[n]wn kn, k = 0, 1,, N 1 (6 ) n=0 1) W N = e
yoo_graduation_thesis.dvi
200 3 A Graduation Thesis of College of Engineering, Chubu University Keypoint Matching of Range Data from Features of Shape and Appearance Yohsuke Murai 1 1 2 2.5D 3 2.1 : : : : : : : : : : : : : : :
2013 M
2013 M0110453 2013 : M0110453 20 1 1 1.1............................ 1 1.2.............................. 4 2 5 2.1................................. 6 2.2................................. 8 2.3.................................
renshumondai-kaito.dvi
3 1 13 14 1.1 1 44.5 39.5 49.5 2 0.10 2 0.10 54.5 49.5 59.5 5 0.25 7 0.35 64.5 59.5 69.5 8 0.40 15 0.75 74.5 69.5 79.5 3 0.15 18 0.90 84.5 79.5 89.5 2 0.10 20 1.00 20 1.00 2 1.2 1 16.5 20.5 12.5 2 0.10
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
![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](/thumbs/92/110416683.jpg "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")
x-means 1 2 2 x-means, x-means k-means Bayesian Information Criterion BIC Watershed x-means Moving Object Extraction Using the Number of Clusters Determined by X-means Clustering Naoki Kubo, 1 Kousuke
Vol.58 No (Sep. 2017) 1 2,a) 3 1,b) , A EM A Latent Class Model to Analyze the Relationship Between Companies Appeal Poi
1 2,a) 3 1,b) 2017 1 17, 2017 6 6 A EM A Latent Class Model to Analyze the Relationship Between Companies Appeal Points and Students Reasons for Application Teppei Sakamoto 1 Haruka Yamashita 2,a) Tairiku
RCS 5 5G 28 10 19 1 1 2 3 2.1........................................ 3 2.2............................... 3 2.3.............................. 10 3 17 3.1...................................... 17 3.2
UWB a) Accuracy of Relative Distance Measurement with Ultra Wideband System Yuichiro SHIMIZU a) and Yukitoshi SANADA (Ultra Wideband; UWB) UWB GHz DLL
UWB a) Accuracy of Relative Distance Measurement with Ultra Wideband System Yuichiro SHIMIZU a) and Yukitoshi SANADA (Ultra Wideband; UWB) UWB GHz DLL UWB (DLL) UWB DLL 1. UWB FCC (Federal Communications
Kalman ( ) 1) (Kalman filter) ( ) t y 0,, y t x ˆx 3) 10) t x Y [y 0,, y ] ) x ( > ) ˆx (prediction) ) x ( ) ˆx (filtering) )
![Kalman ( ) 1) (Kalman filter) ( ) t y 0,, y t x ˆx 3) 10) t x Y [y 0,, y ] ) x ( > ) ˆx (prediction) ) x ( ) ˆx (filtering) )](/thumbs/90/103118389.jpg "Kalman ( ) 1) (Kalman filter) ( ) t y 0,, y t x ˆx 3) 10) t x Y [y 0,, y ] ) x ( > ) ˆx (prediction) ) x ( ) ˆx (filtering) )")
1 -- 5 6 2009 3 R.E. Kalman ( ) H 6-1 6-2 6-3 H Rudolf Emil Kalman IBM IEEE Medal of Honor(1974) (1985) c 2011 1/(23) 1 -- 5 -- 6 6--1 2009 3 Kalman ( ) 1) (Kalman filter) ( ) t y 0,, y t x ˆx 3) 10) t
impulse_response.dvi
5 Time Time Level Level Frequency Frequency Fig. 5.1: [1] 2004. [2] P. A. Nelson, S. J. Elliott, Active Noise Control, Academic Press, 1992. [3] M. R. Schroeder, Integrated-impulse method measuring sound
の さ ま ざ ま な 要 素 技 術 と の イ ン テ グ レー シ ョ ン が 必 要 で あ り,ト ー タ ル で み た 場 合 に,研 だ い ろ い ろ あ る よ う に 思 う.今 究 に 加 え,こ 究 開 発 す べ き課 題 は,ま 後 は,個 れ ら を 融 合 す る 技 術 の 研 究 開 発 が 望 ま れ る だ ろ う. (2003年12月4日 参 図9 応 用
ii 3.,. 4. F. (), ,,. 8.,. 1. (75%) (25%) =7 20, =7 21 (. ). 1.,, (). 3.,. 1. ().,.,.,.,.,. () (12 )., (), 0. 2., 1., 0,.
24(2012) (1 C106) 4 11 (2 C206) 4 12 http://www.math.is.tohoku.ac.jp/~obata,.,,,.. 1. 2. 3. 4. 5. 6. 7.,,. 1., 2007 (). 2. P. G. Hoel, 1995. 3... 1... 2.,,. ii 3.,. 4. F. (),.. 5... 6.. 7.,,. 8.,. 1. (75%)
P361
ΣAD -RFDAC - High-Speed Continuous-Time Bandpass ΣAD Modulator Architecture Employing Sub-Sampling Technnique with 376-8515 1-5-1 Masafumi Uemori Tomonari Ichikawa Haruo Kobayashi Department of Electronic
³ÎΨÏÀ
2017 12 12 Makoto Nakashima 2017 12 12 1 / 22 2.1. C, D π- C, D. A 1, A 2 C A 1 A 2 C A 3, A 4 D A 1 A 2 D Makoto Nakashima 2017 12 12 2 / 22 . (,, L p - ). Makoto Nakashima 2017 12 12 3 / 22 . (,, L p
Real AdaBoost HOG 2009 3 A Graduation Thesis of College of Engineering, Chubu University Efficient Reducing Method of HOG Features for Human Detection based on Real AdaBoost Chika Matsushima ITS Graphics
main.dvi
FDTD S A Study on FDTD Analysis based on S-Parameter 18 2 7 04GD168 FDTD FDTD S S FDTD S S S S FDTD FDTD i 1 1 1.1 FDTD.................................... 1 1.2 FDTD..................... 3 2 S 5 2.1 FDTD
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
PAL On the Precision of 3D Measurement by Stereo PAL Images Hiroyuki HASE,HirofumiKAWAI,FrankEKPAR, Masaaki YONEDA,andJien KATO PAL 3 PAL Panoramic Annular Lens 1985 Greguss PAL 1 PAL PAL 2 3 2 PAL DP
通信容量制約を考慮したフィードバック制御 - 電子情報通信学会 情報理論研究会（IT） 若手研究者のための講演会
IT 1 2 1 2 27 11 24 15:20 16:05 ( ) 27 11 24 1 / 49 1 1940 Witsenhausen 2 3 ( ) 27 11 24 2 / 49 1940 2 gun director Warren Weaver, NDRC (National Defence Research Committee) Final report D-2 project #2,
IPSJ SIG Technical Report Taubin Ellipse Fitting by Hyperaccurate Least Squares Yuuki Iwamoto, 1 Prasanna Rangarajan 2 and Kenichi Kanatani
1 2 1 2 Taubin Ellipse Fitting by Hyperaccurate Least Squares Yuuki Iwamoto, 1 Prasanna Rangarajan 2 and Kenichi Kanatani 1 This paper presents a new method for fitting an ellipse to a point sequence extracted
1 Tokyo Daily Rainfall (mm) Days (mm)
( ) r-taka@maritime.kobe-u.ac.jp 1 Tokyo Daily Rainfall (mm) 0 100 200 300 0 10000 20000 30000 40000 50000 Days (mm) 1876 1 1 2013 12 31 Tokyo, 1876 Daily Rainfall (mm) 0 50 100 150 0 100 200 300 Tokyo,
微分積分 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. このサンプルページの内容は, 初版 1 刷発行時のものです.
微分積分 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. ttp://www.morikita.co.jp/books/mid/00571 このサンプルページの内容は, 初版 1 刷発行時のものです. i ii 014 10 iii [note] 1 3 iv 4 5 3 6 4 x 0 sin x x 1 5 6 z = f(x, y) 1 y = f(x)
IPSJ SIG Technical Report Vol.2010-AVM-68 No /3/ High-Efficient 2-pass Video Coding Algorithm based on Macroblock Rate-Distortion Kazu
. High-Efficient -pass Video Coding Algorithm based on Macroblock Rate-Distortion Kazuya Yokohari, Atsushi Sagata and Kazuto Kamikura In order to achieve high-efficient video coding, -pass video coding
2006 Indexed Fuzzy Vault 3ADM1117 3ADM3225
2006 Indexed Fuzzy Vault 3ADM1117 3ADM3225 1 1 2 Fuzzy Vault Scheme 2 2.1................................... 2 2.2............................... 2 2.3............................. 2 3 3 3.1 Reed-Solomon...........................
it-ken_open.key
深層学習技術の進展 ImageNet Classification 画像認識 音声認識 自然言語処理 機械翻訳 深層学習技術は これらの分野において 特に圧倒的な強みを見せている Figure (Left) Eight ILSVRC-2010 test Deep images and the cited4: from: ``ImageNet Classification with Networks et
JIS Z803: (substitution method) 3 LCR LCR GPIB
LCR NMIJ 003 Agilent 8A 500 ppm JIS Z803:000 50 (substitution method) 3 LCR LCR GPIB Taylor 5 LCR LCR meter (Agilent 8A: Basic accuracy 500 ppm) V D z o I V DUT Z 3 V 3 I A Z V = I V = 0 3 6 V, A LCR meter
読めば必ずわかる 分散分析の基礎 第２版
2 2003 12 5 ( ) ( ) 2 I 3 1 3 2 2? 6 3 11 4? 12 II 14 5 15 6 16 7 17 8 19 9 21 10 22 11 F 25 12 : 1 26 3 I 1 17 11 x 1, x 2,, x n x( ) x = 1 n n i=1 x i 12 (SD ) x 1, x 2,, x n s 2 s 2 = 1 n n (x i x)
ばらつき抑制のための確率最適制御
( ) http://wwwhayanuemnagoya-uacjp/ fujimoto/ 2011 3 9 11 ( ) 2011/03/09-11 1 / 46 Outline 1 2 3 4 5 ( ) 2011/03/09-11 2 / 46 Outline 1 2 3 4 5 ( ) 2011/03/09-11 3 / 46 (1/2) r + Controller - u Plant y
2004 2005 2 2 1G01P038-0 1 2 1.1.............................. 2 1.2......................... 2 1.3......................... 3 2 4 2.1............................ 4 2.2....................... 4 2.3.......................
:EM,,. 4 EM. EM Finch, (AIC)., ( ), ( ), Web,,.,., [1].,. 2010,,,, 5 [2]., 16,000.,..,,. (,, )..,,. (socio-dynamics) [3, 4]. Weidlich Haag.
![:EM,,. 4 EM. EM Finch, (AIC)., ( ), ( ), Web,,.,., [1].,. 2010,,,, 5 [2]., 16,000.,..,,. (,, )..,,. (socio-dynamics) [3, 4]. Weidlich Haag.](/thumbs/102/154192978.jpg ":EM,,. 4 EM. EM Finch, (AIC)., ( ), ( ), Web,,.,., [1].,. 2010,,,, 5 [2]., 16,000.,..,,. (,, )..,,. (socio-dynamics) [3, 4]. Weidlich Haag.")
:EM,,. 4 EM. EM Finch, (AIC)., ( ), ( ),. 1. 1990. Web,,.,., [1].,. 2010,,,, 5 [2]., 16,000.,..,,. (,, )..,,. (socio-dynamics) [3, 4]. Weidlich Haag. [5]. 606-8501,, TEL:075-753-5515, FAX:075-753-4919,
main.dvi
4 DFT DFT Fast Fourier Transform: FFT 4.1 DFT IDFT X(k) = 1 n=0 x(n)e j2πkn (4.1) 1 x(n) = 1 X(k)e j2πkn (4.2) k=0 x(n) X(k) DFT 2 ( 1) 2 4 2 2(2 1) 2 O( 2 ) 4.2 FFT 4.2.1 radix2 FFT 1 (4.1) 86 4. X(0)
,.,. NP,., ,.,,.,.,,, (PCA)...,,. Tipping and Bishop (1999) PCA. (PPCA)., (Ilin and Raiko, 2010). PPCA EM., , tatsukaw
,.,. NP,.,. 1 1.1.,.,,.,.,,,. 2. 1.1.1 (PCA)...,,. Tipping and Bishop (1999) PCA. (PPCA)., (Ilin and Raiko, 2010). PPCA EM., 152-8552 2-12-1, tatsukawa.m.aa@m.titech.ac.jp, 190-8562 10-3, mirai@ism.ac.jp
22 / ( ) OD (Origin-Destination)
23 2 15 22 / ( ) OD (Origin-Destination) 1 1 2 3 2.1....................................... 3 2.2......................................... 3 2.3.......................................... 5 2.4............................
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
Vol. 44 No. SIG 9(CVIM 7) July 2003, Robby T. Tan, 1 Estimating Illumination Position, Color and Surface Reflectance Properties from a Single Image Kenji Hara,, Robby T. Tan, Ko Nishino, Atsushi Nakazawa,
waseda2010a-jukaiki1-main.dvi
November, 2 Contents 6 2 8 3 3 3 32 32 33 5 34 34 6 35 35 7 4 R 2 7 4 4 9 42 42 2 43 44 2 5 : 2 5 5 23 52 52 23 53 53 23 54 24 6 24 6 6 26 62 62 26 63 t 27 7 27 7 7 28 72 72 28 73 36) 29 8 29 8 29 82 3
O1-1 O1-2 O1-3 O1-4 O1-5 O1-6
O1-1 O1-2 O1-3 O1-4 O1-5 O1-6 O1-7 O1-8 O1-9 O1-10 O1-11 O1-12 O1-13 O1-14 O1-15 O1-16 O1-17 O1-18 O1-19 O1-20 O1-21 O1-22 O1-23 O1-24 O1-25 O1-26 O1-27 O1-28 O1-29 O1-30 O1-31 O1-32 O1-33 O1-34 O1-35
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
Journal Article / 学術雑誌論文 ベイズアプローチによる最適識別系の有限 標本効果に関する考察 : 学習標本の大きさ がクラス間で異なる場合 (< 論文小特集 > パ ターン認識のための学習 : 基礎と応用 On the limited sample effect of bayesian approach : the case of each class 韓, 雪仙 ; 若林, 哲史
5 Armitage x 1,, x n y i = 10x i + 3 y i = log x i {x i } {y i } 1.2 n i i x ij i j y ij, z ij i j 2 1 y = a x + b ( cm) x ij (i j )
5 Armitage. x,, x n y i = 0x i + 3 y i = log x i x i y i.2 n i i x ij i j y ij, z ij i j 2 y = a x + b 2 2. ( cm) x ij (i j ) (i) x, x 2 σ 2 x,, σ 2 x,2 σ x,, σ x,2 t t x * (ii) (i) m y ij = x ij /00 y
V 0 = + r pv (H) + qv (T ) = + r ps (H) + qs (T ) = S 0 X n+ (T ) = n S n+ (T ) + ( + r)(x n n S n ) = ( + r)x n + n (d r)s n = ( + r)v n + V n+(h) V
I (..2) (0 < d < + r < u) X 0, X X = 0 S + ( + r)(x 0 0 S 0 ) () X 0 = 0, P (X 0) =, P (X > 0) > 0 0 H, T () X 0 = 0, X (H) = 0 us 0 ( + r) 0 S 0 = 0 S 0 (u r) X (T ) = 0 ds 0 ( + r) 0 S 0 = 0 S 0 (d r)
untitled
K-Means 1 5 2 K-Means 7 2.1 K-Means.............................. 7 2.2 K-Means.......................... 8 2.3................... 9 3 K-Means 11 3.1.................................. 11 3.2..................................
201711grade1ouyou.pdf
2017 11 26 1 2 52 3 12 13 22 23 32 33 42 3 5 3 4 90 5 6 A 1 2 Web Web 3 4 1 2... 5 6 7 7 44 8 9 1 2 3 1 p p >2 2 A 1 2 0.6 0.4 0.52... (a) 0.6 0.4...... B 1 2 0.8-0.2 0.52..... (b) 0.6 0.52.... 1 A B 2
カルマンフィルターによるベータ推定（ ）
β TOPIX 1 22 β β smoothness priors (the Capital Asset Pricing Model, CAPM) CAPM 1 β β β β smoothness priors :,,. E-mail: koiti@ism.ac.jp., 104 1 TOPIX β Z i = β i Z m + α i (1) Z i Z m α i α i β i (the
ii 3.,. 4. F. (), ,,. 8.,. 1. (75% ) (25% ) =9 7, =9 8 (. ). 1.,, (). 3.,. 1. ( ).,.,.,.,.,. ( ) (1 2 )., ( ), 0. 2., 1., 0,.
23(2011) (1 C104) 5 11 (2 C206) 5 12 http://www.math.is.tohoku.ac.jp/~obata,.,,,.. 1. 2. 3. 4. 5. 6. 7.,,. 1., 2007 ( ). 2. P. G. Hoel, 1995. 3... 1... 2.,,. ii 3.,. 4. F. (),.. 5.. 6.. 7.,,. 8.,. 1. (75%
Summary 3D cinemas are becoming real thanks to digital image processing technology. The most feasible and stable technology based on the binocular dis
Summary 3D cinemas are becoming real thanks to digital image processing technology. The most feasible and stable technology based on the binocular disparity requires stereoglasses. However, there is still
ii 3.,. 4. F. ( ), ,,. 8.,. 1. (75% ) (25% ) =7 24, =7 25, =7 26 (. ). 1.,, ( ). 3.,...,.,.,.,.,. ( ) (1 2 )., ( ), 0., 1., 0,.
(1 C205) 4 10 (2 C206) 4 11 (2 B202) 4 12 25(2013) http://www.math.is.tohoku.ac.jp/~obata,.,,,..,,. 1. 2. 3. 4. 5. 6. 7. 8. 1., 2007 ( ).,. 2. P. G., 1995. 3. J. C., 1988. 1... 2.,,. ii 3.,. 4. F. ( ),..
X G P G (X) G BG [X, BG] S 2 2 2 S 2 2 S 2 = { (x 1, x 2, x 3 ) R 3 x 2 1 + x 2 2 + x 2 3 = 1 } R 3 S 2 S 2 v x S 2 x x v(x) T x S 2 T x S 2 S 2 x T x S 2 = { ξ R 3 x ξ } R 3 T x S 2 S 2 x x T x S 2
() n C + n C + n C + + n C n n (3) n C + n C + n C 4 + n C + n C 3 + n C 5 + (5) (6 ) n C + nc + 3 nc n nc n (7 ) n C + nc + 3 nc n nc n (
3 n nc k+ k + 3 () n C r n C n r nc r C r + C r ( r n ) () n C + n C + n C + + n C n n (3) n C + n C + n C 4 + n C + n C 3 + n C 5 + (4) n C n n C + n C + n C + + n C n (5) k k n C k n C k (6) n C + nc
& 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),
.... Deeping and Expansion of Large-Scale Random Fields and Probabilistic Image Processing Kazuyuki Tanaka The mathematical frameworks of probabilistic image processing are formulated by means of Markov
AC Modeling and Control of AC Motors Seiji Kondo, Member 1. q q (1) PM (a) N d q Dept. of E&E, Nagaoka Unive
AC Moeling an Control of AC Motors Seiji Kono, Member 1. (1) PM 33 54 64. 1 11 1(a) N 94 188 163 1 Dept. of E&E, Nagaoka University of Technology 163 1, Kamitomioka-cho, Nagaoka, Niigata 94 188 (a) 巻数
IPSJ SIG Technical Report Vol.2015-MUS-107 No /5/23 HARK-Binaural Raspberry Pi 2 1,a) ( ) HARK 2 HARK-Binaural A/D Raspberry Pi 2 1.
HARK-Binaural Raspberry Pi 2 1,a) 1 1 1 2 3 () HARK 2 HARK-Binaural A/D Raspberry Pi 2 1. [1,2] [2 5] () HARK (Honda Research Institute Japan audition for robots with Kyoto University) *1 GUI ( 1) Python
図 2: 高周波成分を用いた超解像 解像度度画像とそれらを低解像度化して得られる 低解像度画像との差により低解像度の高周波成分 を得る 高解像度と低解像度の高周波成分から位 置関係を保ったままパッチ領域をそれぞれ切り出 し 高解像度パッチ画像と低解像度パッチ画像の ペアとしてデータベースに登録する
Exemplar-Based Super-Resolution of Human Body Image in Surveillance Video 1 1,2 1 1 1 Kento Nishibori 1, Tomokazu TAKAHASHI 1,2, Daisuke DEGUCHI 1, Ichiro IDE 1 and Hiroshi MURASE 1 1 2 nishiborik@murase.m.is.nagoya-u.ac.jp
6.1 (P (P (P (P (P (P (, P (, P.
(011 30 7 0 ( ( 3 ( 010 1 (P.3 1 1.1 (P.4.................. 1 1. (P.4............... 1 (P.15.1 (P.16................. (P.0............3 (P.18 3.4 (P.3............... 4 3 (P.9 4 3.1 (P.30........... 4 3.
Part () () Γ Part ,
Contents a 6 6 6 6 6 6 6 7 7. 8.. 8.. 8.3. 8 Part. 9. 9.. 9.. 3. 3.. 3.. 3 4. 5 4.. 5 4.. 9 4.3. 3 Part. 6 5. () 6 5.. () 7 5.. 9 5.3. Γ 3 6. 3 6.. 3 6.. 3 6.3. 33 Part 3. 34 7. 34 7.. 34 7.. 34 8. 35
SICE東北支部研究集会資料（2017年）
307 (2017.2.27) 307-8 Deep Convolutional Neural Network X Detecting Masses in Mammograms Based on Transfer Learning of A Deep Convolutional Neural Network Shintaro Suzuki, Xiaoyong Zhang, Noriyasu Homma,
seminar0220a.dvi
1 Hi-Stat 2 16 2 20 16:30-18:00 2 2 217 1 COE 4 COE RA E-MAIL: ged0104@srv.cc.hit-u.ac.jp 2004 2 25 S-PLUS S-PLUS S-PLUS S-code 2 [8] [8] [8] 1 2 ARFIMA(p, d, q) FI(d) φ(l)(1 L) d x t = θ(l)ε t ({ε t }
特許侵害訴訟における無効の主張を認めた判決─半導体装置事件−
[*1847] 12 4 11 10 364 54 4 1368 1710 68 1032 120 X Y 6.8.31 29 3 875 X Y 9.9.10 29 3 819 Y 320275 391468 46 12 21 35 2 6 3513745 39 1 30 320249 1) 1 39 1 [*1848] 2) 3) Y 10 51 2 4 39 5 39 1 3 139 7 2
2 1,2, , 2 ( ) (1) (2) (3) (4) Cameron and Trivedi(1998) , (1987) (1982) Agresti(2003)
3 1 1 1 2 1 2 1,2,3 1 0 50 3000, 2 ( ) 1 3 1 0 4 3 (1) (2) (3) (4) 1 1 1 2 3 Cameron and Trivedi(1998) 4 1974, (1987) (1982) Agresti(2003) 3 (1)-(4) AAA, AA+,A (1) (2) (3) (4) (5) (1)-(5) 1 2 5 3 5 (DI)
2008 : 80725872 1 2 2 3 2.1.......................................... 3 2.2....................................... 3 2.3......................................... 4 2.4 ()..................................
Microsoft Word - 信号処理3.doc
Junji OHTSUBO 2012 FFT FFT SN sin cos x v ψ(x,t) = f (x vt) (1.1) t=0 (1.1) ψ(x,t) = A 0 cos{k(x vt) + φ} = A 0 cos(kx ωt + φ) (1.2) A 0 v=ω/k φ ω k 1.3 (1.2) (1.2) (1.2) (1.1) 1.1 c c = a + ib, a = Re[c],
11 22 33 12 23 1 2 3, 1 2, U2 3 U 1 U b 1 (o t ) b 2 (o t ) b 3 (o t ), 3 b (o t ) MULTI-SPEAKER SPEECH DATABASE Training Speech Analysis Mel-Cepstrum, logf0 /context1/ /context2/... Context Dependent
x T = (x 1,, x M ) x T x M K C 1,, C K 22 x w y 1: 2 2
Takio Kurita Neurosceince Research Institute, National Institute of Advanced Indastrial Science and Technology takio-kurita@aistgojp (Support Vector Machine, SVM) 1 (Support Vector Machine, SVM) ( ) 2
: , 2.0, 3.0, 2.0, (%) ( 2.
2017 1 2 1.1...................................... 2 1.2......................................... 4 1.3........................................... 10 1.4................................. 14 1.5..........................................
3807 (3)(2) ,267 1 Fig. 1 Advertisement to the author of a blog. 3 (1) (2) (3) (2) (1) TV 2-0 Adsense (2) Web ) 6) 3
Vol. 52 No. 12 3806 3816 (Dec. 2011) 1 1 Discovering Latent Solutions from Expressions of Dissatisfaction in Blogs Toshiyuki Sakai 1 and Ko Fujimura 1 This paper aims to find the techniques or goods that
sumi.indd
S/N S/N CCDCMOS CCD CMOS & E-mail hirofumi.sumi@jp.sony.com & E-mail Tadakuni.Narabu@jp.sony.com & E-mail Shinichiro.Saito@jp.sony.com Hirofumi SUMI, Non - Member and Tadakuni NARABU, Member and Shinichiro
solutionJIS.dvi
May 0, 006 6 morimune@econ.kyoto-u.ac.jp /9/005 (7 0/5/006 1 1.1 (a) (b) (c) c + c + + c = nc (x 1 x)+(x x)+ +(x n x) =(x 1 + x + + x n ) nx = nx nx =0 c(x 1 x)+c(x x)+ + c(x n x) =c (x i x) =0 y i (x
1).1-5) - 9 -
- 8 - 1).1-5) - 9 - ε = ε xx 0 0 0 ε xx 0 0 0 ε xx (.1 ) z z 1 z ε = ε xx ε x y 0 - ε x y ε xx 0 0 0 ε zz (. ) 3 xy ) ε xx, ε zz» ε x y (.3 ) ε ij = ε ij ^ (.4 ) 6) xx, xy ε xx = ε xx + i ε xx ε xy = ε
日立評論2007年3月号 : ソフトウェア開発への
Vol.89 No.3 298-299 Application of Statistical Process Control to Software Development Mutsumi Komuro 1 23 1985 ACM IEEE 1 195QC Quality Control 1 2 CMM Capability Maturity Model CMMI Capability Maturity
7 π L int = gψ(x)ψ(x)φ(x) + (7.4) [ ] p ψ N = n (7.5) π (π +,π 0,π ) ψ (σ, σ, σ )ψ ( A) σ τ ( L int = gψψφ g N τ ) N π * ) (7.6) π π = (π, π, π ) π ±
![7 π L int = gψ(x)ψ(x)φ(x) + (7.4) [ ] p ψ N = n (7.5) π (π +,π 0,π ) ψ (σ, σ, σ )ψ ( A) σ τ ( L int = gψψφ g N τ ) N π * ) (7.6) π π = (π, π, π ) π ±](/thumbs/91/106462075.jpg "7 π L int = gψ(x)ψ(x)φ(x) + (7.4) [ ] p ψ N = n (7.5) π (π +,π 0,π ) ψ (σ, σ, σ )ψ ( A) σ τ ( L int = gψψφ g N τ ) N π * ) (7.6) π π = (π, π, π ) π ±")
7 7. ( ) SU() SU() 9 ( MeV) p 98.8 π + π 0 n 99.57 9.57 97.4 497.70 δm m 0.4%.% 0.% 0.8% π 9.57 4.96 Σ + Σ 0 Σ 89.6 9.46 K + K 0 49.67 (7.) p p = αp + βn, n n = γp + δn (7.a) [ ] p ψ ψ = Uψ, U = n [ α
L P y P y + ɛ, ɛ y P y I P y,, y P y + I P y, 3 ŷ β 0 β y β 0 β y β β 0, β y x x, x,, x, y y, y,, y x x y y x x, y y, x x y y {}}{,,, / / L P / / y, P
005 5 6 y β + ɛ {x, x,, x p } y, {x, x,, x p }, β, ɛ E ɛ 0 V ɛ σ I 3 rak p 4 ɛ i N 0, σ ɛ ɛ y β y β y y β y + β β, ɛ β y + β 0, β y β y ɛ ɛ β ɛ y β mi L y y ŷ β y β y β β L P y P y + ɛ, ɛ y P y I P y,,
(2004 ) 2 (A) (B) (C) 3 (1987) (1988) Shimono and Tachibanaki(1985) (2008) , % 2 (1999) (2005) 3 (2005) (2006) (2008)
,, 23 4 30 (i) (ii) (i) (ii) Negishi (1960) 2010 (2010) ( ) ( ) (2010) E-mail:fujii@econ.kobe-u.ac.jp E-mail:082e527e@stu.kobe-u.ac.jp E-mail:iritani@econ.kobe-u.ac.jp 1 1 16 (2004 ) 2 (A) (B) (C) 3 (1987)
2_05.dvi
74 68 2 2012 pp. 74 85 43.60. c * 1, 2 1 2, 3 1 2 1 4 BM CSS CSS CSM BM CSM CSS CSS CSM Blind source separation, Sparseness, Binary mas, Musical noise, Cepstral smoothing, Separated speech signals 1. BSS
Sample function Re random process Flutter, Galloping, etc. ensemble (mean value) N 1 µ = lim xk( t1) N k = 1 N autocorrelation function N 1 R( t1, t1
Sample function Re random process Flutter, Galloping, etc. ensemble (mean value) µ = lim xk( k = autocorrelation function R( t, t + τ) = lim ( ) ( + τ) xk t xk t k = V p o o R p o, o V S M R realization
original: 2011/11/5 revised: 2012/10/30, 2013/12/ : 2 V i V t2 V o V L V H V i V i V t1 V o V H V L V t1 V t2 1 Q 1 1 Q
original: 2011/11/5 revised: 2012/10/30, 2013/12/2 1 1 1: 2 V i V t2 V o V L V H V i V i V t1 V o V H V L V t1 V t2 1 Q 1 1 Q 2 2 1 2 1 c 2013 2 2: V i Q 1 I C1 V C1 V B2 I E V E V E Q 1 Q 1 Q 2 Q 2 Q
( )/2 hara/lectures/lectures-j.html 2, {H} {T } S = {H, T } {(H, H), (H, T )} {(H, T ), (T, T )} {(H, H), (T, T )} {1
( )/2 http://www2.math.kyushu-u.ac.jp/ hara/lectures/lectures-j.html 1 2011 ( )/2 2 2011 4 1 2 1.1 1 2 1 2 3 4 5 1.1.1 sample space S S = {H, T } H T T H S = {(H, H), (H, T ), (T, H), (T, T )} (T, H) S