(4) ω t(x) = 1 ω min Ω ( (I C (y))) min 0 < ω < C A C = 1 (5) ω (5) t transmission map tmap 1 4(a) 2. 3 2. 2 t 4(a) t tmap RGB 2 (a) RGB (A), (B), (C)



Similar documents
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,

(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

「霧」や「もや」などをクリアにする高速画像処理技術

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 +

2 Poisson Image Editing DC DC 2 Poisson Image Editing Agarwala 3 4 Agarwala Poisson Image Editing Poisson Image Editing f(u) u 2 u = (x

す 局所領域 ωk において 線形変換に用いる係数 (ak 画素の係数 (ak bk ) を算出し 入力画像の信号成分を bk ) は次式のコスト関数 E を最小化するように最適化 有さない画素に対して 式 (2) より画素値を算出する される これにより 低解像度な画像から補間によるアップサ E(

Fig. 1 Left: Example of a target image and lines. Solid lines mean foreground. Dotted lines mean background. Right: Example of an output mask i

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

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

IPSJ SIG Technical Report Vol.2013-CVIM-188 No /9/2 1,a) D. Marr D. Marr 1. (feature-based) (area-based) (Dense Stereo Vision) van der Ma

IPSJ SIG Technical Report Vol.2015-CG-158 No /2/27 1,a) 2 2 3,b) 1. 2D 3DCG 2 [1] 1 Waseda University, Shinjuku, Tokyo , Japan 2 /JST W

(MIRU2008) HOG Histograms of Oriented Gradients (HOG)

形状変形による古文書画像のシームレス合成

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

日本内科学会雑誌第102巻第10号

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)

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

22_04.dvi

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

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

IPSJ SIG Technical Report Vol.2010-MPS-77 No /3/5 VR SIFT Virtual View Generation in Hallway of Cybercity Buildings from Video Sequen

Mastering the Game of Go without Human Knowledge ( ) AI 3 1 AI 1 rev.1 (2017/11/26) 1 6 2

IPSJ SIG Technical Report iphone iphone,,., OpenGl ES 2.0 GLSL(OpenGL Shading Language), iphone GPGPU(General-Purpose Computing on Graphics Proc

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

yoo_graduation_thesis.dvi

syuu_2_10_3.dvi


FoodLog [3] TADAproject [4] Google Goggles 1 Kumar [5] () Leaf snap Maruyama [6] 3 Lee [7] Yu [8] Gist SVM Active Query Sensing(AQS)

Honda 3) Fujii 4) 5) Agrawala 6) Osaragi 7) Grabler 8) Web Web c 2010 Information Processing Society of Japan

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

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

図 2: 高周波成分を用いた超解像 解像度度画像とそれらを低解像度化して得られる 低解像度画像との差により低解像度の高周波成分 を得る 高解像度と低解像度の高周波成分から位 置関係を保ったままパッチ領域をそれぞれ切り出 し 高解像度パッチ画像と低解像度パッチ画像の ペアとしてデータベースに登録する



福岡大学人文論叢47-3

0911_hyo1.eps

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

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

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

Duplicate Near Duplicate Intact Partial Copy Original Image Near Partial Copy Near Partial Copy with a background (a) (b) 2 1 [6] SIFT SIFT SIF

kobe_sar4.p65

DEIM Forum 2012 E Web Extracting Modification of Objec

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

IS2-06 第21回画像センシングシンポジウム 横浜 2015年6月 画像をスーパーピクセルに変換する手法として SLIC[5] を用いる Achanta らによって提案された SLIC 2.2 グラフマッチング は K-means をベースにした手法で 単純な K-means に いる SPIN

日本内科学会雑誌第101巻第12号

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

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


PSF SN 2 DFD PSF SN PSF PSF PSF 2 2 PSF 2 PSF PSF 2 3 PSF 4 DFD PSF PSF 3) DFD Levin 4) PSF DFD KL KL PSF DFD 2 Zhou 5) 2 DFD DFD DFD DFD Zhou 2

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

SICE東北支部研究集会資料(2017年)

Silhouette on Image Object Silhouette on Images Object 1 Fig. 1 Visual cone Fig. 2 2 Volume intersection method Fig. 3 3 Background subtraction Fig. 4

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

2 ECCV2008,2010,2012 ECCV % % % ECCV % % % ECCV % % % Ligh

2014/3 Vol. J97 D No. 3 Recognition-based segmentation [7] 1 DP 1 Conditional random field; CRF [8] [10] CRF / OCR OCR [11], [1

Web Social Networking Service Virtual Private Network 84

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(

l t a2 b c f g or t a2 b c f a2 b c f or l t a2 b c f g t a2 b c f g l t

2_05.dvi

(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 α,

Sobel Canny i

IBISML 20 (IBIS2017) 6 IBISML 4 CANDAR2017 (Graph Golf 2017) CW WSSM AI Author s Toolkit Writing Better Techn


,,, 2 ( ), $[2, 4]$, $[21, 25]$, $V$,, 31, 2, $V$, $V$ $V$, 2, (b) $-$,,, (1) : (2) : (3) : $r$ $R$ $r/r$, (4) : 3

THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS TECHNICAL REPORT OF IEICE. TRECVID2012 Instance Search {sak

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

名称未設定-1

独立行政法人情報通信研究機構 Development of the Information Analysis System WISDOM KIDAWARA Yutaka NICT Knowledge Clustered Group researched and developed the infor

2.2 6).,.,.,. Yang, 7).,,.,,. 2.3 SIFT SIFT (Scale-Invariant Feature Transform) 8).,. SIFT,,. SIFT, Mean-Shift 9)., SIFT,., SIFT,. 3.,.,,,,,.,,,., 1,

色の類似性に基づいた形状特徴量CS-HOGの提案

27 AR

IPSJ-CVIM

スライド 1

thesis.dvi

Fig Measurement data combination. 2 Fig. 2. Ray vector. Fig (12) 1 2 R 1 r t 1 3 p 1,i i 2 3 Fig.2 R 2 t 2 p 2,i [u, v] T (1)(2) r R 1 R 2

KinecV2 2.2 Kinec Kinec [8] Kinec Kinec [9] KinecV1 3D [10] Kisikidis [11] Kinec Kinec Kinec 3 KinecV2 PC 1 KinecV2 Kinec PC Kinec KinecV2 PC KinecV2

光学

ω ω

横組/中高 技術科問題           ●

2日目 10月31日(金曜日)プログラム

本文/本文


DEIM Forum 2019 A7-1 Flexible Distance-based Hashing mori

特別寄稿.indd

Accuracy Improvement by Compound Discriminant Functions for Resembling Character Recognition Takashi NAKAJIMA, Tetsushi WAKABAYASHI, Fumitaka KIMURA,

日本内科学会雑誌第98巻第3号

30

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],

2. 30 Visual Words TF-IDF Lowe [4] Scale-Invarient Feature Transform (SIFT) Bay [1] Speeded Up Robust Features (SURF) SIFT 128 SURF 64 Visual Words Ni

A Graduation Thesis of College of Engineering, Chubu University Pose Estimation by Regression Analysis with Depth Information Yoshiki Agata

% 2 3 [1] Semantic Texton Forests STFs [1] ( ) STFs STFs ColorSelf-Simlarity CSS [2] ii

(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

顔画像を用いた個人認証システムの性能検討に関する研究

04.™ƒ”R/’Ô”�/’Xfl©

LBP 2 LBP 2. 2 Local Binary Pattern Local Binary pattern(lbp) [6] R

2010 : M DCG 3 (3DCG) 3DCG 3DCG 3DCG S

4 4 2 RAW (PCA) 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 ( )

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

(MIRU2010) Geometric Context Randomized Trees Geometric Context Rand

untitled

Transcription:

(MIRU2011) 2011 7 890 0065 1 21 40 105-6691 1 1 1 731 3194 3 4 1 338 8570 255 346 8524 1836 1 E-mail: {fukumoto,kawasaki}@ibe.kagoshima-u.ac.jp, ryo-f@hiroshima-cu.ac.jp, fukuda@cv.ics.saitama-u.ac.jp, ymgc-tkm@signal.co.jp RGB transmission map Dehazing, transmission map,,,, 1. He Dehazing [3] Dehazing 2. Dehazing [1] [8] Robby He Dark Channel Prior [3] [1] Fattal 2. 1 Dehazing [2] He 1 [3] Dehazing [4], [5] I(x) = J(x)t(x) + A(1 t(x)) (1) 2 I J A t (1) J J I t A IS3-37 : 1111

(4) ω t(x) = 1 ω min Ω ( (I C (y))) min 0 < ω < C A C = 1 (5) ω (5) t transmission map tmap 1 4(a) 2. 3 2. 2 t 4(a) t tmap RGB 2 (a) RGB (A), (B), (C) I i = α i F i + (1 α i )B i (6) 2 (a) RGB 2 (b) F B α RGB (6) 2 (c) 3(a) α i ai i + b i w i (7) 3(b) a = 1 F B b = B F B w J(α) = min J(α, a, b) (8) a,b RGB α a, b ( min I C (x) ) ( = t(x) min J C (x) ) + C {r,g,b} C {r,g,b} ( 1 t(x) ) A C J(α) = α T Lα (9) (2) L Matting Laplacian C RGB α Levin Matting Laplacian [9] (5) tmap t(x) ( min min y Ω(x) C {r,g,b} IC (y) ) tmap t(x) t, t = t(x) ( ( J C (y) )) + ( 1 t(x) ) A C (3) E(t) = t T Lt + λ(t t) T (t t) (10) min y Ω(x) min C {r,g,b} Ω y t 1 [3] 2 λ t t(x) = 1 min Ω ( (I C (y))) min C A C (4) (L + λu)t = λ t (11) min Ω (min C ( IC (y) )) 1 t(x) 0 A C U L λ 1.0 10 4 tmap 4(b) IS3-37 : 1112

(a) (b) RGB (c) 2 RGB (a) (b) 3 (a) transmission map (tmap) 4 (b) tmap tmap 2. 4 A A A 2. 5 Dehazing t A (1) J (1) J(x) = I(x) A max(t(x), t 0 ) + A (12) t(x) 0 IS3-37 : 1113

(a) 3(a) (b) Dehazing 5 Dehazing Dehazing 3. 3 tmap t 0 = 0.1 t 0.1 5(b) Dehazing 3. 3. 1 tmap tmap Dehazing J 1) tmap ID 3. 4 tmap tmap 1 Dehazing 2 3 tmap tmap 4 tmap 5 Dark Channel Prior (1) Dehazing Dehazing tmap 3. 2 2 1) tmap ID 2) ID Dehazing ID 1 1) Dehazing 3. 5 2) Dehazing ID [10] [12] 1 tmap IS3-37 : 1114

5. tmap ID 4. 4. 1 tmap Antari Z1200 II 6 6 Dehazing tmap 15 15 3 3 ω = 0.95 λ = 1.0 10 4 SCOPE ICT t 0 = 0.1 ε = 1.5 10 5 101710002 21200002 4. 2 (LR030) (1) tmap 7 8 Dehazing [1] Robby T. Tan, Visibility in Bad Weather from a Single Image, Computer Vision and Pattern Recogni- tion, 2008. CVPR 2008. IEEE Conference on, 2008. (2) 9(a) [2] Raanan Fattal, Single Image Dehazing, ACM SIG- GRAPH 2008 papers, pp.72:1 72:9, 2008. [3] Kaiming He, Jian Sun, Xiaoou Tang, Single Image ID 9(b) Haze Removal Using Dark Channel Prior, Computer 9(a) Vision and Pattern Recognition, 2009. CVPR 2009. IEEE Conference on, pp.1956 1963, 2009. 9(b) [4] Y.Y. Schechner, S.G. Narasimhan and S.K. Nayar, Instant Dehazing of Images using Polarization, IEEE Conference on Computer Vision and Pattern (3) Recognition (CVPR), Vol.I, pp.325 332, Dec, 2001. 10 10(a) [5] Y.Y. Schechner, S.G. Narasimhan and S.K. Nayar, ID Polarization-Based Vision through Haze, Vol.42, No.3, pp.511 525, Jan, 2003. 10(b) [6] Peter Carr, Richard Hartley, Improved Single Image Dehazing Using Geometry, Digital Image Computing: Techniques and Applications, pp.103 110, 2009. (4) 11 11(a),(b) [7] S.G. Narasimhan and S.K. Nayar, Vision and the Atmosphere, International Journal on Computer Vision, Vol.48, No.3, pp.233 254, Jul, 2002. 6 2 12(a) ID 12(b) [8] Yong Du, Guindon, B. and Cihlar, J., Haze detection and removal in high resolution satellite image with wavelet analysis, IEEE Transactions on Geoscience and Remote Sensing, 40, 1, pp.210 217, 2002. [9] Anat Levin, Dani Lischinski, Yair Weiss, A Closed- (5) 13 Form Solution to Natural Image Matting, IEEE 13 (a) Transactions on Pattern Analysis and Machine Intelligence, pp. 228 242, February, 2008. 13 (b) [10], 2007- CVIM-158-26, pp.193 204, 2007. (6) 14 [11] Yuri Boykov, Olga Veksler, Ramin Zabih, Fast Approximate Energy Minimization via Graph Cuts, Dark Channel Prior IEEE Transactions on Pattern Analysis and Machine Intelligence, pp.1222 1239, November, 2001. [12] C. Rother, V. Kolmogorov, and A. Blake, grabcut : interactive foreground extraction using iterated graph cuts, ACM Trans. Graph., Vol.23(3), pp.309?-314, 2004. IS3-37 : 1115

6 7 tmap 8 Dehazing IS3-37 : 1116

(a) ID (b) 9 tmap (a) ID (b) 10 (a) 1 (b) 2 11 2 IS3-37 : 1117

(a) ID (b) 12 2 (a) 1 (b) 2 13 (a) (b) 14 IS3-37 : 1118