EXTRACTION OF MAIN AND SECONDARY ROADS IN VHR IMAGES USING A HIGHER-ORDER PHASE FIELD MODEL
|
|
- William McDowell
- 5 years ago
- Views:
Transcription
1 EXTRACTION OF MAIN AND SECONDARY ROADS IN VHR IMAGES USING A HIGHER-ORDER PHASE FIELD MODEL Ting Peng a,b, Ian H. Jermyn b, Véronique Prinet a, Josiane Zerubia b a LIAMA & PR, Institute of Automation, Chinese Acaemy of Sciences, Beijing 0090, China (tpeng, prinet)@nlpr.ia.ac.cn b Project-Team Ariana, INRIA/I3S, 0690 Sophia Antipolis, France (tpeng, ijermyn, jzerubia)@sophia.inria.fr KEY WORDS: Roa, Urban, Satellite, Segmentation, Moelling, Variational methos ABSTRACT: This paper aresses the issue of extracting main an seconary roa networks in ense urban areas from very high resolution (VHR, ~0.6m) satellite images. The ifficulty with seconary roas lies in the low iscriminative power of the grey-level istributions of roa regions an the backgroun, an the greater effect of occlusions an other noise on narrower roas. To tackle this problem, we use a previously evelope higher-orer active contour (HOAC) phase fiel moel an augment it with an aitional non-linear non-local term. The aitional term allows separate control of roa with an roa curvature; thus more precise prior knowlege can be incorporate, an better roa prolongation can be achieve for the same with. Promising results on QuickBir panchromatic images at reuce resolutions an comparisons with other moels emonstrate the role an the efficiency of our new moel.. INTRODUCTION Roa extraction from remotely sense imagery has been extensively stuie for the last few ecaes ue to the variety an importance of the potential applications of an automatic extraction metho. While a great number of approaches exist in the literature (Fortier et al., 999, Mena, 003), the evelopment of reliable proceures is still a challenge. The relative failure of existing approaches stems from the complexity of the image scene, i.e. the variety of 'objects' (cars, builings, shaows...) that it contains. Existing algorithms can be classifie into three main categories, accoring to strategy: bottom-up, top-own, an combine. A bottom-up strategy assumes that first basic features are etecte, an then constraints are progressively ae, up to higher-level recognition. This category inclues mathematical morphology (Zhang et al., 999), knowlege representation an reasoning (Wang an Newkirk, 988), an roa tracking (Geman an Jeynak, 996, Merlet an Zerubia, 996). Due to their high sensitivity to nuisance factors, bottomup methos show strong limitations, an in general, low robustness. A top-own strategy moels the objects, an then searches for them in the image. Examples inclue active contours (Fortier et al., 00, Mayer et al., 998) an marke point processes (Stoica et al., 004, Lacoste et al., 005). These methos are relatively less sensitive to incomplete an ambiguous information, but the computations neee are usually expensive. In fact, the borerline between the two strategies is not clear. Most methos make use of both bottom-up an top-own processing. In aition, there are also "transversal" techniques, for instance, multi-scale analysis (Mayer et al., 998), neural networks (Bhattacharya an Parui, 997), Kalman filters (Vosselman an e Knecht, 995), an so on. The algorithms mentione above are mostly restricte to lowresolution images, an particularly to rural an semi-urban areas, where the roa network is reaily visible, with little shaow an few occlusion artefacts compare to inner cities. For very high resolution (VHR) imagery in ense urban areas, the complexity of the image scenes, which contain many roalike features in the backgroun, unesire noise on the roa, an occlusions cause by trees an the shaows of high builings (see Figure ), often results in unreliable roa extraction. This is particularly true for seconary roas. Being narrower, they are more affecte by the various types of geometric noise present in the image; they are more easily completely occlue, for example. This suggests that more sophisticate roa moelling approaches must be evelope in orer to extract these types of roas in an urban context. Figure. A QuickBir panchromatic image (size = , 0.6m/pixel) of a ense urban area. In this paper, our goal is to extract the main an seconary roa networks in ense urban areas from VHR QuickBir panchromatic images. To o so, we introuce a novel nonlinear non-local higher-orer active contour (HOAC) phase fiel energy, base on the energy use for the extraction of main roa networks in (Peng et al., 007a). The new, non-linear term allows the long-range interactions between pairs of bounary points on opposite sies of a roa to have a ifferent magnitue an/or range from those between pairs of bounary points on the same sie of a roa. In practical terms, this allows separate control of roa with an roa curvature: the scale on which the roa is moelle as being 'straight' can be ifferent (usually it is larger) from the roa with, unlike the moel in (Peng et al., 007a). The effect of this more precise prior 5
2 knowlege is better roa prolongation an thus better extraction of those roas for which this prior knowlege is crucial, i.e. narrower roas. Promising results on QuickBir panchromatic images at reuce resolutions an comparisons with other moels emonstrate the role an the efficacy of our new moel. The paper is organise as follows. In section, we recall briefly the main principles of the HOAC phase fiel moel of (Peng et al., 007a), eicate to the extraction of main roa networks. Section 3 introuces the new, non-linear term that ifferentiates between interactions along the roa an across the roa, an thus enables more sophisticate prior knowlege to be inclue. We explain the optimization scheme in section 4. In section 5, the benefits of the new moel are illustrate via experiments on real QuickBir panchromatic images. Section 6 conclues.. HOAC MODEL FOR MAIN ROAD EXTRACTION In (Rochery et al., 006), HOACs were propose for roa network extraction from low to meium resolution images. In contrast to conventional active contours, HOACs incorporate long-range interactions between points on the contour (better calle the 'region bounary'), an thus encoe complex prior knowlege of roa network geometry. For this reason, HOACs are more robust, an can be initialize generically an hence automatically. In (Rochery et al., 005), 'phase fiels' were introuce for region moelling in image processing, an HOACs were reformulate as (non-local) phase fiel moels. We use the phase fiel framework in this paper, because it has several avantages over parametric active contours or stanar level set methos: a linear representation space; ease of implementation; a neutral initialization; an greater topological freeom. To aapt the original phase fiel HOAC moel of (Rochery et al., 005) to the extraction of the main roa network from VHR QuickBir panchromatic images, (Peng et al., 007b) first propose a multi-resolution ata energy to eal with the complexity of VHR images. For the purpose of further eliminating false etections in the backgroun, (Peng et al., 007a) introuce specific prior knowlege in the form of an outate GIS map, to complement the generic prior knowlege carrie by the HOAC prior. It has been experimentally emonstrate that for the main roas, at full resolution, this moel is able to keep the unchange roas, to correct the mistakes, an to extract new roas. However, it is still not capable of retrieving the narrower roas very accurately. In this section, we will briefly review the basic moel in (Rochery et al., 005). We wish to fin the region R in the image omain containing the roa network. The phase fiel framework represents a region by a functionφ : R, where R is the image omain. The functionφ efines a region via a threshol ζ : R = { x : φ( x ) > ζ}. To moel regions, we efine a functional of φ, E ( φ; I) = θe ( φ) + E ( I, φ), () M P D where I : R is the image ata, an θ balances the contributions of the prior energy, which moels the E P geometry of the region sought, i.e. in our case, the region containing the roa network, an the ata energy E, which D moels the image to be expecte given the region. Minimization of such a functional with respect to φ gives a minimizing function φ * *, an hence a region R. The functional * must be esigne so that R is the region sought. The prior term E P in (Rochery et al., 005) is the sum of two terms: a local phase fiel term E 0, an a non-local HOAC phase fiel term E : P, { φ W φ x } E ( φ) = x x ( x) )) (a) 0 φ ( ) + ( (, β x x' E, ( φ ) = P xx' φ ( x ) φ ( x ') Ψ( ), (b) where controls the range of the interaction. The potential functio n W is W z = λ z z + α z z ( ) ( ) ( ) (3) where λ an α are cons tants. The potential W effectively constrains φ( x) for x R an φ( x) for x R = \ R. As a result, the quantitiesφ = ( ± φ) / are approxi- mately equal to the characteristic functions of R an R. The local graient prouct φ( x) φ( x) smoothes this result. Hence, it prouces a narrow interface, which is centre aroun the region bounary R. The interaction function Ψ is ( r + sin( π r )) if r <, Ψ ( r) = π (4) 0 else. E P The energy is equivalent to an active contour moel whose,0 energy is a linear combination of region bounary length an region area. E escribes long-range interactions between the graient vectors of φ at pairs of points. Since φ is only nonzero in R, this is the same as long-range interactions between C pairs of region bounary points an their normal vectors. Its effect is to prevent pairs of bounary points with antiparallel normal vectors from coming too close, an to encourage the growth of arm-like shapes. Therefore, E favours regions P ± R C, 6
3 compose of long, low curvature 'arms' of roughly constant with that meet at junctions, i.e. it moels network structures. as from the back-groun. We moel the one point statistics of the image intensi-ties, i.e. their histograms. It consists of two parts: information from the roas an from the backgroun. E can be written as D D { } E ( I, φ) = x ln P ( I( x)) φ ( x) + ln P ( I( x)) φ ( x).(5) + + P ± are two-component Gaussian mixture istributions, moelling the image intensities, where + enotes the roas an - enotes the backgroun. Their parameters are learne on samples of roa an non-roa in the image by supervise learning. 3. NON-LINEAR TERM FOR SECONDARY ROAD EXTRACTION Compare to the main roas, the seconary roas are much more ifficult to eal with, for the following reasons. First, the raiometric properties of narrower roas are similar to those of the backgroun. Secon, narrower roas are more often obscure by shaows an trees, which can cause gaps in the extracte network. For both reasons, ata riven/bottom-up moels fail to retrieve the roas correctly: strong geometric prior information is neee. The network moel of equation (b) contains such prior knowlege, but it suffers from a limitation that is severe in the case of seconary roas: the interaction between points on opposite sies of a roa ( φ( x) φ( x') < 0) is of the same strength an range as the interaction between points on the same sie of a roa ( φ( x) φ( x') > 0). This means that the scale on which the roa is expecte to be straight is the same as the with of the roa, whereas in fact roa with gives only an (approximate) upper boun on the raius of curvature of the roa: most roas are straighter than they are wie. For narrow roas this is particularly problematic, since the roa region is relatively unconstraine ue to the small roa with. In particular, roa prolongation is short-range just when, ue to the effects of geometric noise mentione above, we want it to be long-range. In orer to change this situation, we nee to be able to moel longer-range, stronger interactions along the roa without changing the interactions across the roa, i.e. we have to separate the two interactions. In this section, we will achieve this goal by introucing a new energy term. To motivate this term, we return to the contour formulation. 3. Interaction functions The ata term E D takes into account the raiometric properties of ense urban areas, which iscriminate ro Since roas are elongate structures, the interaction between points on the same sie of a roa must have longer range (or be stronger, which often amounts to nearly the same thing) than the interaction between points on opposite sies of a roa. To achieve this goal, a straightforwar solution is to separate the interaction function along one sie of a roa Ψ from the one across a roa Ψ, as shown in Figure. In other wors, the // interaction function must epen on the tangent/normal vectors at the pairs of points that are its argument. Although the length scale in the interaction function,, coul be mae to epen on the inner prouct between the tangent/normal vectors at the two pixels, it woul lea to complicate functional erivatives. Alternatively, we prefer to perform a linear interpolation between two interaction functions. In the contour formulation, our new HOAC prior energy E takes the form: HO E ( γ) = ss' f ( γ( s) γ( s')) Ψ { PHO, S S f ( γ( s) γ( s')) Ψ, (6) // // w here γ : S, is an arc length parameterization of the region bounary R, instea of the entire image omain; γ () s is the tangent vector to the bounary at s (thus γ () s γ ( s') [,] ); ' 'enotes parallel vectors an ' //' enotes antiparallel vectors. f // ( x), f // ( x):[,] [0,] are two + linear functions: f ( x ) = ( + x ) /, (7a) + // f ( x ) = ( x ) /. (7b) // Ψ an Ψ are the same types of function as in equation (4), // but have ifferent range or magnitue. The two interaction functions compete with each other: when γ () s γ ( s') [0,], i.e. the two interacting tangent vectors are more parallel, Ψ is ominant; while when γ () s γ ( s') [,0], i.e. the two inter acting tangent vectors are more antiparalle l, Ψ is ominant. // To simplify the formulation, we ajust only the magnitue of the interaction (although this effectively changes its range also), an we further assume that the magnitue of the interaction of parallel vectors is stronger than that of antiparallel vectors, i.e. Ψ = aψ, where a >, is a constant. Equation (6) // becomes } Figure. The interactions an Ψ Ψ // 7
4 E ( γ) = ss' {[( a ) ( a ) ( s) ( s')] }.(8) PHO, + + γ γ Ψ // S S 3. Non-linear non-local HOAC phase fiel energy In orer to implement E ( γ ) in the phase fiel framework, it PHO, nees to be reformulate as a function of the phase fiel φ, instea of the arc length parameterization γ use in equation (8). To this en, we replace tangent vectors by normal vectors, an then normal vectors by φ. Subsequently, the range of interactions is extene from the region bounary R to the whole of the image omain. Due to the fact that φ( x) is approximately equal to zero everywhere outsie the narrow interface R C in, the bounary inicator function S( φ) = ( φ( x) φ( x))( φ( x') φ( x')), (9) is inserte into the first term of equation (8). Thus we have E ( φ) = xx' {[( a ) S( φ) PHO, x x' + ( a+ ) φ( x) φ( x')] Ψ( )}. (0) When a =, this reuces to the non-local HOAC phase fiel term E of equation (b) (up to a factor of β /). Therefore, we efine our new aitional energy term by β E xx S { x x' ( φ) = ' ( φ) Ψ( )}. () 4 stron-ger than that between pairs of points on opposite sies of a roa. 4. OPTIMIZATION We now want to fin the function φ that minimizes our new total energy E. Using graient escent, at convergence, the optimal etermines an estimate of the roa network. * φ Following (Rochery et al., 005), we use a neutral initialization, i.e. the initial value ofφ is set equal to a constant everywhere in. During the iterations, no re-initialization or regularization is require. To perform graient escent we nee only the functional erivative of E: δ E P = + + δφ( x) P 3 ln θ { φ ( x ) λ ( φ ( x ) φ ( x )) + ' ( ( )) ' ( ') ( x + α φ x + β x φ x Ψ x ) x x' + β [ φ( x) x'( φ( x') φ( x')) ( )]}. () Ψ The erivatives δ E P / δφ an δ E /, P, δφ are non-local. To avoi performing explicit convolutions, they are calculate in the Fourier omain. The resulting evolution equation is φ( x) P 3 ln + = + θ { φ ( x ) λ ( φ ( x ) φ ( x )) t P α( φ ( x)) + βf { k Ψˆ ( k) ˆ φ( k)} β φ( x) F { Ψˆ ( k) F{ φ( x) φ( x)}} β φ( x) { F { Ψˆ ( k) F{ φ( x) φ( x)}}}}, (3) Since the functional erivative of E will, unlike that of 4 E, contain a term non-linear inφ ue to S( φ) being O( φ ), we refer to it as the non-linear non-local term. We now efine our new moel as E = θ ( E + E + E ) + E. P,0 D Note that whether the two tangent/normal vectors at a pair of in-teracting points are parallel or antiparallel, the effect of E is always to encourage two points insie the range of the interac-tion to attract each other. Thus E reinforces the effect of E in the case that the tangent/normal vectors are parallel, an it partly annuls the effect of E in the case that the tan gent/normal vectors are antiparallel. Accoringly, the interaction between pairs of points on the same sie of a roa is F where F an enote the Fourier an the inverse Fourier transform respectively, an ^ inicates the Fourier transform of a variable. In the iscretize implementation, all erivatives are compute in the Fourier omain, while the time evolution uses the forwar Euler metho. The parameters of the prior energy, i.e. θ, α, λ, β, β, an are constraine by stability conitions that ensure that a long bar of a given with is a stable configuration of the moel. This enables a choice of λ, β, β, an base on the expecte roa with: only α an θ remain. 8
5 (a) (b) (c) () (e) Figure 3. Experiments at /4 resolution. 3(a)-3(b): image ata (size = , roa with = 3~5 pixels) an its partial enlargement. 3(c)-3(e): results obtaine using the energy E (with E ) at iterations,,500 an 7,000. (a) (b) (c) Figure 4. Experiments at /4 resolution. Left to right: results obtaine respectively using the energy E (without E M, likelihoo estimation, an a stanar, non-higher-orer active contour moel (with neither E nor E ). P ), maximum 5. RESULTS AND COMPARISONS In this section, we emonstrate the behaviour of our new moel containing the non-linear, non-local HOAC term E via experiments on real QuickBir panchromatic images in ense urban areas, at reuce resolutions. Figure 3(a) shows one of the input images at /4 resolution. Figure 3(b) shows its partial enlargement, to isplay the complexity remaining at this resolution. The parameters ( θ, α, λ, β, β, ) were (00, 0., 3.8, , , 4). The results obtaine using the energy with the new non-linear nonlocal term E at iterations,,500 an 7,000 are illustrate in Figures 3(c)-3(e). The result obtaine using the energy E P NE E M (without ) is shown in Figure 4(a). We see that aing, W E enables the recovery of the main an seconary roa network, whereas the moel without E misses a seconary roa. In orer to illustrate the effects of other terms in the moel, we compute results using maximum likelihoo estimation (i.e. θ = 0 ) an a stanar, non-higher- orer active contour, i.e. β = β = 0 (see Figures 4(b) an 4(c)). The MLE result shows that local image information alone is not sufficient to istinguish the roas from the backgroun, while the stanar active contour result shows the importance of the geometric knowlege introuce by HOACs. Quantitative evaluations base on stanar criteria (Heipke et al., 997) are shown in Table. Groun truth for the evaluations was segmente by han. On the other han, the computation time for the result in Figure 3 was aroun 80 minutes, which is consierably slower than the next nearest time, that obtaine with the moel E M (Figure 4(a)). Figure 5 presents more results at reuce resolutions. The first column shows the input image ata, which is either at /4 or / resolution. The two columns on the right show the corresponing results obtaine with an without the new non-linear, non-local term E. 9
6 The importance of E is clear: it facilitates greatly the retrieval of seconary roas. Image New moel E (Figure 3(e)) E ( β = 0 ) M (Figure 4(a)) θ E + E 0 D (Figure 4(c)) MLE ( θ = 0 ) (Figure 4(b)) Completeness TP/(TP+FN) Correctness TP/(TP+FP) Quality TP/(TP+FP+F N) Table. Quantitative evaluation criteria of the ifferent methos (T = True, F = False, P = Positive, N = Negative) 6. CONCLUSIONS Narrow seconary roas in VHR images are very ifficult to extract, because of occlusion effects an the similar raiometric properties of the roa region an backgroun. To tackle this problem, the incorporation of strong geometric prior knowlege of roa networks is essential. Builing upon previous work eicate to segmenting only main roa networks, we have presente, in this paper, a novel non-linear, non-local phase fiel term, an applie it to the extraction of main an seconary roa networks in VHR images. This novel term causes pairs of points insie the range of the interaction to attract each other. In conjunction with the original HOAC geometric term, it allows the interaction between points on the same sie of a roa to be stronger than the interaction between points on opposite sies of a roa. Therefore, the incorporation of the term enables the generation of longer arm-like branches an better prolongation. Experiments on roa network extraction from QuickBir panchromatic images in ense urban areas at reuce resolution show that roa networks are completely recovere using the moel with the aitional term. The new moel clearly outperforms the previous moel in terms of quality of results. However, the new moel is computationally expensive, which is why the metho was applie at reuce resolution. To solve this problem, which is ue to the non-linear nature of the new term, we are now working on a novel linear non-local prior term that will have a similar effect. Figure 5. More experiments at reuce resolutions. First column: input images, first row: / resolution, size = , roa with = ~4 pixels; secon row: /4 resolution, size = , roa with = 3~5 pixels; thir row: /4 resolution, size = , roa with = 3~6 pixels; last row: /4 resolution, size = 5 5, roa with = 3~5 pixels. Two rightmost columns: corresponing results obtaine using the energy E (with E ) an the energy E (without E ). M 0
7 ACKNOWLEDGEMENTS This work was partially supporte by European Union Network of Excellence MUSCLE (FP ). The work of the first author is supporte by an MAE/Thales Alenia Space/LIAMA grant. REFERENCES Bhattacharya, U. an Parui, S., 997. An improve backpropagation neural network for etection of roa-like features in satellite imagery. International Journal of Remote Sensing 8(6), pp Fortier, M. F. A., Ziou, D., Armenakis, C. an Wang, S., 999. Survey of work on roa extraction in aerial an satellite images. Technical Report 4, Université e Sherbrooke, Quebec, Canaa. Fortier, M. F. A., Ziou, D., Armenakis, C. an Wang, S., 00. Automate correction an upating of roa atabases from high-resolution imagery. Canaian Journal of Remote Sensing 7(), pp Geman, D. an Jeynak, B., 996. An active testing moel for tracking roas in satellite images. IEEE Trans. Pattern Analysis an Machine Intelligence 8(), pp. 4. Heipke, C., Mayr, H.,Wieemann, C. an Jamet, O., 997. Evaluation of automatic roa extraction. International Archives of Photogrammetry an Remote Sensing XXXII, pp Lacoste, C., Descombes, X. an Zerubia, J., 005. Point processes for unsupervise line network extraction in remote sensing. IEEE Trans. Pattern Analysis an Machine Intelligence 7(0), pp Mayer, H., Laptev, I. an Baumgartner, A., 998. Multi-scale an snakes for automatic roa extraction. In: Proc. European Conference on Computer Vision (ECCV), Vol., Freiburg, Germany. Mena, J., 003. State of the art on automatic roa extraction for GIS upate: A novel classification. Pattern Recognition Letters 4(6), pp Merlet, N. an Zerubia, J., 996. New prospects in line etection by ynamic programming. IEEE Trans. Pattern Analysis an Machine Intelligence 8(4), pp Peng, T., Jermyn, I. H., Prinet, V., Zerubia, J. an Hu, B., 007a. A phase fiel moel incorporating generic an specific prior knowlege applie to roa network extraction from VHR satellite images. In: Proc. British Machine Vision Conference (BMVC), Warwick, Englan. Peng, T., Jermyn, I. H., Prinet, V., Zerubia, J. an Hu, B., 007b. Urban roa extraction from VHR images using a multiscale approach an a phase fiel moel of network geometry. In: Proc. 4th IEEE GRSS/ISPRS Joint Workshop on Remote Sensing an Data Fusion over Urban Areas (URBAN), Paris, France. Rochery, M., Jermyn, I. H. an Zerubia, J., 005. Phase fiel moels an higher-orer active contours. In: Proc. IEEE International Conference on Computer Vision (ICCV), Beijing, China. Rochery, M., Jermyn, I. H. an Zerubia, J., 006. Higher-orer active contours. International Journal of Computer Vision 69(), pp Stoica, R., Descombes, X. an Zerubia, J., 004. A Gibbs point process for roa extraction from remotely sense images. International Journal of Computer Vision 57(), pp. 36. Vosselman, G. an e Knecht, J., 995. Roa tracing by profile matching an Kalman filtering. In: Proc. Workshop on Automatic Extraction of Man-Mae Objects from Aerial an Space Images, Birkhuser Verlag, Basel-Boston-Berlin. Wang, F. an Newkirk, R., 988. A knowlege-base system for highway network extraction. IEEE Trans. Geoscience an Remote Sensing 6, pp Zhang, C., Murai, S. an Baltsavias, E. P., 999. Roa network etection by mathematical morphology. In: Proc. of ISPRS Workshop '3D Geospatial Data Prouction: Meeting Application Requirements', Paris, France.
8
Classifying Facial Expression with Radial Basis Function Networks, using Gradient Descent and K-means
Classifying Facial Expression with Raial Basis Function Networks, using Graient Descent an K-means Neil Allrin Department of Computer Science University of California, San Diego La Jolla, CA 9237 nallrin@cs.ucs.eu
More informationShift-map Image Registration
Shift-map Image Registration Svärm, Linus; Stranmark, Petter Unpublishe: 2010-01-01 Link to publication Citation for publishe version (APA): Svärm, L., & Stranmark, P. (2010). Shift-map Image Registration.
More informationShift-map Image Registration
Shift-map Image Registration Linus Svärm Petter Stranmark Centre for Mathematical Sciences, Lun University {linus,petter}@maths.lth.se Abstract Shift-map image processing is a new framework base on energy
More informationExploring Context with Deep Structured models for Semantic Segmentation
1 Exploring Context with Deep Structure moels for Semantic Segmentation Guosheng Lin, Chunhua Shen, Anton van en Hengel, Ian Rei between an image patch an a large backgroun image region. Explicitly moeling
More informationDense Disparity Estimation in Ego-motion Reduced Search Space
Dense Disparity Estimation in Ego-motion Reuce Search Space Luka Fućek, Ivan Marković, Igor Cvišić, Ivan Petrović University of Zagreb, Faculty of Electrical Engineering an Computing, Croatia (e-mail:
More informationEXACT SIMULATION OF A BOOLEAN MODEL
Original Research Paper oi:10.5566/ias.v32.p101-105 EXACT SIMULATION OF A BOOLEAN MODEL CHRISTIAN LANTUÉJOULB MinesParisTech 35 rue Saint-Honoré 77305 Fontainebleau France e-mail: christian.lantuejoul@mines-paristech.fr
More informationRegularized Laplacian Zero Crossings as Optimal Edge Integrators
Regularize aplacian Zero rossings as Optimal Ege Integrators R. KIMME A.M. BRUKSTEIN Department of omputer Science Technion Israel Institute of Technology Technion ity, Haifa 32, Israel Abstract We view
More informationBayesian localization microscopy reveals nanoscale podosome dynamics
Nature Methos Bayesian localization microscopy reveals nanoscale poosome ynamics Susan Cox, Ewar Rosten, James Monypenny, Tijana Jovanovic-Talisman, Dylan T Burnette, Jennifer Lippincott-Schwartz, Gareth
More informationExploring Context with Deep Structured models for Semantic Segmentation
APPEARING IN IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, APRIL 2017. 1 Exploring Context with Deep Structure moels for Semantic Segmentation Guosheng Lin, Chunhua Shen, Anton van en
More informationA Neural Network Model Based on Graph Matching and Annealing :Application to Hand-Written Digits Recognition
ITERATIOAL JOURAL OF MATHEMATICS AD COMPUTERS I SIMULATIO A eural etwork Moel Base on Graph Matching an Annealing :Application to Han-Written Digits Recognition Kyunghee Lee Abstract We present a neural
More informationBends, Jogs, And Wiggles for Railroad Tracks and Vehicle Guide Ways
Ben, Jogs, An Wiggles for Railroa Tracks an Vehicle Guie Ways Louis T. Klauer Jr., PhD, PE. Work Soft 833 Galer Dr. Newtown Square, PA 19073 lklauer@wsof.com Preprint, June 4, 00 Copyright 00 by Louis
More informationClassical Mechanics Examples (Lagrange Multipliers)
Classical Mechanics Examples (Lagrange Multipliers) Dipan Kumar Ghosh Physics Department, Inian Institute of Technology Bombay Powai, Mumbai 400076 September 3, 015 1 Introuction We have seen that the
More informationHere are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.
Preface Here are my online notes for my Calculus I course that I teach here at Lamar University. Despite the fact that these are my class notes, they shoul be accessible to anyone wanting to learn Calculus
More information2.7 Implicit Differentiation
2.7 Implicit Differentiation [ y] = = = [ x] 1 Sometimes we may be intereste in fining the erivative of an equation that is not solve or able to be solve for a particular epenent variable explicitly. In
More information1 Surprises in high dimensions
1 Surprises in high imensions Our intuition about space is base on two an three imensions an can often be misleaing in high imensions. It is instructive to analyze the shape an properties of some basic
More informationKinematic Analysis of a Family of 3R Manipulators
Kinematic Analysis of a Family of R Manipulators Maher Baili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S. 6597 1, rue e la Noë, BP 92101,
More informationUsing Vector and Raster-Based Techniques in Categorical Map Generalization
Thir ICA Workshop on Progress in Automate Map Generalization, Ottawa, 12-14 August 1999 1 Using Vector an Raster-Base Techniques in Categorical Map Generalization Beat Peter an Robert Weibel Department
More informationImage Segmentation using K-means clustering and Thresholding
Image Segmentation using Kmeans clustering an Thresholing Preeti Panwar 1, Girhar Gopal 2, Rakesh Kumar 3 1M.Tech Stuent, Department of Computer Science & Applications, Kurukshetra University, Kurukshetra,
More informationA Comparative Evaluation of Iris and Ocular Recognition Methods on Challenging Ocular Images
A Comparative Evaluation of Iris an Ocular Recognition Methos on Challenging Ocular Images Vishnu Naresh Boeti Carnegie Mellon University Pittsburgh, PA 523 naresh@cmu.eu Jonathon M Smereka Carnegie Mellon
More informationCharacterizing Decoding Robustness under Parametric Channel Uncertainty
Characterizing Decoing Robustness uner Parametric Channel Uncertainty Jay D. Wierer, Wahee U. Bajwa, Nigel Boston, an Robert D. Nowak Abstract This paper characterizes the robustness of ecoing uner parametric
More information6 Gradient Descent. 6.1 Functions
6 Graient Descent In this topic we will iscuss optimizing over general functions f. Typically the function is efine f : R! R; that is its omain is multi-imensional (in this case -imensional) an output
More informationLinear First-Order PDEs
MODULE 2: FIRST-ORDER PARTIAL DIFFERENTIAL EQUATIONS 9 Lecture 2 Linear First-Orer PDEs The most general first-orer linear PDE has the form a(x, y)z x + b(x, y)z y + c(x, y)z = (x, y), (1) where a, b,
More informationTHE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE
БСУ Международна конференция - 2 THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE Evgeniya Nikolova, Veselina Jecheva Burgas Free University Abstract:
More informationA Duality Based Approach for Realtime TV-L 1 Optical Flow
A Duality Base Approach for Realtime TV-L 1 Optical Flow C. Zach 1, T. Pock 2, an H. Bischof 2 1 VRVis Research Center 2 Institute for Computer Graphics an Vision, TU Graz Abstract. Variational methos
More informationFast Window Based Stereo Matching for 3D Scene Reconstruction
The International Arab Journal of Information Technology, Vol. 0, No. 3, May 203 209 Fast Winow Base Stereo Matching for 3D Scene Reconstruction Mohamma Mozammel Chowhury an Mohamma AL-Amin Bhuiyan Department
More informationAnyTraffic Labeled Routing
AnyTraffic Labele Routing Dimitri Papaimitriou 1, Pero Peroso 2, Davie Careglio 2 1 Alcatel-Lucent Bell, Antwerp, Belgium Email: imitri.papaimitriou@alcatel-lucent.com 2 Universitat Politècnica e Catalunya,
More informationNEW METHOD FOR FINDING A REFERENCE POINT IN FINGERPRINT IMAGES WITH THE USE OF THE IPAN99 ALGORITHM 1. INTRODUCTION 2.
JOURNAL OF MEDICAL INFORMATICS & TECHNOLOGIES Vol. 13/009, ISSN 164-6037 Krzysztof WRÓBEL, Rafał DOROZ * fingerprint, reference point, IPAN99 NEW METHOD FOR FINDING A REFERENCE POINT IN FINGERPRINT IMAGES
More informationAn Algorithm for Building an Enterprise Network Topology Using Widespread Data Sources
An Algorithm for Builing an Enterprise Network Topology Using Wiesprea Data Sources Anton Anreev, Iurii Bogoiavlenskii Petrozavosk State University Petrozavosk, Russia {anreev, ybgv}@cs.petrsu.ru Abstract
More informationA Framework for Dialogue Detection in Movies
A Framework for Dialogue Detection in Movies Margarita Kotti, Constantine Kotropoulos, Bartosz Ziólko, Ioannis Pitas, an Vassiliki Moschou Department of Informatics, Aristotle University of Thessaloniki
More informationTransient analysis of wave propagation in 3D soil by using the scaled boundary finite element method
Southern Cross University epublications@scu 23r Australasian Conference on the Mechanics of Structures an Materials 214 Transient analysis of wave propagation in 3D soil by using the scale bounary finite
More informationComparison of Methods for Increasing the Performance of a DUA Computation
Comparison of Methos for Increasing the Performance of a DUA Computation Michael Behrisch, Daniel Krajzewicz, Peter Wagner an Yun-Pang Wang Institute of Transportation Systems, German Aerospace Center,
More informationA Versatile Model-Based Visibility Measure for Geometric Primitives
A Versatile Moel-Base Visibility Measure for Geometric Primitives Marc M. Ellenrieer 1,LarsKrüger 1, Dirk Stößel 2, an Marc Hanheie 2 1 DaimlerChrysler AG, Research & Technology, 89013 Ulm, Germany 2 Faculty
More informationP. Fua and Y. G. Leclerc. SRI International. 333 Ravenswood Avenue, Menlo Park, CA
Moel Driven Ege Detection P. Fua an Y. G. Leclerc SI International 333 avenswoo Avenue, Menlo Park, CA 9425 (fua@ai.sri.com leclerc@ai.sri.com) Machine Vision an Applications, 3, 199 Abstract Stanar ege
More informationA Classification of 3R Orthogonal Manipulators by the Topology of their Workspace
A Classification of R Orthogonal Manipulators by the Topology of their Workspace Maher aili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S.
More informationRefinement of scene depth from stereo camera ego-motion parameters
Refinement of scene epth from stereo camera ego-motion parameters Piotr Skulimowski, Pawel Strumillo An algorithm for refinement of isparity (epth) map from stereoscopic sequences is propose. The metho
More informationA Convex Clustering-based Regularizer for Image Segmentation
Vision, Moeling, an Visualization (2015) D. Bommes, T. Ritschel an T. Schultz (Es.) A Convex Clustering-base Regularizer for Image Segmentation Benjamin Hell (TU Braunschweig), Marcus Magnor (TU Braunschweig)
More informationEstimating Velocity Fields on a Freeway from Low Resolution Video
Estimating Velocity Fiels on a Freeway from Low Resolution Vieo Young Cho Department of Statistics University of California, Berkeley Berkeley, CA 94720-3860 Email: young@stat.berkeley.eu John Rice Department
More informationFrequency Domain Parameter Estimation of a Synchronous Generator Using Bi-objective Genetic Algorithms
Proceeings of the 7th WSEAS International Conference on Simulation, Moelling an Optimization, Beijing, China, September 15-17, 2007 429 Frequenc Domain Parameter Estimation of a Snchronous Generator Using
More informationReal Time On Board Stereo Camera Pose through Image Registration*
28 IEEE Intelligent Vehicles Symposium Einhoven University of Technology Einhoven, The Netherlans, June 4-6, 28 Real Time On Boar Stereo Camera Pose through Image Registration* Fai Dornaika French National
More informationEstimation of large-amplitude motion and disparity fields: Application to intermediate view reconstruction
c 2000 SPIE. Personal use of this material is permitte. However, permission to reprint/republish this material for avertising or promotional purposes or for creating new collective works for resale or
More informationBIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES
BIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES OLIVIER BERNARDI AND ÉRIC FUSY Abstract. We present bijections for planar maps with bounaries. In particular, we obtain bijections for triangulations an quarangulations
More informationGeneralized Edge Coloring for Channel Assignment in Wireless Networks
Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu Institute of Information Science Acaemia Sinica Taipei, Taiwan Da-wei Wang Jan-Jan Wu Institute of Information Science
More informationModifying ROC Curves to Incorporate Predicted Probabilities
Moifying ROC Curves to Incorporate Preicte Probabilities Cèsar Ferri DSIC, Universitat Politècnica e València Peter Flach Department of Computer Science, University of Bristol José Hernánez-Orallo DSIC,
More informationMulti-camera tracking algorithm study based on information fusion
International Conference on Avance Electronic Science an Technolog (AEST 016) Multi-camera tracking algorithm stu base on information fusion a Guoqiang Wang, Shangfu Li an Xue Wen School of Electronic
More informationA shortest path algorithm in multimodal networks: a case study with time varying costs
A shortest path algorithm in multimoal networks: a case stuy with time varying costs Daniela Ambrosino*, Anna Sciomachen* * Department of Economics an Quantitative Methos (DIEM), University of Genoa Via
More informationImproving Spatial Reuse of IEEE Based Ad Hoc Networks
mproving Spatial Reuse of EEE 82.11 Base A Hoc Networks Fengji Ye, Su Yi an Biplab Sikar ECSE Department, Rensselaer Polytechnic nstitute Troy, NY 1218 Abstract n this paper, we evaluate an suggest methos
More informationExercises of PIV. incomplete draft, version 0.0. October 2009
Exercises of PIV incomplete raft, version 0.0 October 2009 1 Images Images are signals efine in 2D or 3D omains. They can be vector value (e.g., color images), real (monocromatic images), complex or binary
More informationFigure 1: Schematic of an SEM [source: ]
EECI Course: -9 May 1 by R. Sanfelice Hybri Control Systems Eelco van Horssen E.P.v.Horssen@tue.nl Project: Scanning Electron Microscopy Introuction In Scanning Electron Microscopy (SEM) a (bunle) beam
More informationDiscrete Markov Image Modeling and Inference on the Quadtree
390 IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 9, NO. 3, MARCH 2000 Discrete Markov Image Moeling an Inference on the Quatree Jean-Marc Laferté, Patrick Pérez, an Fabrice Heitz Abstract Noncasual Markov
More informationOffloading Cellular Traffic through Opportunistic Communications: Analysis and Optimization
1 Offloaing Cellular Traffic through Opportunistic Communications: Analysis an Optimization Vincenzo Sciancalepore, Domenico Giustiniano, Albert Banchs, Anreea Picu arxiv:1405.3548v1 [cs.ni] 14 May 24
More informationYet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama and Hayato Ohwada Faculty of Sci. and Tech. Tokyo University of Scien
Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama an Hayato Ohwaa Faculty of Sci. an Tech. Tokyo University of Science, 2641 Yamazaki, Noa-shi, CHIBA, 278-8510, Japan hiroyuki@rs.noa.tus.ac.jp,
More informationOn the Role of Multiply Sectioned Bayesian Networks to Cooperative Multiagent Systems
On the Role of Multiply Sectione Bayesian Networks to Cooperative Multiagent Systems Y. Xiang University of Guelph, Canaa, yxiang@cis.uoguelph.ca V. Lesser University of Massachusetts at Amherst, USA,
More informationStudy of Network Optimization Method Based on ACL
Available online at www.scienceirect.com Proceia Engineering 5 (20) 3959 3963 Avance in Control Engineering an Information Science Stuy of Network Optimization Metho Base on ACL Liu Zhian * Department
More informationState Indexed Policy Search by Dynamic Programming. Abstract. 1. Introduction. 2. System parameterization. Charles DuHadway
State Inexe Policy Search by Dynamic Programming Charles DuHaway Yi Gu 5435537 503372 December 4, 2007 Abstract We consier the reinforcement learning problem of simultaneous trajectory-following an obstacle
More informationProperties of the Derivative Lecture 9.
Properties of the Derivative Lecture 9. Recall that the average rate of change of a function y = f(x) over the interval from a to a + h, with h 0, is the slope of the line between y x f(a + h) f(a) =,
More informationVision-based Multi-Robot Simultaneous Localization and Mapping
Vision-base Multi-Robot Simultaneous Localization an Mapping Hassan Hajjiab an Robert Laganière VIVA Research Lab School of Information Technology an Engineering University of Ottawa, Ottawa, Canaa, K1N
More informationImplicit and Explicit Functions
60_005.q //0 :5 PM Page SECTION.5 Implicit Differentiation Section.5 EXPLORATION Graphing an Implicit Equation How coul ou use a graphing utilit to sketch the graph of the equation? Here are two possible
More informationOn Effectively Determining the Downlink-to-uplink Sub-frame Width Ratio for Mobile WiMAX Networks Using Spline Extrapolation
On Effectively Determining the Downlink-to-uplink Sub-frame With Ratio for Mobile WiMAX Networks Using Spline Extrapolation Panagiotis Sarigianniis, Member, IEEE, Member Malamati Louta, Member, IEEE, Member
More informationRobust Camera Calibration for an Autonomous Underwater Vehicle
obust Camera Calibration for an Autonomous Unerwater Vehicle Matthew Bryant, Davi Wettergreen *, Samer Aballah, Alexaner Zelinsky obotic Systems Laboratory Department of Engineering, FEIT Department of
More informationIEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 31, NO. 4, APRIL
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 1, NO. 4, APRIL 01 74 Towar Efficient Distribute Algorithms for In-Network Binary Operator Tree Placement in Wireless Sensor Networks Zongqing Lu,
More informationParts Assembly by Throwing Manipulation with a One-Joint Arm
21 IEEE/RSJ International Conference on Intelligent Robots an Systems, Taipei, Taiwan, October, 21. Parts Assembly by Throwing Manipulation with a One-Joint Arm Hieyuki Miyashita, Tasuku Yamawaki an Masahito
More informationQueueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks
Queueing Moel an Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Marc Aoun, Antonios Argyriou, Philips Research, Einhoven, 66AE, The Netherlans Department of Computer an Communication
More informationOpen Access Adaptive Image Enhancement Algorithm with Complex Background
Sen Orers for Reprints to reprints@benthamscience.ae 594 The Open Cybernetics & Systemics Journal, 205, 9, 594-600 Open Access Aaptive Image Enhancement Algorithm with Complex Bacgroun Zhang Pai * epartment
More informationEFFICIENT STEREO MATCHING BASED ON A NEW CONFIDENCE METRIC. Won-Hee Lee, Yumi Kim, and Jong Beom Ra
th European Signal Processing Conference (EUSIPCO ) Bucharest, omania, August 7-3, EFFICIENT STEEO MATCHING BASED ON A NEW CONFIDENCE METIC Won-Hee Lee, Yumi Kim, an Jong Beom a Department of Electrical
More informationArchitecture Design of Mobile Access Coordinated Wireless Sensor Networks
Architecture Design of Mobile Access Coorinate Wireless Sensor Networks Mai Abelhakim 1 Leonar E. Lightfoot Jian Ren 1 Tongtong Li 1 1 Department of Electrical & Computer Engineering, Michigan State University,
More informationPDE-BASED INTERPOLATION METHOD FOR OPTICALLY VISUALIZED SOUND FIELD. Kohei Yatabe and Yasuhiro Oikawa
4 IEEE International Conference on Acoustic, Speech an Signal Processing (ICASSP) PDE-BASED INTERPOLATION METHOD FOR OPTICALLY VISUALIZED SOUND FIELD Kohei Yatabe an Yasuhiro Oikawa Department of Intermeia
More informationOptimal path planning in a constant wind with a bounded turning rate
Optimal path planning in a constant win with a boune turning rate Timothy G. McGee, Stephen Spry an J. Karl Herick Center for Collaborative Control of Unmanne Vehicles, University of California, Berkeley,
More informationResearch Article Inviscid Uniform Shear Flow past a Smooth Concave Body
International Engineering Mathematics Volume 04, Article ID 46593, 7 pages http://x.oi.org/0.55/04/46593 Research Article Invisci Uniform Shear Flow past a Smooth Concave Boy Abullah Mura Department of
More informationPAMPAS: Real-Valued Graphical Models for Computer Vision. Abstract. 1. Introduction. Anonymous
PAMPAS: Real-Value Graphical Moels for Computer Vision Anonymous Abstract Probabilistic moels have been aopte for many computer vision applications, however inference in high-imensional spaces remains
More information3D CITY REGISTRATION AND ENRICHMENT
3D CITY REGISTRATION AND ENRICHMENT J. A. Quinn, P. D. Smart an C. B. Jones School of Computer Science, Cariff University {j.a.quinn, p.smart, c.b.jones}@cs.cf.ac.uk KEY WORDS: City moels, registration,
More informationObject Recognition Using Colour, Shape and Affine Invariant Ratios
Object Recognition Using Colour, Shape an Affine Invariant Ratios Paul A. Walcott Centre for Information Engineering City University, Lonon EC1V 0HB, Englan P.A.Walcott@city.ac.uk Abstract This paper escribes
More informationUsing the disparity space to compute occupancy grids from stereo-vision
The 2010 IEEE/RSJ International Conference on Intelligent Robots an Systems October 18-22, 2010, Taipei, Taiwan Using the isparity space to compute occupancy gris from stereo-vision Mathias Perrollaz,
More informationNon-homogeneous Generalization in Privacy Preserving Data Publishing
Non-homogeneous Generalization in Privacy Preserving Data Publishing W. K. Wong, Nios Mamoulis an Davi W. Cheung Department of Computer Science, The University of Hong Kong Pofulam Roa, Hong Kong {wwong2,nios,cheung}@cs.hu.h
More informationAn Adaptive Routing Algorithm for Communication Networks using Back Pressure Technique
International OPEN ACCESS Journal Of Moern Engineering Research (IJMER) An Aaptive Routing Algorithm for Communication Networks using Back Pressure Technique Khasimpeera Mohamme 1, K. Kalpana 2 1 M. Tech
More informationA Block-Based Blind Source Separation Approach With Equilateral Triangular Microphone Array
APSIPA ASC 2011 Xi an A Block-Base Blin Source Separation Approach With Equilateral Triangular Microphone Array Jian Zhang, Zhonghua Fu an Lei Xie Shaanxi Provincial Key Laboratory of Speech an Image Information
More informationDigital fringe profilometry based on triangular fringe patterns and spatial shift estimation
University of Wollongong Research Online Faculty of Engineering an Information Sciences - Papers: Part A Faculty of Engineering an Information Sciences 4 Digital fringe profilometry base on triangular
More informationAnimated Surface Pasting
Animate Surface Pasting Clara Tsang an Stephen Mann Computing Science Department University of Waterloo 200 University Ave W. Waterloo, Ontario Canaa N2L 3G1 e-mail: clftsang@cgl.uwaterloo.ca, smann@cgl.uwaterloo.ca
More informationThroughput Characterization of Node-based Scheduling in Multihop Wireless Networks: A Novel Application of the Gallai-Edmonds Structure Theorem
Throughput Characterization of Noe-base Scheuling in Multihop Wireless Networks: A Novel Application of the Gallai-Emons Structure Theorem Bo Ji an Yu Sang Dept. of Computer an Information Sciences Temple
More informationA FUZZY FRAMEWORK FOR SEGMENTATION, FEATURE MATCHING AND RETRIEVAL OF BRAIN MR IMAGES
A FUZZY FRAMEWORK FOR SEGMENTATION, FEATURE MATCHING AND RETRIEVAL OF BRAIN MR IMAGES Archana.S 1 an Srihar.S 2 1 Department of Information Science an Technology, College of Engineering, Guiny archana.santhira@gmail.com
More informationThe Panum Proxy algorithm for dense stereo matching over a volume of interest
The Panum Proxy algorithm for ense stereo matching over a volume of interest A. Agarwal an A. Blake Microsoft Research Lt. 7 J J Thomson Ave, Cambrige, CB3 FB, UK http://research.microsoft.com/vision/cambrige
More information(a) Find the equation of the plane that passes through the points P, Q, and R.
Math 040 Miterm Exam 1 Spring 014 S o l u t i o n s 1 For given points P (, 0, 1), Q(, 1, 0), R(3, 1, 0) an S(,, 0) (a) Fin the equation of the plane that passes through the points P, Q, an R P Q = 0,
More information2-connected graphs with small 2-connected dominating sets
2-connecte graphs with small 2-connecte ominating sets Yair Caro, Raphael Yuster 1 Department of Mathematics, University of Haifa at Oranim, Tivon 36006, Israel Abstract Let G be a 2-connecte graph. A
More informationAdvanced method of NC programming for 5-axis machining
Available online at www.scienceirect.com Proceia CIRP (0 ) 0 07 5 th CIRP Conference on High Performance Cutting 0 Avance metho of NC programming for 5-axis machining Sergej N. Grigoriev a, A.A. Kutin
More informationTry It. Implicit and Explicit Functions. Video. Exploration A. Differentiating with Respect to x
SECTION 5 Implicit Differentiation Section 5 Implicit Differentiation Distinguish between functions written in implicit form an eplicit form Use implicit ifferentiation to fin the erivative of a function
More informationHoly Halved Heaquarters Riddler
Holy Halve Heaquarters Riler Anonymous Philosopher June 206 Laser Larry threatens to imminently zap Riler Heaquarters (which is of regular pentagonal shape with no courtyar or other funny business) with
More informationFINDING OPTICAL DISPERSION OF A PRISM WITH APPLICATION OF MINIMUM DEVIATION ANGLE MEASUREMENT METHOD
Warsaw University of Technology Faculty of Physics Physics Laboratory I P Joanna Konwerska-Hrabowska 6 FINDING OPTICAL DISPERSION OF A PRISM WITH APPLICATION OF MINIMUM DEVIATION ANGLE MEASUREMENT METHOD.
More informationLoop Scheduling and Partitions for Hiding Memory Latencies
Loop Scheuling an Partitions for Hiing Memory Latencies Fei Chen Ewin Hsing-Mean Sha Dept. of Computer Science an Engineering University of Notre Dame Notre Dame, IN 46556 Email: fchen,esha @cse.n.eu Tel:
More informationInvestigation into a new incremental forming process using an adjustable punch set for the manufacture of a doubly curved sheet metal
991 Investigation into a new incremental forming process using an ajustable punch set for the manufacture of a oubly curve sheet metal S J Yoon an D Y Yang* Department of Mechanical Engineering, Korea
More informationA multiple wavelength unwrapping algorithm for digital fringe profilometry based on spatial shift estimation
University of Wollongong Research Online Faculty of Engineering an Information Sciences - Papers: Part A Faculty of Engineering an Information Sciences 214 A multiple wavelength unwrapping algorithm for
More informationCS 106 Winter 2016 Craig S. Kaplan. Module 01 Processing Recap. Topics
CS 106 Winter 2016 Craig S. Kaplan Moule 01 Processing Recap Topics The basic parts of speech in a Processing program Scope Review of syntax for classes an objects Reaings Your CS 105 notes Learning Processing,
More informationParticle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 17, No 3 Sofia 017 Print ISSN: 1311-970; Online ISSN: 1314-4081 DOI: 10.1515/cait-017-0030 Particle Swarm Optimization Base
More informationLearning convex bodies is hard
Learning convex boies is har Navin Goyal Microsoft Research Inia navingo@microsoftcom Luis Raemacher Georgia Tech lraemac@ccgatecheu Abstract We show that learning a convex boy in R, given ranom samples
More informationGeneralized Edge Coloring for Channel Assignment in Wireless Networks
TR-IIS-05-021 Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu, Pangfeng Liu, Da-Wei Wang, Jan-Jan Wu December 2005 Technical Report No. TR-IIS-05-021 http://www.iis.sinica.eu.tw/lib/techreport/tr2005/tr05.html
More informationFast Fractal Image Compression using PSO Based Optimization Techniques
Fast Fractal Compression using PSO Base Optimization Techniques A.Krishnamoorthy Visiting faculty Department Of ECE University College of Engineering panruti rishpci89@gmail.com S.Buvaneswari Visiting
More informationRandom Clustering for Multiple Sampling Units to Speed Up Run-time Sample Generation
DEIM Forum 2018 I4-4 Abstract Ranom Clustering for Multiple Sampling Units to Spee Up Run-time Sample Generation uzuru OKAJIMA an Koichi MARUAMA NEC Solution Innovators, Lt. 1-18-7 Shinkiba, Koto-ku, Tokyo,
More informationChapter 5 Proposed models for reconstituting/ adapting three stereoscopes
Chapter 5 Propose moels for reconstituting/ aapting three stereoscopes - 89 - 5. Propose moels for reconstituting/aapting three stereoscopes This chapter offers three contributions in the Stereoscopy area,
More informationMultimodal Stereo Image Registration for Pedestrian Detection
Multimoal Stereo Image Registration for Peestrian Detection Stephen Krotosky an Mohan Trivei Abstract This paper presents an approach for the registration of multimoal imagery for peestrian etection when
More informationImpact of changing the position of the tool point on the moving platform on the dynamic performance of a 3RRR planar parallel manipulator
IOSR Journal of Mechanical an Civil Engineering (IOSR-JMCE) e-issn: 78-84,p-ISSN: 0-4X, Volume, Issue 4 Ver. I (Jul. - Aug. 05), PP 7-8 www.iosrjournals.org Impact of changing the position of the tool
More informationTracking and Regulation Control of a Mobile Robot System With Kinematic Disturbances: A Variable Structure-Like Approach
W. E. Dixon e-mail: wixon@ces.clemson.eu D. M. Dawson e-mail: awson@ces.clemson.eu E. Zergeroglu e-mail: ezerger@ces.clemson.eu Department of Electrical & Computer Engineering, Clemson University, Clemson,
More informationLearning Polynomial Functions. by Feature Construction
I Proceeings of the Eighth International Workshop on Machine Learning Chicago, Illinois, June 27-29 1991 Learning Polynomial Functions by Feature Construction Richar S. Sutton GTE Laboratories Incorporate
More information