Growing Least Squares for the Analysis of Manifolds in Scale-Space

Size: px
Start display at page:

Download "Growing Least Squares for the Analysis of Manifolds in Scale-Space"

Transcription

1 Growing Leas Squares for he Analysis of Manifolds in Scale-Space Nicolas Mellado, Gaël Guennebaud, Pascal Barla, Parick Reuer, Chrisophe Schlick To cie his version: Nicolas Mellado, Gaël Guennebaud, Pascal Barla, Parick Reuer, Chrisophe Schlick. Growing Leas Squares for he Analysis of Manifolds in Scale-Space. Compuer Graphics Forum, Wiley, 2012, Proceedings of Symposium on Geomery Processing 2012, 31 (5), pp < /j x>. <hal v2> HAL Id: hal hps://hal.inria.fr/hal v2 Submied on 24 Feb 2015 HAL is a muli-disciplinary open access archive for he deposi and disseminaion of scienific research documens, wheher hey are published or no. The documens may come from eaching and research insiuions in France or abroad, or from public or privae research ceners. L archive ouvere pluridisciplinaire HAL, es desinée au dépô e à la diffusion de documens scienifiques de niveau recherche, publiés ou non, émanan des éablissemens d enseignemen e de recherche français ou érangers, des laboraoires publics ou privés.

2 Eurographics Symposium on Geomery Processing 2012 Eian Grinspun and Niloy Mira (Gues Ediors) Volume 31 (2012), Number 5 Growing Leas Squares for he Analysis of Manifolds in Scale-Space Nicolas Mellado, Gaël Guennebaud, Pascal Barla, Parick Reuer, Chrisophe Schlick Inria - Univ. Bordeaux - IOGS - CNRS Absrac We presen a novel approach o he muli-scale analysis of poin-sampled manifolds of co-dimension 1. I is based on a varian of Moving Leas Squares, whereby he evoluion of a geomeric descripor a increasing scales is used o locae perinen locaions in scale-space, hence he name Growing Leas Squares. Compared o exising scale-space analysis mehods, our approach is he firs o provide a coninuous soluion in space and scale dimensions, wihou requiring any paramerizaion, conneciviy or uniform sampling. An imporan implicaion is ha we idenify muliple perinen scales for any poin on a manifold, a propery ha had no ye been demonsraed in he lieraure. In pracice, our approach exhibis an improved robusness o change of inpu, and is easily implemened in a parallel fashion on he GPU. We compare our mehod o sae-of-he-ar scale-space analysis echniques and illusrae is pracical relevance in a few applicaion scenarios. 1. Inroducion The use of muli-scale algorihms is ubiquious in image and geomery processing, and may serve very diverse purposes. In compuer graphics, muli-resoluion represenaions have been widely used. They are based on he decomposiion of a spaial signal ino base and deail layers, which may be used for insance in signal processing (e.g., [BEA83]) or for compression purposes (e.g., [Mal08]). In boh cases, he goal of a muli-resoluion srucure is o help modify a signal in ways ha depend on he argeed applicaion. In his paper, we are raher ineresed in scale-space echniques [Lin94, Rom09], where he goal is alogeher differen: i consiss in analyzing a signal a differen scales o discover is geomeric srucure, independenly of any applicaion. While muliresoluion mehods srive o decompose he signal ino independen layers, scale-space echniques criically rely upon redundan informaion beween scales o characerize he srucure of a spaial signal. A classical approach consiss in racking signal exrema (0-crossings) a increasing scales, using he scale a which hey ge annihilaed o characerize his srucure. Unforunaely, his mehod raises imporan issues. Firs, he consrucion of a scale space requires a dense regular sampling in boh spaial and scale dimensions. Mos imporanly, he racking of exrema provides informaion only for a subse of scale-space (a signal exrema); i is no able o idenify muliple perinen scales per poin; and i is sensiive o noise or nicolas.mellado@inria.fr small changes in he inpu signal, as deailed in Secion 2.1. Moreover, i is difficul o adap scale-space heory o he analysis of poin-sampled manifolds as explained in Secion 2.2. To he bes of our knowledge, here is no mehod ha has proposed a coninuous alernaive o exrema racking, and ha avoids he need of a regular paramerizaion while remaining compuaionally racable for manifolds of co-dimension 1 (e.g., curves in 2D, surfaces in 3D). The key idea of his paper is o perform he scale-space analysis of manifolds by means of coninuous algebraic fis. In our approach, a scale-space is buil hrough leas-square fis of a low-degree algebraic surface ono neighborhoods of coninuously increasing sizes. In some sense, i can be seen as an adapaion of he Moving Leas Squares formalism [Lev98a] o coninuously varying scales, hence he name Growing Leas Squares. The use of an algebraic surface ensures robus fis even a large scales and yields a rich geomeric descripor wih only a few parameers. The coninuiy of he fiing process hrough scales provides for a sable and elegan analysis of geomeric variaions. Our approach exhibis a number of advanages over previous scale-space analysis mehods of manifolds: I provides a fully coninuous alernaive o exrema racking, based on he derivaive of a local geomeric descripor ailored o scale-space analysis; I does no require any conneciviy or paramerizaion, and works from poins equipped wih normals; I is easy o implemen on he GPU, and robus o he scale sampling and o small changes in inpu poins. Compuer Graphics Forum c 2013 The Eurographics Associaion and Blackwell Publishing Ld. Published by Blackwell Publishing, 9600 Garsingon Road, Oxford OX4 2DQ, UK and 350 Main Sree, Malden, MA 02148, USA.

3 Mellado & Guennebaud & Barla & Reuer & Schlick / Growing Leas Squares for he Analysis of Manifolds in Scale-Space 2. Background In his secion, we presen previous work relevan o he analysis of manifolds in scale-space. This excludes pyramidal mehods [FMR11], specral processing [LZ09], or opological persisence [ELZ02, CGOS11], since hese are based on formalisms ha do no permi o analyze redundancy Scale-space heory Scale-space heory has firs been applied o 1D signals [Wi83] and gray-level images [Lin94]. Is main idea is o represen he inpu signal as a one-parameer family of smoohed signals. The parameer ha conrols smoohing size is called he scale, and he inuiion behind his approach is o ignore small variaions a increasing scales. The mos common smoohing operaor is he Gaussian kernel, in which case we alk abou linear scale-space. Conrary o muli-resoluion approaches ha mosly rely on pyramidal represenaions, scale-space makes use of sack represenaions: he resoluion is kep unchanged, which creaes a lo of redundancy from one scale o he oher. Such a redundancy is cenral o scale-space analysis, since i permis o sudy accuraely how a signal evolves from scale o scale. The core of analysis echniques relies on differenial invarians (e.g., gradien magniude, curvaure). The common approach consiss in racking 0-crossings of hose invarians along he scale dimension, and o record locaions where pairs of hem annihilae. This analysis exhibis wha has been called he deep srucure (e.g., [Rom09], p.154): 0- crossings are considered more or less perinen depending on he scale a which hey ge annihilaed. Once idenified, he deep srucure may be pu o use in a variey of applicaions: denoising, maching, simplificaion, ec. The main benefi of scale-space heory is ha he signal is analyzed independenly of any poenial applicaion, fully auomaically, wihou requiring he uning of parameers. Unforunaely, heir are some imporan limiaions: he pairing of 0-crossings is no robus o small changes in he inpu (as shown in [Mal00], p.86), and spurious 0-crossings may appear a increasing scales in 2D [Lin94]. Pracical algorihms have limiaions of heir own: he racking of 0- crossings requires a dense sampling in he scale dimension; and he smoohing operaor requires a regular uniform sampling. Alernaive mehods based on he racking of levelcrossings [WS90, DUM 11] have parly addressed heoreical limiaions, bu hey are sill limied by he aforemenioned pracical issues. Mos imporanly, he adapaion of racking-based mehods o he analysis of manifolds is far from sraighforward. As opposed o he image domain which offers a naural paramerizaion, manifolds are (d-1)-dimensional signals in R d, and ofen lack paramerizaion, uniform sampling and even conneciviy. Hence, specific soluions are required o analyze manifolds in scale-space Manifolds in scale-space Differenial geomery. One way o adap he scale-space heory o manifolds is o compue differenial invarians of poin coordinaes. This approach has firs been applied o curves and surfaces by Mokharian e al. [MM86, MKY01]. Is main limiaion is ha i requires a paramerizaion and a regular sampling on exended neighborhoods, which are ofen difficul and/or cosly o obain. A simpler approach employs he Difference of Gaussians (DoG) ha approximaes he Laplacian, firs inroduced for images [MH80] and laer adaped o meshes [ZBVH09]. I works in wo sages: 1) smooh he manifold a wo scales; 2) approximae curvaure a a poin by he disance beween is wo smoohed locaions. This mehod does no require any paramerizaion. The DoG mehod is preferable o mehods based on paramerizaion when dealing wih complex (e.g., scanned) geomery, alhough i sill relies on a conneced mesh in exising implemenaions. Moreover, i only provides local curvaure informaion. Boh approaches suffer from common scale-space issues: need of a dense sampling and lack of robusness of 0-crossings. Even hough spurious 0-crossings could be discarded (e.g., using [ELZ02, CGOS11]), oher pracical issues will remain. Numerical approximaion. An alernaive soluion o avoid compuing a paramerizaion is o perform measuremens of manifold properies ha are relaed o curvaure. One example is direc curvaure space smoohing [ZH97, ZH99], which uses a global spherical space o smooh curvaure-like values a differen scales. Hea kernel smoohing [SOG09] replaces he classic smoohing sep by a geodesic Gaussian diffusion o compue a hea kernel value a each scale. Inegral invarians [HFG 06, PWHY09] compue he volume occupied by he objec in a ball of varying size, which plays he role of scale. Like he DoG, hese mehods do no require any paramerizaion, and have hus been used in applicaions such as maching and regisraion of scanned surfaces (hey also require a mesh reconsrucion sep when applied o poin ses). Alhough hey have proven o be efficien for exracing global characerisics of manifolds, hey are no well adaped o scale-space analysis where we are ineresed in idenifying precise geomeric srucures: he compued values are valid curvaure approximaions only a small scales. Local regression. A hird approach o analyze manifolds in scale-space consiss in firs locally fiing simple geomeric kernels o inpu daa, and hen exracing properies relaed o differenial invarians. Performing regression wih a firs-order kernel inuiively corresponds o he fiing of a plane o inpu poins and normals. Surface anisoropy may hen be exraced [YLHP06, LG05, IT11], as well as a covariance measure [PKG03]. Regression hrough 2nd-order kernels [BSF02,CPG09] provides curvaure informaion, bu requires successive fiing seps (firs fi a plane, hen fi a quadric o he residual heigh daa). This raises issues when he surface folds-over iself. c 2013 The Eurographics Associaion and Blackwell Publishing Ld.

4 Mellado & Guennebaud & Barla & Reuer & Schlick / Growing Leas Squares for he Analysis of Manifolds in Scale-Space The main benefi of local regression mehods is ha hey work direcly from poin ses, while all oher mehods require a conneced mesh and ignore normals alogeher. As before, he differenial invarians ha may be exraced from fied kernels are limied. Indeed, alhough curvaure is compued wih second order kernels, he use of wo fiing seps grealy complexifies subsequen scale-space analysis: indeed, curvaure values are no direcly relaed when he suppor plane of he fied quadric changes from scale o scale. 3. Our approach The approach aken in his paper is based on local regression. I works direcly wih unorganized poin ses equipped wih normals and hus does no require any conneciviy. Moreover, conrary o previous echniques, i provides a geomeric descripor ha is direcly amenable o coninuous scalespace analysis. Our approach draws inspiraion from Moving Leas Squares (MLS) [Lev98b], whereby local regression is performed in a globally consisen way, resuling in coninuously differeniable surfaces. Our firs main conribuion is o adap MLS o perform scale-space analysis, aking advanage of heir coninuiy along he scale dimension. In a nushell, insead of shifing in space a weigh funcion of consan scale as wih MLS, we sudy he evoluion of he fiing resuls a a consan posiion wih a growing weigh funcion suppor. This leads us o our second key conribuion: insead of considering simple curvaure measures or eigenvalue raios, we propose o exploi and analyze he enire low-degree algebraic surfaces resuling from he fis. 4. Growing leas squares We firs briefly explain our choice of local regression in secion 4.1, along wih a reparamerizaion ha makes i relevan for he analysis of manifolds in scale-space. We hen exend he mehod in secion 4.2 o provide an alernaive o he racking of 0-crossings, based on analyic derivaives along he scale dimension. Third, we show how o adap our approach in secion 4.3 o measure pair-wise geomeric dissimilariies a arbirary scales and posiions Scale-space via local regression The firs sep of our approach is o characerize any poin p of a manifold a any scale by a low-degree algebraic surface ha bes approximaes is neighborhood P. In a discree seing, our manifold is described by a se of poins q i R d, wih d being he dimension of he ambien space, and he neighborhood P consiss in he se of daa poins conained in a ball of radius cenered a p: P = {q i ; q i p }. Inspired by recen work on MLS reconsrucion [GG07], we use algebraic hyper-spheres which have he advanages of being easy o fi in a robus manner, while providing secondorder informaion wih a minimal number of parameers. We assume each poin q i is equipped wih a normal n i R d. In case normals are no provided we esimae hem using covariance analysis, as done in previous work. {x ; su(x)=0} p qi ni Figure 1: Fiing and reparamerisaion. The weigh funcion (in green) around a poin p is defined in a neighborhood of size (dashed green line). Poins q i and normals n i ha belong o his neighborhood are fied by an algebraic hyper-sphere s u; is 0-isosurface is shown in black, and is scalar field wih a color code. This sphere is reparamerized in erms of hree geomeric parameers: he mean curvaure κ, he offse τ, and he gradien direcion η a p. Fiing. An algebraic sphere is implicily defined as he 0- isosurface of he following scalar field (see Figure 1): s u(x) = [1 x T x T x] u, (1) where u R d+2, u = [u c u l u q] T is he vecor of (respecively consan, linear and quadraic) parameers. In order o fi such a sphere ono a se of neighborhood poins P, we employ he fas fiing echnique of Guennebaud e al. [GGG08]. Firs, u l and u q are compued by minimizing i w i () s u(q i ) n i 2, where q i P and w i is a scaledependen weigh funcion: ( ) 2 q w i () = i p (2) Second, he consan coefficien u c is obained by minimizing in a leas square sense he algebraic disance o he samples: i w i () s u(q i ) 2. These wo minimizaions yield closed-form formulas which are recalled in he Appendix. Normalizaion. Conrary o [GG07], our goal is no o reconsruc a surface from a poin se, bu insead o analyze is shape a muliple scales. To his end, we wan o assign a unique and meaningful geomeric descripor for any choice of poin p and scale. A sraighforward soluion would be o use he cener c and radius r of he hyper-sphere. Unforunaely, his leads o degeneraed cases when he surface is locally planar: in paricular, c becomes undefined. We hus raher consider he scalar field iself s u as a geomeric descripor. However, here exiss an infiniy of scalar fields (based on scalar muliples of u) ha correspond o he same hyper-sphere. To solve his issue and consisenly pick a unique soluion, we use Pra s normalizaion [Pra87]: is basic idea is o consrain he scalar field o have a uniary gradien vecor on he 0-isosurface, yielding: û = [û c û l û q] T = u/ u l 2 4u cu q. (3) This choice has he addiional advanage o make algebraic disances near-euclidean for poins close o he 0-isosurface. κ 1 η p τ su c 2013 The Eurographics Associaion and Blackwell Publishing Ld.

5 Mellado & Guennebaud & Barla & Reuer & Schlick / Growing Leas Squares for he Analysis of Manifolds in Scale-Space (a) Small- and medium-scale analysis (b) Geomeric parameers (c) Geomeric variaion & finess (d) Dissimilariy profiles Figure 2: 2D analysis. The analysis of a synheic 2D curve composed of wo sinusoids of differen frequencies is illusraed a 3 differen poins. In (a), we show heir geomeric descripor a wo scales, whose parameers are visualized in (b) for all scales, wih one poin per row. In (c), we display geomeric variaions and finess: noe ha he 3rd poin has a more sable srucure a small scales since he magniude of he high-frequency componen is low a is locaion. In (d), we display dissimilariy measures for all pairs of poins. Observe how he use of he finess parameer helps disambiguae beween he wo ypes of inflexion poins a inermediae scales. In all plos, scale sampling is quadraic. Reparamerizaion. Afer normalizaion, we are lef wih a scalar field sû for which a geomeric inerpreaion is far from eviden. Firsly, û c and û l do no correspond o any measurable physical quaniy. Secondly, all d +2 parameers are sill inerdependen, since he normalizaion binds hem ogeher wih: û l 2 4û cû q = 1. We propose an alernaive paramerizaion of he scalar field, which is illusraed in Figure 1. Inuiively, is parameers consis of: he algebraic offse disance τ beween he evaluaion poin p and he 0-isosurface; he uni normal η of he scalar field a p; he signed curvaure κ of he hyper-sphere. When he fiing degeneraes o a plane, τ represens he disance from he origin o he plane, η is normal, and κ vanishes (see Figures 2 and 3 for 2D&3D illusraions, respecively). Formally, he geomeric parameers are given by: τ = sû(p) ; η = s û(p) ; κ = 2ûq. (4) sû(p) Thanks o Pra s normalizaion, he offse τ provides a close approximaion o he Euclidean disance beween p and he 0-isosurface. The normal parameer η gives he direcion o he poin on he hyper-sphere ha is closes o p. The curvaure parameer simply corresponds o he inverse of he hyper-sphere radius r, and has he advanage of behaving coninuously when passing hrough a locally planar surface, while r ends oward infiniy. Noe ha wih hese parameers, he scalar field can no longer be expressed as a linear combinaion of monomials, as shown in he Appendix. Finess. Once reparamerized, he scalar field fied from P yields a univocal geomeric descripor invarian o rigid ransformaions. However, a given geomeric descripor can be associaed o a space of generaor neighborhoods. Considering he sphere as a whole insead of, for insance, local curvaure only, already permis o significanly reduce he size of hese spaces. I is ineresing o remark ha hey can be furher reduced by looking a he finess ϕ ha exhibis how close he q i are o he fied scalar field s u. We define his ϕ = 1 ϕ = 0.91 ϕ = 1 ϕ = 0.86 Figure 4: The finess parameer ϕ helps o disambiguae wo idenical fis, e.g., a smooh versus a bumped neighborhood (lef), or a fla versus a saddle configuraion (righ). addiional parameer by ϕ = i w i () s u(q i ) n i / i w i (), where w i is he same weighing funcion as before. Using he fiing equaions 7, i can be shown ha for his fiing procedure, ϕ boils down o Pra s norm for u: ϕ = u l 2 4u cu q. Hence, ϕ does no have o be measured or sored explicily since i is embedded in he vecor of parameers u. Noe ha by consrucion, ϕ is dimension-less, scale-invarian, and varies in he [0,1] range, wih ϕ = 1 meaning a perfec alignmen beween he fied scalar field and inpu normals. As illusraed in Figure 4, his ypically permis o disambiguae beween surfaces ha locally have he same geomeric descripion, bu differs from a pure algebraic sphere. The chain of operaions described in his secion augmens an arbirary poin p a an arbirary scale wih a geomeric descripor ha characerizes daa poins q i P, as illusraed in Figure 2(a-b) for a 2D curve, and Figure 3(a-c) for a 3D surface. I hus describes an elegan mehod for building a fully coninuous scale-space from sampled manifolds of co-dimension 1, providing meaningful surface informaion in he form of he τ, η κ geomeric parameers, and a finess parameer ϕ ha furher helps disambiguae similar descripors. Anoher handy propery of our geomeric descripor is ha negaing is parameers yields he complemen descripor, which is equivalen o he descripor of he same surface wih an opposie orienaion. As deailed in Secion 5, his is a significan improvemen compared o exising mehods. One may be emped o use i o rack 0-crossings of he curvaure κ for insance, as in previous work. Insead, we show in he nex secion ha scale-space analysis may also be performed in a fully coninuous manner. c 2013 The Eurographics Associaion and Blackwell Publishing Ld.

6 Mellado & Guennebaud & Barla & Reuer & Schlick / Growing Leas Squares for he Analysis of Manifolds in Scale-Space (a) Small-scale analysis (b) Medium/large-scale analysis (c) Geomeric parameers (d) Geomeric variaion & finess Figure 3: 3D analysis. The analysis of a 3D golf ball model is illusraed a 3 differen poins: a concaviy, an edge and a juncion. This is shown a a small scale in (a), where we see ha he hree poins (wih heir neighborhoods in blue) have quie dissimilar geomeric descripors (in green). However, a medium and large scales (b), all 3 poins converge o a same global sphere (only one poin is shown for clariy). This is bes observed in (c), where we display heir geomeric parameers (excep for η ), and in (d), where all 3 poins converge ogeher. In all plos, scale sampling is quadraic Coninuous scale-space analysis The main purpose of analyzing a spaial signal in scale-space is o rack is variaions a increasing scales o discover is geomeric srucure. A classical approach consiss in racking invarians in he form of 0-crossings of a spaial derivaive of he signal; hen find locaions in scale-space where hey ge annihilaed. As menioned in Secion 2, his leads o many shorcomings, especially when rying o deal wih manifolds. Mos imporanly, i resrics he analysis o a subse of locaions in scale-space while requiring a paramerizaion. We propose a differen approach o discover he muliscale srucure of a manifold. Our key insigh is o observe ha, in general, a perinen scale for p is one where is geomeric descripor exhibis minimal variaion when he neighborhood size increases. This suggess ha, a such scales, he parameers of our descripor do no crucially depend on scale, bu raher indicae sable geomeric properies of he manifold. In his secion we focus on he derivaion of such a general geomeric variaion; we will show is relevance in Secion 5 and how i can be exploied in Secion 6. One may hink ha he curvaure parameer κ is he one mosly involved in geomeric variaions. Figure 5 shows couner examples where eiher τ or η have significan influence. We hus compue he variaions of all 3 geomeric parameers and combine hem in a naural fashion o yield a geomeric variaion funcion ν(p,) ha describes he scalespace srucure of he inpu manifold. Scale derivaives. The variaion of geomeric descripor parameers we are looking for are simply given by heir parial η/d, derivaives along he scale dimension a (p,): dτ/d, dη and dκ/d. We emphasize ha we are ineresed in geomeric variaions only, hence he finess ϕ does no play a role here. Since we make use of a local regression ha is boh coninuous and given in closed-form, hese derivaives are easily compued analyically, provided he weigh funcions hemselves are differeniable. Their compuaion does no yield any difficuly, and simply involves differeniaing he chain c 2013 The Auhor(s) c 2013 The Eurographics Associaion and Blackwell Publishing Ld. Figure 5: Variaions of τ and η. We show he hyper-spheres fied for he red poin wih various suppor sizes (indicaed by dark dos). On he lef, boh he offse τ and curvaure κ vary, while on he righ only he normal direcion η varies. of equaions presened in Secion 4.1, i.e. from op o boom: weighing (Eq. 2), fiing (Eq. 7), normalizaion (Eq. 3) and reparamerizaion (Eq. 4). Geomeric variaion. The geomeric variaion funcion ν(p,) is obained by a weighed squared sum of hese parial derivaives. In order no o inroduce any bias, a special care has o be aken in he choice of hese weighs. In paricular, we propose he following weighing scheme: 2 2 η 2 dκ dτ dη ν(p,) = + + 2, (5) d d d which has he fundamenal advanages o yield a dimensionless and scale-invarian measure, and o naurally give equal imporance o each parameer. Indeed, le us for insance choose meers m for he uni of lengh. Thanks o our inuiive reparamerizaion of Secion 4.1, we have τ in m, he uni-less η, and κ in m-1. Moreover, by consrucion i is reasonable o expec o have τ o be mosly comprised in ηk = 1. Therefore, a reasonable [,], κ in [ 1, 1 ], while kη η, κ) by (1/, 1,) choice is o scale he parameers (τ,η respecively in order o ge scale-invarian and uni-less quaniies of he same order of magniude. Finally, in order o compensae for he differeniaion over he scale ha is in m, i is naural o muliply by he scale, hus leading o he scaling facors (1,, 2 ) of Equaion 5. The funcion ν(p,) is one of he he key conribuion of his paper. I provides a coninuous descripion of perinen

7 Mellado & Guennebaud & Barla & Reuer & Schlick / Growing Leas Squares for he Analysis of Manifolds in Scale-Space (a) Scale-space for a synheic curve (b) Scale space for he drawn curve on he righ Figure 6: Curvaure scale spaces (from op o boom: DoG, ours and CA), wih orange colors for concaviies and blue colors for convexiies. In (a), we show curvaures for he sinus-based funcion of Figure 2(a); in (b), we show curvaures for he symmeric curve shown on he righ. Compared o DoG, our approach exhibis less noise a small scales and a beer convergence a large scales. CA does no make a difference beween convex and concave regions, which merge ogeher. scales for any poin p, and i is robus o small changes in he inpu. This is o conras wih previous approaches ha rely on he annihilaion of exremal poins (0-crossings) and may lead o alogeher differen srucures when he inpu changes only a lile, as shown in Secion 5. Mos imporanly, our approach is he firs o idenify muliple perinen scales for individual poins on manifolds, as exemplified in Figures 2(c) and 3(d) for 2D and 3D cases, respecively. This opens he door o many new applicaions, for which we skech a few examples in Secion Pairwise dissimilariy in scale-space For a variey of applicaions, i is also ineresing o compare a pair of arbirary scale-space locaions (p a, a) and (p b, b ). In his conex, i is crucial o provide a measure invarian o similariy ransformaions. Invariance o ranslaion is readily available because he geomeric parameers are defined relaive o heir fied poins. Since our descripor is isoropic, invariance o roaion is achieved by aligning he respecive uni normals η a and η b, which amouns o ignore hese parameers. Finally, scale invariance is obained using he weighs derived in he previous paragraph, and we hus define he dimension-less dissimilariy funcion δ a,b by: ( ) 2 δ a,b = a -1 τ a b -1 τ b + (aκa b κ b ) 2 + (ϕ a ϕ b ) 2 (6) Here he fiing errors ϕ a and ϕ b help disambiguae beween similar descripors ha may correspond o differen surfaces. Recall ha i is dimension-less, scale-invarian, and of he same order of magniude han he oher quaniies since i varies beween 0 and 1. The dissimilariy measure is illusraed in Figure 2(d), where we compare hree pairs of poins a muliple scales. Oher examples are presened in Secion 6, where we combine geomeric variaion and dissimilariy measuremens. 5. Comparisons wih previous work In his secion, we demonsrae he benefis of our scale space consrucion and analysis echniques and compare hem o sandard approaches. We only consider mehods ha, like ours, avoid fold-over issues, do no require any paramerizaion and provide valid approximaions of curvaure a all scales: DoG curvaure scale space [ZBVH09] and covariance analysis (CA) [PKG03]. Neverheless, his secion mosly makes use of paramerized 2D curves o 1) visualize he differen scale-spaces in a comprehensive manner, and 2) permi comparisons wih DoG and 0-crossings. Curvaure scale space. Le us firs focus on he scalarvalued scale-space obained using our curvaure measure κ. All our 2D visualizaions use he arclengh l and scale parameers for he horizonal and verical axis, respecively. Figure 6(a) compares our appraoch o DoG and CA for he smooh sinus-like curve of Figure 2. On his example, all mehods manage o idenify he wo signals, hough CA canno disinguish beween concaviies and convexiies, and DoG fails o capure imporan variaions a curve borders. On a more complex example, as shown in Figure 6(b), he differen mehods sar o exhibi more differen behaviors. In paricular, DoG does no reach convergence a large scales: i keeps on inroducing meaningless srucures. In conras, our curvaure κ produces a much smooher and coheren scale space, even hough i does no rely on inpu poin conneciviy. Sabiliy comparison. In Figure 7, we illusrae an imporan limiaion of racking-based scale-space analysis. When he inpu curve is modified so ha one of is bumps is slighly more prominen, hen he corresponding se of 0-crossings changes abruply, suggesing ha he inrinsic srucure of he curve has changed in similar respecs. In conras, our geomeric variaion scale-space evolves coninuously o reflec he more suble change of srucure implied by his sligh modificaion. In paricular, inermediae scales around he bump region are no longer considered persisen once he more prominen bump is se in place. Indeed, increasing he ampliude of he bump has he effec of breaking he srucure of he slope on he lef side of he curve. Relaionship o 0-crossings. Figure 8 shows a layering of 0-crossings on op of our geomeric variaion scale-space. c 2013 The Eurographics Associaion and Blackwell Publishing Ld.

8 Mellado & Guennebaud & Barla & Reuer & Schlick / Growing Leas Squares for he Analysis of Manifolds in Scale-Space Figure 7: Sabiliy comparison. Top row: a convex bump is added o he lef side of a simple open curve. Middle row: he srucure of 0-crossings changes abruply even for small changes in he inpu (red and green lines show he 0-crossings of κ and of is curvilinear derivaive κ, respecively). Boom row: he geomeric variaion ν changes coninuously o reflec he suble change in he inpu curve (whie means low variaion). Noe how he sable region a inermediae scales, which corresponds o he slope on he lef side, is progressively filled wih a more complex srucure. comparison wih dedicaed echniques in each of hese applicaion domains is ou of he scope of his paper. Insead, we focus on he novelies brough by our scale-space analysis, essenially is coninuiy and is abiliy o deec muliple perinen scales per poin. Some implemenaion deails are given a he end of his secion. Figure 8: Relaionship o 0-crossings. The geomeric variaion ν for he second drawing in Figure 7 is displayed wih 0-crossings of κ (in red) and κ (in green) layed on op. Two ypes of differenial invarians are shown: 0-crossings of κ and is spaial derivaive κ. Le s wrie he corresponding scale-space poins C and C for convenience. Firs, noe ha all annihilaion evens for boh C and C occur in regions of low geomeric variaion, bu here are oher such regions which are never reached by eiher C or C. This suggess ha he racking of exrema acually leads o a subse of perinen scale-space locaions according o ν. I is also ineresing o noe ha poins in C (resp. C ) seem o be araced oward regions of high (resp. low) variaion, a endency we plan o sudy in fuure work. Our second observaion concerns he larges scale: by consrucion, only a few poins from C (and none from C) reach he op of scale-space, and hey are relaed hrough racking o a single poin on he original manifold. However, here is no reason o idenify a precise locaion as a represenaive of such a large scale, since i corresponds o an exremely smooh shape. Our approach reflecs his convergence since mos poins have a low geomeric variaion in his case, and correspond o a global geomeric descripor. 6. Applicaion scenarios We have shown ha our geomeric variaion scale-space provides a robus and coninuous characerizaion of he geomeric srucure of a manifold. We now give examples of is usefulness hrough hree applicaion scenarios relaed o denoising, feaure deecion and maching/regisraion. A full Adapive Bandwidh. When a poin-sampled manifold is corruped wih spaially varying noise as shown in Figure 9, i is no appropriae o reconsruc he signal a a single global scale. Insead, we mus find a spaially-varying scale locally adaped o he ampliude of noise, also called adapive bandwidh [WSS09]. However, care mus be aken no o over-esimae his minimum scale, oherwise perinen manifold srucures may be damaged. Thanks o our geomeric variaion scale-space, i is possible o adapively esimae a proper bandwidh: inuiively, we only have o find he smalles perinen scale for each poin p. As a proof of concep, we propose a simple op-down heurisic ha works well for smooh objecs. We deec he noise in a coarse-o-fine fashion: for each poin we se a bandwidh a scales where dν/d is greaer han a given hreshold (we use 0.01 in his example). We hen regularize he resul wih a spaial smoohing across daa poins. We will sudy he exension of his mehod o more complex objecs in fuure work. The resuling adapive bandwidh is used as a variable suppor size o reconsruc a smooh curve, shown in orange in Figure 9 for differen kind of noise. Coninuous feaures. To deal wih complex manifolds, many geomery processing applicaions rely on a preliminary feaure exracion sep, which idenifies a subse of salien poins o consider for furher processing. Probably he mos famous echnique in his field is SIFT (e.g., [IT11]), which idenifies local feaures ha are relaed o locaions where 0-crossings of κ annihilae. Because such 0-crossings are sensiive o noise and small changes in he inpu, SIFT poins may be filered ou in a number of ways o keep only he mos salien locaions. c 2013 The Eurographics Associaion and Blackwell Publishing Ld.

9 Mellado & Guennebaud & Barla & Reuer & Schlick / Growing Leas Squares for he Analysis of Manifolds in Scale-Space A B D C (a) Noisy 2D poin se A B C D (b) Exraced bandwidh Figure 9: Adapive bandwidh: a 2D poin se (a) is corruped wih noise on: normals and posiions (A), posiions (B) and normals (C) ; D is wihou noise. The reconsruced curve (shown in orange) is obained using an adapive bandwidh (black curve) exraced from our coninuous scalespace represenaion (b). Insead of relying on individual poins, we propose he coninuous feaure funcion f (p) = ν(p,)d, where ν is a smooh remapping of ν ha disregards oo srong geomeric variaions (we use a anh funcion o his end). The inuiion behind his formula is ha poins for which f is small are subjec o nearly no geomeric variaions across scales (e.g., f = 0 on a sphere); whereas poins wih a high f indicae ha our geomeric descripor is perinen only a a few scales. This is shown on complex curves and surfaces in Figure 10 wih a color gradien. Observe how he mos pronounced feaures (in red) may correspond o widely differen concave and/or convex regions; his is desirable because here is ofen no a priori on he sign of curvaure of feaures. Also noe ha regions wih repeiive small deails are no considered as imporan, whereas isolaed or more prominen shape deails emerge as key feaures of he model. Muli-scale dissimilariy. The abiliy o evaluae local surface similariies is he cornersone of many maching or regisraion echniques. However, he noion of muli-scale similariy hides an imporan quesion: which scales should acually be aken ino accoun? One may hink ha aking all scales a once is a naural soluion. However, as shown in Figure 11(a), his migh no always be he case, a leas for some applicaions. The quesion becomes delicae as soon as muliple scales are nesed in a same objec: one may wan o find similariies a he smalles of hese scales, or perhaps in oher siuaions a he larges scale. Our approach permis o make his choice in a coninuous manner, and we illusrae i wih a simple picking ool: he user selecs a poin on a surface, and he sysem finds all similar poins on he same objec, given a rough scale prior. The basic idea is o combine he global prior wih he local geomeric variaion o compue a per-scale dissimilariy, which is hen inegraed over he scales i o yield a muli-scale dissimilariy p,q = i δ p,q( i )h( i ), where δ p,q() is he dissimilariy measure from Equaion 6, and h is a normalized weighing funcion over scales ha defines he global prior. In our example, we use a simple box filer for h. Figure 11(b-c) visualizes p,q as a funcion of q (in blue) for a given poin p (in red) locaed boh on a small ridge and on he S of he SGP acronym. By varying he global prior, our mehod idenifies unambiguously eiher one deail layer or he oher. Alhough our approach is based on an isoropic regression, his resul demonsraes ha anisoropic feaures a perinen scales are properly exraced, even juncions and corners. Moreover, his is done irrespecive of he shape of he base surface, since he leers SGP are exraced similarly on differen locaions of he orus. Implemenaion deails. In our sysem we use a kd-ree for he neighbor search, and he fiing a scale is performed by collecing all he neighbors wihin he disance of he curren poin. This makes he complexiy of our algorihm quadraic wih respec o for a 3D surface. We implemened our approach boh on he CPU (on all 8 cores of an Inel I7 3.40Ghz) and on he GPU (using CUDA on a GTX 580). As expeced, he GPU implemenaion ouperforms he CPU version; for he example of Figure 10(c), he analysis akes only 6.3s versus 221s. All repored imings correspond o our CUDA implemenaion. We believe a huge speed-up could be achieved by ieraively smoohing and simplifying he inpu poin cloud o compue he larger scales [PKG06]. 7. Discussion & Fuure work We have presened a novel approach o scale-space analysis based on local regression, ha auomaically and robusly characerizes he sable srucure of a manifold of codimension 1 in a coninuous manner. A srengh of his approach is ha i is enirely independen of any argeed applicaion. Indeed, our coninuous geomeric variaion scalespace may be inerpreed and processed differenly by differen ypes of applicaions, as demonsraed in Secion 6. Our soluion considerably improves previous work: i is fully coninuous in boh space and scale, i is robus o noise (Figures 9 and??), i does no require any paramerizaion or conneciviy, and i naurally deals wih manifold borders. The DoG mehod could be adaped o handle poin ses and manifold borders using local regression for smoohing. However, i would sill have o be applied o daa poins wih geodesic neighborhoods, which are ofen difficul o obain, and i would provide only curvaure measuremens. Our approach idenifies a more complee geomeric descripor while only requiring an Euclidean neighborhood wih a reasonable number of poin samples (a leas abou 5 in 2D and 12 in 3D). Quadric fiing is anoher alernaive o compue curvaure, bu i is no adaped o scale-space analysis since i requires a local planar paramerizaion which is no globally coheren and no robus o fold-overs. In conras, our mehod avoids hese shorcomings by employing a oalleas square fiing procedure. A limiaion of our approach comes from he choice of an isoropic regression: surface anisoropy is no explicily idenified. However, as shown in Figure 11, our mehod is able o deec indirecly complex anisoropic srucures. As shown in Figure??, our scale-space analysis even permis o idenify saddle-like shapes. The case of a perfec saddle c 2013 The Eurographics Associaion and Blackwell Publishing Ld.

10 Mellado & Guennebaud & Barla & Reuer & Schlick / Growing Leas Squares for he Analysis of Manifolds in Scale-Space f =1 f =0 (a) (b) 2D symmeric curve: 5k ps, 1k scales, 3s (c) 3D Armadillo models: 173k ps, 20 scales, 6.3s Figure 10: Coninuous feaures are displayed using a color gradien (a), on a symmeric 2D closed curve (b), and on 3 varians of he Armadillo 3D model. Observe how feaures of varying shapes and sizes (in red) are properly seleced in all cases. (a) All scales (b) Fine scales (c) Coarse scales Figure 11: Muli-scale similariy. Top row: Poins similar o he picked poin (in red) are seleced (in blue) via our dissimilariy measure. Boom row: he ype of seleced feaure depends on a user-conrolled global prior (blue box), which is locally refined by our geomeric variaion. In (a), all scales are seleced. In (b), only he fine displacemen paern emerges. In (c), he largescale SGP leers are properly segmened (SGP orus: 500k ps, 20 scales, 42sec). We use a log remapping on he scale axis. pach requires he ake finess ino accoun, as shown in Figure 4. In fuure work, we also plan o sudy spaial variaions of our geomeric descripor, in a way similar o wha is classically done wih MLS. I would permi o explicily idenify direcion fields on manifolds and he scales a which hese are perinen. In his paper, we have only considered shape geomery and ignored addiional informaion such as color aribues. In fuure work, we plan o exend our weigh funcions o rejec neighbor poins of dissimilar aribues, yielding a non-linear version of our coninuous scale-space analysis. We have also observed oscillaions in ν for inpu manifolds wih regular srucures (see Figures 2(c) and 3(d)). For some applicaions, hey migh lead o false posiives, which could be deeced hrough a frequenial analysis of ν. Our versaile and coninuous geomeric scale-space analysis has a grea poenial for a large variey of applicaions ha we wan o explore in fuure work. For example, in he domain of Culural Heriage, where i is common o conc 2013 The Auhor(s) c 2013 The Eurographics Associaion and Blackwell Publishing Ld. fron differen hypoheses, our coninuous scale-space could be used o design semi-auomaic mehods ha guide archaeologiss in shape maching asks. Muli-resoluion represenaions could also benefi from our analysis as a pre-process, for insance for he idenificaion of he mos meaningful scales a which deails should be compued. This could be paricularly ineresing in he conex of base/relief surface decomposiion. Finally, he geomeric descripors ha correspond o perinen scales could be used for curve and surface absracion purposes. Acknowledgmen This work has been suppored by he ANR SeARCH projec (ANR-09-CORD-019), and he European Communiy s Sevenh Framework Program [FP7-2007/2013] under he Gran Agreemen (V-mus.ne). The model of figure 3 is provided couresy of S. Rusinkiewicz, and figure 10 couresy of AIM@SHAPE Shape Reposiory.

11 Mellado & Guennebaud & Barla & Reuer & Schlick / Growing Leas Squares for he Analysis of Manifolds in Scale-Space References [BEA83] BURT P. J., EDWARD, ADELSON E. H.: The laplacian pyramid as a compac image code. IEEE Transacions on Communicaions 31 (1983), [BSF02] BOYER K. L., SRIKANTIAH R., FLYNN P. J.: Saliency sequenial surface organizaion for free-form objec recogniion. Compu. Vis. Image Unders. 88, 3 (2002), [CGOS11] CHAZAL F., GUIBAS L., OUDOT S., SKRABA P.: Scalar field analysis over poin cloud daa. Discree & Compuaional Geomery 46 (2011), [CPG09] CIPRIANO G., PHILLIPS G. N., GLEICHER M.: Muliscale surface descripors. IEEE Transacions on Visualizaion and Compuer Graphics 15, 6 (2009), [DUM 11] DUANGGATE C., UYYANONVARA B., MAKHANOV S. S., BARMAN S., WILLIAMSON T.: Objec deecion wih feaure sabiliy over scale space. Journal of Visual Communicaion and Image Represenaion 22, 4 (2011), [ELZ02] EDELSBRUNNER H., LETSCHER D., ZOMORODIAN A.: Topological persisence and simplificaion. Discree & Compuaional Geomery 28 (2002), [FMR11] FIORIO C., MERCAT C., RIEUX F.: Adapive Discree Laplace Operaor. In Advances in Visual Compuing (2011), vol. 6939/2011, pp [GG07] GUENNEBAUD G., GROSS M.: Algebraic poin se surfaces. ACM Trans. Graph. 26, 3 (2007). 3 [GGG08] GUENNEBAUD G., GERMANN M., GROSS M.: Dynamic sampling and rendering of algebraic poin se surfaces. Compuer Graphics Forum 27, 2 (2008). 3, 10 [HFG 06] HUANG Q.-X., FLÖRY S., GELFAND N., HOFER M., POTTMANN H.: Reassembling Fracured Objecs by Geomeric Maching. ACM Trans. Graph. 25, 3 (2006), [IT11] ITSKOVICH A., TAL A.: Surface parial maching and applicaion o archaeology. Compuers & Graphics 35, 2 (2011), , 7 [Lev98a] LEVIN D.: The approximaion power of moving leassquares. Mah. Compu. 67, 224 (1998), [Lev98b] LEVIN D.: The approximaion power of moving leassquares. Mahemaics of Compuaion 67 (1998), [LG05] LI X., GUSKOV I.: Muli-scale feaures for approximae alignmen of poin-based surfaces. In Proc. of he Eurographics symposium on Geomery processing (2005). 2 [Lin94] LINDEBERG T.: Scale-Space Theory in Compuer Vision. Norwell, MA, USA, , 2 [LZ09] LÉVY B., ZHANG H. R.: Specral mesh processing. In ACM SIGGRAPH ASIA 2009 Courses (2009), pp. 17:1 17:47. 2 [Mal00] MALLOT H.: Compuaional vision: informaion processing in percepion and visual behavior [Mal08] MALLAT S.: A Wavele Tour of Signal Processing, Third Ediion: The Sparse Way, 3rd ed [MH80] MARR D., HILDRETH E.: Theory of edge-deecion. In Proc. of he Royal Sociey of London (1980), pp [MKY01] MOKHTARIAN F., KHALILI N., YUEN P.: Curvaure compuaion on free-form 3-d meshes a muliple scales. Compu. Vis. Image Unders. 83 (2001), [MM86] MOKHTARIAN F., MACKWORTH A.: Scale-based descripion and recogniion of planar curves and wo-dimensional shapes. Paern Analysis and Machine Inelligence, IEEE Transacions on PAMI-8, 1 (1986), [PKG03] PAULY M., KEISER R., GROSS M. H.: Muli-scale feaure exracion on poin-sampled surfaces. Compuer Graphics Forum 22, 3 (2003), , 6 [PKG06] PAULY M., KOBBELT L. P., GROSS M.: Poin-based muliscale surface represenaion. ACM Trans. Graph. 25 (2006), [Pra87] PRATT V.: Direc leas-squares fiing of algebraic surfaces. In Proceedings of he 14h annual conference on Compuer graphics and ineracive echniques (New York, NY, USA, 1987), pp [PWHY09] POTTMANN H., WALLNER J., HUANG Q.-X., YANG Y.-L.: Inegral invarians for robus geomery processing. Compu. Aided Geom. Des. 26 (2009), [Rom09] ROMENY B.: Fron-End Vision and Muli-Scale Image Analysis: Muli-scale Compuer Vision Theory and Applicaions, wrien in Mahemaica , 2 [SOG09] SUN J., OVSJANIKOV M., GUIBAS L.: A concise and provably informaive muli-scale signaure based on hea diffusion. In Proc. of he Symposium on Geomery Processing (2009), pp [Wi83] WITKIN A. P.: Scale-space filering. In Proc. of he Eighh inernaional join conference on Arificial inelligence - Volume 2 (1983), pp [WS90] WADA T., SATO M.: Scale-space ree and is hierarchy. In Paern Recogniion, Proc., 10h Inernaional Conference on (1990), vol. ii, pp vol.2. 2 [WSS09] WANG H., SCHEIDEGGER C., SILVA C.: Bandwidh selecion and reconsrucion qualiy in poin-based surfaces. IEEE TVCG 15, 4 (2009), [YLHP06] YANG Y.-L., LAI Y.-K., HU S.-M., POTTMANN H.: Robus principal curvaures on muliple scales. In Proc. of he Eurographics symposium on Geomery processing (2006), pp [ZBVH09] ZAHARESCU A., BOYER E., VARANASI K., HO- RAUD R. P.: Surface feaure deecion and descripion wih applicaions o mesh maching. In CVPR (2009). 2, 6 [ZH97] ZHANG D., HEBERT M.: Muli-scale classificaion of 3D objecs. In CVPR (1997), pp [ZH99] ZHANG D., HEBERT M.: Harmonic maps and heir applicaions in surface maching. In CVPR (1999), pp Appendix Sphere fiing. For ease of implemenaion we recall he closed-form formula for algebraic sphere fiing [GGG08]: u q = 1 w i q T i n i w i q T i w i n i 2 w i q T i q i w i q T i w i q i u l = w i n i 2u 4 w i q i (7) u 0 = u T l w i q i u 4 w i q T i q i where w i is he normalized weigh of he sample q i : w i = w i / j w j. The differeniaion of hese formulas is sraighforward and yield o he differeniaion of w i () (Equaion 2) over he scale : dw i d () = 4 p i p 2 3 ( ) p i p Reparamerizaion. Afer our reparamerizaion (Equaion 4), he scalar field sû can be rerieved by: (8) sû(x) = s τ,η,κ(x) = τ + (1 + 2τκ) 1 2 η (x p) + κ 2 (x p)2 (9) c 2013 The Eurographics Associaion and Blackwell Publishing Ld.

Implementing Ray Casting in Tetrahedral Meshes with Programmable Graphics Hardware (Technical Report)

Implementing Ray Casting in Tetrahedral Meshes with Programmable Graphics Hardware (Technical Report) Implemening Ray Casing in Terahedral Meshes wih Programmable Graphics Hardware (Technical Repor) Marin Kraus, Thomas Erl March 28, 2002 1 Inroducion Alhough cell-projecion, e.g., [3, 2], and resampling,

More information

CAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL

CAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL CAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL Klečka Jan Docoral Degree Programme (1), FEEC BUT E-mail: xkleck01@sud.feec.vubr.cz Supervised by: Horák Karel E-mail: horak@feec.vubr.cz

More information

EECS 487: Interactive Computer Graphics

EECS 487: Interactive Computer Graphics EECS 487: Ineracive Compuer Graphics Lecure 7: B-splines curves Raional Bézier and NURBS Cubic Splines A represenaion of cubic spline consiss of: four conrol poins (why four?) hese are compleely user specified

More information

A Matching Algorithm for Content-Based Image Retrieval

A Matching Algorithm for Content-Based Image Retrieval A Maching Algorihm for Conen-Based Image Rerieval Sue J. Cho Deparmen of Compuer Science Seoul Naional Universiy Seoul, Korea Absrac Conen-based image rerieval sysem rerieves an image from a daabase using

More information

AML710 CAD LECTURE 11 SPACE CURVES. Space Curves Intrinsic properties Synthetic curves

AML710 CAD LECTURE 11 SPACE CURVES. Space Curves Intrinsic properties Synthetic curves AML7 CAD LECTURE Space Curves Inrinsic properies Synheic curves A curve which may pass hrough any region of hreedimensional space, as conrased o a plane curve which mus lie on a single plane. Space curves

More information

CENG 477 Introduction to Computer Graphics. Modeling Transformations

CENG 477 Introduction to Computer Graphics. Modeling Transformations CENG 477 Inroducion o Compuer Graphics Modeling Transformaions Modeling Transformaions Model coordinaes o World coordinaes: Model coordinaes: All shapes wih heir local coordinaes and sies. world World

More information

An Improved Square-Root Nyquist Shaping Filter

An Improved Square-Root Nyquist Shaping Filter An Improved Square-Roo Nyquis Shaping Filer fred harris San Diego Sae Universiy fred.harris@sdsu.edu Sridhar Seshagiri San Diego Sae Universiy Seshigar.@engineering.sdsu.edu Chris Dick Xilinx Corp. chris.dick@xilinx.com

More information

4.1 3D GEOMETRIC TRANSFORMATIONS

4.1 3D GEOMETRIC TRANSFORMATIONS MODULE IV MCA - 3 COMPUTER GRAPHICS ADMN 29- Dep. of Compuer Science And Applicaions, SJCET, Palai 94 4. 3D GEOMETRIC TRANSFORMATIONS Mehods for geomeric ransformaions and objec modeling in hree dimensions

More information

Image Content Representation

Image Content Representation Image Conen Represenaion Represenaion for curves and shapes regions relaionships beween regions E.G.M. Perakis Image Represenaion & Recogniion 1 Reliable Represenaion Uniqueness: mus uniquely specify an

More information

STEREO PLANE MATCHING TECHNIQUE

STEREO PLANE MATCHING TECHNIQUE STEREO PLANE MATCHING TECHNIQUE Commission III KEY WORDS: Sereo Maching, Surface Modeling, Projecive Transformaion, Homography ABSTRACT: This paper presens a new ype of sereo maching algorihm called Sereo

More information

Sam knows that his MP3 player has 40% of its battery life left and that the battery charges by an additional 12 percentage points every 15 minutes.

Sam knows that his MP3 player has 40% of its battery life left and that the battery charges by an additional 12 percentage points every 15 minutes. 8.F Baery Charging Task Sam wans o ake his MP3 player and his video game player on a car rip. An hour before hey plan o leave, he realized ha he forgo o charge he baeries las nigh. A ha poin, he plugged

More information

Curves & Surfaces. Last Time? Today. Readings for Today (pick one) Limitations of Polygonal Meshes. Today. Adjacency Data Structures

Curves & Surfaces. Last Time? Today. Readings for Today (pick one) Limitations of Polygonal Meshes. Today. Adjacency Data Structures Las Time? Adjacency Daa Srucures Geomeric & opologic informaion Dynamic allocaion Efficiency of access Curves & Surfaces Mesh Simplificaion edge collapse/verex spli geomorphs progressive ransmission view-dependen

More information

Spline Curves. Color Interpolation. Normal Interpolation. Last Time? Today. glshademodel (GL_SMOOTH); Adjacency Data Structures. Mesh Simplification

Spline Curves. Color Interpolation. Normal Interpolation. Last Time? Today. glshademodel (GL_SMOOTH); Adjacency Data Structures. Mesh Simplification Las Time? Adjacency Daa Srucures Spline Curves Geomeric & opologic informaion Dynamic allocaion Efficiency of access Mesh Simplificaion edge collapse/verex spli geomorphs progressive ransmission view-dependen

More information

MORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES

MORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES MORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES B. MARCOTEGUI and F. MEYER Ecole des Mines de Paris, Cenre de Morphologie Mahémaique, 35, rue Sain-Honoré, F 77305 Fonainebleau Cedex, France Absrac. In image

More information

4. Minimax and planning problems

4. Minimax and planning problems CS/ECE/ISyE 524 Inroducion o Opimizaion Spring 2017 18 4. Minima and planning problems ˆ Opimizing piecewise linear funcions ˆ Minima problems ˆ Eample: Chebyshev cener ˆ Muli-period planning problems

More information

Landmarks: A New Model for Similarity-Based Pattern Querying in Time Series Databases

Landmarks: A New Model for Similarity-Based Pattern Querying in Time Series Databases Lmarks: A New Model for Similariy-Based Paern Querying in Time Series Daabases Chang-Shing Perng Haixun Wang Sylvia R. Zhang D. So Parker perng@cs.ucla.edu hxwang@cs.ucla.edu Sylvia Zhang@cle.com so@cs.ucla.edu

More information

Video Content Description Using Fuzzy Spatio-Temporal Relations

Video Content Description Using Fuzzy Spatio-Temporal Relations Proceedings of he 4s Hawaii Inernaional Conference on Sysem Sciences - 008 Video Conen Descripion Using Fuzzy Spaio-Temporal Relaions rchana M. Rajurkar *, R.C. Joshi and Sananu Chaudhary 3 Dep of Compuer

More information

MATH Differential Equations September 15, 2008 Project 1, Fall 2008 Due: September 24, 2008

MATH Differential Equations September 15, 2008 Project 1, Fall 2008 Due: September 24, 2008 MATH 5 - Differenial Equaions Sepember 15, 8 Projec 1, Fall 8 Due: Sepember 4, 8 Lab 1.3 - Logisics Populaion Models wih Harvesing For his projec we consider lab 1.3 of Differenial Equaions pages 146 o

More information

Representing Non-Manifold Shapes in Arbitrary Dimensions

Representing Non-Manifold Shapes in Arbitrary Dimensions Represening Non-Manifold Shapes in Arbirary Dimensions Leila De Floriani,2 and Annie Hui 2 DISI, Universiy of Genova, Via Dodecaneso, 35-646 Genova (Ialy). 2 Deparmen of Compuer Science, Universiy of Maryland,

More information

Definition and examples of time series

Definition and examples of time series Definiion and examples of ime series A ime series is a sequence of daa poins being recorded a specific imes. Formally, le,,p be a probabiliy space, and T an index se. A real valued sochasic process is

More information

Design Alternatives for a Thin Lens Spatial Integrator Array

Design Alternatives for a Thin Lens Spatial Integrator Array Egyp. J. Solids, Vol. (7), No. (), (004) 75 Design Alernaives for a Thin Lens Spaial Inegraor Array Hala Kamal *, Daniel V azquez and Javier Alda and E. Bernabeu Opics Deparmen. Universiy Compluense of

More information

Visual Indoor Localization with a Floor-Plan Map

Visual Indoor Localization with a Floor-Plan Map Visual Indoor Localizaion wih a Floor-Plan Map Hang Chu Dep. of ECE Cornell Universiy Ihaca, NY 14850 hc772@cornell.edu Absrac In his repor, a indoor localizaion mehod is presened. The mehod akes firsperson

More information

Learning in Games via Opponent Strategy Estimation and Policy Search

Learning in Games via Opponent Strategy Estimation and Policy Search Learning in Games via Opponen Sraegy Esimaion and Policy Search Yavar Naddaf Deparmen of Compuer Science Universiy of Briish Columbia Vancouver, BC yavar@naddaf.name Nando de Freias (Supervisor) Deparmen

More information

Real Time Integral-Based Structural Health Monitoring

Real Time Integral-Based Structural Health Monitoring Real Time Inegral-Based Srucural Healh Monioring The nd Inernaional Conference on Sensing Technology ICST 7 J. G. Chase, I. Singh-Leve, C. E. Hann, X. Chen Deparmen of Mechanical Engineering, Universiy

More information

AUTOMATIC 3D FACE REGISTRATION WITHOUT INITIALIZATION

AUTOMATIC 3D FACE REGISTRATION WITHOUT INITIALIZATION Chaper 3 AUTOMATIC 3D FACE REGISTRATION WITHOUT INITIALIZATION A. Koschan, V. R. Ayyagari, F. Boughorbel, and M. A. Abidi Imaging, Roboics, and Inelligen Sysems Laboraory, The Universiy of Tennessee, 334

More information

STRING DESCRIPTIONS OF DATA FOR DISPLAY*

STRING DESCRIPTIONS OF DATA FOR DISPLAY* SLAC-PUB-383 January 1968 STRING DESCRIPTIONS OF DATA FOR DISPLAY* J. E. George and W. F. Miller Compuer Science Deparmen and Sanford Linear Acceleraor Cener Sanford Universiy Sanford, California Absrac

More information

Today. Curves & Surfaces. Can We Disguise the Facets? Limitations of Polygonal Meshes. Better, but not always good enough

Today. Curves & Surfaces. Can We Disguise the Facets? Limitations of Polygonal Meshes. Better, but not always good enough Today Curves & Surfaces Moivaion Limiaions of Polygonal Models Some Modeling Tools & Definiions Curves Surfaces / Paches Subdivision Surfaces Limiaions of Polygonal Meshes Can We Disguise he Faces? Planar

More information

Evaluation and Improvement of Region-based Motion Segmentation

Evaluation and Improvement of Region-based Motion Segmentation Evaluaion and Improvemen of Region-based Moion Segmenaion Mark Ross Universiy Koblenz-Landau, Insiue of Compuaional Visualisics, Universiässraße 1, 56070 Koblenz, Germany Email: ross@uni-koblenz.de Absrac

More information

Image segmentation. Motivation. Objective. Definitions. A classification of segmentation techniques. Assumptions for thresholding

Image segmentation. Motivation. Objective. Definitions. A classification of segmentation techniques. Assumptions for thresholding Moivaion Image segmenaion Which pixels belong o he same objec in an image/video sequence? (spaial segmenaion) Which frames belong o he same video sho? (emporal segmenaion) Which frames belong o he same

More information

NEWTON S SECOND LAW OF MOTION

NEWTON S SECOND LAW OF MOTION Course and Secion Dae Names NEWTON S SECOND LAW OF MOTION The acceleraion of an objec is defined as he rae of change of elociy. If he elociy changes by an amoun in a ime, hen he aerage acceleraion during

More information

A Hierarchical Object Recognition System Based on Multi-scale Principal Curvature Regions

A Hierarchical Object Recognition System Based on Multi-scale Principal Curvature Regions A Hierarchical Objec Recogniion Sysem Based on Muli-scale Principal Curvaure Regions Wei Zhang, Hongli Deng, Thomas G Dieerich and Eric N Morensen School of Elecrical Engineering and Compuer Science Oregon

More information

IntentSearch:Capturing User Intention for One-Click Internet Image Search

IntentSearch:Capturing User Intention for One-Click Internet Image Search JOURNAL OF L A T E X CLASS FILES, VOL. 6, NO. 1, JANUARY 2010 1 InenSearch:Capuring User Inenion for One-Click Inerne Image Search Xiaoou Tang, Fellow, IEEE, Ke Liu, Jingyu Cui, Suden Member, IEEE, Fang

More information

Last Time: Curves & Surfaces. Today. Questions? Limitations of Polygonal Meshes. Can We Disguise the Facets?

Last Time: Curves & Surfaces. Today. Questions? Limitations of Polygonal Meshes. Can We Disguise the Facets? Las Time: Curves & Surfaces Expeced value and variance Mone-Carlo in graphics Imporance sampling Sraified sampling Pah Tracing Irradiance Cache Phoon Mapping Quesions? Today Moivaion Limiaions of Polygonal

More information

Computer representations of piecewise

Computer representations of piecewise Edior: Gabriel Taubin Inroducion o Geomeric Processing hrough Opimizaion Gabriel Taubin Brown Universiy Compuer represenaions o piecewise smooh suraces have become vial echnologies in areas ranging rom

More information

Nonparametric CUSUM Charts for Process Variability

Nonparametric CUSUM Charts for Process Variability Journal of Academia and Indusrial Research (JAIR) Volume 3, Issue June 4 53 REEARCH ARTICLE IN: 78-53 Nonparameric CUUM Chars for Process Variabiliy D.M. Zombade and V.B. Ghue * Dep. of aisics, Walchand

More information

SOT: Compact Representation for Triangle and Tetrahedral Meshes

SOT: Compact Representation for Triangle and Tetrahedral Meshes SOT: Compac Represenaion for Triangle and Terahedral Meshes Topraj Gurung and Jarek Rossignac School of Ineracive Compuing, College of Compuing, Georgia Insiue of Technology, Alana, GA ABSTRACT The Corner

More information

In fmri a Dual Echo Time EPI Pulse Sequence Can Induce Sources of Error in Dynamic Magnetic Field Maps

In fmri a Dual Echo Time EPI Pulse Sequence Can Induce Sources of Error in Dynamic Magnetic Field Maps In fmri a Dual Echo Time EPI Pulse Sequence Can Induce Sources of Error in Dynamic Magneic Field Maps A. D. Hahn 1, A. S. Nencka 1 and D. B. Rowe 2,1 1 Medical College of Wisconsin, Milwaukee, WI, Unied

More information

LAMP: 3D Layered, Adaptive-resolution and Multiperspective Panorama - a New Scene Representation

LAMP: 3D Layered, Adaptive-resolution and Multiperspective Panorama - a New Scene Representation Submission o Special Issue of CVIU on Model-based and Image-based 3D Scene Represenaion for Ineracive Visualizaion LAMP: 3D Layered, Adapive-resoluion and Muliperspecive Panorama - a New Scene Represenaion

More information

X-Splines : A Spline Model Designed for the End-User

X-Splines : A Spline Model Designed for the End-User X-Splines : A Spline Model Designed for he End-User Carole Blanc Chrisophe Schlic LaBRI 1 cours de la libéraion, 40 alence (France) [blancjschlic]@labri.u-bordeaux.fr Absrac his paper presens a new model

More information

The Impact of Product Development on the Lifecycle of Defects

The Impact of Product Development on the Lifecycle of Defects The Impac of Produc Developmen on he Lifecycle of Rudolf Ramler Sofware Compeence Cener Hagenberg Sofware Park 21 A-4232 Hagenberg, Ausria +43 7236 3343 872 rudolf.ramler@scch.a ABSTRACT This paper invesigaes

More information

4 Error Control. 4.1 Issues with Reliable Protocols

4 Error Control. 4.1 Issues with Reliable Protocols 4 Error Conrol Jus abou all communicaion sysems aemp o ensure ha he daa ges o he oher end of he link wihou errors. Since i s impossible o build an error-free physical layer (alhough some shor links can

More information

Open Access Research on an Improved Medical Image Enhancement Algorithm Based on P-M Model. Luo Aijing 1 and Yin Jin 2,* u = div( c u ) u

Open Access Research on an Improved Medical Image Enhancement Algorithm Based on P-M Model. Luo Aijing 1 and Yin Jin 2,* u = div( c u ) u Send Orders for Reprins o reprins@benhamscience.ae The Open Biomedical Engineering Journal, 5, 9, 9-3 9 Open Access Research on an Improved Medical Image Enhancemen Algorihm Based on P-M Model Luo Aijing

More information

Network management and QoS provisioning - QoS in Frame Relay. . packet switching with virtual circuit service (virtual circuits are bidirectional);

Network management and QoS provisioning - QoS in Frame Relay. . packet switching with virtual circuit service (virtual circuits are bidirectional); QoS in Frame Relay Frame relay characerisics are:. packe swiching wih virual circui service (virual circuis are bidirecional);. labels are called DLCI (Daa Link Connecion Idenifier);. for connecion is

More information

A Fast Non-Uniform Knots Placement Method for B-Spline Fitting

A Fast Non-Uniform Knots Placement Method for B-Spline Fitting 2015 IEEE Inernaional Conference on Advanced Inelligen Mecharonics (AIM) July 7-11, 2015. Busan, Korea A Fas Non-Uniform Knos Placemen Mehod for B-Spline Fiing T. Tjahjowidodo, VT. Dung, and ML. Han Absrac

More information

Research Article Auto Coloring with Enhanced Character Registration

Research Article Auto Coloring with Enhanced Character Registration Compuer Games Technology Volume 2008, Aricle ID 35398, 7 pages doi:0.55/2008/35398 Research Aricle Auo Coloring wih Enhanced Characer Regisraion Jie Qiu, Hock Soon Seah, Feng Tian, Quan Chen, Zhongke Wu,

More information

Improving the Efficiency of Dynamic Service Provisioning in Transport Networks with Scheduled Services

Improving the Efficiency of Dynamic Service Provisioning in Transport Networks with Scheduled Services Improving he Efficiency of Dynamic Service Provisioning in Transpor Neworks wih Scheduled Services Ralf Hülsermann, Monika Jäger and Andreas Gladisch Technologiezenrum, T-Sysems, Goslarer Ufer 35, D-1585

More information

Feature-Preserving Reconstruction of Singular Surfaces

Feature-Preserving Reconstruction of Singular Surfaces Eurographics Symposium on Geomery Processing 2012 Eian Grinspun and Niloy Mira (Gues Ediors) Volume 31 (2012), Number 5 Feaure-Preserving Reconsrucion of Singular Surfaces T. K. Dey 1 and X. Ge 1 and Q.

More information

A Fast Stereo-Based Multi-Person Tracking using an Approximated Likelihood Map for Overlapping Silhouette Templates

A Fast Stereo-Based Multi-Person Tracking using an Approximated Likelihood Map for Overlapping Silhouette Templates A Fas Sereo-Based Muli-Person Tracking using an Approximaed Likelihood Map for Overlapping Silhouee Templaes Junji Saake Jun Miura Deparmen of Compuer Science and Engineering Toyohashi Universiy of Technology

More information

Detection and segmentation of moving objects in highly dynamic scenes

Detection and segmentation of moving objects in highly dynamic scenes Deecion and segmenaion of moving objecs in highly dynamic scenes Aurélie Bugeau Parick Pérez INRIA, Cenre Rennes - Breagne Alanique Universié de Rennes, Campus de Beaulieu, 35 042 Rennes Cedex, France

More information

Schedule. Curves & Surfaces. Questions? Last Time: Today. Limitations of Polygonal Meshes. Acceleration Data Structures.

Schedule. Curves & Surfaces. Questions? Last Time: Today. Limitations of Polygonal Meshes. Acceleration Data Structures. Schedule Curves & Surfaces Sunday Ocober 5 h, * 3-5 PM *, Room TBA: Review Session for Quiz 1 Exra Office Hours on Monday (NE43 Graphics Lab) Tuesday Ocober 7 h : Quiz 1: In class 1 hand-wrien 8.5x11 shee

More information

Voltair Version 2.5 Release Notes (January, 2018)

Voltair Version 2.5 Release Notes (January, 2018) Volair Version 2.5 Release Noes (January, 2018) Inroducion 25-Seven s new Firmware Updae 2.5 for he Volair processor is par of our coninuing effors o improve Volair wih new feaures and capabiliies. For

More information

Digital Geometry Processing Differential Geometry

Digital Geometry Processing Differential Geometry Digial Geomery Processing Differenial Geomery Moivaion Undersand he srucure of he surface Differenial Geomery Properies: smoohness, curviness, imporan direcions How o modify he surface o change hese properies

More information

Precise Voronoi Cell Extraction of Free-form Rational Planar Closed Curves

Precise Voronoi Cell Extraction of Free-form Rational Planar Closed Curves Precise Voronoi Cell Exracion of Free-form Raional Planar Closed Curves Iddo Hanniel, Ramanahan Muhuganapahy, Gershon Elber Deparmen of Compuer Science Technion, Israel Insiue of Technology Haifa 32000,

More information

In Proceedings of CVPR '96. Structure and Motion of Curved 3D Objects from. using these methods [12].

In Proceedings of CVPR '96. Structure and Motion of Curved 3D Objects from. using these methods [12]. In Proceedings of CVPR '96 Srucure and Moion of Curved 3D Objecs from Monocular Silhouees B Vijayakumar David J Kriegman Dep of Elecrical Engineering Yale Universiy New Haven, CT 652-8267 Jean Ponce Compuer

More information

Assignment 2. Due Monday Feb. 12, 10:00pm.

Assignment 2. Due Monday Feb. 12, 10:00pm. Faculy of rs and Science Universiy of Torono CSC 358 - Inroducion o Compuer Neworks, Winer 218, LEC11 ssignmen 2 Due Monday Feb. 12, 1:pm. 1 Quesion 1 (2 Poins): Go-ack n RQ In his quesion, we review how

More information

DAGM 2011 Tutorial on Convex Optimization for Computer Vision

DAGM 2011 Tutorial on Convex Optimization for Computer Vision DAGM 2011 Tuorial on Convex Opimizaion for Compuer Vision Par 3: Convex Soluions for Sereo and Opical Flow Daniel Cremers Compuer Vision Group Technical Universiy of Munich Graz Universiy of Technology

More information

Time Expression Recognition Using a Constituent-based Tagging Scheme

Time Expression Recognition Using a Constituent-based Tagging Scheme Track: Web Conen Analysis, Semanics and Knowledge Time Expression Recogniion Using a Consiuen-based Tagging Scheme Xiaoshi Zhong and Erik Cambria School of Compuer Science and Engineering Nanyang Technological

More information

Improved TLD Algorithm for Face Tracking

Improved TLD Algorithm for Face Tracking Absrac Improved TLD Algorihm for Face Tracking Huimin Li a, Chaojing Yu b and Jing Chen c Chongqing Universiy of Poss and Telecommunicaions, Chongqing 400065, China a li.huimin666@163.com, b 15023299065@163.com,

More information

A Face Detection Method Based on Skin Color Model

A Face Detection Method Based on Skin Color Model A Face Deecion Mehod Based on Skin Color Model Dazhi Zhang Boying Wu Jiebao Sun Qinglei Liao Deparmen of Mahemaics Harbin Insiue of Technology Harbin China 150000 Zhang_dz@163.com mahwby@hi.edu.cn sunjiebao@om.com

More information

COSC 3213: Computer Networks I Chapter 6 Handout # 7

COSC 3213: Computer Networks I Chapter 6 Handout # 7 COSC 3213: Compuer Neworks I Chaper 6 Handou # 7 Insrucor: Dr. Marvin Mandelbaum Deparmen of Compuer Science York Universiy F05 Secion A Medium Access Conrol (MAC) Topics: 1. Muliple Access Communicaions:

More information

Robust Segmentation and Tracking of Colored Objects in Video

Robust Segmentation and Tracking of Colored Objects in Video IEEE TRANSACTIONS ON CSVT, VOL. 4, NO. 6, 2004 Robus Segmenaion and Tracking of Colored Objecs in Video Theo Gevers, member, IEEE Absrac Segmening and racking of objecs in video is of grea imporance for

More information

Gender Classification of Faces Using Adaboost*

Gender Classification of Faces Using Adaboost* Gender Classificaion of Faces Using Adaboos* Rodrigo Verschae 1,2,3, Javier Ruiz-del-Solar 1,2, and Mauricio Correa 1,2 1 Deparmen of Elecrical Engineering, Universidad de Chile 2 Cener for Web Research,

More information

FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS

FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS Mohammed A. Aseeri and M. I. Sobhy Deparmen of Elecronics, The Universiy of Ken a Canerbury Canerbury, Ken, CT2

More information

Video-Based Face Recognition Using Probabilistic Appearance Manifolds

Video-Based Face Recognition Using Probabilistic Appearance Manifolds Video-Based Face Recogniion Using Probabilisic Appearance Manifolds Kuang-Chih Lee Jeffrey Ho Ming-Hsuan Yang David Kriegman klee10@uiuc.edu jho@cs.ucsd.edu myang@honda-ri.com kriegman@cs.ucsd.edu Compuer

More information

Coded Caching with Multiple File Requests

Coded Caching with Multiple File Requests Coded Caching wih Muliple File Requess Yi-Peng Wei Sennur Ulukus Deparmen of Elecrical and Compuer Engineering Universiy of Maryland College Park, MD 20742 ypwei@umd.edu ulukus@umd.edu Absrac We sudy a

More information

A High-Speed Adaptive Multi-Module Structured Light Scanner

A High-Speed Adaptive Multi-Module Structured Light Scanner A High-Speed Adapive Muli-Module Srucured Ligh Scanner Andreas Griesser 1 Luc Van Gool 1,2 1 Swiss Fed.Ins.of Techn.(ETH) 2 Kaholieke Univ. Leuven D-ITET/Compuer Vision Lab ESAT/VISICS Zürich, Swizerland

More information

An Adaptive Spatial Depth Filter for 3D Rendering IP

An Adaptive Spatial Depth Filter for 3D Rendering IP JOURNAL OF SEMICONDUCTOR TECHNOLOGY AND SCIENCE, VOL.3, NO. 4, DECEMBER, 23 175 An Adapive Spaial Deph Filer for 3D Rendering IP Chang-Hyo Yu and Lee-Sup Kim Absrac In his paper, we presen a new mehod

More information

Probabilistic Detection and Tracking of Motion Discontinuities

Probabilistic Detection and Tracking of Motion Discontinuities Probabilisic Deecion and Tracking of Moion Disconinuiies Michael J. Black David J. Flee Xerox Palo Alo Research Cener 3333 Coyoe Hill Road Palo Alo, CA 94304 fblack,fleeg@parc.xerox.com hp://www.parc.xerox.com/fblack,fleeg/

More information

Joint Feature Learning With Robust Local Ternary Pattern for Face Recognition

Joint Feature Learning With Robust Local Ternary Pattern for Face Recognition Join Feaure Learning Wih Robus Local Ternary Paern for Face Recogniion Yuvaraju.M 1, Shalini.S 1 Assisan Professor, Deparmen of Elecrical and Elecronics Engineering, Anna Universiy Regional Campus, Coimbaore,

More information

Real-time 2D Video/3D LiDAR Registration

Real-time 2D Video/3D LiDAR Registration Real-ime 2D Video/3D LiDAR Regisraion C. Bodenseiner Fraunhofer IOSB chrisoph.bodenseiner@iosb.fraunhofer.de M. Arens Fraunhofer IOSB michael.arens@iosb.fraunhofer.de Absrac Progress in LiDAR scanning

More information

Chapter 3 MEDIA ACCESS CONTROL

Chapter 3 MEDIA ACCESS CONTROL Chaper 3 MEDIA ACCESS CONTROL Overview Moivaion SDMA, FDMA, TDMA Aloha Adapive Aloha Backoff proocols Reservaion schemes Polling Disribued Compuing Group Mobile Compuing Summer 2003 Disribued Compuing

More information

Real-Time Non-Rigid Multi-Frame Depth Video Super-Resolution

Real-Time Non-Rigid Multi-Frame Depth Video Super-Resolution Real-Time Non-Rigid Muli-Frame Deph Video Super-Resoluion Kassem Al Ismaeil 1, Djamila Aouada 1, Thomas Solignac 2, Bruno Mirbach 2, Björn Oersen 1 1 Inerdisciplinary Cenre for Securiy, Reliabiliy, and

More information

Fill in the following table for the functions shown below.

Fill in the following table for the functions shown below. By: Carl H. Durney and Neil E. Coer Example 1 EX: Fill in he following able for he funcions shown below. he funcion is odd he funcion is even he funcion has shif-flip symmery he funcion has quarer-wave

More information

Why not experiment with the system itself? Ways to study a system System. Application areas. Different kinds of systems

Why not experiment with the system itself? Ways to study a system System. Application areas. Different kinds of systems Simulaion Wha is simulaion? Simple synonym: imiaion We are ineresed in sudying a Insead of experimening wih he iself we experimen wih a model of he Experimen wih he Acual Ways o sudy a Sysem Experimen

More information

Quantitative macro models feature an infinite number of periods A more realistic (?) view of time

Quantitative macro models feature an infinite number of periods A more realistic (?) view of time INFINIE-HORIZON CONSUMPION-SAVINGS MODEL SEPEMBER, Inroducion BASICS Quaniaive macro models feaure an infinie number of periods A more realisic (?) view of ime Infinie number of periods A meaphor for many

More information

Chapter 4 Sequential Instructions

Chapter 4 Sequential Instructions Chaper 4 Sequenial Insrucions The sequenial insrucions of FBs-PLC shown in his chaper are also lised in secion 3.. Please refer o Chaper, "PLC Ladder diagram and he Coding rules of Mnemonic insrucion",

More information

Audio Engineering Society. Convention Paper. Presented at the 119th Convention 2005 October 7 10 New York, New York USA

Audio Engineering Society. Convention Paper. Presented at the 119th Convention 2005 October 7 10 New York, New York USA Audio Engineering Sociey Convenion Paper Presened a he 119h Convenion 2005 Ocober 7 10 New Yor, New Yor USA This convenion paper has been reproduced from he auhor's advance manuscrip, wihou ediing, correcions,

More information

Image Based Computer-Aided Manufacturing Technology

Image Based Computer-Aided Manufacturing Technology Sensors & Transducers 03 by IFSA hp://www.sensorsporal.com Image Based Compuer-Aided Manufacuring Technology Zhanqi HU Xiaoqin ZHANG Jinze LI Wei LI College of Mechanical Engineering Yanshan Universiy

More information

Simultaneous Precise Solutions to the Visibility Problem of Sculptured Models

Simultaneous Precise Solutions to the Visibility Problem of Sculptured Models Simulaneous Precise Soluions o he Visibiliy Problem of Sculpured Models Joon-Kyung Seong 1, Gershon Elber 2, and Elaine Cohen 1 1 Universiy of Uah, Sal Lake Ciy, UT84112, USA, seong@cs.uah.edu, cohen@cs.uah.edu

More information

Rule-Based Multi-Query Optimization

Rule-Based Multi-Query Optimization Rule-Based Muli-Query Opimizaion Mingsheng Hong Dep. of Compuer cience Cornell Universiy mshong@cs.cornell.edu Johannes Gehrke Dep. of Compuer cience Cornell Universiy johannes@cs.cornell.edu Mirek Riedewald

More information

Handling uncertainty in semantic information retrieval process

Handling uncertainty in semantic information retrieval process Handling uncerainy in semanic informaion rerieval process Chkiwa Mounira 1, Jedidi Anis 1 and Faiez Gargouri 1 1 Mulimedia, InfoRmaion sysems and Advanced Compuing Laboraory Sfax Universiy, Tunisia m.chkiwa@gmail.com,

More information

The Roots of Lisp paul graham

The Roots of Lisp paul graham The Roos of Lisp paul graham Draf, January 18, 2002. In 1960, John McCarhy published a remarkable paper in which he did for programming somehing like wha Euclid did for geomery. 1 He showed how, given

More information

Relevance Ranking using Kernels

Relevance Ranking using Kernels Relevance Ranking using Kernels Jun Xu 1, Hang Li 1, and Chaoliang Zhong 2 1 Microsof Research Asia, 4F Sigma Cener, No. 49 Zhichun Road, Beijing, China 100190 2 Beijing Universiy of Poss and Telecommunicaions,

More information

Rao-Blackwellized Particle Filtering for Probing-Based 6-DOF Localization in Robotic Assembly

Rao-Blackwellized Particle Filtering for Probing-Based 6-DOF Localization in Robotic Assembly MITSUBISHI ELECTRIC RESEARCH LABORATORIES hp://www.merl.com Rao-Blackwellized Paricle Filering for Probing-Based 6-DOF Localizaion in Roboic Assembly Yuichi Taguchi, Tim Marks, Haruhisa Okuda TR1-8 June

More information

Low-Cost WLAN based. Dr. Christian Hoene. Computer Science Department, University of Tübingen, Germany

Low-Cost WLAN based. Dr. Christian Hoene. Computer Science Department, University of Tübingen, Germany Low-Cos WLAN based Time-of-fligh fligh Trilaeraion Precision Indoor Personnel Locaion and Tracking for Emergency Responders Third Annual Technology Workshop, Augus 5, 2008 Worceser Polyechnic Insiue, Worceser,

More information

IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS PART A: SYSTEMS AND HUMANS 1

IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS PART A: SYSTEMS AND HUMANS 1 TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS PART A: SYSTEMS AND HUMANS 1 Adapive Appearance Model and Condensaion Algorihm for Robus Face Tracking Yui Man Lui, Suden Member,, J. Ross Beveridge, Member,,

More information

Lemonia Ragia and Stephan Winter 1 CONTRIBUTIONS TO A QUALITY DESCRIPTION OF AREAL OBJECTS IN SPATIAL DATA SETS

Lemonia Ragia and Stephan Winter 1 CONTRIBUTIONS TO A QUALITY DESCRIPTION OF AREAL OBJECTS IN SPATIAL DATA SETS D. Frisch, M. Englich & M. Seser, eds, 'IAPRS', Vol. 32/, ISPRS Commission IV Symposium on GIS - Beween Visions and Applicaions, Sugar, Germany. Lemonia Ragia and Sephan Winer 1 CONTRIBUTIONS TO A QUALITY

More information

A non-stationary uniform tension controlled interpolating 4-point scheme reproducing conics

A non-stationary uniform tension controlled interpolating 4-point scheme reproducing conics A non-saionary uniform ension conrolled inerpolaing 4-poin scheme reproducing conics C. Beccari a, G. Casciola b, L. Romani b, a Deparmen of Pure and Applied Mahemaics, Universiy of Padova, Via G. Belzoni

More information

A time-space consistency solution for hardware-in-the-loop simulation system

A time-space consistency solution for hardware-in-the-loop simulation system Inernaional Conference on Advanced Elecronic Science and Technology (AEST 206) A ime-space consisency soluion for hardware-in-he-loop simulaion sysem Zexin Jiang a Elecric Power Research Insiue of Guangdong

More information

Simple Network Management Based on PHP and SNMP

Simple Network Management Based on PHP and SNMP Simple Nework Managemen Based on PHP and SNMP Krasimir Trichkov, Elisavea Trichkova bsrac: This paper aims o presen simple mehod for nework managemen based on SNMP - managemen of Cisco rouer. The paper

More information

MOTION DETECTORS GRAPH MATCHING LAB PRE-LAB QUESTIONS

MOTION DETECTORS GRAPH MATCHING LAB PRE-LAB QUESTIONS NME: TE: LOK: MOTION ETETORS GRPH MTHING L PRE-L QUESTIONS 1. Read he insrucions, and answer he following quesions. Make sure you resae he quesion so I don hae o read he quesion o undersand he answer..

More information

A METHOD OF MODELING DEFORMATION OF AN OBJECT EMPLOYING SURROUNDING VIDEO CAMERAS

A METHOD OF MODELING DEFORMATION OF AN OBJECT EMPLOYING SURROUNDING VIDEO CAMERAS A METHOD OF MODELING DEFORMATION OF AN OBJECT EMLOYING SURROUNDING IDEO CAMERAS Joo Kooi TAN, Seiji ISHIKAWA Deparmen of Mechanical and Conrol Engineering Kushu Insiue of Technolog, Japan ehelan@is.cnl.kuech.ac.jp,

More information

Gauss-Jordan Algorithm

Gauss-Jordan Algorithm Gauss-Jordan Algorihm The Gauss-Jordan algorihm is a sep by sep procedure for solving a sysem of linear equaions which may conain any number of variables and any number of equaions. The algorihm is carried

More information

Analysis of Various Types of Bugs in the Object Oriented Java Script Language Coding

Analysis of Various Types of Bugs in the Object Oriented Java Script Language Coding Indian Journal of Science and Technology, Vol 8(21), DOI: 10.17485/ijs/2015/v8i21/69958, Sepember 2015 ISSN (Prin) : 0974-6846 ISSN (Online) : 0974-5645 Analysis of Various Types of Bugs in he Objec Oriened

More information

Algorithm for image reconstruction in multi-slice helical CT

Algorithm for image reconstruction in multi-slice helical CT Algorihm for image reconsrucion in muli-slice helical CT Kasuyuki Taguchi a) and Hiroshi Aradae Medical Engineering Laboraory, Toshiba Corporaion, 1385 Shimoishigami, Oawara, Tochigi 324-855, Japan Received

More information

A Review on Block Matching Motion Estimation and Automata Theory based Approaches for Fractal Coding

A Review on Block Matching Motion Estimation and Automata Theory based Approaches for Fractal Coding Regular Issue A Review on Block Maching Moion Esimaion and Auomaa Theory based Approaches for Fracal Coding Shailesh D Kamble 1, Nileshsingh V Thakur 2, and Preei R Bajaj 3 1 Compuer Science & Engineering,

More information

Motor Control. 5. Control. Motor Control. Motor Control

Motor Control. 5. Control. Motor Control. Motor Control 5. Conrol In his chaper we will do: Feedback Conrol On/Off Conroller PID Conroller Moor Conrol Why use conrol a all? Correc or wrong? Supplying a cerain volage / pulsewidh will make he moor spin a a cerain

More information

An Iterative Scheme for Motion-Based Scene Segmentation

An Iterative Scheme for Motion-Based Scene Segmentation An Ieraive Scheme for Moion-Based Scene Segmenaion Alexander Bachmann and Hildegard Kuehne Deparmen for Measuremen and Conrol Insiue for Anhropomaics Universiy of Karlsruhe (H), 76 131 Karlsruhe, Germany

More information

Shortest Path Algorithms. Lecture I: Shortest Path Algorithms. Example. Graphs and Matrices. Setting: Dr Kieran T. Herley.

Shortest Path Algorithms. Lecture I: Shortest Path Algorithms. Example. Graphs and Matrices. Setting: Dr Kieran T. Herley. Shores Pah Algorihms Background Seing: Lecure I: Shores Pah Algorihms Dr Kieran T. Herle Deparmen of Compuer Science Universi College Cork Ocober 201 direced graph, real edge weighs Le he lengh of a pah

More information

GrowCut - Interactive Multi-Label N-D Image Segmentation By Cellular Automata

GrowCut - Interactive Multi-Label N-D Image Segmentation By Cellular Automata GrowCu - Ineracive Muli-Label N-D Image Segmenaion By Cellular Auomaa Vladimir Vezhneves Vadim Konouchine Graphics and Media Laboraory Faculy of Compuaional Mahemaics and Cyberneics Moscow Sae Universiy,

More information