利用二維影像產生影子
全文
(2) .
(3) . !"#$%&#%&'–#(%(%)'. *+,-./01234563789: ;< =>? @ A?B?@B
(4) @BC D&)<E(F'GH& IJKL. MNOP63QRS. !"# is accompli-shed by identifying the portion of the base. plane which is in shadow in an image with respect to $%&'()*+,-./0123. the. reference. points. using. the. view-invariant. 4567"89467:;8<.=>. cross-ratios and some geometric properties associated. ?@ABC*%&DEFGH*I8. with perspective projection. The approach can be. <.23JK467LMNOP23QR. extended easily to solve more general problems which. ST U4V"WXYZ[*23V\U. involve multiple objects as well as multiple planar. ]^_`Q*ST Uab4cdefg234. surfaces on which object shadows are to be cast.. :I8h(1"W67ij23k. !l4mnopqrst*uvUI8BVph. -%4. wx(1Cy467;+,zYZuv. U4{|S}~8. !4=>~1. B4 ¡YZ¢£4 V. wVmnopB 4"C*67. 4¤¥¦§sw~4¨©"ª«467. 4p*2382. ¬:;8 =>?@A%®gkO4. 3!l*no". z /0s
(5) ¯]^4°±8. 23k!l4no"z
(6) . (Keyword: Shadow generation, Perspective. 4 ²³´µ¶· I8uv
(7) ¸F¹º4¹». projection. ). !lq¼½423p¾¿B ÀÁ²ÂÃÄ· ÅÆÇ!. This paper presents a novel approach to generating. l p"ȸ4ÉÊI8. object. (2D). Y23ËM{Ì"BÍ7?¸Î. shadow. ÏÐbÑÒÓ4 ¾¿Ç+,C*. generation are usually based on 3D geometry. In this. 4
(8) 1wkÔ4Õo;Ö. paper, we present a way of deriving accurate shadows. sB"B×ØÙÚ23ÕoÛ]^. of a 3D object which requires only stereo images of the. É;ÖÔÏÜÔSÜ423ÕoÝ;kÞ4. object taken from two different viewpoints. For each. ÒÓ"B GH) ! 467”ߦ”4/0. view of the object, the object shadows can be. ×ØÎÏËMàáâãBäåæ]^. generated for point light sources located along the line. ç "YZ*ÔÏ4Uäå4ߦèh. connecting the two view points. The approach assumes. éêq]^4. that at least five reference points on the base plane,. çí³î zY°±4ߦèïPU;B. where the object shadow is to be cast upon, can be. \"B"k'(4 67[* . identified in the stereo images. The shadow generation. #$ :sðldÛäålñ[*ÔÏÜ42. shadows. inform-ation.. using. Previous. two-dimensional approaches. of. U4. UÐb"ëéê¿4èìZ]^.
(9) 3U"ÛPUlñ]^4lds{ò>23. ë A¯B¯C æ D üU4VI8B d4VpJ. 4ÕoïPU;B\". K4w°(1(÷t4 a¯b¯c æ d)ï cross ratio 4. <óô67õö. S}~. [ A , B , C , D ] = [a , b , c , d ] ¨WðdÆpü*U4 cross ratio èë òý<UBVp4JK°±ïüU4°± I84ÎÏ" BW%DEij23kB4opqr st*uvU;Mòý<USd4"B÷< ÷ü¨?t*uvUI8JKw°k8D EI8Bt¹º4[ðYdpw(ü*uv UQ*Yd4U(;t*uvU4 a)8Q*QðYd4{U". ÷ . ÷ -. ÷ <. ÷÷-àáøù)238t*uvUk ºõ4t¹ºÛQ*ST U V1 æ V2 kúÏ4 VL÷÷-23¹»kûõ4ÒÓ(Ü÷ <¯÷ü)Ý;U]^àá°Z V1 V2 gk4 "NuvUI8BVpJK4w(1ï òý4. U:IÏC*4°±"þ. ëDEI8Z÷(÷üÒÓ¹»4 dt¹ºYd4{Uï23¨]^Z V2 k 4ÝIÎÏ"1DEGH> , S}~ cross-ratio 1®(po4{U L ÏJK4" v
(10) 3D Ðbð dp4ü*U A¯B¯C æ D (÷t)ïABCD4 cross-ratioIÕùõ[A, B, C, D]. [A, B , C , D ]=. AC • BD BC • AD. ÷ ü.
(11) ÷ 4 ÷ t BCDE. H LS I 4¨;¨? I U,. B÷<?)(op¹»dÆ4. Ïà+!"5"z6401k1y I8hÎ(1". d×ظ(qrQðt¹ºYd4{U(ë. 8W7k2 8I79:"s) k1 k2 Zs. V1 æ V2 S;z4DEI8 ¹». ) l1`; l2 8ѹ»dÆ4 d. d{!" 90#4QðYd)"B÷<k. :I,zT467Ï";¿ï;4<U P’¯. 4QðYdpp$k'4¹»d4{U. Q’¯R’¯S’¯T’8 U’(÷4);¿=öøùB÷. 8%Xü*uvU4<*UÝI8,1%®. >÷?"÷@@ï;%*764þ÷. cross ratio è"?)&'B%®p(è4)w~. ;ABC4". B C<*UgDE×ØK*B%® cross ratio gà+S,s(-./è401". ÷ >. ÷ 2 8÷24 K1 U?þ3; CE L1 4{U" ë÷4 l1 ce 44{U k1=(k1x , k1y)M[C, H, K1, E]=R ïDEI8Ï. Rh (c − e ) − c x (hx − ex ) k1x = x x x R (c x − e x ) − hx + ex. ÷ ?.
(12) p4M°±g#CU8#C¹4 :N?4OPî¶ÄQ³´¶#. ü=RSR. B$%'()*T54671 "SV-ãO U 23VW4X®7DE NOQRo3Y±BmnoZíIJ¶ ÂÃÄ[¶\ p4Vnopst*4uvU" DEk'(467\]^°ZQRV Uc dpò°±g:I8BQRVp" 4]^_;MRVp4uv UB%RVpw(23B íIJ¶ ÂÃÄ[¶ pk` ÷ @. 4ÒÓ"\]^_`p$cdefgDEI8 a4LCNO,bc4 U = >"C*67I84qad4e 1þ*23!lqo3Õo" tuvf [1] Woo, P. Poulin and A. Fournie, "A Survey of Shadow Algorithms,". IEEE. Computer. Graphics. and. Applications, vol. 10, no. 6, Nov. 1990, pp. 13-32. [2] A. Appel, "Some Techniques for Shading Machine Renderings of Solids," Proc. AFIPS JSCC, vol. 32, 1968,. ÷ @. pp. 37-45. [3] F. Crow, "Shadow Algorithms for Computer Graphics,". s)p$4=ö\]^_`QRV4 Ua b4 defg23cD4I8( 1"BC\DE×Ø,Q*=>~#. Computer Graphics (Proc. SIGGRAPH), vol. 11, no. 3, Aug. 1977, pp. 242-248. [4] P. Atherton, K. Weiler, and D. Greenberg, “Polygon. 23ò>U4ks:°BT dp"#. Shadow. 23ò>¹4ksad:×Ø{ZU. SIGGRAPH), vol. 12, no. 3, Aug. 1978, pp. 275-281.. Gener ation,". Computer. Graphics. (Proc.. EFÌznG"B#k'4 d8B#. [5] L. Williams, "Casting Curved Shadows on Curved. kH4{U:I8ÛaI4=öÏ"#4 d. Surfac es," Computer Graphics (Proc. SIGGRAPH), vol.. I8Ï;¨?DEJW dp4Q*U*. 12, no. 3, Aug. 1978, pp. 270-274.. ;23$K4<UL%*ï ,p$67k. [6] T. Whitted, "An Improved Illumination Model for. Ï434"WX#4{UJ;ѹ4. Shaded Display," CACM, vol. 23, no. 6, June 1980, pp.. dæÑLð¹4dab4{U"¨ WB#Lð dp23<U4ò>*ë ïksÑWU4¹ad4:I8 ~#(1"\]^°ZQ Uab4 d. 343-349..
(13)
相關文件
decision tree: a traditional learning model that realizes conditional aggregation.. Decision Tree Decision Tree Hypothesis.. Disclaimers about
decision tree: a traditional learning model that realizes conditional aggregation.. Disclaimers about Decision
• validation set blending: a special any blending model E test (squared): 519.45 =⇒ 456.24. —helped secure the lead in last
Hsuan-Tien Lin (NTU CSIE) Machine Learning Techniques 21/25.. Gradient Boosted Decision Tree Summary of Aggregation Models. Map of
移動滑鼠游標到縮圖上, 移動滑鼠游標到縮圖上, ACDSee會自動顯示放大 ACDSee 會自動顯示放大 的縮圖
the composition presented by T101 〉, “ First, the style of writing: by and large, these s ū tras are translated into prose.. Even though there are some verse-like renderings,
(Samuel, 1959) Some studies in machine learning using the game of checkers. Picture extracted from the original paper of Samuel for
⇔ improve some performance measure (e.g. prediction accuracy) machine learning: improving some performance measure..