Any Pair of 2D Curves Is Consistent with a 3D Symmetric Interpretation

Size: px
Start display at page:

Download "Any Pair of 2D Curves Is Consistent with a 3D Symmetric Interpretation"

Transcription

1 Symmetry 2011, 3, ; do: /sym OPEN ACCESS symmetry ISSN Artcle Any Par of 2D Curves Is Consstent wth a 3D Symmetrc Interpretaton Tadamasa Sawada *, Yunfeng L and Zygmunt Pzlo Department of Psychologcal Scences, Purdue Unversty, West Lafayette, IN , USA; E-Mals: l135@purdue.edu (Y.L.); pzlo@psych.purdue.edu (Z.P.) * Author to whom correspondence should be addressed; E-Mal: sawada@psych.purdue.edu; Tel.: ; Fax: Receved: 10 February 2011; n revsed form: 27 May 2011 / Accepted: 30 May 2011 / Publshed: 10 June 2011 Abstract: Symmetry has been shown to be a very effectve a pror constrant n solvng a 3D shape recovery problem. Symmetry s useful n 3D recovery because t s a form of redundancy. There are, however, some fundamental lmts to the effectveness of symmetry. Specfcally, gven two arbtrary curves n a sngle 2D mage, one can always fnd a 3D mrror-symmetrc nterpretaton of these curves under qute general assumptons. The symmetrc nterpretaton s unque under a perspectve projecton and there s a one parameter famly of symmetrc nterpretatons under an orthographc projecton. We formally state and prove ths observaton for the case of one-to-one and many-to-many pont correspondences. We conclude by dscussng the role of degenerate vews, hgher-order features n determnng the pont correspondences, as well as the role of the planarty constrant. When the correspondence of features s known and/or curves can be assumed to be planar, 3D symmetry becomes non-accdental n the sense that a 2D mage of a 3D asymmetrc shape obtaned from a random vewng drecton wll not allow for 3D symmetrc nterpretatons. Keywords: 3D symmetry; 3D recovery; 3D shape; degenerate vews; human percepton

2 Symmetry 2011, Introducton Curves n a 2D mage provde very effectve nformaton about the 3D shape out there [1]. Fgure 1 shows a smple example. The reader can easly see the 3D shape of the closed contour even though the mage tself s 2D. Demo 1 [2] llustrates the 3D nterpretaton that agrees wth what the reader perceves by lookng at Fgure 1. The 3D recovery shown n the Demo used 3D symmetry as a constrant. Ths nformal observaton s consstent wth results of a number of psychophyscal experments. Specfcally, t has been shown that humans can perceve 3D shapes of objects and recognze the objects as effectvely from lne drawngs as from realstc mages [1,3 5]. Furthermore, the 3D percept s usually close to verdcal. We have recently presented a computatonal model that can recover 3D shape of a symmetrc or approxmately symmetrc 3D object from a sngle 2D mage (lne drawng) of ths object. The model does ths by applyng a pror constrants to a 3D nterpretaton of an mage of the object s contours. The a pror constrants ncluded: mrror-symmetry of the 3D shape, planarty of ts contours, maxmum 3D compactness and mnmum surface area of the convex hull of the 3D contours [6 11]. Fgure 1. A 2D closed curve that looks lke a 2D projecton of a 3D mrror-symmetrc curve. See Demo 1 n supplemental materal for an nteractve llustraton of the 3D symmetrc nterpretaton produced from ths 2D curve [2]. A 3D symmetry s a natural pror n recoverng 3D shapes from 2D mages. Most objects n our natural envronment are at least approxmately symmetrc: anmal and human bodes [12], as well as many man-made objects are mrror symmetrc, trees and flowers are rotatonally symmetrc and lmbs and torsos of anmals are characterzed by translatonal symmetry. Clearly, f a vson system of a human or a robot can assume that the object n front of her s symmetrc, the 3D shape recovery becomes much easer. How much easer? Consder mrror-symmetry. Vetter and Poggo [13] showed that a sngle 2D orthographc mage of a mrror-symmetrc 3D shape determnes ths shape wth only one unknown parameter. If a 2D perspectve mage s used, the 3D shape recovery s unque [14 17]. In these models, the contour-confgural organzaton was provded to the model by a human user. By contour-confgural organzaton we mean: fndng contours n the mage, determnng whch contours and features n the mage correspond to symmetrc contours and features n the 3D nterpretaton, whch contours are co-planar and whch contours are on the symmetry plane. Note that what we call contour-confgural organzaton s smlar to the tradtonal phenomenon called

3 Symmetry 2011, perceptual organzaton. The man dfference s that contour-confgural organzaton ncorporates operatons such as establshng symmetry and coplanarty n the 3D nterpretaton. These operatons go beyond the tradtonal perceptual organzaton. We decded to ntroduce ths new concept (followng the suggeston of the Edtor) because we want to emphasze that the processes we nclude are related to the emergence of the percept of the shape of an object, not to arbtrary groupng of features n the mage. Establshng contour-confgural organzaton s natural and easy to a human observer. However, we are stll far from understandng the underlyng mechansms and there s no computer vson algorthm whose performance n establshng contour-confgural organzaton comes even close to that of a human observer. Fgure 2. An asymmetrc par of 2D curves and the 3D symmetrc nterpretaton. (a) An asymmetrc par of 2D curves. These curves can be nterpreted as a 2D perspectve projecton of a symmetrc par of 3D curves whose symmetry plane s slanted at an angle of 40 (see Theorem 1); (b) Three dfferent vews of the 3D symmetrc nterpretaton produced from the par of the 2D curves n (a). The numbers n the bottom are the values of the slant σ s of the symmetry plane of the symmetrc par of the 3D curves. For σ s equal to 40, the mage s dentcal to that n (a). When σ s s 90, ts 2D projecton tself becomes symmetrc. See Demo 2 n supplemental materal for an nteractve llustraton of the 3D symmetrc curves [2]. (a) (b) Front vew Can a symmetry constrant be appled to an mage for whch contour-confgural organzaton has not been establshed? In other words, can 3D symmetry, tself, be used as a tool n establshng contour-confgural organzaton? The answer s, n a general case, negatve. Under qute general assumptons, any par of 2D curves s consstent wth 3D symmetrc nterpretatons. For example, a par of 2D curves n Fgure 2a does not look lke a 2D projecton of a symmetrc par of 3D curves. However, they can be actually nterpreted as a symmetrc par of 3D curves by allowng the degenerate (accdental) vew of the 3D curves (Fgure 2b). Namely, some characterstc features of the 3D symmetrc curves become hdden n the depth drecton (see Dscusson). The reader can see pars of 2D curves (Fgures 1,2,3,5,7,8,12 and 13) and ther 3D symmetrc nterpretatons n our onlne demos [2]. Note that ths paper focuses on the process of constructng or nterpretng, rather than recoverng or re-constructng a 3D shape from a 2D lne drawng. When a 3D shape s beng reconstructed from a lne drawng, t s assumed that ths lne drawng s a 2D projecton produced by some 3D object. For the reconstructon to be accurate, t s necessary to know whether the 2D mage s a result of a perspectve or an orthographc projecton and whether the 3D object was symmetrc, n the

4 Symmetry 2011, frst place. Dependng on the actual projecton type, the reconstructon may or may not be unque. In ths paper, we do not have to know what the actual projecton type s and whether the 3D object was symmetrc. In fact, the 3D object dd not have to exst; the 2D mage could have been drawn by an artst wthout any reference to a 3D object. So, we can assume here the type of projecton and then we can always construct a 3D symmetrc shape. Ths s why we use the word 3D nterpretaton, rather than 3D reconstructon throughout ths paper. As a consequence of constructng, rather than reconstructng, we are not concerned whether the 3D nterpretaton s accurate or not. In partcular, even f the 2D mage was produced by an asymmetrc 3D shape, 3D symmetrc nterpretatons exst. The concept of accuracy s rrelevant here. In Secton 2, t s formally stated and proved that any par of suffcently regular 2D curves can be nterpreted as a symmetrc par of 3D curves. Ths s proved by showng how a symmetrc par of 3D curves s produced from the par of 2D curves. The man dea behnd the proofs s farly smple. Take a par of ponts p and q n the 2D mage. There s always a par of 3D ponts P and Q, whose mages are p and q, such that P and Q are symmetrc wth respect to some plane. The symmetry plane bsects the lne segment P Q and s orthogonal to ths segment. There are nfntely many such solutons. The ndvdual theorems specfy the famly of these solutons for perspectve and orthographc projectons and show that f the mage curves are contnuous, the 3D symmetrc nterpretatons are also contnuous, for both one-to-one and many-to-many pont correspondences. Frst, we provde a proof for a smple case where there s a unque correspondence of pars of symmetrc ponts. We then generalze the theorems to the case of multple correspondences. In Secton 3, we dscuss the role of symmetry n contour-confgural organzaton, as well as the role of other constrants n detectng symmetry from a sngle 2D mage. 2. Theorems and Proofs We begn wth notaton. Consder two curves Φ and Ψ n a 3D space and ther 2D mages φ and ψ. Let Φ and Ψ be symmetrc wth respect to a plane Π s, whose normal s n s (n x, n y, n z ). Let P (x Φ, y Φ, z Φ ), be a pont on Φ and Q (x Ψ, y Ψ, z Ψ ) be ts symmetrc counterpart on Ψ. Symmetry lne segments, whch are lne segments connectng pars of correspondng ponts on Φ and Ψ are parallel to the normal of Π s n the 3D space. Perspectve mages of these lnes ntersect at the vanshng pont v on the mage plane. The 3D orentaton of Π s s specfed by ts slant σ s and tlt τ s. Wthout restrctng generalty, assume τ s = 0. Note that when τ s s not zero, we can always rotate the 3D coordnate system around the z-axs by τ s. Under ths assumpton, the normal to the symmetry plane s n s (n x, 0, n z ). The slant of the symmetry plane s σ s = atan(n x /n z ). In the followng theorems, let z = 0 be the mage plane Π I and the x- and y-axes of the 3D Cartesan coordnate system be the 2D coordnate system on the mage plane. Let the center of projecton F be on the postve sde of the z-axs of the 3D Cartesan coordnate system: z f > 0 where z f s a z-value of F. We assume n ths paper that 2D curves n Π s are fntely long and tame: Defnton 1: A 2D curve s tame when t s connected and composed of a fnte number of C 2 arcs that have followng propertes; each arc s twce contnuously dfferentable and a tangent lne at every non-endpont of the arc does not have any ntersecton wth the arc.

5 Symmetry 2011, Tame curves have fnte number of nflectons and turns. The defnton excludes, for example, pathologcal curves (lke fractal curves), whch have nfntely many nflectons or turns (see [18] for further dscusson) A Par of 2D Curves wth Unque Correspondences The Case of a Perspectve Projecton We frst consder the case of a perspectve projecton. The equvalent theorem for an orthographc projecton wll be proved as a specal case of a perspectve projecton. Theorem 1 states that for any par of curves n the 2D mage, there exsts a par of 3D curves that are symmetrc wth respect to a plane. The gst of the proof s as follows. Gven a par of 2D curves, the vanshng pont of a perspectve projecton s computed from the endponts of the curves. The vanshng pont determnes unque pont correspondences between the two curves. It also determnes the symmetry plane unquely for a gven poston of the center of perspectve projecton F. Gven the plane of symmetry, for any par of 2D ponts t s always possble to fnd a par of 3D ponts that are mrror symmetrc wth respect to ths plane. Theorem 1: Let φ and ψ be curves n a 2D mage that are tame. Let the endponts of φ be e φ0 and e φ1, and the endponts of ψ be e ψ0 and e ψ1. Assume that the lnes e φ0 e ψ0 and e φ1 e ψ1 ntersect at a pont v that () s not on φ or ψ and () s not between e φ0 and e ψ0 or between e φ1 and e ψ1. Addtonally, assume that each half lne that emanates from v and ntersects φ has a unque ntersecton wth ψ and vce versa (see Fgure 3). Then, for a gven center of projecton F there exsts a par of contnuous curves Φ and Ψ and a plane Π s n a 3D space such that Φ and Ψ are mrror-symmetrc wth respect to Π s and that φ s a perspectve projecton of Φ and ψ s a perspectve projecton of Ψ. Proof: Fgure 3. F = [0, 0, z f ] s the center of perspectve projecton and Π I (z = 0) s the mage plane. φ and ψ are two gven curves on the mage plane. e φ0 and e φ1 are the endponts of φ, and e ψ0 and e ψ1 are the end ponts of ψ. The lnes e φ0 e ψ0 and e φ1 e ψ1 ntersect at pont v on the x-axs. A lne that s emanatng from v and ntersects wth φ has a unque ntersecton wth ψ and vce versa. y p q v o F z x

6 Symmetry 2011, In order to prove ths theorem, we have to show that for any par of correspondng ponts on φ and ψ, we can fnd ther backprojectons n the 3D space, such that these backprojected ponts are mrror-symmetrc wth respect to the same plane Π s. That s, the lne segment connectng the backprojected ponts s bsected by Π s and parallel to the normal of Π s. It wll be also shown that the backprojected ponts form a par of contnuous curves. Let s set the drecton of x-axs so that the vanshng pont v s on the x-axs, v = [x v, 0, 0]. We express φ and ψ n a polar coordnate system (r, α), where r s the dstance from the vanshng pont v and α s the angle measured relatve to the drecton of the x-axs. Then, the pont p = [x φ, y φ, 0] = [x v + r φ (α )cosα, r φ (α )snα, 0] on φ and the pont q = [x ψ, y ψ, 0] = [x v + r ψ (α )cosα, r ψ (α )snα, 0] on ψ are correspondng. Note that both r φ (α) and r ψ (α) are contnuous functons and they are always postve (r φ (α), r ψ (α) > 0). Let the equaton of the symmetry plane Π s be: t [ a b c][ x y z] = d (1) P and Q, the 3D nverse perspectve projectons of p and q, are symmetrc wth respect to Π s f and only f they satsfy the followng two requrements: the lne segment connectng P and Q s parallel to the normal of Π s and s bsected by Π s. The followng equaton represents the fact that the lne segment connectng P and Q s parallel to the normal of the plane Π s : ( P Q ) [ a b c] = [ 0 0 0] (2) Note that n an nverse perspectve projecton, an mage pont [x, y, 0] projects to a 3D pont [x(z f z)/z f, y(z f z)/z f, z]. Hence, P = [(z f z Φ )(x v + r φ (α )cosα )/z f, (z f z Φ )r φ (α )snα /z f, z Φ ] and Q = [(z f z Ψ )(x v + r ψ (α )cosα )/z f, (z f z Ψ )r ψ (α )snα /z f, z Ψ ]. Then, combnng (1) and (2), we obtan: x z v f d x + z + c From Equaton (3), we obtan the followng three facts. Frst, d/c s an ntersecton of the symmetry plane Π s and the z-axs; t specfes the poston of Π s. Second, the normal to ths plane s [ x v /z f, 0, 1], whch s parallel to a vector [x v, 0, z f ] connectng the center of perspectve projecton wth the vanshng pont. Ths mmedately follows from the fact that v s the vanshng pont correspondng to the lnes connectng the pars of 3D symmetrc ponts, whch are all normal to the symmetry plane. Thrd, a vanshng lne (horzon) h of Π s s parallel to the y-axs on the mage plane Π I. The lne h ntersects x-axs at: = 0 (3) x h z = x 2 f v (4) The next equaton represents the fact that the lne segments connectng pars of 3D symmetrc ponts are bsected by the symmetry plane. Let M be the mdpont between P and Q the mdpont les on the symmetry plane Π s : x x t v t v P + Q 0 1 M = 0 1 z f z f 2 t = d c (5)

7 Symmetry 2011, From Equatons (2) and (5), a perspectve projecton of M to the mage plane Π I can be wrtten as follows: xm m = y m 0 t 2rϕ ( α) rψ ( α) xv + cos ( rϕ ( α) + rψ ( α) ) 2rϕ ( α) rψ ( α ) = snα ( rϕ ( α) + rψ ( α )) 0 t α (6) Equaton (6) shows that m s on a 2D lne segment p q and s determned only by 2D mage features on Π I. It does not depend on the poston of the center of projecton F. Recall that both r φ (α) and r ψ (α) are contnuous functons and they are always postve (r φ (α), r ψ (α) > 0). It follows that the mdponts of the correspondng pars of ponts on φ and ψ form a 2D contnuous curve between φ and ψ on Π I. From Equatons 2 6, we have: z z Φ Ψ = z = z f f + + 2rψ ( α )( z f + d c) xh ( rϕ ( α ) + rψ ( α ))( xm xh ) 2rϕ ( α )( z f + d c) xh ( r ( α ) + r ( α ))( x x ) ϕ It s obvous that (7) and (8) represent contnuous functons unless m s on h: x m = x h. Usng Equatons (6) and (4), we can rewrte x m = x h as follows: r ( α ) ϕ r ( α ) ψ Note that the left-hand sde of Equaton (9) s a cross-rato [x v + r φ (α )cosα, x v + r ψ (α )cosα ; x v, x h ] = [x φ, x ψ ; x v, x h ]. If x m = x h, z Φ and z Ψ dverge to ± and Φ and Ψ are not contnuous. Ths s because a projectng lne emanatng from F and gong through m does not ntersect Π s. As a result, M, whch should be a mdpont between P and Q, cannot be determned. Recall that 2D projectons of mdponts of 3D symmetrc pars of ponts form a 2D contnuous curve on Π I. Hence, ths curve must not have any ntersecton or tangent pont wth h. The whole curve must be ether to the left or rght of h. It follows that the denomnators n (7) and (8) must be always postve or always negatve for gven φ and ψ. If ths crteron s not satsfed, the 3D curves wll not be contnuous. Note that f the poston of the center of projecton F s a free parameter (ths happens when the camera s uncalbrated), t s always possble to set F and thus h so that the crteron for contnuty wll be satsfed because the curve connectng the mdponts does not depend on F. Note that d/c s the only free parameter n Equatons (7) and (8), once the vanshng pont and the center of projecton are fxed. Specfcally, Equatons (7) and (8) show that the left-hand sdes are lnear functons of d/c. Recall that n an nverse perspectve projecton, an mage pont [x, y, 0] projects to a 3D pont [x(z f z)/z f, y(z f z)/z f, z]. Assume that d/c z f otherwse, the 3D nterpretaton wll be degenerate wth all the 3D ponts concdng wth the center of perspectve projecton F (Except for the case when the symmetry plane concdes wth the YOZ plane. Ths can happen when the mage curves are themselves symmetrc). It can be seen that d/c determnes the sze, but not the shape of the ψ ( xv + rψ ( α )cos( α ) xh ) ( x + r ( α )cos( α ) x ) v ϕ m h h = 1 (7) (8) (9)

8 Symmetry 2011, D curves Φ and Ψ; z f + d/c s a scale factor wth respect to F as a center of scalng. Recall that the denomnators n (7) and (8) must be always postve or always negatve. From Equatons (7) and (8), d/c can be adjusted so that Φ and Ψ are n front of the center of projecton F and the mage plane Π I. The symmetrc par of 3D curves produced from the curves n Fgure 3 usng Equatons (7) and (8) s shown n Fgure 4. Fgure 4. Front and sde vews of a symmetrc par of 3D curves produced from the par of 2D curves n Fgure 3. The dstance z f between the center of projecton and the mage plane, together wth the vanshng pont v determne the slant σ s of the symmetry plane Π s (the slant s 30 n ths case). See Demo 3 n supplemental materal for an nteractve llustraton of the 3D symmetrc curves [2]. Note that a perspectve projecton s used n Demo 3. As a result, the two curves n the sde vew do not project to the same curve on the mage: the farther curve projects to a smaller mage. The sde vew n ths fgure was computed usng an orthographc projecton. As a result, the two symmetrc 3D curves project to the same 2D mage. Front vew Sde vew In ths proof, t was assumed that the poston of the vanshng pont v s known or can be computed from the gven 2D mage. If the poston of the vanshng pont on the mage plane s not known or s uncertan n the 2D mage, the shape of the 3D symmetrc nterpretaton s defned up to two free parameters [19]. These two unknown parameters correspond to the slant and tlt of the symmetry plane Π s A Par of 2D Curves wth Unque Symmetrc Correspondences the Case of an Orthographc Projecton An orthographc projecton s produced from a perspectve projecton by movng the center of perspectve projecton to nfnty. As a result, the vanshng pont correspondng to the symmetry lne segments s also moved to nfnty regardless of the slant of the symmetry plane. Ths mples that the 3D symmetrc nterpretaton s always possble regardless of the poston of the 2D curves on the mage plane. In other words, the crtera for decdng whether the 3D curves are behnd or n front of the camera are rrelevant n the case of an orthographc projecton. We begn wth modfyng Equatons (7) and (8) so that the poston of the vanshng pont s expressed as a functon of the focal length of the camera. It wll then be easy to transform the equatons representng a perspectve projecton to equatons representng an orthographc projecton.

9 Symmetry 2011, Under a perspectve projecton, the projected symmetry lne segments n Π I ntersect at a vanshng pont v. Snce v s an ntersecton of Π I and a lne whch emanates from F and s parallel to n s, the poston of v s [x v, 0, 0] = [ z f tanσ s, 0, 0]. The sne and cosne of the slant σ s of the symmetry plane Π s can be expressed as follows: snσ s = xv L cosσ s = z f L where L s the dstance between the vanshng pont v and the center of projecton F: (10) 2 L = x v + z f 2 (11) Let P = [x Φ, y Φ, z Φ ], be a pont on Φ and Q = [x Ψ, y Ψ, z Ψ ] be ts symmetrc counterpart on Ψ. Recall that the symmetry lne segments are parallel to the normal n s of the symmetry plane Π s and n s = [snσ s, 0, cosσ s ]. Hence, y Φ = y Ψ. Let, p = [x φ, y φ, 0] be a perspectve mage of P and q = [x ψ, y ψ, 0] be a perspectve mage of Q n Π I. A lne segment connectng P and Q s a symmetry lne segment and a lne segment connectng p and q s a projected symmetry lne segment; recall that a projected symmetry lne segment ntersects the x-axs at v. The p and q were represented n a polar coordnate system and wrtten as p = [x φ, y φ, 0] = [x v + r φ cosα, r φ snα, 0] and q = [x ψ, y ψ, 0] = [x v + r ψ cosα, r ψ snα, 0], where r φ and r ψ are the dstances of p and q from v when α = α. Note that the 3D ponts P and Q and ther 2D projectons p and q satsfy Equatons (7) and (8). From Equatons (7), (10) and (11), we obtan z Φ (an analogous formula can be wrtten for z Ψ ): z Φ x = ψ 2d ccosσ s 2xϕ xψ snσ s xϕ cos2σ s L L ( xϕ + xψ ) cos2σ s 2xϕ xψ snσ s + sn 2σ s z z L f Recall that an orthographc projecton s produced from a perspectve projecton by movng the center of projecton F to nfnty: z f +. As z f goes to nfnty, L goes to postve nfnty, as well. From Equaton (12), the lmt of z Φ as z f goes to nfnty s: z f lm z Φ x = ψ s f + xϕ cos2σ s d c sn 2σ d c sn 2σ s (12) (13) The lmt of z Ψ s obtaned n an analogous way: lm z z f Ψ x = ϕ + xψ cos2σ s d sn 2σ s c (14) Recall that n an nverse perspectve projecton, an mage pont [x, y,0] projects to a 3D pont [x(z f z)/z f, y(z f z)/z f, z]. As z f goes to nfnty, the lmt of [x(z f z)/z f, y(z f z)/z f, z] s [x, y, z], whch s an nverse orthographc projecton of [x, y, 0]. Note that x v goes to negatve nfnty as z f goes to nfnty; t follows that all α become zero. Ths means that the projected symmetry lne segments become parallel to one another and to the x-axs, and the vanshng pont v goes to nfnty. Hence, the slant σ s of the symmetry plane cannot be computed from the 2D mage; nstead, σ s becomes a free parameter n the 3D nterpretaton under an orthographc projecton. It follows that there are nfntely many 3D symmetrc curves that are consstent wth a par of 2D curves φ and ψ. In other words, the 3D curves form a one-parameter

10 Symmetry 2011, famly characterzed by σ s ; σ s changes the aspect rato and the orentaton of the 3D shapes of the curves Φ and Ψ [10]. Note that f sn2σ s = 0 (σ s s 0 or 90 ), z Φ and z Ψ dverge to ±. Hence, σ s should not be 0 or 90. These two cases correspond to degenerate vews of Φ and Ψ. When σ s s 0, the symmetry plane s parallel to the mage plane; φ and ψ wll then concde wth each other n the 2D mage. In such a case, the 3D recovery of a par of symmetrc 3D curves becomes trval: one produces any Φ from ϕ and then Ψ s obtaned as a mrror reflecton of Φ. When σ s s 90, the symmetry plane s perpendcular to the mage plane. In such a case, φ and ψ, themselves, must be mrror symmetrc n the 2D mage n order for the 3D symmetrc nterpretaton to exst. But then, the 2D curves themselves represent one possble 3D symmetrc nterpretaton. The rato d/c s another free parameter, but t only changes the poston of Φ and Ψ along the z-axs and does not change ther 3D shapes or orentatons. From these results, Theorem 1 for a perspectve projecton generalzes to Theorem 2 for an orthographc projecton. Theorem 2: Let φ and ψ be curves that are tame n a sngle 2D mage. Let the endponts of φ be e φ0 and e φ1, and the endponts of ψ be e ψ0 and e ψ1. Assume that φ and ψ have the followng propertes: () e φ0 e ψ0 e φ1 e ψ1 and () a lne that s parallel to e φ0 e ψ0 and ntersects wth φ has a unque ntersecton wth ψ and vce versa (see Fgure 5). Then, there exst nfntely many pars of contnuous curves Φ and Ψ and a plane Π s n a 3D space, such that Φ and Ψ are mrror-symmetrc wth respect to Π s and that φ s an orthographc projecton of Φ and ψ s an orthographc projecton of Ψ. Proof: Fgure 5. φ and ψ are two 2D curves. e φ0 and e φ1 are the endponts of φ, and e ψ0 and e ψ1 are the end ponts of ψ. The lnes e φ0 e ψ0 and e φ1 e ψ1 are parallel to the x-axs and do not have any ntersecton wth φ and ψ. A lne that s parallel to e φ0 e ψ0 and ntersects wth φ has a unque ntersecton wth ψ and vce versa. y p q x

11 Symmetry 2011, Let the orentatons of the lne segments e φ0 e ψ0 and e φ1 e ψ1 be horzontal. Ths does not restrct the generalty: f these lne segments are not horzontal, we rotate the mage so that they become horzontal. For any pont p = [x φ, y φ ] on φ, we fnd ts counterpart on ψ as q = [x ψ, y ψ ]. Note that q s found as an ntersecton of ψ and a horzontal lne y = y φ. Hence, y φ = y ψ. We assume that ths ntersecton s unque. Then, both φ and ψ can be represented as functons of y: x φ = x φ (y φ ) and x ψ = x ψ (y φ ). From Equatons (13) and (14), the 3D symmetrc curves Φ and Ψ are produced by computng the postons of all ponts P and Q as follows: xψ ( yϕ ) + xϕ ( yϕ )cos2σ s P = xϕ ( yϕ ) yϕ d c sn 2σ s xϕ ( yϕ ) + xψ ( yϕ )cos2σ s Q = xψ ( yϕ ) yϕ d c sn 2σ s where σ s s a slant of the symmetry plane. The tlt τ s of the symmetry plane s zero. Equatons (15) and (16) allow one to compute a par of 3D symmetrc curves Φ and Ψ from a par of 2D curves φ and ψ under an orthographc projecton. It s obvous from these equatons that Φ and Ψ are contnuous when φ and ψ are contnuous. Recall that slant σ s s a free parameter; t can be arbtrary, except for sn2σ s = 0. So, the 3D symmetrc curves form a one-parameter famly characterzed by σ s. Equatons (15 16) show that a relaton between the par of 2D curves φ and ψ and the par of 3D curves Φ and Ψ becomes computatonally smple when σ s s 45 (or 45 ) and d/c s 0; the absolute value of the z-coordnate of Q s equal to the x-coordnate of P and the absolute value of the z-coordnate of P s equal to the x- coordnate of Q. The symmetrc par of 3D curves produced usng Equatons (15) and (16) and consstent wth φ and ψ n Fgure 5 s shown n Fgure 6. If the drecton of the lnes connectng the correspondng ponts on φ and ψ s not known or s uncertan, the famly of 3D nterpretatons s characterzed by two parameters: slant and tlt of the symmetry plane. Fgure 6. Vews of a symmetrc par of 3D curves produced from the par of 2D curves n Fgure 5. The slant σ s of the symmetry plane Π s was set to 45. See Demo 4 n supplemental materal for an nteractve llustraton of the 3D symmetrc curves [2]. (15) (16) Front vew Sde vew

12 Symmetry 2011, A Par of 2D Curves wth Multple Symmetrc Correspondences In the two theorems above, t was assumed that correspondences between ponts of φ and ψ are unque. We generalze these theorems to the case of non-unque correspondences. A pont on φ can have multple correspondng ponts on ψ (and vce versa). In such a case, the 3D nterpretaton of φ wll have segments whose 2D projectons perfectly overlap one another n the 2D mage (Fgure 7). In other words, the 3D symmetry wll be hdden n the depth drecton, and thus, the 3D vew wll be degenerate (see Dscusson). Frst, we consder the case of an orthographc projecton. Ths case wll then be generalzed to a perspectve projecton. Fgure 7. An asymmetrc par of 2D curves wth multple symmetrc correspondences and ts 3D symmetrc nterpretaton. (a) An asymmetrc par of 2D curves. Some ponts of the rght curve correspond to three ponts of the left curve. These curves can be stll nterpreted as a 2D orthographc projecton of a symmetrc par of 3D curves. The slant σ s of the symmetry plane was set to 35 ; (b) Three dfferent vews of the 3D symmetrc nterpretaton produced from the par of the 2D curves n (a). The numbers n the bottom are the values of the slant σ s of the symmetry plane of the symmetrc par of the 3D curves. For σ s equal to 35, the mage s dentcal to that n (a). When σ s s 90, ts 2D projecton tself becomes symmetrc. See Demo 5 n supplemental materal for an nteractve llustraton of the 3D symmetrc curves [2]. (a) (b) Front vew Theorem 3: Let φ and ψ be curves that are tame n a 2D mage. Let the endponts of φ be e φ0 and e φ1, the endponts of ψ be e ψ0 and e ψ1. Let a lne connectng e φ0 and e ψ0 be l 0 and that connectng e φ1 and e ψ1 be l 1. Assume that φ and ψ have the followng propertes: () l 0 l 1, () l 0 and l 1 do not have any ntersecton wth φ and ψ and () a lne that s parallel to l 0 and ntersects φ has one or a fnte number of ntersectons wth ψ and vce versa (see Fgure 8). Then, there exst nfntely many pars of contnuous curves Φ and Ψ and a plane Π s n a 3D space, such that Φ and Ψ are mrror-symmetrc wth respect to Π s and that φ s an orthographc projecton of Φ and ψ s an orthographc projecton of Ψ.

13 Symmetry 2011, Proof: Fgure 8. φ and ψ are 2D curves. e φ0 and e φ1 are the endponts of φ, and e ψ0 and e ψ1 are the end ponts of ψ. l 0 s a lne connectng e φ0 and e ψ0, and l 1 s a lne connectng e φ1 and e ψ1. l 0 and l 1 are parallel to the x-axs and do not have any ntersecton wth φ and ψ. A lne that s parallel to l 0 and ntersects wth φ has one or more ntersectons wth ψ and vce versa. p 5 p 15 q 13 p 4 p 6 p 8 p 14 q 8 q 12 p 3 p 7 p 9 p 13 q 3 q 7 q 9 q 11 p 2 p 10 p 12 q 2 q 4 q 6 q 10 p 1 p 11 q 1 q 5 In order to prove ths theorem, we frst dvde a par of φ and ψ nto multple pars of fragments, such that each par satsfes the assumptons of Theorem 2. Then, we fnd ther backprojectons that are mrror-symmetrc pars of contnuous curves n the 3D space. Next, we wll show that these multple pars of 3D curves can share a common symmetry plane Π s and produce a symmetrc par of contnuous curves. As before we assume that the orentatons of the lne segments e φ0 e ψ0 and e φ1 e ψ1 are horzontal. In ths case, e φ0, e φ1, e ψ0 and e ψ1 are ether global maxma or mnma of φ and ψ along a vertcal axs on the 2D mage. Consder horzontal lnes that are tangent to the curves at ther local extrema (Fgure 8). Intersectons and tangent ponts of these horzontal lnes wth φ and ψ are labeled by numbers sequentally along each curve; p 1,, p m on φ and q 1,, q n on ψ (n Fgure 8, n = 15, and m = 13). Both φ and ψ are dvded nto segments p 1 p 2, p 2 p 3 etc. Let the endponts e φ0, e φ1, e ψ0 and e ψ1 on φ and ψ be p 0, p m+1, q 0 and q n+1, respectvely. Let c φ be a segment of ϕ connectng p and ts successor p +1. Then, c φ s a curve that s monotonc and contnuous between p and p +1 and these two ponts are the endponts of c φ. Smlarly, let c ψj be a segment of ψ connectng q j and ts successor q j+1. A segment c φ of φ has, at least, one correspondng segment of ψ; the endponts of these segments of ϕ and ψ form parallel lne segments. From Theorem 2, a par of c φ and each of the correspondng segments of ψ are consstent wth an nfnte number of 3D symmetrc nterpretatons under an orthographc projecton; the one-parameter famly of symmetrc pars of 3D curves s characterzed by the slant of a symmetry plane. The tlt of the symmetry plane s zero and ts depth along the z-axs s arbtrary. It follows that, among all correspondng pars of 2D segments of these curves, ther possble 3D symmetrc nterpretatons can share a common symmetry plane Π s wth some slant σ s and depth. Hence, φ and ψ

14 Symmetry 2011, are consstent wth a one parameter famly of symmetrc pars of the 3D fragmented curves that are backprojectons of the 2D segments of the 2D curves. In order to prove Theorem 3, we show that, for each member of the famly, the symmetrc pars of the 3D fragmented curves produce a symmetrc par of 3D contnuous curves whose endponts are backprojectons of the endponts of φ and ψ. An orthographc projecton of such a symmetrc par of the 3D contnuous curves wll be φ and ψ. A table representng pars of the segments of φ and ψ and ther endponts s shown n Fgure 9. The rows of the table represent the ponts p 0,, p m+1 on φ. The columns represent the ponts q 0,, q n+1 on ψ. A crcle at (p, q j ) represents a correspondng par of ponts p and q j n Fgure 8. These crcles are nodes n a graph representng the possble correspondences among pars of ponts n Fgure 8. Let an edge n ths graph connectng (p, q j ) and (p k, q l ) be labeled (p, q j )-(p k, q l ). Note that the edge (p, q j )-(p k, q l ) s the same as (p k, q l )-(p, q j ). The edge (p k, q l )-(p, q j ) represents a par of segments of ϕ and ψ, such that c φ mn(,k) connects p and p k and c ψ mn(j,l) connects q j and q l. Recall that the endponts of each segment on ϕ and ψ are two neghborng ponts of φ or ψ; I k = 1 and j l = 1. Hence, an edge n the graph shown n Fgure 9 can only connect two nodes that are dagonally next to each other n the table and a node can be connected to, at most, four nodes by four edges. A par of nodes can be connected to each other only by a sngle edge. The end nodes of (p, q j )-(p k, q l ) are ether the maxma or mnma of these segments and ther endponts form horzontal lne segments. Hence, from the Theorem 2, a par of segments of ϕ and ψ represented by each edge n the graph s consstent wth a one-parameter famly of pars of 3D curves that s symmetrc wth respect to the common symmetry plane Π s. Fgure 9. Ths table represents pars of segments and pars of ponts on of ϕ and ψ. The rows represent the ponts p 0,, p m+1 on φ. The columns represent the ponts q 0,, q n+1 on ψ. A crcle at (p, q j ), whch s a node n the graph, represents a correspondng par of ponts p and q j ; p and q j form a horzontal lne segment n Fgure 8. The top left and bottom rght nodes represent pars of endponts of φ and ψ. An edge (p, q j )-(p k, q l ) (or (p k, q l )-(p, q j )) connectng (p, q j ) and (p k, q l ) represents a par of segments of ϕ and ψ. p 0 p 1 p 2 p 3 p 4 p 5 p 6 p 7 p 8 p 9 p 10 p 11 p 12 p 13 p 14 p 15 p 16 q 0 q 1 q 2 q 3 q 4 q 5 q 6 q 7 q 8 q 9 q 10 q 11 q 12 q 13 q 14

15 Symmetry 2011, Consder two edges (p, q j )-(p k, q l ) and (p, q j )-(p g, q h ) connected to a common node (p, q j ). These edges represent two pars of segments of the 2D curves; a par c φmn(,k) and c ψmn(j,l) and a par c φmn(,g) and c ψmn(j,h). The two segments c φmn(,k) and c φmn(,g) are connected to each other at ther common endpont p (see Fgure 8). In the same way, c ψmn(j,l) and c ψmn(j,h) are connected to each other at ther common endpont q j. Hence, these two pars of 2D curves can be regarded as a par of 2D curves whose endponts are represented by (p k, q l ) and (p g, q h ) that are the end nodes of the path formed by the edges. Note that each (p, q j )-(p k, q l ) and (p, q j )-(p g, q h ) s consstent wth nfntely many pars of 3D contnuous curves. Assume that they are symmetrc wth respect to the common symmetry plane Π s whose slant and depth are gven. Then, two symmetrc pars of 3D contnuous curves are unquely determned; these 3D curves are backprojectons of c φmn(,k), c φmn(,g), c ψmn(j,l) and c ψmn(j,h), respectvely. The 3D curves that are backprojectons of c φmn(,k) and c φmn(,g) are connected to each other at ther common endpont that s a backprojecton of p ; these two 3D curves can be regarded as a sngle 3D curve. The same way, the 3D curves that are backprojectons of c ψmn(j,l) and c ψmn(j,h) can be regarded as a sngle 3D curve. It follows that the two symmetrc pars of 3D curves produced from c φmn(,k), c φmn(,g), c ψmn(j,l) and c ψmn(j,h) can be regarded as a sngle symmetrc par of 3D contnuous curves. Ther endponts are backprojectons of the 2D ponts represented by the end nodes (p k, q l ) and (p g, q h ) of the contnuous path. Ths can be generalzed to all segments of ϕ and ψ as follows. A contnuous path of the edges n the table n Fgure 9 represents a par of 2D contnuous curves; the 2D curves are composed of the 2D segments of φ and ψ and ther endponts are represented by the end nodes of the path. The 2D curves are consstent wth an nfnte number of symmetrc pars of 3D contnuous curves. The endponts of the 3D curves are backprojectons of the ponts represented by the end nodes of the path. So, f there s a contnuous path connectng (p 0, q 0 ) and (p m+1, q n+1 ) n the graph n Fgure 9, then ths path represents a par of 2D contnuous curves φ and ψ and ths par of the 2D curves s consstent wth a one-parameter famly of symmetrc pars of 3D contnuous curves. The exstence of a contnuous path of edges connectng (p 0, q 0 ) and (p m+1, q n+1 ) n the graph wll now be proved by usng concepts from a graph theory. A graph s called connected f there s a contnuous path of edges between every par of nodes n the graph. If (p 0, q 0 ) and (p m+1, q n+1 ) belong to a connected graph, there s a path connectng (p 0, q 0 ) and (p m+1, q n+1 ). A connected graph has even number of nodes of odd degree, where degree of a node refers to number of edges connected to the node [20]. If (p 0, q 0 ) and (p m+1, q n+1 ) are the only nodes of odd degree n the graph, they must belong to the same connected graph and there must be a contnuous path connectng (p 0, q 0 ) and (p m+1, q n+1 ). Next, we provde a classfcaton of possble nodes n the graph and show that there are only four types: of degree zero, one, two or four. Ths wll conclude the proof. Consder p 1,, p m on φ and q 1,, q n on ψ. If a node (p, q j ) exsts n the table, p and q j form a horzontal lne segment n Fgure 8. Note that (p, q j ) can be connected to, at most, four nodes n the graph that are dagonally next to (p, q j ): (p 1, q j 1 ), (p 1, q j+1 ), (p +1, q j 1 ) and (p +1, q j+1 ). Hence, the maxmum degree of each node n the table s four. These four neghborng nodes represent possble pars of neghborng ponts of p along φ and q j along ψ. Consder a par of the neghborng ponts p +1 and q j + 1. The node (p +1, q j+1 ) exsts f and only f p +1 and q j+1 are a correspondng par; they form a horzontal lne segment n Fgure 8. Note that p + 1 and p are connected by c φ and q j+1 and q j are connected by c ψj. If both (p +1, q j+1 ) and (p, q j ) exst n the graph, they are connected by

16 Symmetry 2011, (p +1, q j+1 )-(p, q j ) representng a par of segments c φ and c ψj. Therefore, the number of edges n the graph connected to (p, q j ) can be computed by verfyng the exstence of the four neghborng nodes. In order to compute the number of edges connected to each node, ponts and correspondng pars of ponts represented by the nodes n the graph are classfed. Consder ponts p 1,, p m and q 1,, q n. Frst, these ponts can be classfed nto three types: local maxma, local mnma and ponts at whch the curve s monotonc (Fgure 10). If a pont s a local maxmum, ts neghborng ponts are lower than the local maxmum. If a pont s a local mnmum, ts neghborng ponts are hgher than the local mnmum. If a pont s a monotonc pont, one of ts neghborng ponts s hgher and the other s lower. Next, based on the classfcaton of the ponts, the correspondng pars of the ponts can be classfed nto three types (Fgure 11). Type (): f two monotonc ponts are correspondng, a node representng ths par of ponts s connected to two nodes by two edges. Hence, the degree of ths node s two; Type (): f a monotonc pont and a local maxmum/mnmum are correspondng, the degree of a node representng ths par s also two; Type (): f two local maxma/mnma are correspondng, the degree of a node representng ths par s four; Type (v): f a local maxmum and a local mnmum are correspondng, the degree of a node representng ths par s zero. From these facts, the degree of any node whch does not represent the endponts of the two curves s always even (0, 2 or 4). Next, consder pars of endponts of φ and ψ: (p 0, q 0 ) and (p m + 1, q n+1 ). Recall that p 0 = e φ0, p m+1 = e φ1, q 0 = e ψ0 and q n+1 = e ψ1 ; so, the lne segments p 0 q 0 and p m+1 q n+1 are horzontal n Fgure 8. Hence, these pars of the endponts are correspondng pars and the nodes representng these pars exst n the graph. Note that these endponts are global maxma and mnma of φ and ψ; the global maxma form a correspondng par and the global mnma form a correspondng par. Recall that f two local maxma or two local mnma form a correspondng par, there are four correspondng pars of ther neghborng ponts. However, each endpont has only one neghborng pont. Hence, there s one correspondng par of the neghborng ponts for each par of the endponts. Therefore, each (p 0, q 0 ) and (p m+1, q n+1 ) s connected to a sngle node and ther degrees are one, whch s an odd number. Fgure 10. Three types of ponts (sold crcles) on a 2D curve and ther neghborng ponts (open crcles). (a) Local maxmum (b) Local mnmum (c) Monotonc pont

17 Symmetry 2011, Fgure 11. Four types of pars of ponts (sold crcles) and ther neghborng ponts (open crcles). See text for more nformaton. Type () or Type () or Type () Type (v) Note that the case where φ or ψ has a local extremum at whch a horzontal lne connectng e φ0 and e ψ0 or e φ1 and e ψ1 s tangent to the curve of the extremum, s analogous to Type () n Fgure 11. The extremum of the curve corresponds to an endpont of the other curve that s on the horzontal tangent lne. Unlke Type (), the endpont has only one neghborng pont that forms a correspondng par wth the neghborng ponts of the local extremum. Hence, the degree of a node representng the par of the local extremum and the endpont s also two, whch s an even number. From these facts, there are two nodes (p 0, q 0 ) and (p m+1, q n+1 ) whose degrees are odd (1) and the degrees of all other nodes are even (0, 2 or 4). Hence, (p 0, q 0 ) and (p m+1, q n+1 ) must belong to the same connected graph and these two nodes are connected by a contnuous path of edges. Ths contnuous path n the graph represents the correspondences between 3D contnuous curves of a symmetrc par whose orthographc projectons are the 2D curves φ and ψ, respectvely. Once the correspondences are formed, the par of the 3D curves can be produced usng Equatons (15) and (16). Note that the slant of the symmetry plane Π s s a free parameter of the 3D symmetrc nterpretaton of φ and ψ under an orthographc projecton. A symmetrc par of 3D curves produced from the par of 2D curves n Fgure 8 s shown n Demo 6 n supplemental materal [2]. Ths proof of Theorem 3 for an orthographc projecton can be easly generalzed to the case of a perspectve projecton: Theorem 4: Let φ and ψ be curves that are tame n a sngle 2D mage. Let the endponts of φ be e φ0 and e φ1, and the endponts of ψ be e ψ0 and e ψ1. Let a lne connectng e φ0 and e ψ0 be l 0 and that connectng e φ1 and e ψ1 be l 1. Assume that φ and ψ have the followng propertes: () l 0 and l 1 ntersect at a pont v that s not on φ or ψ; () l 0 and l 1 do not have any ntersecton wth φ and ψ; () v s not

18 Symmetry 2011, between e φ0 and e ψ0 or between e φ1 and e ψ1 ; and (v) a half lne that emanates from v and ntersects wth φ has one or a fnte number of ntersectons wth ψ and vce versa. Then, there exsts a par of contnuous curves Φ and Ψ and a plane Π s n a 3D space for a gven center of projecton F, such that Φ and Ψ are mrror-symmetrc wth respect to Π s and that φ s a perspectve projecton of Φ and ψ s a perspectve projecton of Ψ. Proof: In the proof of Theorem 3 for the case of an orthographc projecton, the 2D curves φ and ψ were dvded by lnes whch were parallel to e φ0 e ψ0 and were tangent to ether of the 2D curves. In the case of a perspectve projecton, φ and ψ are dvded by lnes whch emanate from the vanshng pont v and are tangent to ether of the 2D curves. The rest of ths proof s dentcal to that of Theorem 3. The only dfference s that n the case of a perspectve projecton the 3D nterpretaton s unque the slant of the symmetry plane s not a free parameter. In the four theorems above t was assumed that an endpont of one curve corresponds to an endpont of the other curve. Next, we generalze Theorems 3 and 4 to the case where an endpont of a curve may or may not correspond to an endpont of the other curve. Ths can happen, for example, n the presence of occluson. We begn wth the case of an orthographc projecton. Theorem 5: Let φ and ψ be curves that are tame n a 2D mage. Assume that there exst two lnes l 0 and l 1 whch satsfy the followng propertes: () l 0 and/or l 1 s ether tangent to both φ and ψ or passes through ther endponts, () l 0 l 1, () l 0 and l 1 do not have any ntersecton wth φ and ψ and (v) a lne that s parallel to l 0 and ntersects φ has one or a fnte number of ntersectons wth ψ and vce versa (see Fgure 12). Then, there exst nfntely many pars of contnuous curves Φ and Ψ and a plane Π s n a 3D space, such that Φ and Ψ are mrror-symmetrc wth respect to Π s and that φ s an orthographc projecton of Φ and ψ s an orthographc projecton of Ψ. In order to prove ths theorem, we frst extend φ and ψ and obtan a par of 2D curves φ and ψ that perfectly overlap φ and ψ n the 2D mage and satsfy the assumptons of Theorem 3. Then, we fnd the backprojectons of φ and ψ n the 3D space, such that these backprojected curves are mrror-symmetrc wth respect to a plane Π s. Ther orthographc projectons n the 2D mage concde wth φ and ψ, as well as wth φ and ψ. Let the orentatons of l 0 and l 1 be horzontal. In ths case, tangent ponts of φ and ψ to l 0 or l 1 are ether global maxma or mnma of φ and ψ along a vertcal axs on the 2D mage. Assume that the endponts of these curves are not global extrema the case when they are global extrema has been consdered n the prevous theorems. Let the tangent ponts of φ to l 0 and l 1 be t φ0 and t φ1. Let an endpont of φ, whch s closer (as measured by the arc length along the curve) to t φ0 be e φ0, and that, whch s closer to t φ1 be e φ1. The same way, let the tangent ponts of ψ to l 0 or l 1 be t ψ0 and t ψ1, and the endponts ψ be e ψ0 and e ψ1. We extend the 2D curves φ and ψ by addng arcs that start from e φ0, e φ1, e ψ0 and e ψ1, whch are endponts of φ and ψ. The extenson startng from e φ0 s dentcal to the segment of φ between e φ0 and t φ0. Smlarly, the extenson startng from e φ1 s dentcal to the segment of φ between e φ1 and t φ1. Let ths new curve be φ. Let the endponts of φ be e φ0 and e φ1, so that the postons of e φ0 and e φ1 are respectvely the same as those of t φ0 and t φ1 n the 2D mage. The same way, let the extended curve produced from ψ be ψ and the endponts of ψ be e ψ0 and e ψ1. The postons of e ψ0 and e ψ1 are

19 Symmetry 2011, respectvely the same as those of t ψ0 and t ψ1 n the 2D mage. The curves φ and ψ perfectly overlap φ and ψ n the 2D mage (Fgure 12). Therefore, the 3D nterpretatons of φ and ψ are also consstent wth the 3D nterpretatons of φ and ψ. It s easy to see that φ and ψ satsfy the assumptons of Theorem 3. Therefore, t follows from the proof of Theorem 3 that there exsts a one-parameter famly of symmetrc pars of contnuous 3D curves Φ and Ψ, such that φ s an orthographc projecton of Φ and ψ s an orthographc projecton of Ψ. Ths, n turn, mples that φ and ψ are also orthographc projecton of Φ and Ψ. A symmetrc par of 3D curves produced from the par of 2D curves n Fgure 12 s shown n Demo 7 n supplemental materal [2] (It looks lke each of the 3D curves n Demo 6 has four endponts, rather than two, as would be expected from Theorem 3. It also looks lke each of the 3D curves has two bfurcatons. All of the four ponts that look lke endponts are actually 180 turns of the 3D curve. The real endponts of the 3D curve are at the bfurcatons). Proof: Fgure 12. φ and ψ (red sold curves) are 2D curves. e φ0 and e φ1 are the endponts of φ, and e ψ0 and e ψ1 are the end ponts of ψ. l 0 s tangent to both φ and ψ at t φ0 and t ψ0, and l 1 s tangent to both φ and ψ at t φ1 and t ψ1. l 0 and l 1 are parallel to the x-axs and do not have any ntersecton wth φ and ψ. The two curves, φ and ψ are extended by addng arcs (blue dotted curves) that start from e φ0, e φ1, e ψ0 and e ψ1. The addtonal arcs are dentcal to the segments of φ and ψ (note that the blue dotted curves are perfectly overlappng the red sold curves n the mage). They end at e φ0, e φ1, e ψ0 and e ψ1 whose postons are respectvely the same as those of t φ0, t φ1, t ψ0 and t ψ1. See Demo 7 n supplemental materal for an nteractve llustraton of the 3D symmetrc curves produced from φ and ψ [2]. l 1 l 0

20 Symmetry 2011, Ths proof of Theorem 5 for an orthographc projecton can be easly generalzed to the case of a perspectve projecton, the same way as the proof of Theorem 3 was generalzed to the case of perspectve projecton: Theorem 6: Let φ and ψ be curves that are tame n a 2D mage. Assume that there exst two lnes l 0 and l 1 whch satsfy the followng propertes: () l 0 and/or l 1 s ether tangent to both φ and ψ or passes through ther endponts; () l 0 and l 1 ntersect at a pont v that s not on φ or ψ; () l 0 and l 1 do not have any other ntersectons wth φ and ψ; (v) v s not between e φ0 and e ψ0 or between e φ1 and e ψ1, and (v) a half lne that emanates from v and ntersects wth φ has one or a fnte number of ntersectons wth ψ and vce versa. Then, there exsts a par of contnuous curves Φ and Ψ and a plane Π s n a 3D space for a gven center of projecton F, such that Φ and Ψ are mrror-symmetrc wth respect to Π s and that φ s a perspectve projecton of Φ and ψ s a perspectve projecton of Ψ. 3. Dscusson In ths paper, we showed that any par of 2D curves that are suffcently regular s consstent wth a 3D symmetrc nterpretaton under qute general assumptons. We derved the equatons that allow one to compute the 3D curves for the case of perspectve and orthographc projectons. Although the man part of the proofs s farly straghtforward, the result s surprsng and has mportant mplcatons for theores of shape percepton. Consder the examples n Fgures 1, 2, 3, 5, 7, 8 and 13. Although these pars of 2D curves do not look lke symmetrc pars of 3D curves, they do have 3D symmetrc nterpretatons. What s the nature of the process that can produce 3D symmetry from an arbtrary 2D mage? The key element of ths process seems to be related to the concept of degenerate vews. Essentally, the 3D vewng drecton for whch the 3D symmetrc curves project to the gven 2D asymmetrc curves s degenerate and the 3D symmetry becomes hdden n the 2D mage. There are two cases representng a degenerate vew. The frst, more obvous case, happens when multple segments of a 3D curve project to the same segment of a 2D curve. Ths can be seen n the 3D symmetrc nterpretatons of Fgures 7, 8 and 13 (see Demos 5 7 [2]). The second, more subtle case, corresponds to the stuaton where a local curvature of a 3D curve dsappears n the 2D projecton. The smplest example s when a planar curve n the 3D space projects to a straght lne segment n the 2D mage [21]. However, f a curve n the 3D space s not planar, then ts 2D projecton s never a straght lne segment, even for degenerate vews. Recall that curvature of a 3D curve (also called frst curvature) represents the change of the tangent to the curve wthn the plane of the crcle of curvature, whle torson (also called second curvature) represents the change of the tangent to the curve away from the plane of the crcle of curvature [22]. If the normal of the plane of the crcle of curvature s perpendcular to the lne of sght, the change of the tangent wthn ths plane (.e., curvature of the 3D curve) dsappears n the 2D projecton, but the departure from ths plane (.e., torson of the 3D curve) does not. In a sense, for such vews, the local curvature of a 2D curve s a projecton of the local torson of a 3D curve. Fgures 2, 3 and 5 llustrate the second case of degenerate vews (see Demos 2 4 [2]). Apparently, the vsual system rejects 3D symmetrc nterpretatons f they mply degenerate vews. Ths makes sense because degenerate vews are unlkely.

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges

More information

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1) Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A

More information

3D vector computer graphics

3D vector computer graphics 3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres

More information

Structure from Motion

Structure from Motion Structure from Moton Structure from Moton For now, statc scene and movng camera Equvalentl, rgdl movng scene and statc camera Lmtng case of stereo wth man cameras Lmtng case of multvew camera calbraton

More information

Electrical analysis of light-weight, triangular weave reflector antennas

Electrical analysis of light-weight, triangular weave reflector antennas Electrcal analyss of lght-weght, trangular weave reflector antennas Knud Pontoppdan TICRA Laederstraede 34 DK-121 Copenhagen K Denmark Emal: kp@tcra.com INTRODUCTION The new lght-weght reflector antenna

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

More information

ROBOT KINEMATICS. ME Robotics ME Robotics

ROBOT KINEMATICS. ME Robotics ME Robotics ROBOT KINEMATICS Purpose: The purpose of ths chapter s to ntroduce you to robot knematcs, and the concepts related to both open and closed knematcs chans. Forward knematcs s dstngushed from nverse knematcs.

More information

Accounting for the Use of Different Length Scale Factors in x, y and z Directions

Accounting for the Use of Different Length Scale Factors in x, y and z Directions 1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,

More information

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following. Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal

More information

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach Data Representaton n Dgtal Desgn, a Sngle Converson Equaton and a Formal Languages Approach Hassan Farhat Unversty of Nebraska at Omaha Abstract- In the study of data representaton n dgtal desgn and computer

More information

REFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water.

REFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water. Purpose Theory REFRACTION a. To study the refracton of lght from plane surfaces. b. To determne the ndex of refracton for Acrylc and Water. When a ray of lght passes from one medum nto another one of dfferent

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

Lecture 5: Multilayer Perceptrons

Lecture 5: Multilayer Perceptrons Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented

More information

Introduction to Geometrical Optics - a 2D ray tracing Excel model for spherical mirrors - Part 2

Introduction to Geometrical Optics - a 2D ray tracing Excel model for spherical mirrors - Part 2 Introducton to Geometrcal Optcs - a D ra tracng Ecel model for sphercal mrrors - Part b George ungu - Ths s a tutoral eplanng the creaton of an eact D ra tracng model for both sphercal concave and sphercal

More information

Finding Intrinsic and Extrinsic Viewing Parameters from a Single Realist Painting

Finding Intrinsic and Extrinsic Viewing Parameters from a Single Realist Painting Fndng Intrnsc and Extrnsc Vewng Parameters from a Sngle Realst Pantng Tadeusz Jordan 1, Davd G. Stork,3, Wa L. Khoo 1, and Zhgang Zhu 1 1 CUNY Cty College, Department of Computer Scence, Convent Avenue

More information

TEST-05 TOPIC: OPTICS COMPLETE

TEST-05 TOPIC: OPTICS COMPLETE Q. A boy s walkng under an nclned mrror at a constant velocty V m/s along the x-axs as shown n fgure. If the mrror s nclned at an angle wth the horzontal then what s the velocty of the mage? Y V sn + V

More information

Chapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward

More information

Line geometry, according to the principles of Grassmann s theory of extensions. By E. Müller in Vienna.

Line geometry, according to the principles of Grassmann s theory of extensions. By E. Müller in Vienna. De Lnengeometre nach den Prnzpen der Grassmanschen Ausdehnungslehre, Monastshefte f. Mathematk u. Physk, II (89), 67-90. Lne geometry, accordng to the prncples of Grassmann s theory of extensons. By E.

More information

Math Homotopy Theory Additional notes

Math Homotopy Theory Additional notes Math 527 - Homotopy Theory Addtonal notes Martn Frankland February 4, 2013 The category Top s not Cartesan closed. problem. In these notes, we explan how to remedy that 1 Compactly generated spaces Ths

More information

Vanishing Hull. Jinhui Hu, Suya You, Ulrich Neumann University of Southern California {jinhuihu,suyay,

Vanishing Hull. Jinhui Hu, Suya You, Ulrich Neumann University of Southern California {jinhuihu,suyay, Vanshng Hull Jnhu Hu Suya You Ulrch Neumann Unversty of Southern Calforna {jnhuhusuyay uneumann}@graphcs.usc.edu Abstract Vanshng ponts are valuable n many vson tasks such as orentaton estmaton pose recovery

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

Scan Conversion & Shading

Scan Conversion & Shading Scan Converson & Shadng Thomas Funkhouser Prnceton Unversty C0S 426, Fall 1999 3D Renderng Ppelne (for drect llumnaton) 3D Prmtves 3D Modelng Coordnates Modelng Transformaton 3D World Coordnates Lghtng

More information

LECTURE : MANIFOLD LEARNING

LECTURE : MANIFOLD LEARNING LECTURE : MANIFOLD LEARNING Rta Osadchy Some sldes are due to L.Saul, V. C. Raykar, N. Verma Topcs PCA MDS IsoMap LLE EgenMaps Done! Dmensonalty Reducton Data representaton Inputs are real-valued vectors

More information

Resolving Ambiguity in Depth Extraction for Motion Capture using Genetic Algorithm

Resolving Ambiguity in Depth Extraction for Motion Capture using Genetic Algorithm Resolvng Ambguty n Depth Extracton for Moton Capture usng Genetc Algorthm Yn Yee Wa, Ch Kn Chow, Tong Lee Computer Vson and Image Processng Laboratory Dept. of Electronc Engneerng The Chnese Unversty of

More information

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.

More information

GSLM Operations Research II Fall 13/14

GSLM Operations Research II Fall 13/14 GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are

More information

Scan Conversion & Shading

Scan Conversion & Shading 1 3D Renderng Ppelne (for drect llumnaton) 2 Scan Converson & Shadng Adam Fnkelsten Prnceton Unversty C0S 426, Fall 2001 3DPrmtves 3D Modelng Coordnates Modelng Transformaton 3D World Coordnates Lghtng

More information

Sketching of Mirror-symmetric Shapes

Sketching of Mirror-symmetric Shapes IEEE TRANSACTIONS ON TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS Sketchng of Mrror-symmetrc Shapes Frederc Corder Hyewon Seo Jnho Park and Junyong Noh Fg.. Sketchng of a symmetrc shape. Abstract

More information

AP PHYSICS B 2008 SCORING GUIDELINES

AP PHYSICS B 2008 SCORING GUIDELINES AP PHYSICS B 2008 SCORING GUIDELINES General Notes About 2008 AP Physcs Scorng Gudelnes 1. The solutons contan the most common method of solvng the free-response questons and the allocaton of ponts for

More information

An Approach in Coloring Semi-Regular Tilings on the Hyperbolic Plane

An Approach in Coloring Semi-Regular Tilings on the Hyperbolic Plane An Approach n Colorng Sem-Regular Tlngs on the Hyperbolc Plane Ma Louse Antonette N De Las Peñas, mlp@mathscmathadmueduph Glenn R Lago, glago@yahoocom Math Department, Ateneo de Manla Unversty, Loyola

More information

CHAPTER 2 DECOMPOSITION OF GRAPHS

CHAPTER 2 DECOMPOSITION OF GRAPHS CHAPTER DECOMPOSITION OF GRAPHS. INTRODUCTION A graph H s called a Supersubdvson of a graph G f H s obtaned from G by replacng every edge uv of G by a bpartte graph,m (m may vary for each edge by dentfyng

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

A Comparison and Evaluation of Three Different Pose Estimation Algorithms In Detecting Low Texture Manufactured Objects

A Comparison and Evaluation of Three Different Pose Estimation Algorithms In Detecting Low Texture Manufactured Objects Clemson Unversty TgerPrnts All Theses Theses 12-2011 A Comparson and Evaluaton of Three Dfferent Pose Estmaton Algorthms In Detectng Low Texture Manufactured Objects Robert Krener Clemson Unversty, rkrene@clemson.edu

More information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

Fast Computation of Shortest Path for Visiting Segments in the Plane

Fast Computation of Shortest Path for Visiting Segments in the Plane Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

A high precision collaborative vision measurement of gear chamfering profile

A high precision collaborative vision measurement of gear chamfering profile Internatonal Conference on Advances n Mechancal Engneerng and Industral Informatcs (AMEII 05) A hgh precson collaboratve vson measurement of gear chamferng profle Conglng Zhou, a, Zengpu Xu, b, Chunmng

More information

CMPS 10 Introduction to Computer Science Lecture Notes

CMPS 10 Introduction to Computer Science Lecture Notes CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not

More information

Hermite Splines in Lie Groups as Products of Geodesics

Hermite Splines in Lie Groups as Products of Geodesics Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the

More information

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

Amnon Shashua Shai Avidan Michael Werman. The Hebrew University, objects.

Amnon Shashua Shai Avidan Michael Werman. The Hebrew University,   objects. Trajectory Trangulaton over Conc Sectons Amnon Shashua Sha Avdan Mchael Werman Insttute of Computer Scence, The Hebrew Unversty, Jerusalem 91904, Israel e-mal: fshashua,avdan,wermang@cs.huj.ac.l Abstract

More information

UNIT 2 : INEQUALITIES AND CONVEX SETS

UNIT 2 : INEQUALITIES AND CONVEX SETS UNT 2 : NEQUALTES AND CONVEX SETS ' Structure 2. ntroducton Objectves, nequaltes and ther Graphs Convex Sets and ther Geometry Noton of Convex Sets Extreme Ponts of Convex Set Hyper Planes and Half Spaces

More information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

More information

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson

More information

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples

More information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

Slide 1 SPH3UW: OPTICS I. Slide 2. Slide 3. Introduction to Mirrors. Light incident on an object

Slide 1 SPH3UW: OPTICS I. Slide 2. Slide 3. Introduction to Mirrors. Light incident on an object Slde 1 SPH3UW: OPTICS I Introducton to Mrrors Slde 2 Lght ncdent on an object Absorpton Relecton (bounces)** See t Mrrors Reracton (bends) Lenses Oten some o each Everythng true or wavelengths

More information

Solving some Combinatorial Problems in grid n-ogons

Solving some Combinatorial Problems in grid n-ogons Solvng some Combnatoral Problems n grd n-ogons Antono L. Bajuelos, Santago Canales, Gregoro Hernández, Ana Mafalda Martns Abstract In ths paper we study some problems related to grd n-ogons. A grd n-ogon

More information

Lecture 5: Probability Distributions. Random Variables

Lecture 5: Probability Distributions. Random Variables Lecture 5: Probablty Dstrbutons Random Varables Probablty Dstrbutons Dscrete Random Varables Contnuous Random Varables and ther Dstrbutons Dscrete Jont Dstrbutons Contnuous Jont Dstrbutons Independent

More information

CS 231A Computer Vision Midterm

CS 231A Computer Vision Midterm CS 231A Computer Vson Mdterm Tuesday October 30, 2012 Set 1 Multple Choce (22 ponts) Each queston s worth 2 ponts. To dscourage random guessng, 1 pont wll be deducted for a wrong answer on multple choce

More information

Related-Mode Attacks on CTR Encryption Mode

Related-Mode Attacks on CTR Encryption Mode Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory

More information

CS 534: Computer Vision Model Fitting

CS 534: Computer Vision Model Fitting CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust

More information

Inverse-Polar Ray Projection for Recovering Projective Transformations

Inverse-Polar Ray Projection for Recovering Projective Transformations nverse-polar Ray Projecton for Recoverng Projectve Transformatons Yun Zhang The Center for Advanced Computer Studes Unversty of Lousana at Lafayette yxz646@lousana.edu Henry Chu The Center for Advanced

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

Intro. Iterators. 1. Access

Intro. Iterators. 1. Access Intro Ths mornng I d lke to talk a lttle bt about s and s. We wll start out wth smlartes and dfferences, then we wll see how to draw them n envronment dagrams, and we wll fnsh wth some examples. Happy

More information

Line-based Camera Movement Estimation by Using Parallel Lines in Omnidirectional Video

Line-based Camera Movement Estimation by Using Parallel Lines in Omnidirectional Video 01 IEEE Internatonal Conference on Robotcs and Automaton RverCentre, Sant Paul, Mnnesota, USA May 14-18, 01 Lne-based Camera Movement Estmaton by Usng Parallel Lnes n Omndrectonal Vdeo Ryosuke kawansh,

More information

Calibrating a single camera. Odilon Redon, Cyclops, 1914

Calibrating a single camera. Odilon Redon, Cyclops, 1914 Calbratng a sngle camera Odlon Redon, Cclops, 94 Our goal: Recover o 3D structure Recover o structure rom one mage s nherentl ambguous??? Sngle-vew ambgut Sngle-vew ambgut Rashad Alakbarov shadow sculptures

More information

USING GRAPHING SKILLS

USING GRAPHING SKILLS Name: BOLOGY: Date: _ Class: USNG GRAPHNG SKLLS NTRODUCTON: Recorded data can be plotted on a graph. A graph s a pctoral representaton of nformaton recorded n a data table. t s used to show a relatonshp

More information

The Shortest Path of Touring Lines given in the Plane

The Shortest Path of Touring Lines given in the Plane Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He

More information

CS 231A Computer Vision Midterm

CS 231A Computer Vision Midterm CS 231A Computer Vson Mdterm Tuesday October 30, 2012 Set 1 Multple Choce (20 ponts) Each queston s worth 2 ponts. To dscourage random guessng, 1 pont wll be deducted for a wrong answer on multple choce

More information

Detection of hand grasping an object from complex background based on machine learning co-occurrence of local image feature

Detection of hand grasping an object from complex background based on machine learning co-occurrence of local image feature Detecton of hand graspng an object from complex background based on machne learnng co-occurrence of local mage feature Shnya Moroka, Yasuhro Hramoto, Nobutaka Shmada, Tadash Matsuo, Yoshak Shra Rtsumekan

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

More information

Performance Evaluation of Information Retrieval Systems

Performance Evaluation of Information Retrieval Systems Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero

More information

PHYS 219 Spring semester Lecture 20: Reflection of Electromagnetic Radiation: Mirrors and Images Formed by Mirrors

PHYS 219 Spring semester Lecture 20: Reflection of Electromagnetic Radiation: Mirrors and Images Formed by Mirrors PHYS 219 Sprng semester 2014 Lecture 20: eflecton of Electromagnetc adaton: Mrrors and Images Formed by Mrrors on efenberger Brck Nanotechnology Center Purdue Unversty Lecture 20 1 evew: Snapshot of an

More information

Clustering on antimatroids and convex geometries

Clustering on antimatroids and convex geometries Clusterng on antmatrods and convex geometres YULIA KEMPNER 1, ILYA MUCNIK 2 1 Department of Computer cence olon Academc Insttute of Technology 52 Golomb tr., P.O. Box 305, olon 58102 IRAEL 2 Department

More information

F Geometric Mean Graphs

F Geometric Mean Graphs Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 2 (December 2015), pp. 937-952 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) F Geometrc Mean Graphs A.

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

More information

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

More information

Reading. 14. Subdivision curves. Recommended:

Reading. 14. Subdivision curves. Recommended: eadng ecommended: Stollntz, Deose, and Salesn. Wavelets for Computer Graphcs: heory and Applcatons, 996, secton 6.-6., A.5. 4. Subdvson curves Note: there s an error n Stollntz, et al., secton A.5. Equaton

More information

Optimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming

Optimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming Optzaton Methods: Integer Prograng Integer Lnear Prograng Module Lecture Notes Integer Lnear Prograng Introducton In all the prevous lectures n lnear prograng dscussed so far, the desgn varables consdered

More information

Edge Detection in Noisy Images Using the Support Vector Machines

Edge Detection in Noisy Images Using the Support Vector Machines Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona

More information

Module 6: FEM for Plates and Shells Lecture 6: Finite Element Analysis of Shell

Module 6: FEM for Plates and Shells Lecture 6: Finite Element Analysis of Shell Module 6: FEM for Plates and Shells Lecture 6: Fnte Element Analyss of Shell 3 6.6. Introducton A shell s a curved surface, whch by vrtue of ther shape can wthstand both membrane and bendng forces. A shell

More information

ALEKSANDROV URYSOHN COMPACTNESS CRITERION ON INTUITIONISTIC FUZZY S * STRUCTURE SPACE

ALEKSANDROV URYSOHN COMPACTNESS CRITERION ON INTUITIONISTIC FUZZY S * STRUCTURE SPACE mercan Journal of Mathematcs and cences Vol. 5, No., (January-December, 206) Copyrght Mnd Reader Publcatons IN No: 2250-302 www.journalshub.com LEKNDROV URYOHN COMPCTNE CRITERION ON INTUITIONITIC FUZZY

More information

Kinematics of pantograph masts

Kinematics of pantograph masts Abstract Spacecraft Mechansms Group, ISRO Satellte Centre, Arport Road, Bangalore 560 07, Emal:bpn@sac.ernet.n Flght Dynamcs Dvson, ISRO Satellte Centre, Arport Road, Bangalore 560 07 Emal:pandyan@sac.ernet.n

More information

Visual Curvature. 1. Introduction. y C. IEEE Conf. on Computer Vision and Pattern Recognition (CVPR), June 2007

Visual Curvature. 1. Introduction. y C. IEEE Conf. on Computer Vision and Pattern Recognition (CVPR), June 2007 IEEE onf. on omputer Vson and Pattern Recognton (VPR June 7 Vsual urvature HaRong Lu, Longn Jan Lateck, WenYu Lu, Xang Ba HuaZhong Unversty of Scence and Technology, P.R. hna Temple Unversty, US lhrbss@gmal.com,

More information

Inverse Kinematics (part 2) CSE169: Computer Animation Instructor: Steve Rotenberg UCSD, Spring 2016

Inverse Kinematics (part 2) CSE169: Computer Animation Instructor: Steve Rotenberg UCSD, Spring 2016 Inverse Knematcs (part 2) CSE169: Computer Anmaton Instructor: Steve Rotenberg UCSD, Sprng 2016 Forward Knematcs We wll use the vector: Φ... 1 2 M to represent the array of M jont DOF values We wll also

More information

Accelerating X-Ray data collection using Pyramid Beam ray casting geometries

Accelerating X-Ray data collection using Pyramid Beam ray casting geometries Acceleratng X-Ray data collecton usng Pyramd Beam ray castng geometres Amr Averbuch Guy Lfchtz Y. Shkolnsky 3 School of Computer Scence Department of Appled Mathematcs, School of Mathematcal Scences Tel

More information

Distribution Analysis

Distribution Analysis Chapter II Dstrbuton Analyss D... (Absolute and Relatve Frequences) Let X be a characterstc possessng the attrbutesa, =,,..., k. The absolute frequency of the attrbutea, =,,..., k s defned as follows:

More information

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

The Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole

The Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole Appled Mathematcs, 04, 5, 37-3 Publshed Onlne May 04 n ScRes. http://www.scrp.org/journal/am http://dx.do.org/0.436/am.04.584 The Research of Ellpse Parameter Fttng Algorthm of Ultrasonc Imagng Loggng

More information

Color in OpenGL Polygonal Shading Light Source in OpenGL Material Properties Normal Vectors Phong model

Color in OpenGL Polygonal Shading Light Source in OpenGL Material Properties Normal Vectors Phong model Color n OpenGL Polygonal Shadng Lght Source n OpenGL Materal Propertes Normal Vectors Phong model 2 We know how to rasterze - Gven a 3D trangle and a 3D vewpont, we know whch pxels represent the trangle

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

The Erdős Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces

The Erdős Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces Dscrete Mathematcs 307 (2007) 764 768 www.elsever.com/locate/dsc Note The Erdős Pósa property for vertex- and edge-dsjont odd cycles n graphs on orentable surfaces Ken-Ich Kawarabayash a, Atsuhro Nakamoto

More information

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for

More information

2D Raster Graphics. Integer grid Sequential (left-right, top-down) scan. Computer Graphics

2D Raster Graphics. Integer grid Sequential (left-right, top-down) scan. Computer Graphics 2D Graphcs 2D Raster Graphcs Integer grd Sequental (left-rght, top-down scan j Lne drawng A ver mportant operaton used frequentl, block dagrams, bar charts, engneerng drawng, archtecture plans, etc. curves

More information

Array transposition in CUDA shared memory

Array transposition in CUDA shared memory Array transposton n CUDA shared memory Mke Gles February 19, 2014 Abstract Ths short note s nspred by some code wrtten by Jeremy Appleyard for the transposton of data through shared memory. I had some

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

y and the total sum of

y and the total sum of Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton

More information

Robust Surface Reconstruction from Orthogonal Slices

Robust Surface Reconstruction from Orthogonal Slices Robust Surface Reconstructon from Orthogonal Slces Radek Svták 1, Václav Skala Department of Computer Scence and Engneerng, Unversty of West ohema n Plsen, Unverztní 8, 306 14 Plzeň, Czech Republc E-mal:

More information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

Intra-Parametric Analysis of a Fuzzy MOLP

Intra-Parametric Analysis of a Fuzzy MOLP Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral

More information

A Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme

A Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme Mathematcal and Computatonal Applcatons Artcle A Fve-Pont Subdvson Scheme wth Two Parameters and a Four-Pont Shape-Preservng Scheme Jeqng Tan,2, Bo Wang, * and Jun Sh School of Mathematcs, Hefe Unversty

More information

PROJECTIVE RECONSTRUCTION OF BUILDING SHAPE FROM SILHOUETTE IMAGES ACQUIRED FROM UNCALIBRATED CAMERAS

PROJECTIVE RECONSTRUCTION OF BUILDING SHAPE FROM SILHOUETTE IMAGES ACQUIRED FROM UNCALIBRATED CAMERAS PROJECTIVE RECONSTRUCTION OF BUILDING SHAPE FROM SILHOUETTE IMAGES ACQUIRED FROM UNCALIBRATED CAMERAS Po-Lun La and Alper Ylmaz Photogrammetrc Computer Vson Lab Oho State Unversty, Columbus, Oho, USA -la.138@osu.edu,

More information