A rich discrete labeling scheme for line drawings of curved objects
|
|
- Gervais Ward
- 5 years ago
- Views:
Transcription
1 A rih disrete labeling sheme for line drawings of urved objets Martin C. Cooer, IRIT, University of Toulouse III, Toulouse, Frane Abstrat We resent a disrete labeling sheme for line drawings of urved objets whih an be seen as an information-rih extension of the lassi line-labeling sheme in whih lines are lassified as onvex, onave, oluding or extremal. New labels are introdued to distinguish between urved and lanar surfae-athes, to identify orthogonal edges and to indiate gradient diretions of lanar surfae-athes. keywords: sene analysis, shae, line drawing analysis, line labeling, soft onstraints. 1 Regularities in man-made objets Most man-made objets have ertain harateristi shae features whih distinguish them from natural objets suh as roks, louds or trees. In this aer we onentrate on lanarity and orthogonality, although learly other regularities (suh as symmetry and isometry) an also rovide useful visual lues in the interretation of drawings of man-made objets. We say that an edge E, whether urved or lanar, is orthogonal if at eah oint on E the tangents to the two surfaes whih meet at E are orthogonal. Consider, as an illustration, the two drawings in Fig. 1. Of the 20 visible faes of these two objets, 13 are lanar. Of the 57 visible edges, 51 are orthogonal, the six non-orthogonal edges being marked by an 1
2 asterisk. Both of these drawings aear unambiguous to a human viewer. In artiular, we immediately identify surfae A in Fig. 1(a) as lanar and surfae B as urved, although most eole have great diffiulty in exlaining why they ame to this onlusion. This aer is onerned with setting down some basi loal geometrial rules whih will allow a omuter to automatially identify lanar surfaes and orthogonal edges. Possible aliations inlude sketh interretation [21], automati indexing of databases of line drawings [19] and 3D objet retrieval from the web [1]. We follow in the tradition of Kanade [9] who advoated the use of more information about the hysial world, thus avoiding overstrit onstraints based on unrealisti assumtions (suh as lanar surfaes meeting at trihedral verties [8, 2]) or the otimization of a fairly arbitrary objetive funtion. An imortant oint is that features that are ommon in manmade objets, suh as orthogonal edges or lanar faes, are essentially disrete roerties. For examle, 90 degree angles are ommon, but 85 degree angles are no more ommon than 65 degree angles. Thus an objetive funtion F, based on orthogonality (or other essentially disrete roerties), whih is a true refletion of the likelihood of a omlete 3D reonstrution should take on the same onstant value over most of the solution sae, sine the vast majority of solutions involve no orthogonality. Soft Constraint Satisfation [16] rovides a more aroriate method for otimizing F rather than searh methods in real-valued arameter sae [15, 12, 21]. In a revious aer we have shown how soft onstraint satisfation rovides a framework in whih we an ombine strit geometrial onstraints and referene onstraints [6]. An examle of a strit geometrial onstraint is that arallel 3D lines annot interset; an examle of a referene onstraint is that we refer a air of lines whih are arallel (within a given error tolerane) in the drawing to be rojetions of 3D arallel edges, sine arallel edges are ommon features of man-made objets. Our aroah is similar to that of Ding & Young [7] who used a Truth Maintenane System for the omlete 3D reonstrution of olyhedral objets from imerfet line drawings. We introdue new onstraints for the analysis of line drawings of urved objets, but we do not attemt hidden-art reonstrution. 2
3 * * P B E A * * (a) J * K * (b) Figure 1: Examles of drawings of urved man-made objets. 2 Line labels for urved objets Line-drawing labeling, in whih eah line is assigned a semanti label ( + for onvex, for onave or for oluding), was ioneered by Huffman [8] and Clowes [2]. At a onvex (onave) edge E, the external angle between the two visible surfaes whih interset at E is greater (less) than π; at an oluding edge, only one surfae is visible. They established the atalogue of legal labelings of juntions reated by the rojetion of trihedral verties. These onstraints, together with the Outer Boundary Constraint (whih simly says that the outer boundary of the drawing is neessarily an oluding line), were often found to be suffiient to uniquely determine the orret semanti labeling of the drawing of a olyhedral objet. Catalogues of labeled juntions have also been established for non-trihedral verties [20], but in this ase extra visual ues, suh as arallel lines, are required to avoid an exonential number of legal global labelings [6]. Malik [14] extended semanti labeling to line drawings of urved objets omosed of smooth surfae athes searated by surfae-normal disontinuity edges. His atalogue was refined and extended to inlude objets with tangential edges and surfaes [3, 4]. When surfaes are urved, the semanti label of a line may hange at any oint due to the resene of hantom juntions. For examle, transitions from oluding to onvex labels, suh as the oint P in Fig. 1(a), are ommon in line drawings of urved objets. Other transitions may our. For examle, as ointed out in [3], a onvex-onave transition an our if distint 3
4 + (a) (b) Figure 2: Illustration of (a) semanti line labels, and (b) lanarity labels. surfaes may be tangential to eah other. Under the Straight Edge Formation Assumtion, whih says that a straight edge is formed by the intersetion of two loally-lanar surfaes [5], the semanti label of a line L is invariant along any straight segment of L. In artiular, a straight line has a unique semanti label. Eah global semanti labeling an be individually heked for hysial realisability via Sugihara s linear rogramming aroah [18] generalized to urved objets with some linear features [5]. Unfortunately, although mathematially elegant, Sugihara s aroah does not hel us find the most likely interretation of a drawing. 3 Planarity onstraints Consider a 3D edge E formed by the intersetion of two surfaes S, T. We say that S is loally lanar along E if the tangent to S at eah oint of E is idential. Planar surfaes are neessarily loally lanar, but a urved surfae may also be loally lanar. As an examle, onsider surfae B in Fig. 1, whih is loally lanar along the edge E, sine it has an invariant tangent lane along the whole length of E. A surfae-normal disontinuity edge (a onvex, onave or oluding edge) is formed by the intersetion of two surfaes S, T. A line L whih is the rojetion of a surfae-normal disontinuity edge has a semanti label +,, or, as illustrated in Fig. 2(a). We also label eah side of L by a lanarity label or to indiate whether S, T are loally lanar or not ( for lanar and for urved ). At an oluding edge, one of the surfaes, say T, is invisible. The lanarity label of S is written on the side of the line into whih the surfae S rojets and the lanarity label of T on the other side. This is illustrated in Fig. 2(b): the rightmost label indiates that the hidden base of the ylindrial art of the objet is 4
5 L L urved = or L +/ / L straight = under the Straight Edge Formation Assumtion + + L or L = L 1 L 2 = x 1 x 2 x 1 = x 2 {,} orth(l 1 )=orth(l 2 ) = Figure 3: Planarity onstraints. loally lanar. An extremal edge is the lous of oints of intersetion of the line of sight with a urved visible objet surfae. The rojetion of an extremal edge, known as an extremal line, is labeled by a double-headed arrow as shown in Fig. 2(a). By onvention, both sides of an extremal line are always labeled, as shown in Fig. 2(b). Having introdued the new lanarity labels, we an now give the lanarity onstraints whih relate lanarity and semanti line labels. These are given in Fig. 3. We say that the drawing satisfies the General Viewoint Assumtion (GVA) if no small erturbation in the osition of the viewoint hanges the onfiguration of the drawing (juntion-tyes, resene of straight lines and arallel lines). Under the GVA, the rojetion of a 3D edge E is a straight line if and only if E is a straight edge. The first onstraint in Fig. 3 simly says that a urved line annot be the rojetion of the intersetion of two loally lanar surfaes. The seond onstraint is a translation of the Straight Edge Formation Assumtion. The last three lanarity onstraints in Fig. 3 (showing a hantom, a 3-tangent and a urvature-l juntion resetively) allow us to dedue that a surfae is urved. Consider a 5
6 3D oint P at whih a surfae-normal disontinuity edge E intersets an extremal edge E ext, and let S be the surfae in whih the extremal edge lies and T P the tangent-lane to S at the oint P. By the definition of an extremal edge, the viewoint lies in the lane T P. If S were loally lanar along E, then T P would be the tangent lane to this loally lanar segment of E, whih would ontradit the General Viewoint Assumtion. This reasoning allows us to dedue the labels shown in the last three lanarity onstraints in Fig. 3. There are three distint onstraints deending on whether the extremal edge E ext or art of the surfae-disontinuity edge E is oluded. The dot reresents a disontinuity of urvature between the rojetions of E and E ext. These lanarity onstraints are valid even in the ase of objets with tangential edges and surfaes [4]. Sine lanar surfaes are ommon in man-made objets, it is natural to try to maximize the number of lanar surfaes in our interretation of the drawing. However, simly maximizing the number N of labels is not always suffiient to determine the orret lanarity labeling: for examle, alying this riterion to the drawing in Fig. 1(a) does not allow us to distinguish between the two labelings and for the edge searating faes A and B. Considering the drawing as a lanar grah G, the faes of G are rojetions of visible (artial) surfae-athes of the 3D objet. A fae F of G an only be the rojetion of (art of) a lanar surfae if all its lanarity labels are. We say that F is loally lanar if all its lanarity labels are. Maximizing the riterion N + N lf, where N lf is the number of faes of G whih are loally lanar, allows us to refine the artial order defined by N and hene to find the orret lanarity labeling of the drawing in Fig. 1(a). 4 Constraints from orthogonal edges It is well known that identifying a labeled juntion as the rojetion of a ubi orner allows us to alulate the 3D orientation of the three faes that meet at the orresonding vertex [17, 10]. This setion shows that we an extend this to urved objets, by determining ertain information about the surfaes whih meet at viewoint-deendent verties, based only on the assumtion that the 3D edge E is orthogonal. Consider the first onstraint shown in Fig. 4, reading the imliation from left to right. 6
7 3-tangent + urvature-l or hantom + Figure 4: Gradient-diretion onstraints assuming that the surfae-normal disontinuity edges are orthogonal. The imliations are onsequenes of the GVA. It onerns a labeled 3-tangent juntion formed by the rojetion of a urved orthogonal edge E whih is the intersetion of a urved surfae S with a lanar surfae S. Let P reresent the 3D oint on E at whih the tangent-lane to S asses through the viewoint, and let T P reresent this tangent-lane. If n is the normal to the lanar surfae S, then by orthogonality of E, n is arallel to T P. It follows that the rojetion of n in the drawing is arallel to the extremal edge (whih is the rojetion of T P ). We symbolize the diretion of the rojetion of n by a short arrow next to the on the right hand side of Fig. 4. Similar onstraints exist, and are given in Fig. 4, for urvature-l juntions and hantom juntions. The arrowhead indiates the diretion of n. By onvention, the 3D orientation of n, the normal to the lanar surfae S, is always towards the viewoint. This onvention means that in the urvature-l onstraint of Fig. 4, the gradient diretion is the same whether E is a onave or an oluding edge. For the hantom juntion shown in Fig. 4, the gradient diretion an only be determined aurately if the osition of the hantom juntion is reisely known. However, this is an imortant onstraint when read from right to left, sine it allows us to loate hantom juntions at the oints where the gradient-diretion is tangential to the line. Under orthograhi rojetion, the gradient-diretion is invariant on a lanar surfae, and hene roagates through juntions and along loally-lanar surfaes. Under ersetive rojetion, the gradient diretions of a surfae meet at a vanishing oint; 7
8 (a) or = + or = / / (b) s αβ = π 2 < α < π 2 π 2 < β < π 2 s = + if π 2 < β < α < π 2 s {,, } if π 2 < α < β < π 2 Figure 5: The gradient-diretion/semanti-label onstraints: (a) assuming that the edge is orthogonal; (b) for any edge. at least two gradient diretions are required to loate the vanishing oint of the normals to a lanar surfae. For eah line segment L in the drawing we reate a boolean variable orth(l) whih takes on the value true if and only if L is the rojetion of an orthogonal edge segment. We then imose the hard onstraints orth(l) the gradient-diretion onstraints aly at eah 3-tangent, urvature-l and hantom juntion on L. together with the soft onstraint whih imoses a enalty of w o if orth(l) = false. Following the disussion in Setion 3, there is also a enalty of w h for eah hantom juntion, a enalty of w for eah lanarity label, a enalty of w lf for eah fae whih is not loally lanar, and a enalty w t for eah lanarity label transition ( to ) between the two ends of a line segment. The objetive funtion to be minimized is the sum of these enalties. Hard onstraints an be viewed as enalty funtions taking values in {0, } [16]. There are also gradient-diretion onstraints at rojetions of trihedral verties V at whih surfaes and edges meet non-tangentially. Let L 1, L 2, L 3 be the rojetions of the edges E 1, E 2, E 3 meeting at V and let F 12 be the fae bounded by E 1 and E 2. The normal n to F 12 is arallel to E 3 in 3D iff both E 1 and E 2 are orthogonal at V. Thus, invoking the 8
9 GVA whih says that arallel 2D lines are rojetions of arallel 3D lines, we an dedue that the gradient-diretion of F is arallel to L 3 iff both E 1 and E 2 are orthogonal at V. The gradient-diretion/semanti-label onstraints in Fig. 5(a) show the tight relationshi between the gradient diretion and the semanti label of a line L, whenever L is the rojetion of an orthogonal edge. The arrows reresent any gradient diretion whih oints away from L in the first onstraint and towards L in the seond onstraint. The line L is shown urved, but ould be straight or urved in the oosite diretion. At a oint P on an orthogonal edge E at whih surfaes S 1, S 2 interset, the normal n 1 (n 2 ) to surfae S 1 (S 2 ) is arallel to the tangent-lane to the surfae S 2 (S 1 ) at P. If E rojets into a onvex (onave) line L, it follows that the rojetions of n 1,n 2 oint away from (towards) L. Sine, by onvention, oluding lines have the same gradient-diretion labels as onave lines, this roves the orretness of the gradient-diretion/semanti-label onstraints given in Fig. 5(a). One onsequene of these onstraints is that a losed urve L whih is the rojetion of a loally-lanar orthogonal edge annot have the same semanti label around the whole of L. If L is not a losed urve but instead terminates at a 3-tangent or urvature-l juntion, then the gradient-diretion onstraints allow us to determine the gradient-diretion. This, in turn, rovides us with the semanti label at eah oint of L via the gradient-diretion/semantilabel onstraints. In Fig. 5(b), the surfaes S 1,S 2 are both loally-lanar and hene L is neessarily straight. The right-hand end of L is further away from the viewer than the left-hand end if and only if π < α < π and if and only if π < β < π. Furthermore, for π < α < π, the dihedral angle between the surfaes S 1 and S 2 is greater than π if α > β, equal to π if α = β and less than π if α < β. The onstraints of Fig. 5(b) follow immediately. 5 Exerimental trials To test our labeling sheme, we built u a test set of 28 drawings, all rodued by orthograhi rojetion: the four drawings in Fig. 1 and Fig. 6, the 15 drawings of urved objets from [3], the four drawings of urved objets from the test-set of [13] and the five drawings given in Fig. 2 of [1]. Any lines whih were not rojetions of visible edges were eliminated 9
10 (b) (a) Figure 6: Drawings of urved objets with orthogonal edges. in order to rodue erfet rojetions of oaque objets. In the orret interretations, 76.7% of the 395 edges are orthogonal, 72.9% of the 229 faes are lanar and 67.6% of the 1044 lanarity labels are. The GVA was satisfied in eah of the drawings. We alied the Outer Boundary Constraint together with the aroriate semanti labeling sheme [3, 6]. For simliity and reroduibility, we set all of w o, w h, w, w lf and w t to 1. We also alied the following simle geometrial onstraints: (1) two surfaes whih are tangential annot be orthogonal; (2) a viewoint-deendent juntion (3-tangent, urvature-l or hantom) annot be onave [3] if it is the rojetion of the intersetion of a lanar surfae with a urved surfae at an orthogonal edge. For eah drawing, we found, by exhaustive searh, the set of all otimal labelings. A line segment was onsidered to be orretly/ambiguously/inorretly labeled if it was assigned the orret label in all/some/none of the otimal labelings. Out of 395 orthogonality labels, 94.4% were orret, 2.3% ambiguous and 3.3% inorret. Out of 1044 lanarity labels, 95.2% were orret, 3.4% ambiguous and 1.4% inorret. Out of 229 visible faes, 96.1% were orretly lassified as loally lanar/urved, 3.5% were ambiguous and 0.4% were inorret (ambiguity tyially ourring when two regions are searated by a urved line but there is insuffiient evidene to determine whih of the two faes is lanar). If we set w = w lf = 0 (i.e. we do not try to maximize lanarity), the lanarity onstraints alone (Fig. 3) orretly identify only 77.6% of the lanarity labels and orretly lassify only 63.1% of faes as loally-lanar/urved. 10
11 X Y Figure 7: The drawing of Fig. 6(a) with lanarity labels and gradient diretions. To illustrate the strength of our onstraints, onsider the drawing in Fig. 6(a). Using the semanti labeling sheme [14], the lanarity onstraints and the gradient diretion onstraints, we obtain the labeling given in Fig. 7 (with semanti labels not shown to avoid luttering u the figure). This interretation simultaneously maximizes the number of orthogonal edges, the number of labels and the number of loally-lanar surfae athes. All surfaes are orretly labeled as lanar or urved and the diretions of the rojetions of the normals to the lanar surfaes have been orretly determined. This rovides a muh riher interretation than the semanti labeling alone. The hantom-juntion gradient-diretion onstraint (Fig. 4) allows us to reisely loate the two hantom juntions X, Y shown in Fig. 7 at whih there is a transition from an oluding label to a onvex label. To illustrate the limitations of our labeling sheme, onsider the drawing in Fig. 6(b). Using the semanti labeling sheme, the lanarity onstraints and the gradient diretion onstraints, we obtain the labeling illustrated in Fig. 8. To avoid luttering u the figure, labels, as well as semanti labels, are omitted. The line L 1, whih extends from juntion 11
12 J L 2 L 1 F K Figure 8: The drawing of Fig. 6(b) with lanarity labels and gradient diretions. J to juntion K, rovides an examle of lanarity-label transitions. Starting at juntion J, the atual lanarity label air hanges from to to. These hanges are not deteted by our onstraints, whih stritly seaking only inform us about lanarity labels in the viinity of juntions or along the length of straight line segments, with the result that fae F is inorretly lassified as loally lanar. The losed urve L 2 in Fig. 8, whih we see as a long hole running down the handle of the objet, rovides a hallenge for our onstraints, whih rodue an inorret semanti labeling of L 2. It would aear to be the skew symmetry of L 2, whose axis oinides with the axis of symmetry of the whole objet, whih allows us to identify L 2 as a hole in a lanar surfae rather than a searate objet lying on to of a larger objet. Our omlete branh-and-bound searh has worst-ase exonential time omlexity, but this is inevitable given that finding a single semanti labeling is NP-omlete [11]. 6 Conlusion We have seen that a rih labeling sheme together with simle loal geometrial onstraints allow us to obtain a onsiderable amount of information about the 3D objet deited in a 12
13 drawing. This information goes muh further than traditional semanti line labels (oluding, onvex, onave, extremal), but does not in itself rovide a omlete 3D reonstrution. For this, we an look for various other ommon features of man-made objets, suh as ubi orners, symmetry, arallel urves and isometry. Referenes [1] Cao, L., Liu, J. & Tang, X., 3D Objet retrieval using 2D line drawing and grah based relevane feedbak, MM 06, Santa Barbara, CA, USA (2006) [2] Clowes, M.B., On seeing things, Artifiial Intelligene 2 (1) (1971) [3] Cooer, M.C., Interretation of line drawings of omlex objets, Image and Vision Comuting 11 (2) (1993) [4] Cooer, M.C., Interreting line drawings of urved objets with tangential edges and surfaes, Image and Vision Comuting 15 (1997) [5] Cooer, M.C., Linear onstraints for the interretation of line drawings of urved objets, Artifiial Intelligene 119 (2000) [6] Cooer, M.C., Constraints between distant lines in the labelling of line drawings of olyhedral senes, Int. J. of Comuter Vision 73(2) (2007) [7] Ding, Y. & Young, T.Y., Comlete shae from imerfet ontour: a rule-based aroah, Comuter Vision and Image Understanding 70(2) (1998) [8] Huffman, D.A., Imossible objets as nonsense sentenes, in Mahine Intelligene 6, Meltzer, B. & Mihie, D. (eds.) Edinburgh University Press (1971) [9] Kanade, T., Reovery of the three-dimensional shae of an objet from a single view, Artifiial Intelligene 17 (1981) [10] Kanatani, K., The onstraints on images of retangular olyhedra, IEEE Trans. on Pattern Analysis and Mahine Intelligene PAMI-8 (4) (1986)
14 [11] Kirousis, L.M. & Paadimitriou, C.H., The omlexity of reognizing olyhedral senes, J. Comut. System Si. 37 (1) (1988) [12] Lison, H. & Shitalni, M., Otimisation-based reonstrution of a 3d objet from a single freehand line drawing, Comuter-Aided Design 28 (8) (1996) [13] Liu, J., Lee, Y.T., Cham, W.-K., Identifying faes in a 2D line drawing reresenting a manifold objet, IEEE Trans. PAMI 24 (12) (2002) [14] Malik, J., Interreting line drawings of urved objets, International Journal of Comuter Vision 1 (1987) [15] Marill, T., Emulating the human interretation of line drawings as three-dimensional objets, International Journal of Comuter Vision Vision 6 (2) (1991) [16] Meseguer, P., Rossi, F. & Shiex, T., Soft Constraints, in Handbook of Constraint Programming, eds. Rossi, F., van Beek, P. & Walsh, T., Elsevier (2006) [17] Perkins, D.N., Visual disrimination between retangular and nonretangular aralleleieds, Peretion and Psyhohysis 12 (5) (1972) [18] Sugihara, K. Mahine Interretation of Line Drawings, MIT Press: Cambridge, MA (1986). (Freely available on Kokihi Sugihara s website). [19] Syeda-Mahmood, T., Indexing of tehnial line drawing databases, IEEE Trans. on Pattern Analysis and Mahine Intelligene 2l(8) (1999) [20] Varley, P.A.C. & Martin, R.R., The juntion atalogue for labelling line drawings of olyhedra with tetrahedral verties, Int. J. of Shae Modelling 7 (1) (2001) [21] Varley, P.A.C., Martin, R.R. & Suzuki, H., Frontal geometry from skethes of engineering objets: is line labelling neessary, Comuter-Aided Design 37 (2005)
p[4] p[3] p[2] p[1] p[0]
CMSC 425 : Sring 208 Dave Mount and Roger Eastman Homework Due: Wed, Marh 28, :00m. Submit through ELMS as a df file. It an either be distilled from a tyeset doument or handwritten, sanned, and enhaned
More informationApproximate Labeling via the Primal-Dual Schema
Aroximate Labeling via the Primal-Dual Shema Nikos Komodakis and Georgios Tziritas Tehnial Reort CSD-TR-2005-01 February 1, 2005 Aroximate Labeling via the Primal-Dual Shema Nikos Komodakis and Georgios
More informationDetection and Recognition of Non-Occluded Objects using Signature Map
6th WSEAS International Conferene on CIRCUITS, SYSTEMS, ELECTRONICS,CONTROL & SIGNAL PROCESSING, Cairo, Egypt, De 9-31, 007 65 Detetion and Reognition of Non-Oluded Objets using Signature Map Sangbum Park,
More informationThe official electronic file of this thesis or dissertation is maintained by the University Libraries on behalf of The Graduate School at Stony Brook
Stony Brook University The offiial eletroni file of this thesis or dissertation is maintained by the University Libraries on behalf of The Graduate Shool at Stony Brook University. Alll Rigghht tss Reesseerrvveedd
More informationExponential Particle Swarm Optimization Approach for Improving Data Clustering
International Journal of Eletrial and Eletronis Engineering 3:4 9 Exonential Partile Swarm Otimization Aroah for Imroving Data Clustering eveen I. Ghali, ahed El-Dessoui, Mervat A.., and Lamiaa Barawi
More informationReconfigurable Shape-Adaptive Template Matching Architectures
Reonfigurable Shae-Adative Temlate Mathing Arhitetures Jörn Gause 1, Peter Y.K. Cheung 1, Wayne Luk 2 1 Deartment of Eletrial and Eletroni Engineering, Imerial College, London SW7 2BT, England. 2 Deartment
More informationProjector Calibration for 3D Scanning Using Virtual Target Images
INTERNATIONAL JOURNAL OF RECISION ENGINEERING AND MANUFACTURING Vol. 13, No. 1,. 125-131 JANUARY 2012 / 125 DOI: 10.1007/s12541-012-0017-3 rojetor Calibration for 3D Sanning Using Virtual Target Images
More informationEvent Detection Using Local Binary Pattern Based Dynamic Textures
Event Detetion Using Loal Binary Pattern Based Dynami Textures Abstrat Deteting susiious events from video surveillane ameras has been an imortant task reently. Many trajetory based desritors were develoed,
More informationGENERATING A PERSPECTIVE IMAGE FROM A PANORAMIC IMAGE BY THE SWUNG-TO-CYLINDER PROJECTION
GENERATING A PERSPECTIVE IMAGE FROM A PANORAMIC IMAGE BY THE SWUNG-TO-CYLINDER PROJECTION Che-Han Chang Wei-Sheng Lai Yung-Yu Chuang HTC UC Mered National Taiwan University ABSTRACT This aer rooses a swung-to-ylinder
More informationIntroduction to Seismology Spring 2008
MIT OpenCourseWare http://ow.mit.edu 1.510 Introdution to Seismology Spring 008 For information about iting these materials or our Terms of Use, visit: http://ow.mit.edu/terms. 1.510 Leture Notes 3.3.007
More informationCleanUp: Improving Quadrilateral Finite Element Meshes
CleanUp: Improving Quadrilateral Finite Element Meshes Paul Kinney MD-10 ECC P.O. Box 203 Ford Motor Company Dearborn, MI. 8121 (313) 28-1228 pkinney@ford.om Abstrat: Unless an all quadrilateral (quad)
More informationMulti-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality
INTERNATIONAL CONFERENCE ON MANUFACTURING AUTOMATION (ICMA200) Multi-Piee Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality Stephen Stoyan, Yong Chen* Epstein Department of
More information特集 Road Border Recognition Using FIR Images and LIDAR Signal Processing
デンソーテクニカルレビュー Vol. 15 2010 特集 Road Border Reognition Using FIR Images and LIDAR Signal Proessing 高木聖和 バーゼル ファルディ Kiyokazu TAKAGI Basel Fardi ヘンドリック ヴァイゲル Hendrik Weigel ゲルド ヴァニーリック Gerd Wanielik This paper
More informationImplicit Representation of Molecular Surfaces
Imliit Reresentation of Moleular Surfaes Julius Parulek Ivan Viola Deartment of Informatis, University of Bergen Deartment of Informatis, University of Bergen. (a) (b) () (d) (e) (f) (g) (h) Figure : Ray-asting
More informationLecture 3: Geometric Algorithms(Convex sets, Divide & Conquer Algo.)
Advanced Algorithms Fall 2015 Lecture 3: Geometric Algorithms(Convex sets, Divide & Conuer Algo.) Faculty: K.R. Chowdhary : Professor of CS Disclaimer: These notes have not been subjected to the usual
More informationTriangles. Learning Objectives. Pre-Activity
Setion 3.2 Pre-tivity Preparation Triangles Geena needs to make sure that the dek she is building is perfetly square to the brae holding the dek in plae. How an she use geometry to ensure that the boards
More information4. Principles of Picture taking 4 hours
Leture 4 - - 0/3/003 Conet Hell/Pfeiffer February 003 4. Priniles of Piture taking 4 hours Aim: riniles of iture taking (normal ase, onvergent for oint measurements, flight lanning) flight lanning (arameter,
More informationDrawing lines. Naïve line drawing algorithm. drawpixel(x, round(y)); double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx; double y = y0;
Naïve line drawing algorithm // Connet to grid points(x0,y0) and // (x1,y1) by a line. void drawline(int x0, int y0, int x1, int y1) { int x; double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx;
More informationWe P9 16 Eigenray Tracing in 3D Heterogeneous Media
We P9 Eigenray Traing in 3D Heterogeneous Media Z. Koren* (Emerson), I. Ravve (Emerson) Summary Conventional two-point ray traing in a general 3D heterogeneous medium is normally performed by a shooting
More informationBoundary Correct Real-Time Soft Shadows
Boundary Corret Real-Time Soft Shadows Bjarke Jakobsen Niels J. Christensen Bent D. Larsen Kim S. Petersen Informatis and Mathematial Modelling Tehnial University of Denmark {bj, nj, bdl}@imm.dtu.dk, kim@deadline.dk
More informationComparing Images Under Variable Illumination
( This paper appeared in CVPR 8. IEEE ) Comparing Images Under Variable Illumination David W. Jaobs Peter N. Belhumeur Ronen Basri NEC Researh Institute Center for Computational Vision and Control The
More informationBias Error Reduction of Digital Image Correlation Based on Kernel
Vol.81 (CST 15),.16- htt://dx.doi.org/1.1457/astl.15.81.4 Bias Error Redution of Digital Image Correlation Based on Kernel Huan Shen 1,, eize Zhang 1, and Xiang Shen 1 Energy and ower College, anjing Uniersity
More informationRobust Multithreaded Object Tracker through Occlusions for Spatial Augmented Reality
ETRI Journal, Volume 40, Number 2, Aril, 2018 246 Robust Multithreaded Objet Traker through Olusions for Satial Augmented Reality Ahyun Lee and Insung Jang A satial augmented reality (SAR) system enables
More informationarxiv: v1 [cs.db] 13 Sep 2017
An effiient lustering algorithm from the measure of loal Gaussian distribution Yuan-Yen Tai (Dated: May 27, 2018) In this paper, I will introdue a fast and novel lustering algorithm based on Gaussian distribution
More information1. The collection of the vowels in the word probability. 2. The collection of real numbers that satisfy the equation x 9 = 0.
C HPTER 1 SETS I. DEFINITION OF SET We begin our study of probability with the disussion of the basi onept of set. We assume that there is a ommon understanding of what is meant by the notion of a olletion
More informationVertex Unfoldings of Orthogonal Polyhedra: Positive, Negative, and Inconclusive Results
CCCG 2018, Winnipeg, Canada, August 8 10, 2018 Vertex Unfoldings of Orthogonal Polyhedra: Positive, Negative, and Inonlusive Results Luis A. Garia Andres Gutierrrez Isaa Ruiz Andrew Winslow Abstrat We
More informationGray Codes for Reflectable Languages
Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings
More informationStable Road Lane Model Based on Clothoids
Stable Road Lane Model Based on Clothoids C Gakstatter*, S Thomas**, Dr P Heinemann*, Prof Gudrun Klinker*** *Audi Eletronis Venture GmbH, **Leibniz Universität Hannover, ***Tehnishe Universität Münhen
More informationCMSC 425: Lecture 16 Motion Planning: Basic Concepts
: Lecture 16 Motion lanning: Basic Concets eading: Today s material comes from various sources, including AI Game rogramming Wisdom 2 by S. abin and lanning Algorithms by S. M. LaValle (Chats. 4 and 5).
More informationPlot-to-track correlation in A-SMGCS using the target images from a Surface Movement Radar
Plot-to-trak orrelation in A-SMGCS using the target images from a Surfae Movement Radar G. Golino Radar & ehnology Division AMS, Italy ggolino@amsjv.it Abstrat he main topi of this paper is the formulation
More informationData we are discussing in the class. Scalar/vector/tensor. Heterogeneous. Scientific data. 3D+time (n<4) Information data
Data we are disussing in the lass Soure: VIS, Universit of Stuttgart Sientifi data 3D+time (n3 Heterogeneous Salar Data Analsis Salar Fields The approimation
More information521493S Computer Graphics Exercise 3 (Chapters 6-8)
521493S Comuter Grahics Exercise 3 (Chaters 6-8) 1 Most grahics systems and APIs use the simle lighting and reflection models that we introduced for olygon rendering Describe the ways in which each of
More informationGEOMETRIC CONSTRAINT SOLVING IN < 2 AND < 3. Department of Computer Sciences, Purdue University. and PAMELA J. VERMEER
GEOMETRIC CONSTRAINT SOLVING IN < AND < 3 CHRISTOPH M. HOFFMANN Deartment of Comuter Sciences, Purdue University West Lafayette, Indiana 47907-1398, USA and PAMELA J. VERMEER Deartment of Comuter Sciences,
More informationControl CPR: A Branch Height Reduction Optimization for EPIC Architectures
Control CPR: A Branh Height Redution Otimization for EPIC Arhitetures Mihael Shlansker, Sott Mahlke, Rihard Johnson HP Laboratories Palo Alto HPL-1999-34 February, 1999 E-mail: [shlansk,mahlke]@hl.h.om
More informationColouring contact graphs of squares and rectilinear polygons de Berg, M.T.; Markovic, A.; Woeginger, G.
Colouring ontat graphs of squares and retilinear polygons de Berg, M.T.; Markovi, A.; Woeginger, G. Published in: nd European Workshop on Computational Geometry (EuroCG 06), 0 Marh - April, Lugano, Switzerland
More informationSkip Strips: Maintaining Triangle Strips for View-dependent Rendering
Ski Stris: Maintaining Triangle Stris for View-deendent Rendering Jihad El-Sana ; Elvir Azanli Amitabh Varshney Deartment of Mathematis and Comuter Siene Deartment of Comuter Siene Ben-Gurion University
More informationSocial Network Analysis Based on BSP Clustering Algorithm
Communiations of the IIMA Volume 7 Issue 4 Artile 5 7 Soial Network Analysis Based on BSP Clustering Algorithm ong Shool of Business Administration China University of Petroleum Follow this and additional
More informationContour Box: Rejecting Object Proposals Without Explicit Closed Contours
Contour Box: Rejeting Objet Proposals Without Expliit Closed Contours Cewu Lu, Shu Liu Jiaya Jia Chi-Keung Tang The Hong Kong University of Siene and Tehnology Stanford University The Chinese University
More informationNONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION. Ken Sauer and Charles A. Bouman
NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION Ken Sauer and Charles A. Bouman Department of Eletrial Engineering, University of Notre Dame Notre Dame, IN 46556, (219) 631-6999 Shool of
More informationConstrained Empty-Rectangle Delaunay Graphs
CCCG 2015, Kingston, Ontario, August 10 12, 2015 Constrained Emty-Rectangle Delaunay Grahs Prosenjit Bose Jean-Lou De Carufel André van Renssen Abstract Given an arbitrary convex shae C, a set P of oints
More informationRelevance for Computer Vision
The Geometry of ROC Spae: Understanding Mahine Learning Metris through ROC Isometris, by Peter A. Flah International Conferene on Mahine Learning (ICML-23) http://www.s.bris.a.uk/publiations/papers/74.pdf
More informationRotation Invariant Spherical Harmonic Representation of 3D Shape Descriptors
Eurographis Symposium on Geometry Proessing (003) L. Kobbelt, P. Shröder, H. Hoppe (Editors) Rotation Invariant Spherial Harmoni Representation of 3D Shape Desriptors Mihael Kazhdan, Thomas Funkhouser,
More informationA Unified Subdivision Scheme for Polygonal Modeling
EUROGRAPHICS 2 / A. Chalmers and T.-M. Rhyne (Guest Editors) Volume 2 (2), Number 3 A Unified Subdivision Sheme for Polygonal Modeling Jérôme Maillot Jos Stam Alias Wavefront Alias Wavefront 2 King St.
More informationOutline: Software Design
Outline: Software Design. Goals History of software design ideas Design priniples Design methods Life belt or leg iron? (Budgen) Copyright Nany Leveson, Sept. 1999 A Little History... At first, struggling
More informationDirected Rectangle-Visibility Graphs have. Abstract. Visibility representations of graphs map vertices to sets in Euclidean space and
Direted Retangle-Visibility Graphs have Unbounded Dimension Kathleen Romanik DIMACS Center for Disrete Mathematis and Theoretial Computer Siene Rutgers, The State University of New Jersey P.O. Box 1179,
More informationarxiv: v2 [cs.cv] 25 Nov 2015
Pose-Guided Human Parsing with Dee-Learned Features Fangting Xia, Jun Zhu, Peng Wang, Alan Yuille University of California, Los Angeles arxiv:158.3881v2 [s.cv] 25 Nov 215 Abstrat Parsing human body into
More informationOn the Relationship Between Dual Photography and Classical Ghost Imaging
1 On the Relationshi Between Dual Photograhy and Classial Ghost Imaging Pradee Sen University of California, Santa Barbara arxiv:1309.3007v1 [hysis.otis] 12 Se 2013 Abstrat Classial ghost imaging has reeived
More informationWide-baseline Multiple-view Correspondences
Wide-baseline Multiple-view Correspondenes Vittorio Ferrari, Tinne Tuytelaars, Lu Van Gool, Computer Vision Group (BIWI), ETH Zuerih, Switzerland ESAT-PSI, University of Leuven, Belgium {ferrari,vangool}@vision.ee.ethz.h,
More informationStereo Disparity Estimation in Moment Space
Stereo Disarity Estimation in oment Sace Angeline Pang Faculty of Information Technology, ultimedia University, 63 Cyberjaya, alaysia. angeline.ang@mmu.edu.my R. ukundan Deartment of Comuter Science, University
More informationVideo Data and Sonar Data: Real World Data Fusion Example
14th International Conferene on Information Fusion Chiago, Illinois, USA, July 5-8, 2011 Video Data and Sonar Data: Real World Data Fusion Example David W. Krout Applied Physis Lab dkrout@apl.washington.edu
More informationReal-time Modeling of 3D Soccer Ball Trajectories from Multiple Fixed Cameras
Real-time Modeling o 3D Soer Ball rajetories rom Multile Fixed Cameras Jinhang Ren, James rwell, Graeme A Jones and Ming u Astrat n this aer, model-ased aroahes or real-time 3D soer all traing are roosed,
More informationAbstract A method for the extrusion of arbitrary polygon meshes is introduced. This method can be applied to model a large class of complex 3-D
Abstrat A method for the extrusion of arbitrary polygon meshes is introdued. This method an be applied to model a large lass of omplex 3-D losed surfaes. It onsists of defining a (typially small) set of
More informationChromaticity-matched Superimposition of Foreground Objects in Different Environments
FCV216, the 22nd Korea-Japan Joint Workshop on Frontiers of Computer Vision Chromatiity-mathed Superimposition of Foreground Objets in Different Environments Yohei Ogura Graduate Shool of Siene and Tehnology
More informationGradient based progressive probabilistic Hough transform
Gradient based progressive probabilisti Hough transform C.Galambos, J.Kittler and J.Matas Abstrat: The authors look at the benefits of exploiting gradient information to enhane the progressive probabilisti
More informationPerception of Shape from Shading
1 Percetion of Shae from Shading Continuous image brightness variation due to shae variations is called shading Our ercetion of shae deends on shading Circular region on left is erceived as a flat disk
More informationWe will then introduce the DT, discuss some of its fundamental properties and show how to compute a DT directly from a given set of points.
Voronoi Diagram and Delaunay Triangulation 1 Introduction The Voronoi Diagram (VD, for short) is a ubiquitious structure that aears in a variety of discilines - biology, geograhy, ecology, crystallograhy,
More informationOne Against One or One Against All : Which One is Better for Handwriting Recognition with SVMs?
One Against One or One Against All : Whih One is Better for Handwriting Reognition with SVMs? Jonathan Milgram, Mohamed Cheriet, Robert Sabourin To ite this version: Jonathan Milgram, Mohamed Cheriet,
More informationSEGMENTATION OF IMAGERY USING NETWORK SNAKES
SEGMENTATION OF IMAGERY USING NETWORK SNAKES Matthias Butenuth Institute of Photogrammetry and GeoInformation, Leibniz Universität Hannover Nienburger Str. 1, 30167 Hannover, Germany butenuth@ipi.uni-hannover.de
More informationIncremental Mining of Partial Periodic Patterns in Time-series Databases
CERIAS Teh Report 2000-03 Inremental Mining of Partial Periodi Patterns in Time-series Dataases Mohamed G. Elfeky Center for Eduation and Researh in Information Assurane and Seurity Purdue University,
More informationAdaptive Implicit Surface Polygonization using Marching Triangles
Volume 20 (2001), Number 2 pp. 67 80 Adaptive Impliit Surfae Polygonization using Marhing Triangles Samir Akkouhe Eri Galin L.I.G.I.M L.I.G.I.M Eole Centrale de Lyon Université Claude Bernard Lyon 1 B.P.
More informationPlumber: a method for a multi-scale decomposition of 3D shapes into tubular primitives and bodies
ACM Symposium on Solid Modeling and Appliations (2004) P. Brunet, N. Patrikalakis (Editors) Plumber: a method for a multi-sale deomposition of 3D shapes into tubular primitives and bodies M. Mortara G.
More informationCS 229 Final Project: Single Image Depth Estimation From Predicted Semantic Labels
CS 229 Final Project: Single Image Deth Estimation From Predicted Semantic Labels Beyang Liu beyangl@cs.stanford.edu Stehen Gould sgould@stanford.edu Prof. Dahne Koller koller@cs.stanford.edu December
More informationConstrained Path Optimisation for Underground Mine Layout
Constrained Path Otimisation for Underground Mine Layout M. Brazil P.A. Grossman D.H. Lee J.H. Rubinstein D.A. Thomas N.C. Wormald Abstract The major infrastructure comonent reuired to develo an underground
More informationUnsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks
Unsupervised Stereosopi Video Objet Segmentation Based on Ative Contours and Retrainable Neural Networks KLIMIS NTALIANIS, ANASTASIOS DOULAMIS, and NIKOLAOS DOULAMIS National Tehnial University of Athens
More informationExtracting Partition Statistics from Semistructured Data
Extrating Partition Statistis from Semistrutured Data John N. Wilson Rihard Gourlay Robert Japp Mathias Neumüller Department of Computer and Information Sienes University of Strathlyde, Glasgow, UK {jnw,rsg,rpj,mathias}@is.strath.a.uk
More informationTheoretical Analysis of Graphcut Textures
Theoretical Analysis o Grahcut Textures Xuejie Qin Yee-Hong Yang {xu yang}@cs.ualberta.ca Deartment o omuting Science University o Alberta Abstract Since the aer was ublished in SIGGRAPH 2003 the grahcut
More informationAn Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index
IJCSES International Journal of Computer Sienes and Engineering Systems, ol., No.4, Otober 2007 CSES International 2007 ISSN 0973-4406 253 An Optimized Approah on Applying Geneti Algorithm to Adaptive
More informationBayesian Belief Networks for Data Mining. Harald Steck and Volker Tresp. Siemens AG, Corporate Technology. Information and Communications
Bayesian Belief Networks for Data Mining Harald Stek and Volker Tresp Siemens AG, Corporate Tehnology Information and Communiations 81730 Munih, Germany fharald.stek, Volker.Trespg@mhp.siemens.de Abstrat
More informationWireframe Projections: Physical Realisability of Curved Objects and Unambiguous Reconstruction of Simple Polyhedra
International Journal of Computer Vision 64(1), 69 88, 2005 c 2005 Springer Science + Business Media, Inc. Manufactured in The Netherlands. Wireframe Projections: Physical Realisability of Curved Objects
More informationDiscrete sequential models and CRFs. 1 Case Study: Supervised Part-of-Speech Tagging
0-708: Probabilisti Graphial Models 0-708, Spring 204 Disrete sequential models and CRFs Leturer: Eri P. Xing Sribes: Pankesh Bamotra, Xuanhong Li Case Study: Supervised Part-of-Speeh Tagging The supervised
More informationDubins Path Planning of Multiple UAVs for Tracking Contaminant Cloud
Proeedings of the 17th World Congress The International Federation of Automati Control Dubins Path Planning of Multiple UAVs for Traking Contaminant Cloud S. Subhan, B.A. White, A. Tsourdos M. Shanmugavel,
More informationLearning Motion Patterns in Crowded Scenes Using Motion Flow Field
Learning Motion Patterns in Crowded Scenes Using Motion Flow Field Min Hu, Saad Ali and Mubarak Shah Comuter Vision Lab, University of Central Florida {mhu,sali,shah}@eecs.ucf.edu Abstract Learning tyical
More informationTOWARD HYBRID VARIANT/GENERATIVE PROCESS PLANNING
Proeedings of DETC 97: 1997 ASME Design Engineering Tehnial Conferenes September 14-17,1997, Saramento, California DETC97/DFM-4333 TOWARD HYBRID VARIANT/GENERATIVE PROCESS PLANNING Alexei Elinson Dept.
More informationAn Alternative Approach to the Fuzzifier in Fuzzy Clustering to Obtain Better Clustering Results
An Alternative Approah to the Fuzziier in Fuzzy Clustering to Obtain Better Clustering Results Frank Klawonn Department o Computer Siene University o Applied Sienes BS/WF Salzdahlumer Str. 46/48 D-38302
More informationChapter 8: Adaptive Networks
Chater : Adative Networks Introduction (.1) Architecture (.2) Backroagation for Feedforward Networks (.3) Jyh-Shing Roger Jang et al., Neuro-Fuzzy and Soft Comuting: A Comutational Aroach to Learning and
More informationthe data. Structured Principal Component Analysis (SPCA)
Strutured Prinipal Component Analysis Kristin M. Branson and Sameer Agarwal Department of Computer Siene and Engineering University of California, San Diego La Jolla, CA 9193-114 Abstrat Many tasks involving
More informationwith respect to the normal in each medium, respectively. The question is: How are θ
Prof. Raghuveer Parthasarathy University of Oregon Physis 35 Winter 8 3 R EFRACTION When light travels from one medium to another, it may hange diretion. This phenomenon familiar whenever we see the bent
More informationEvolutionary Feature Synthesis for Image Databases
Evolutionary Feature Synthesis for Image Databases Anlei Dong, Bir Bhanu, Yingqiang Lin Center for Researh in Intelligent Systems University of California, Riverside, California 92521, USA {adong, bhanu,
More informationC 2 C 3 C 1 M S. f e. e f (3,0) (0,1) (2,0) (-1,1) (1,0) (-1,0) (1,-1) (0,-1) (-2,0) (-3,0) (0,-2)
SPECIAL ISSUE OF IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION: MULTI-ROBOT SSTEMS, 00 Distributed reonfiguration of hexagonal metamorphi robots Jennifer E. Walter, Jennifer L. Welh, and Nany M. Amato Abstrat
More informationNeural Net Robotics Visual Servo : Learning The Epipolar Geometry
Neural Net Robotis Visual Servo : Learning The Eiolar Geometr K. N. Al Muteb, E. A. Mattar, M. Al-Sulaiman, H. Ramdane 4, and M. Emaduddin 5 Com & Information Sienes College, King Saud Universit, P. O.
More informationGrouping of Patches in Progressive Radiosity
Grouing of Patches in Progressive Radiosity Arjan J.F. Kok * Abstract The radiosity method can be imroved by (adatively) grouing small neighboring atches into grous. Comutations normally done for searate
More informationOrientation of the coordinate system
Orientation of the oordinate system Right-handed oordinate system: -axis by a positive, around the -axis. The -axis is mapped to the i.e., antilokwise, rotation of The -axis is mapped to the -axis by a
More informationCalculation of typical running time of a branch-and-bound algorithm for the vertex-cover problem
Calulation of typial running time of a branh-and-bound algorithm for the vertex-over problem Joni Pajarinen, Joni.Pajarinen@iki.fi Otober 21, 2007 1 Introdution The vertex-over problem is one of a olletion
More informationUsing Augmented Measurements to Improve the Convergence of ICP
Using Augmented Measurements to Improve the onvergene of IP Jaopo Serafin, Giorgio Grisetti Dept. of omputer, ontrol and Management Engineering, Sapienza University of Rome, Via Ariosto 25, I-0085, Rome,
More informationarxiv: v5 [cs.cc] 6 Jun 2017
On the Comlexity of Barrier Resilience for Fat Regions and Bounded Ply arxiv:1302.4707v5 [cs.cc] 6 Jun 2017 Matias Korman Maarten Löffler Rodrigo I. Silveira Darren Strash Abstract In the barrier resilience
More informationON CHARACTERIZING TERRAIN VISIBILITY GRAPHS
ON CHARACTERIZING TERRAIN VISIBILITY GRAPHS William Evans, and Noushin Saeedi Astrat. A terrain is an x-monotone polygonal line in the xy-plane. Two verties of a terrain are mutually visile if and only
More informationCluster-Based Cumulative Ensembles
Cluster-Based Cumulative Ensembles Hanan G. Ayad and Mohamed S. Kamel Pattern Analysis and Mahine Intelligene Lab, Eletrial and Computer Engineering, University of Waterloo, Waterloo, Ontario N2L 3G1,
More informationA CLASS OF STRUCTURED LDPC CODES WITH LARGE GIRTH
A CLASS OF STRUCTURED LDPC CODES WITH LARGE GIRTH Jin Lu, José M. F. Moura, and Urs Niesen Deartment of Electrical and Comuter Engineering Carnegie Mellon University, Pittsburgh, PA 15213 jinlu, moura@ece.cmu.edu
More informationGraph Cut Matching In Computer Vision
Grah Cut Matching In Comuter Vision Toby Collins (s0455374@sms.ed.ac.uk) February 2004 Introduction Many of the roblems that arise in early vision can be naturally exressed in terms of energy minimization.
More informationIoannis PITAS b. TIMC-IMAG Grenoble laboratory, UMR CNRS 5525, Domaine de la Merci, LA TRONCHE Cedex, FRANCE,
ylindrical Surface Localization in Monocular Vision William PUEH a Jean-Marc HASSERY a and Ioannis PITAS b a TIM-IMAG Grenoble laboratory, UMR NRS 5525, Domaine de la Merci, 38706 LA TRONHE edex, FRANE,
More informationClassification of Roadway Type and Estimation of a Road Curvature Using a Road Characteristic Conversion Coefficient
,.33-38 htt://dx.doi.org/10.14257/astl.2015.90.08 Classification of Roadway Tye and Estimation of a Road Curvature Using a Road Characteristic Conversion Coefficient SangChan Moon 1, SoonGeul Lee 1,*1,
More informationAutomatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425)
Automati Physial Design Tuning: Workload as a Sequene Sanjay Agrawal Mirosoft Researh One Mirosoft Way Redmond, WA, USA +1-(425) 75-357 sagrawal@mirosoft.om Eri Chu * Computer Sienes Department University
More informationThe Mathematics of Simple Ultrasonic 2-Dimensional Sensing
The Mathematis of Simple Ultrasoni -Dimensional Sensing President, Bitstream Tehnology The Mathematis of Simple Ultrasoni -Dimensional Sensing Introdution Our ompany, Bitstream Tehnology, has been developing
More informationConvex Hulls. Helen Cameron. Helen Cameron Convex Hulls 1/101
Convex Hulls Helen Cameron Helen Cameron Convex Hulls 1/101 What Is a Convex Hull? Starting Point: Points in 2D y x Helen Cameron Convex Hulls 3/101 Convex Hull: Informally Imagine that the x, y-lane is
More informationModeling of Wire Electrochemical Machining
A publiation of 91 CHEMICAL ENGINEERING TRANSACTIONS VOL. 41, 214 Guest Editors: Simonetta Palmas, Mihele Masia, Annalisa Vaa Copyright 214, AIDIC Servizi S.r.l., ISBN 978-88-9568-32-7; ISSN 2283-9216
More informationA BICRITERION STEINER TREE PROBLEM ON GRAPH. Mirko VUJO[EVI], Milan STANOJEVI] 1. INTRODUCTION
Yugoslav Journal of Oerations Research (00), umber, 5- A BICRITERIO STEIER TREE PROBLEM O GRAPH Mirko VUJO[EVI], Milan STAOJEVI] Laboratory for Oerational Research, Faculty of Organizational Sciences University
More informationA Novel Validity Index for Determination of the Optimal Number of Clusters
IEICE TRANS. INF. & SYST., VOL.E84 D, NO.2 FEBRUARY 2001 281 LETTER A Novel Validity Index for Determination of the Optimal Number of Clusters Do-Jong KIM, Yong-Woon PARK, and Dong-Jo PARK, Nonmembers
More informationLast time: Disparity. Lecture 11: Stereo II. Last time: Triangulation. Last time: Multi-view geometry. Last time: Epipolar geometry
Last time: Disarity Lecture 11: Stereo II Thursday, Oct 4 CS 378/395T Prof. Kristen Grauman Disarity: difference in retinal osition of same item Case of stereo rig for arallel image lanes and calibrated
More informationThe Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines
The Minimum Redundany Maximum Relevane Approah to Building Sparse Support Vetor Mahines Xiaoxing Yang, Ke Tang, and Xin Yao, Nature Inspired Computation and Appliations Laboratory (NICAL), Shool of Computer
More informationPARAMETRIC SAR IMAGE FORMATION - A PROMISING APPROACH TO RESOLUTION-UNLIMITED IMAGING. Yesheng Gao, Kaizhi Wang, Xingzhao Liu
20th European Signal Proessing Conferene EUSIPCO 2012) Buharest, Romania, August 27-31, 2012 PARAMETRIC SAR IMAGE FORMATION - A PROMISING APPROACH TO RESOLUTION-UNLIMITED IMAGING Yesheng Gao, Kaizhi Wang,
More information