Joint disparity and motion eld estimation in. stereoscopic image sequences. Ioannis Patras, Nikos Alvertos and Georgios Tziritas y.
|
|
- Brooke Lamb
- 6 years ago
- Views:
Transcription
1 FORTH-ICS / TR-157 December 1995 Joint disparity and motion ed estimation in stereoscopic image sequences Ioannis Patras, Nikos Avertos and Georgios Tziritas y Abstract This work aims at determining four dense eds given two stereoscopic pairs of images in consecutive time instances: two dense veocity eds and two dense disparity eds. The proposed scheme is competed in two stages. During the rst stage, the dense disparity ed of the rst stereoscopic pair is estimated using a mutiscae iterative reaxation agorithm. During the second stage, again using a simiar iterative agorithm, the two dense veocity eds and the disparity ed of the second stereoscopic pair are estimated. The method has been impemented with both synthetic and rea data. y Institute of Computer Science, F.O.R.T.H., and, Computer Science Department, University of Crete, Greece, E-mai: patras@csd.uch.gr, avertos@csd.uch.gr, tziritas@csi.forth.gr
2 1 Introduction There are three genera approaches regarding dynamic stereo vision which are found in the existing bibiography [11]. The rst one consists of initiay soving the stereoscopic probem, which eads to the static determination of objects, foowed by the correspondence of these objects in time. Leung and Huang [5] assume a scene which contains ony one moving object with respect to the stationary receiver (camera), where stereoscopic correspondences are rst determined for a sucient number of points foowed by evauation of their three-dimensiona motion. A simiar approach to the probem is empoyed by Netravai et a. [9] and Mitiche and Bouthemy [8]. Kim and Aggarwa [] use segments of boundaries, instead of points, for which initiay the stereoscopic probem is soved. Motion is determined under the hypothesis that the depicted objects are rigid and, thus, their geometric characteristics remain unchanged in time. Simiar is aso the approach by Zhang and Faugeras [13] which is based on straight ine segments with compete determination and appropriate description in the three-dimensiona space. The second genera approach evauates independenty the two two-dimensiona veocity eds in the sequence of stereoscopic image pairs and then determines and uses the stereoscopic reations which exist between the two veocity eds. Mitiche [7] determines reations among positions and veocities of discrete points which correspond to the stereoscopic pairs. Soution to these equations resuts into the three-dimensiona motion of a set of points which are assumed to beong to the same rigid body. Waxman and Duncan [1] determine reations between the -D veocity eds of the stereoscopic pair and dene the binocuar dierentia motion which is connected to the stereoscopic disparity. Finay, the third approach uses a joint estimation of the two -D veocity eds taking advantage of their stereoscopic reation without seeking the compete 3-D reconstruction of the depicted objects. In this case, where a compete 3-D motion and shape object description is not required, Tamtaoui and Labit [10] introduce stereoscopic reations between the veocity eds of the stereoscopic pair which utiize for the simutaneous evauation of the two veocity eds using a recursive method. This approach seems to produce interesting resuts for appications in 3-D teevision. As it was shown through the previous bibiographic reference, the existing
3 soutions do not utiize the stereoscopic and motion reations simutaneousy; instead, they consider the probem in sequentia stages. It is known, however, that positions at each time instant are connected with dispacements and, furthermore, the reations which connect the rate of change of the stereoscopic disparities with the veocity eds are known. This work aims at an integrated soution to the probem of dynamic stereoscopic vision. A simutaneous estimation of the veocity and disparity eds in a dense structure, that is, for a image points, as opposed to most of the existing methods where ony sparse image descriptions are given, is proposed. At any time instant two motion eds (for the eft and right image sequences) and one disparity ed are computed. The disparity ed of the previous stereoscopic pair is considered as known, that is previousy estimated. In addition, a method which has been shown to be eective in monocuar motion anaysis is used, given that it has been appropriatey adapted to the requirements of the probem. Initiay, a cost function is determined which constraints the dierent eds to be adaptativey smooth. This cost function aso contains known equations regarding veocity and disparity eds in reation to image intensity, as we as reations between veocities and disparities depending on the geometrica mode of the optica system. Minimization of the cost function resuts into estimation of the veocity and disparity eds. This minimization can be achieved using an iterative reaxation agorithm based on the gradient of the cost function. θ z y x B z r yr x r Figure 1: Converging Mode The anaysis is based on a converging (xating) stereoscopic optica system, 3
4 shown in Figure 1, where is the ange between the two optica axes, B is the distance between the two foca points and f is the same foca ength for each camera. For a 3-D point r with eft camera coordinates r = ( ; Y ; Z ) and right camera coordinates r r = ( r ; Y r ; Z r ) the foowing equaity hods true: 6 r Y r Z r = 6 cos 0 sin 0 1 0? sin 0 cos Y Z ?B cos (=) 0 B sin (=) (1) If (x r ; y r ) and (x ; y ) are the perspective projections of r in the right and eft image, respectivey, the foowing reations among the coordinates of the same point r and its projections in the stereoscopic pair are obtained: x r Z r f y r Z r f = x Z f cos + Z sin? B cos = () = y Z f (3) Z r =?x Z f sin + Z cos + B sin = () Examining the ratio y y r it is shown: y y r = Z r Z = x f x r f sin = + cos = sin = + cos = Dening the disparity vector ~ d as ~d = (x r? x ; y r? y ) and assuming that is very sma, then y y r 1; that is, the y-coordinate of d ~ is amost zero. For the remainder of this work it is accepted that a previous assumptions hod true, thus, d ~ is a 1-D vector aong the x-axis. Eqs. ( - ) form the basis for 3-D scene reconstruction foowing the estabishment of image-point correspondence in the stereoscopic pair. For every image-point pair (x r ; y r ); (x ; y ), the soution of those equations provides a depth estimate (Z and Z r ) of the projected 3-D point. Depth can aso be cacuated using an intermediate coordinate system (the cycopean system) which is obtained by rotating < ; Y ; Z > about the y axis with an ange = and then transating B sin (=) aong the x-axis. From the corresponding equations, a cosed form soution for Z (depth) is determined []: Z =?B tan(? ) tan( + ) tan(? ) + tan( + ) (5) where = =?, = arctan(x =f) and = arctan(x r =f).
5 If the ange = 0, we obtain the atera mode. In this case, the equations reating image and 3-D point coordinates are: x r = x? B f Z (6) y r = y (7) where Z = Z r = Z. It is aso noted that the disparity vector ~ d is 1-D aong the x-axis. In Section we present a reguarization method for obtaining a smooth disparity ed from a stereoscopic pair using diusion adaptive functions. In Section 3 the simutaneous estimation of the two motion eds and the current disparity ed from two successive stereoscopic pairs is presented. Section contains experimenta resuts with both synthetic and rea stereoscopic image sequences. Then some concusions are given, as we as directions of future work. Disparity Fied Estimation Soution to the stereoscopic probem consists of determining a dense disparity ed through which every point (x ; y ) in the eft image is matched to a point (x + ; y ) = (x r ; y r ) in the right image. Using the optica-ow preservation principe, it is aso true that I (x ; y ) = I r (x r ; y r ). However, since intensity measurements are not exact and a hypotheses are not absoute, the foowing functiona is minimized [3]: e i = Z Z (I (x; y)? I r (x + ; y)) dxdy (8) In addition, it is required that Z, and thus, is varying smoothy. Consequenty, a smooth-ed functiona is introduced for minimization: e s = Z Z (g( x ) + g( y ))dxdy (9) where x y and g(:) is a function which beongs to DAF (Diusion Adaptive Functions) as described in [6]. g(:) as a member of the DAF famiy, is provided as an aternative to the quadratic reguarizer (:) which has the disadvantage that it imposes the smoothness constraint everywhere and eads to oversmoothing. On the other hand a carefuy chosen g c (:) may reguarize the soution and at the same time preserve the discontinuites. In that framework the interaction function h(:) which is dened such that : g 0 (x) = xh(x) determines the interaction between neighboring pixes. In this work g(:) and h(:) were chosen to be : g(x) = jxj? n (1 + jxj and h(x) = 1 1+ jxj. For the discrete case the tota quantity to be minimized is 5 )
6 given by: i j (I r (i + i;j ; j)? I (i; j)) + i j g( ij? p 0) where N ij = f(i?1; j); (i+1; j); (i; j?1); (i; j+1)g is the -point neighborhood of (i; j). The sum P g( ij? p 0) is an approximation for e s and can be extended to a neighborhood of more than points (e.g., 3 3 where the diagona terms are normaized by p ). is a weight coecient which determines to what degree estimation of the ed is inuenced by the smoothing operator. Minimization of this quantity resuts into the foowing equation: (I r (i + i;j ; j)? I (i; j)) r x(i + i;j ; j) + p 0( ij? ij ) = 0 (10) where p 0 = h( ij? p 0) are the coecients which determine the contribution of each of the neighborhood points in estimating ij, and ij = p 0 p 0 p 0 N ij p 0 Assuming that the magnitude of the ed is reativey sma and image intensity varies smoothy, the foowing reations hod true: I r x(x + ; y) = I r x(x + ; y) I r (x r ; y r ) = I r (x + ; y ) = I r (x + ; y ) + (? )I r x (x + ; y r ) Considering the above, Eq. (10) becomes: (I r + (? )I r x (x + ; y r )) I r x (x + ; y r ) + p 0(? ) = 0 (11) where I r = I r (x + ; y )? I (i; j). In tota, there are as many equations as there are points (i.e., unknowns). The system is formuated into a tri-diagona matrix, thus aowing use of the iterative Gauss-Seide method. The soution at the k th iteration is given by the reation: k i;j = I k?1 i;j? r I r x P (1) p 0 + ( r x) where k?1 is the disparity ed estimated at the (k? 1) iteration. It is particuary important to determine a termination condition for the agorithm, so that convergence is ensured. For this reason, a convergence 6
7 measure is examined periodicay (every ten iterations), which is the average correction in the direction of the sope: ji T = r Ixj r P (i;j) p 0 + (Ix) r The agorithm is terminated when the percentage diminishment of the T amount becomes ess than a threshod. This condition on the diminishment T ratio is proven to be more stabe and reiabe for dierent stereoscopic pairs than a threshod condition on the T amount itsef..1 Mutiscae Agorithm The previousy described agorithm, as a gradient-descent agorithm, can estimate successfuy ony eds of sma disparities. Otherwise, it requires good initia conditions so that it wi not be entrapped and converge to a oca minimum. Thus, it is insucient for rea data where arge disparity vaues are possibe and no prior genera knowedge of the scene depth is avaiabe. 3rd eve nd eve 1st eve (a) (b) Figure : (a) Data pyramid and (b) Fied pyramid Consequenty, a coarse-to-ne mutiscae method in a pyramida form (Fig. ) is impemented, where in each eve () the agorithm is appied to images of submutipe dimensions of the origina ones. Those images are the resut of reduction by ow-pass tering and subsamping. The image dimensions at eve are both reduced by a factor. Convergence of the agorithm at eve impies a dense disparity ed where each of its 1-D vector () corresponds to an initia image region of size. The estimated at eve disparity ed () constitutes the initiaization of the ed (?1) to be estimated at eve? 1. An immediate resut of this reduction is the scae change on the magnitude of the ed to be estimated. Because of the reduction, the 7
8 characteristics (features) to be matched in the two images dier by a smaer absoute vaue (number of pixes). If, for exampe, (x, y ) and (x +, y ) are the coordinates of corresponding points at eve (), then at the higher eve ( + 1) the coordinates wi be ( x, y ) and ( x +, y ), respectivey. This means that at a higher eve the disparity to be estimated has a submutipe magnitude, thus, making the agorithm more ecient. This way, at the higher eves a coarse estimation of the disparity ed is achieved which becomes ner, in exactness and detai, at the ower eves of the pyramid. In the ast eve, the base of the pyramid, the agorithm is appied to the origina images and its convergence provides the na disparity ed. 3 Simutaneous Motion and Disparity Estimation The second stage of this work consists of a simutaneous estimation of the two veocity eds and the disparity ed of the second stereoscopic image pair. 3.1 Optica Fow - Disparity Reations Combining equations 6-7, the foowing reations among the components of the eds to be estimated are derived: and y = y r ) v = v r (13) x r = x + ) u r = u + t+1? t (1) Soving the system of these two equations with respect to t+1 and v r resuts into: v r = v and t+1 = u r? u + t (15) Therefore, to competey determine the requested eds it is sucient to evauate their three components u r, u and v. 3. Proposed Soution To estimate the motion and the second disparity eds, the correspondence between points in the rst stereoscopic image pair is used, as derived in the rst stage by evauating the ed t. In the second stage, the aim is to determine two points in the second pair of images for every pair of points of the rst stereoscopic image pair, so that these four corresponding points are the projections of the same point in space. The rst point pair is the projection at time instant t whie the second is at t + 1. The principe of optica-ow preservation is used; that is, the projections in the four images of 8
9 the same feature of an object in space are of the same ight intensity. Thus, the foowing reations resut: e 1 s = I r t+1? I r t = 0 e s = I t+1? I t = 0 e 3 s = I r t+1? I t+1 = 0 where I and I r t+1 t+1 are the intensities of the eft and right points in the second stereoscopic image pair, whie I t and I r t are the intensities of the corresponding points in the rst stereoscopic image pair. As with the soution to the stereoscopic probem, the minimization of the squared deviation from the optica-ow preservation principe and the minimization of a smoothness measure for the estimated eds are considered. In addition to the eds for direct evauation, a smoothness measure for the quantity (u r?u ) is introduced; that is, the veocity dierence in the two image sequence which in the case of the atera mode is u r? u = f Vz Z. Smoothness of this quantity is achieved with a coecient in reation to the smoothness of eds u r, u and v. The tota quantity to be minimized is: E = (i;j) where Z Z Z Z + ((e 1 s) + (e s) + (e 3 s) )dxdy + Z Z r? u ) + r? u ) ) ) + g(@u ) + ) + ) + g(@v ) + g(@v )! dxdy (16) In the discrete case this quantity becomes: (I ) + (I r ) + (I r ) + (g(u r? ij ur 0) + p g(u? ij u 0) + p g(v? ij v 0) + p g((ur? ij u )? ij (ur? p u 0)) 0 p (i;j) I r = I r t+1? I t+1 I r = I r t+1? I r t I = I t+1? I t Minimizing this ast quantity the foowing equations are obtained: I I x? I r t+1 I x + 1 p 0(u ij? u 0) + p p ((u 0 ij? u r ij)? (u? p ur 0)) = (17) 0 0 p p 0 N ij I r I r r x + I I r + t+1 x p 0(u? ij u 0) + p p ((ur? 0 ij u )? ij (ur? p u 0)) = (18) 0 0 p I I x + I r I r x + (It+1) r (I r x? Ix) + 3 p 0(v ij? v 0) = (19) 0 p 9
10 where the coecients 1 0; p 0; p 3 and p 0 resut from the smoothing of p u ; u r ; v 0 and ( u r? u ), respectivey, and the derivatives of the ight intensities refer to the second stereoscopic image pair (i.e., at time instant t + 1). Let P u p ij = 0 N ij 1 p 0u p 0 + P 1 p 0 and simiary u r ij, whie et v ij be: v ij = P p 0u p 0 P p 0 P 3 p 0v p 0 P 3 p 0 and V ij = 3 p 0(v ij? Assuming that the eds to be estimated are sma in magnitude and that the intensities vary smoothy, the foowing approximations are used: v ij) approximation of the rst derivative of the intensity: I r x I r y r (x t+1 r + u r ; y + v r (x t+1 r + u r ; y + r t+1 (x r + u r ; y + r t+1 (x r + u r ; y + v Simiar approximations hod true for the intensities in the eft image (I x and I y). approximation of the intensities at points (x r + u r ; y + v ) and (x + u ; y +v ) in the eft and right image, respectivey, with rst order Tayor expansion: I r t+1 (x r + u r ; y + v ) I r t+1 (x r + u r ; y + v ) + (u r? u r )I r x + (v r? v r )I r y where Q = I t+1(x + u ; y + v ) I t+1(x + u ; y + v ) + (u? u )I x + (v? v )I y The na form of the equations in the discrete grid are: 6 Q 6 u k? uk?1 u k r? uk?1 r v k? v k?1 (I x) +?I xi r x??i xi r x? = b (0) p 0 I x(i y? I r y) p 0 (I r x) + I r x(i r y? I y) I x(i y? I r y) I r x(i r y? I y) + (I y) + (I r y) + (I r y? I y)
11 and b = 6 I x(i? I r ) + ( I r x(i r + I r ) + ( 0 p ((? 1) 0 p ((? 1) p 0ur p 0 + p 0 u I y (I? I r ) + I r y (I r + I r ) p 0 + p 0 ur p 0 u p 0 p 0 The above system is represented by a positive-denite matrix; thus, its soution is obtained through direct inversion. Experimenta Resuts.1 Stereoscopic Probem Soutions This agorithm was tested with both synthetic and rea data. In the synthetic case, the image of a square is given, with constant disparity = 5 for the square and = 0 for the background. The mean squared error in evauating the ed was , and the mean squared dierence between the right image and its reconstruction using the estimated ed was The argest scae where the ed was estimated was, whie the number of iterations necessary for the agorithm to converge was 150. The vaue of the coecient was 500. A quantitative evauation of the ed is shown in Fig. 3(a), where the corresponding depth map is given (a) (b) Figure 3: Depth map at time (a) t, and (b) t + 1 Rea data consist of a stereoscopic pair shown in Fig.. For = 500, the resuting mean squared error on the intensities was In addition, Fig. 5(a) shows a depth evauation, as it resuts from Eq. (5), of the depicted objects. 11
12 Figure : Stereoscopic image pair at time t. Stereoscopy and Motion The resuts on synthetic data from the second stage of the work are concuded in Tabe 1. Tests on synthetic data were reaized using two categories of images: The second stereoscopic image pair foows from the rst by transating the components U, U r and V = V r which are varied from the eft top to the right bottom point of the image: U from 1.0 to 3.0 U r from 1.0 to.0 V = V r =.0 (constant) The second stereoscopic image pair foows from the rst by transating the depicted square (where = 5 ) as it resuts from the constant eds U = 3:0, U r = 3:0, V = V r = :0. The remaining image is transated by a vector (?1;?1) for both the eft and the right sequence. Category Iterations MSE MSE on Intensities U U r V LL RR RL Tabe 1: Experimenta resuts on synthetic data In Tabe 1 the MSE expresses the mean squared deviation for each of the estimated eds; that is, it resuts from P P (^u ij? U ij ), where ^u is the 1
13 (a) (b) Figure 5: Estimated depth map at time (a) t, and (b) t + 1 estimated ed, whie U is the syntheticay created ed, on which production of the second stereoscopic image pair was based. In the same tabe MSE on intensities are given too, for the eft images (LL), for the right images (RR) and for the stereoscopic pair at t + 1 (RL). A quaitative evauation of the ed t+1 is shown in Fig. 3(b). Impementation of the second stage with rea data consists of two stereoscopic pairs, the rst of which was the one used during the rst stage of this work. The resut of the rst stage (i.e., correspondence between image points in the rst pair) is assumed given and is utiized for the simutaneous estimation of motion and disparity at the next time instant. Quaitativey, the motion of scene objects consists of two components: a camera movement from right to eft, which creates the optica eect of scene objects moving towards the opposite direction movement of the depicted train from right to eft Maximum eve Iterations MSE on Intensities LL RR RL Tabe : Stereoscopy and motion on rea data The estimated motion ed for a scae depth equa to 3 and = 150 is shown in Fig. 6, where the unied motion of the background to the right, 13
14 and the independent motion of the train to the eft, are ceary distinguished. Other numerica resuts are given in Tabe. The estimated motion eds were then segmented into regions using a K-Means type agorithm, in which the number of segments shoud be provided a priori. The distance between a segment s and a point p was dened to be the quantity: k ^Us? U p k, where ^U s is the mean of the veocity vectors at the points that beong to segment s and U p the veocity vector at point p. The resuting segmentation on the eft motion ed is shown in Fig. 6, were the regions that correspond to the train and to the camera's motion are ceary distinguished. The evauated depth map for the time instant t + 1 is shown in Fig. 5(b). (a) (b) Figure 6: (a) Estimated dense veocity ed for the eft camera, and (b) corresponding segmentation 5 Concusions An integrated approach to the probem of dynamic stereoscopic vision was proposed, where veocity and disparity eds in a dense structure are estimated simutaneousy. In both stages of the scheme, where initiay the dense disparity ed of the stereoscopic pair is evauated foowed by estimation of 1
15 the two dense veocity and disparity eds of the second stereoscopic pair, convergence is achieved using a mutiscae iterative reaxation agorithm. Experimenta resuts were presented for both synthetic and rea data. Specicay, the approach was appied to an image sequence of a rea scene, where both the object and the binocuar system are moving. The estimated veocity ed was then segmented using a K-Means type agorithm. Currenty we are working on the reconstruction of the 3-D motion for the dierent segments using robust regression techniques. It woud be aso usefu to incorporate the regression scheme into the segmentation phase, that is to segment the veocity ed into regions that correspond to the same 3-D motion. Since theoretica and experimenta approaches to this probem assume ony a simpe stereoscopic mode (i.e., converging or atera), it woud be usefu to examine other modes such as the axia [1], the teescopic, or a genera one where the two optica systems are reated with non-zero rotations, so that it is possibe to confront the more genera case where the geometry of the stereoscopic mode is varying with time. This optica-system dynamic behavior nds appication in robotics where autonomous mechanisms are desired. References [1] N. Avertos, D. Brazakovic, and R. C. Gonzaez, \Camera geometries for image matching in 3-D machine vision", IEEE Transactions on Pattern Anaysis and Machine Inteigence, Vo. PAMI-11, No. 9, pp , Sept [] E.Grosso and M.Tistarei, \ Active/Dynamic Stereo Vision," IEEE Trans. Patt. Ana. Machine Inte., Vo. 17, No. 9, pp , Sept [3] B. Horn, Robot vision, MIT Press, [] Y. C. Kim and J. K. Aggarwa, \Determining object motion in a sequence of stereo images", IEEE Journa of Robotics and Automation, Vo. 3, No. 6, pp , Dec [5] M. K. Leung and T. S. Huang, \An integrated approach to 3D motion anaysis and object recognition", IEEE Transactions on Pattern Anaysis and Machine Inteigence, Vo. PAMI-13, No. 10, pp , Oct [6] S.Z.Li, \On Dincontinuity-Adaptive Smoothness Priors in Computer Vision", IEEE Trans. Patt. Ana. Machine Inte., Vo. 17, No. 6, pp , June [7] A. Mitiche, \On kineopsis and computation of structure and motion", IEEE Transactions on Pattern Anaysis and Machine Inteigence, Vo. PAMI-8, No. 1, pp , Jan
16 [8] A. Mitiche and P. Bouthemy, \Tracking modeed objects using binocuar images", Computer Vision, Graphics and Image Processing, Vo. 3, pp , [9] A. N. Netravai, T. S. Huang et a, \Agebraic methods in 3D motion estimation from two-view point correspondences", Int. Journa of Imaging Systems and Technoogy, Vo. 1, pp , [10] A. Tamtaoui and C. Labit, \Constrained disparity and motion estimators for 3DTV image sequence coding", Signa Processing: Image Communication, Vo., pp. 5-5, [11] G. Tziritas and C. Labit, Motion anaysis for image sequence coding, Esevier, pp. 366+xxiv, 199. [1] A. M. Waxman and J. H. Duncan, \Binocuar image ows: steps forward stereo-motion fusion", IEEE Transactions on Pattern Anaysis and Machine Inteigence, Vo. PAMI-8, No. 6, pp , Nov [13] Z. Zhang and O. Faugeras, \Estimation of dispacements from two 3-D frames obtained from stereo", IEEE Transactions on Pattern Anaysis and Machine Inteigence, Vo. PAMI-1, No. 1, pp , Dec
Backing-up Fuzzy Control of a Truck-trailer Equipped with a Kingpin Sliding Mechanism
Backing-up Fuzzy Contro of a Truck-traier Equipped with a Kingpin Siding Mechanism G. Siamantas and S. Manesis Eectrica & Computer Engineering Dept., University of Patras, Patras, Greece gsiama@upatras.gr;stam.manesis@ece.upatras.gr
More informationA Comparison of a Second-Order versus a Fourth- Order Laplacian Operator in the Multigrid Algorithm
A Comparison of a Second-Order versus a Fourth- Order Lapacian Operator in the Mutigrid Agorithm Kaushik Datta (kdatta@cs.berkeey.edu Math Project May 9, 003 Abstract In this paper, the mutigrid agorithm
More informationLanguage Identification for Texts Written in Transliteration
Language Identification for Texts Written in Transiteration Andrey Chepovskiy, Sergey Gusev, Margarita Kurbatova Higher Schoo of Economics, Data Anaysis and Artificia Inteigence Department, Pokrovskiy
More informationMobile App Recommendation: Maximize the Total App Downloads
Mobie App Recommendation: Maximize the Tota App Downoads Zhuohua Chen Schoo of Economics and Management Tsinghua University chenzhh3.12@sem.tsinghua.edu.cn Yinghui (Catherine) Yang Graduate Schoo of Management
More informationLoad Balancing by MPLS in Differentiated Services Networks
Load Baancing by MPLS in Differentiated Services Networks Riikka Susitaiva, Jorma Virtamo, and Samui Aato Networking Laboratory, Hesinki University of Technoogy P.O.Box 3000, FIN-02015 HUT, Finand {riikka.susitaiva,
More informationJOINT IMAGE REGISTRATION AND EXAMPLE-BASED SUPER-RESOLUTION ALGORITHM
JOINT IMAGE REGISTRATION AND AMPLE-BASED SUPER-RESOLUTION ALGORITHM Hyo-Song Kim, Jeyong Shin, and Rae-Hong Park Department of Eectronic Engineering, Schoo of Engineering, Sogang University 35 Baekbeom-ro,
More informationFastest-Path Computation
Fastest-Path Computation DONGHUI ZHANG Coege of Computer & Information Science Northeastern University Synonyms fastest route; driving direction Definition In the United states, ony 9.% of the househods
More informationA Robust Sign Language Recognition System with Sparsely Labeled Instances Using Wi-Fi Signals
A Robust Sign Language Recognition System with Sparsey Labeed Instances Using Wi-Fi Signas Jiacheng Shang, Jie Wu Center for Networked Computing Dept. of Computer and Info. Sciences Tempe University Motivation
More informationSensitivity Analysis of Hopfield Neural Network in Classifying Natural RGB Color Space
Sensitivity Anaysis of Hopfied Neura Network in Cassifying Natura RGB Coor Space Department of Computer Science University of Sharjah UAE rsammouda@sharjah.ac.ae Abstract: - This paper presents a study
More informationSolutions to the Final Exam
CS/Math 24: Intro to Discrete Math 5//2 Instructor: Dieter van Mekebeek Soutions to the Fina Exam Probem Let D be the set of a peope. From the definition of R we see that (x, y) R if and ony if x is a
More informationA Memory Grouping Method for Sharing Memory BIST Logic
A Memory Grouping Method for Sharing Memory BIST Logic Masahide Miyazai, Tomoazu Yoneda, and Hideo Fuiwara Graduate Schoo of Information Science, Nara Institute of Science and Technoogy (NAIST), 8916-5
More informationEndoscopic Motion Compensation of High Speed Videoendoscopy
Endoscopic Motion Compensation of High Speed Videoendoscopy Bharath avuri Department of Computer Science and Engineering, University of South Caroina, Coumbia, SC - 901. ravuri@cse.sc.edu Abstract. High
More informationLecture outline Graphics and Interaction Scan Converting Polygons and Lines. Inside or outside a polygon? Scan conversion.
Lecture outine 433-324 Graphics and Interaction Scan Converting Poygons and Lines Department of Computer Science and Software Engineering The Introduction Scan conversion Scan-ine agorithm Edge coherence
More informationCollinearity and Coplanarity Constraints for Structure from Motion
Coinearity and Copanarity Constraints for Structure from Motion Gang Liu 1, Reinhard Kette 2, and Bodo Rosenhahn 3 1 Institute of Information Sciences and Technoogy, Massey University, New Zeaand, Department
More informationComputer Graphics. - Shading & Texturing -
Computer Graphics - Shading & Texturing - Empirica BRDF Approximation Purey heuristic mode Initiay without units (vaues [0,1] r = r,a + r,d + r,s ( + r,m + r,t r,a : Ambient term Approximate indirect iumination
More informationDiscrete elastica model for shape design of grid shells
Abstracts for IASS Annua Symposium 017 5 8th September, 017, Hamburg, Germany Annette Böge, Manfred Grohmann (eds.) Discrete eastica mode for shape design of grid shes Yusuke SAKAI* and Makoto OHSAKI a
More informationA Design Method for Optimal Truss Structures with Certain Redundancy Based on Combinatorial Rigidity Theory
0 th Word Congress on Structura and Mutidiscipinary Optimization May 9 -, 03, Orando, Forida, USA A Design Method for Optima Truss Structures with Certain Redundancy Based on Combinatoria Rigidity Theory
More informationStereo. CS 510 May 2 nd, 2014
Stereo CS 510 May 2 nd, 2014 Where are we? We are done! (essentiay) We covered image matching Correation & Correation Fiters Fourier Anaysis PCA We covered feature-based matching Bag of Features approach
More informationUniversity of Illinois at Urbana-Champaign, Urbana, IL 61801, /11/$ IEEE 162
oward Efficient Spatia Variation Decomposition via Sparse Regression Wangyang Zhang, Karthik Baakrishnan, Xin Li, Duane Boning and Rob Rutenbar 3 Carnegie Meon University, Pittsburgh, PA 53, wangyan@ece.cmu.edu,
More informationAN EVOLUTIONARY APPROACH TO OPTIMIZATION OF A LAYOUT CHART
13 AN EVOLUTIONARY APPROACH TO OPTIMIZATION OF A LAYOUT CHART Eva Vona University of Ostrava, 30th dubna st. 22, Ostrava, Czech Repubic e-mai: Eva.Vona@osu.cz Abstract: This artice presents the use of
More informationtread base carc1 carc2 sidewall2 beadflat beadcushion treadfine basefine Y X Z
APPLICATION OF THE FINITE ELEMENT METHOD TO THE ANALYSIS OF AUTOMOBILE TIRES H.-J. PAYER, G. MESCHKE AND H.A. MANG Institute for Strength of Materias Vienna University of Technoogy Karspatz 13/E202, A-1040
More informationDETECTION OF OBSTACLE AND FREESPACE IN AN AUTONOMOUS WHEELCHAIR USING A STEREOSCOPIC CAMERA SYSTEM
DETECTION OF OBSTACLE AND FREESPACE IN AN AUTONOMOUS WHEELCHAIR USING A STEREOSCOPIC CAMERA SYSTEM Le Minh 1, Thanh Hai Nguyen 2, Tran Nghia Khanh 2, Vo Văn Toi 2, Ngo Van Thuyen 1 1 University of Technica
More informationNearest Neighbor Learning
Nearest Neighbor Learning Cassify based on oca simiarity Ranges from simpe nearest neighbor to case-based and anaogica reasoning Use oca information near the current query instance to decide the cassification
More informationA New Supervised Clustering Algorithm Based on Min-Max Modular Network with Gaussian-Zero-Crossing Functions
2006 Internationa Joint Conference on Neura Networks Sheraton Vancouver Wa Centre Hote, Vancouver, BC, Canada Juy 16-21, 2006 A New Supervised Custering Agorithm Based on Min-Max Moduar Network with Gaussian-Zero-Crossing
More informationTechTest2017. Solutions Key. Final Edit Copy. Merit Scholarship Examination in the Sciences and Mathematics given on 1 April 2017, and.
TechTest07 Merit Schoarship Examination in the Sciences and Mathematics given on Apri 07, and sponsored by The Sierra Economics and Science Foundation Soutions Key V9feb7 TechTest07 Soutions Key / 9 07
More informationExtended Node-Arc Formulation for the K-Edge-Disjoint Hop-Constrained Network Design Problem
Extended Node-Arc Formuation for the K-Edge-Disjoint Hop-Constrained Network Design Probem Quentin Botton Université cathoique de Louvain, Louvain Schoo of Management, (Begique) botton@poms.uc.ac.be Bernard
More informationReference trajectory tracking for a multi-dof robot arm
Archives of Contro Sciences Voume 5LXI, 5 No. 4, pages 53 57 Reference trajectory tracking for a muti-dof robot arm RÓBERT KRASŇANSKÝ, PETER VALACH, DÁVID SOÓS, JAVAD ZARBAKHSH This paper presents the
More informationA Fast Block Matching Algorithm Based on the Winner-Update Strategy
In Proceedings of the Fourth Asian Conference on Computer Vision, Taipei, Taiwan, Jan. 000, Voume, pages 977 98 A Fast Bock Matching Agorithm Based on the Winner-Update Strategy Yong-Sheng Chenyz Yi-Ping
More informationHiding secrete data in compressed images using histogram analysis
University of Woongong Research Onine University of Woongong in Dubai - Papers University of Woongong in Dubai 2 iding secrete data in compressed images using histogram anaysis Farhad Keissarian University
More informationDigital Image Watermarking Algorithm Based on Fast Curvelet Transform
J. Software Engineering & Appications, 010, 3, 939-943 doi:10.436/jsea.010.310111 Pubished Onine October 010 (http://www.scirp.org/journa/jsea) 939 igita Image Watermarking Agorithm Based on Fast Curveet
More informationMulti-level Shape Recognition based on Wavelet-Transform. Modulus Maxima
uti-eve Shape Recognition based on Waveet-Transform oduus axima Faouzi Aaya Cheikh, Azhar Quddus and oncef Gabbouj Tampere University of Technoogy (TUT), Signa Processing aboratory, P.O. Box 553, FIN-33101
More informationPneumo-Mechanical Simulation of a 2 Dof Planar Manipulator
Pneumo-Mechanica Simuation of a 2 Dof Panar Manipuator Hermes GIBERTI, Simone CINQUEMANI Mechanica Engineering Department, Poitecnico di Miano, Campus Bovisa Sud, via La Masa 34, 2156, Miano, Itay ABSTRACT
More informationChapter Multidimensional Direct Search Method
Chapter 09.03 Mutidimensiona Direct Search Method After reading this chapter, you shoud be abe to:. Understand the fundamentas of the mutidimensiona direct search methods. Understand how the coordinate
More informationOn-Chip CNN Accelerator for Image Super-Resolution
On-Chip CNN Acceerator for Image Super-Resoution Jung-Woo Chang and Suk-Ju Kang Dept. of Eectronic Engineering, Sogang University, Seou, South Korea {zwzang91, sjkang}@sogang.ac.kr ABSTRACT To impement
More informationRelative Positioning from Model Indexing
Reative Positioning from Mode Indexing Stefan Carsson Computationa Vision and Active Perception Laboratory (CVAP)* Roya Institute of Technoogy (KTH), Stockhom, Sweden Abstract We show how to determine
More informationResponse Surface Model Updating for Nonlinear Structures
Response Surface Mode Updating for Noninear Structures Gonaz Shahidi a, Shamim Pakzad b a PhD Student, Department of Civi and Environmenta Engineering, Lehigh University, ATLSS Engineering Research Center,
More informationImage Segmentation Using Semi-Supervised k-means
I J C T A, 9(34) 2016, pp. 595-601 Internationa Science Press Image Segmentation Using Semi-Supervised k-means Reza Monsefi * and Saeed Zahedi * ABSTRACT Extracting the region of interest is a very chaenging
More informationIdentifying and Tracking Pedestrians Based on Sensor Fusion and Motion Stability Predictions
Sensors 2010, 10, 8028-8053; doi:10.3390/s100908028 OPEN ACCESS sensors ISSN 1424-8220 www.mdpi.com/journa/sensors Artice Identifying and Tracking Pedestrians Based on Sensor Fusion and Motion Stabiity
More informationSpace-Time Trade-offs.
Space-Time Trade-offs. Chethan Kamath 03.07.2017 1 Motivation An important question in the study of computation is how to best use the registers in a CPU. In most cases, the amount of registers avaiabe
More informationOutline. Parallel Numerical Algorithms. Forward Substitution. Triangular Matrices. Solving Triangular Systems. Back Substitution. Parallel Algorithm
Outine Parae Numerica Agorithms Chapter 8 Prof. Michae T. Heath Department of Computer Science University of Iinois at Urbana-Champaign CS 554 / CSE 512 1 2 3 4 Trianguar Matrices Michae T. Heath Parae
More informationResource Optimization to Provision a Virtual Private Network Using the Hose Model
Resource Optimization to Provision a Virtua Private Network Using the Hose Mode Monia Ghobadi, Sudhakar Ganti, Ghoamai C. Shoja University of Victoria, Victoria C, Canada V8W 3P6 e-mai: {monia, sganti,
More informationIncremental Discovery of Object Parts in Video Sequences
Incrementa Discovery of Object Parts in Video Sequences Stéphane Drouin, Patrick Hébert and Marc Parizeau Computer Vision and Systems Laboratory, Department of Eectrica and Computer Engineering Lava University,
More informationDistance Weighted Discrimination and Second Order Cone Programming
Distance Weighted Discrimination and Second Order Cone Programming Hanwen Huang, Xiaosun Lu, Yufeng Liu, J. S. Marron, Perry Haaand Apri 3, 2012 1 Introduction This vignette demonstrates the utiity and
More informationEighth Annual ACM-SIAM Symposium on Discrete Algorithms, January 1997, pp. 777{ Partial Matching of Planar Polylines
Eighth Annua ACM-SIAM Symposium on Discrete Agorithm January 997, pp. 777{786 Partia Matching of Panar Poyines Under Simiarity Transformations Scott D. Cohen Leonidas J. Guibas fscohen,guibasg@cs.stanford.edu
More informationTesting Whether a Set of Code Words Satisfies a Given Set of Constraints *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 6, 333-346 (010) Testing Whether a Set of Code Words Satisfies a Given Set of Constraints * HSIN-WEN WEI, WAN-CHEN LU, PEI-CHI HUANG, WEI-KUAN SHIH AND MING-YANG
More informationFurther Optimization of the Decoding Method for Shortened Binary Cyclic Fire Code
Further Optimization of the Decoding Method for Shortened Binary Cycic Fire Code Ch. Nanda Kishore Heosoft (India) Private Limited 8-2-703, Road No-12 Banjara His, Hyderabad, INDIA Phone: +91-040-3378222
More informationElements of Computer Vision: Multiple View Geometry. 1 Introduction. 2 Elements of Geometry. Andrea Fusiello
Eements of Computer Vision: Mutipe View Geometry. Andrea Fusieo http://www.sci.univr.it/~fusieo June 20, 2005 Fig. 1. Exampe of reconstruction from the five images shown in the top row. 3 1 Introduction
More informationA Petrel Plugin for Surface Modeling
A Petre Pugin for Surface Modeing R. M. Hassanpour, S. H. Derakhshan and C. V. Deutsch Structure and thickness uncertainty are important components of any uncertainty study. The exact ocations of the geoogica
More informationSubstitute Model of Deep-groove Ball Bearings in Numeric Analysis of Complex Constructions Like Manipulators
Mechanics and Mechanica Engineering Vo. 12, No. 4 (2008) 349 356 c Technica University of Lodz Substitute Mode of Deep-groove Ba Bearings in Numeric Anaysis of Compex Constructions Like Manipuators Leszek
More informationComplex Human Activity Searching in a Video Employing Negative Space Analysis
Compex Human Activity Searching in a Video Empoying Negative Space Anaysis Shah Atiqur Rahman, Siu-Yeung Cho, M.K.H. Leung 3, Schoo of Computer Engineering, Nanyang Technoogica University, Singapore 639798
More informationNeural Network Enhancement of the Los Alamos Force Deployment Estimator
Missouri University of Science and Technoogy Schoars' Mine Eectrica and Computer Engineering Facuty Research & Creative Works Eectrica and Computer Engineering 1-1-1994 Neura Network Enhancement of the
More informationBackground Oriented Schlieren technique sensitivity, accuracy, resolution and application to a three-dimensional density field
Background Oriented Schieren technique sensitivity, accuracy, resoution and appication to a three-dimensiona density fied Erik Godhahn 1, Jörg Seume 2 1: Institute of Turbomachinery and Fuid-Dynamics,
More informationarxiv: v1 [math.na] 4 Dec 2015
Optica fow with fractiona order reguarization: variationa mode and soution method Somayeh Gh. Bardeji a,, Isabe N. Figueiredo a,, Ercíia Sousa a,, a CMUC, Department of Mathematics, University of Coimbra,
More informationFurther Concepts in Geometry
ppendix F Further oncepts in Geometry F. Exporing ongruence and Simiarity Identifying ongruent Figures Identifying Simiar Figures Reading and Using Definitions ongruent Trianges assifying Trianges Identifying
More informationEfficient Convex Optimization for Minimal Partition Problems with Volume Constraints
Efficient Convex Optimization for Minima Partition Probems with Voume Constraints Thomas Möenhoff, Caudia Nieuwenhuis, Eno Töppe, and Danie Cremers Department of Computer Science, Technica University of
More informationMassively Parallel Part of Speech Tagging Using. Min-Max Modular Neural Networks.
assivey Parae Part of Speech Tagging Using in-ax oduar Neura Networks Bao-Liang Lu y, Qing a z, ichinori Ichikawa y, & Hitoshi Isahara z y Lab. for Brain-Operative Device, Brain Science Institute, RIEN
More informationMULTIGRID REDUCTION IN TIME FOR NONLINEAR PARABOLIC PROBLEMS: A CASE STUDY
MULTIGRID REDUCTION IN TIME FOR NONLINEAR PARABOLIC PROBLEMS: A CASE STUDY R.D. FALGOUT, T.A. MANTEUFFEL, B. O NEILL, AND J.B. SCHRODER Abstract. The need for paraeism in the time dimension is being driven
More informationOn Upper Bounds for Assortment Optimization under the Mixture of Multinomial Logit Models
On Upper Bounds for Assortment Optimization under the Mixture of Mutinomia Logit Modes Sumit Kunnumka September 30, 2014 Abstract The assortment optimization probem under the mixture of mutinomia ogit
More informationResearch on UAV Fixed Area Inspection based on Image Reconstruction
Research on UAV Fixed Area Inspection based on Image Reconstruction Kun Cao a, Fei Wu b Schoo of Eectronic and Eectrica Engineering, Shanghai University of Engineering Science, Abstract Shanghai 20600,
More informationQuality Assessment using Tone Mapping Algorithm
Quaity Assessment using Tone Mapping Agorithm Nandiki.pushpa atha, Kuriti.Rajendra Prasad Research Schoar, Assistant Professor, Vignan s institute of engineering for women, Visakhapatnam, Andhra Pradesh,
More informationStereo Matching with Energy Minimizing Snake Grid for 3D Face Modeling
Stereo Matching with Energy Minimizing Snake Grid for 3D Face Modeing Shafik Huq 1, Besma Abidi 1, Ardeshir Goshtasby 2, and Mongi Abidi 1 1 Imaging, Robotics, and Inteigent System (IRIS) Laboratory, Department
More informationBinarized support vector machines
Universidad Caros III de Madrid Repositorio instituciona e-archivo Departamento de Estadística http://e-archivo.uc3m.es DES - Working Papers. Statistics and Econometrics. WS 2007-11 Binarized support vector
More informationMinimizing Resource Cost for Camera Stream Scheduling in Video Data Center
Gao YH, Ma HD, Liu W. Minimizing resource cost for camera stream scheduing in video data center. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 32(3): 555 570 May 2017. DOI 10.1007/s11390-017-1743-x Minimizing
More informationPath-Based Protection for Surviving Double-Link Failures in Mesh-Restorable Optical Networks
Path-Based Protection for Surviving Doube-Link Faiures in Mesh-Restorabe Optica Networks Wensheng He and Arun K. Somani Dependabe Computing and Networking Laboratory Department of Eectrica and Computer
More informationAn Exponential Time 2-Approximation Algorithm for Bandwidth
An Exponentia Time 2-Approximation Agorithm for Bandwidth Martin Fürer 1, Serge Gaspers 2, Shiva Prasad Kasiviswanathan 3 1 Computer Science and Engineering, Pennsyvania State University, furer@cse.psu.edu
More informationA Near-Optimal Distributed QoS Constrained Routing Algorithm for Multichannel Wireless Sensor Networks
Sensors 2013, 13, 16424-16450; doi:10.3390/s131216424 Artice OPEN ACCESS sensors ISSN 1424-8220 www.mdpi.com/journa/sensors A Near-Optima Distributed QoS Constrained Routing Agorithm for Mutichanne Wireess
More informationWATERMARKING GIS DATA FOR DIGITAL MAP COPYRIGHT PROTECTION
WATERMARKING GIS DATA FOR DIGITAL MAP COPYRIGHT PROTECTION Shen Tao Chinese Academy of Surveying and Mapping, Beijing 100039, China shentao@casm.ac.cn Xu Dehe Institute of resources and environment, North
More informationCS 231. Inverse Kinematics Intro to Motion Capture. 3D characters. Representation. 1) Skeleton Origin (root) Joint centers/ bones lengths
CS Inverse Kinematics Intro to Motion Capture Representation D characters ) Skeeton Origin (root) Joint centers/ bones engths ) Keyframes Pos/Rot Root (x) Joint Anges (q) Kinematics study of static movement
More informationDETERMINING INTUITIONISTIC FUZZY DEGREE OF OVERLAPPING OF COMPUTATION AND COMMUNICATION IN PARALLEL APPLICATIONS USING GENERALIZED NETS
DETERMINING INTUITIONISTIC FUZZY DEGREE OF OVERLAPPING OF COMPUTATION AND COMMUNICATION IN PARALLEL APPLICATIONS USING GENERALIZED NETS Pave Tchesmedjiev, Peter Vassiev Centre for Biomedica Engineering,
More informationTSR: Topology Reduction from Tree to Star Data Grids
03 Seventh Internationa Conference on Innovative Mobie and Internet Services in biquitous Computing TSR: Topoogy Reduction from Tree to Star Data Grids Ming-Chang Lee #, Fang-Yie Leu *, Ying-ping Chen
More informationMULTITASK MULTIVARIATE COMMON SPARSE REPRESENTATIONS FOR ROBUST MULTIMODAL BIOMETRICS RECOGNITION. Heng Zhang, Vishal M. Patel and Rama Chellappa
MULTITASK MULTIVARIATE COMMON SPARSE REPRESENTATIONS FOR ROBUST MULTIMODAL BIOMETRICS RECOGNITION Heng Zhang, Visha M. Pate and Rama Cheappa Center for Automation Research University of Maryand, Coage
More informationUtility-based Camera Assignment in a Video Network: A Game Theoretic Framework
This artice has been accepted for pubication in a future issue of this journa, but has not been fuy edited. Content may change prior to fina pubication. Y.LI AND B.BHANU CAMERA ASSIGNMENT: A GAME-THEORETIC
More informationRegister Allocation. Consider the following assignment statement: x = (a*b)+((c*d)+(e*f)); In posfix notation: ab*cd*ef*++x
Register Aocation Consider the foowing assignment statement: x = (a*b)+((c*d)+(e*f)); In posfix notation: ab*cd*ef*++x Assume that two registers are avaiabe. Starting from the eft a compier woud generate
More informationDelay Budget Partitioning to Maximize Network Resource Usage Efficiency
Deay Budget Partitioning to Maximize Network Resource Usage Efficiency Kartik Gopaan Tzi-cker Chiueh Yow-Jian Lin Forida State University Stony Brook University Tecordia Technoogies kartik@cs.fsu.edu chiueh@cs.sunysb.edu
More informationAutomatic Grouping for Social Networks CS229 Project Report
Automatic Grouping for Socia Networks CS229 Project Report Xiaoying Tian Ya Le Yangru Fang Abstract Socia networking sites aow users to manuay categorize their friends, but it is aborious to construct
More informationETNA Kent State University
Eectronic Transactions on Numerica Anaysis. Voume 6, pp. 162-181, December 1997. Copyright 1997,. ISSN 1068-9613. ETNA WAVE-RAY MULTIGRID METHOD FOR STANDING WAVE EQUATIONS A. BRANDT AND I. LIVSHITS Abstract.
More informationInnerSpec: Technical Report
InnerSpec: Technica Report Fabrizio Guerrini, Aessandro Gnutti, Riccardo Leonardi Department of Information Engineering, University of Brescia Via Branze 38, 25123 Brescia, Itay {fabrizio.guerrini, a.gnutti006,
More informationOptimization and Application of Support Vector Machine Based on SVM Algorithm Parameters
Optimization and Appication of Support Vector Machine Based on SVM Agorithm Parameters YAN Hui-feng 1, WANG Wei-feng 1, LIU Jie 2 1 ChongQing University of Posts and Teecom 400065, China 2 Schoo Of Civi
More informationA Novel Congestion Control Scheme for Elastic Flows in Network-on-Chip Based on Sum-Rate Optimization
A Nove Congestion Contro Scheme for Eastic Fows in Network-on-Chip Based on Sum-Rate Optimization Mohammad S. Taebi 1, Fahimeh Jafari 1,3, Ahmad Khonsari 2,1, and Mohammad H. Yaghmae 3 1 IPM, Schoo of
More informationLearning Dynamic Guidance for Depth Image Enhancement
Learning Dynamic Guidance for Depth Image Enhancement Shuhang Gu 1, Wangmeng Zuo 2, Shi Guo 2, Yunjin Chen 3, Chongyu Chen 4,1, Lei Zhang 1, 1 The Hong Kong Poytechnic University, 2 Harbin Institute of
More information(0,l) (0,0) (l,0) (l,l)
Parae Domain Decomposition and Load Baancing Using Space-Fiing Curves Srinivas Auru Fatih E. Sevigen Dept. of CS Schoo of EECS New Mexico State University Syracuse University Las Cruces, NM 88003-8001
More informationFREE-FORM ANISOTROPY: A NEW METHOD FOR CRACK DETECTION ON PAVEMENT SURFACE IMAGES
FREE-FORM ANISOTROPY: A NEW METHOD FOR CRACK DETECTION ON PAVEMENT SURFACE IMAGES Tien Sy Nguyen, Stéphane Begot, Forent Ducuty, Manue Avia To cite this version: Tien Sy Nguyen, Stéphane Begot, Forent
More informationAutomatic Hidden Web Database Classification
Automatic idden Web atabase Cassification Zhiguo Gong, Jingbai Zhang, and Qian Liu Facuty of Science and Technoogy niversity of Macau Macao, PRC {fstzgg,ma46597,ma46620}@umac.mo Abstract. In this paper,
More informationLecture Notes for Chapter 4 Part III. Introduction to Data Mining
Data Mining Cassification: Basic Concepts, Decision Trees, and Mode Evauation Lecture Notes for Chapter 4 Part III Introduction to Data Mining by Tan, Steinbach, Kumar Adapted by Qiang Yang (2010) Tan,Steinbach,
More informationCommunity-Aware Opportunistic Routing in Mobile Social Networks
IEEE TRANSACTIONS ON COMPUTERS VOL:PP NO:99 YEAR 213 Community-Aware Opportunistic Routing in Mobie Socia Networks Mingjun Xiao, Member, IEEE Jie Wu, Feow, IEEE, and Liusheng Huang, Member, IEEE Abstract
More informationEfficient Histogram-based Indexing for Video Copy Detection
Efficient Histogram-based Indexing for Video Copy Detection Chih-Yi Chiu, Jenq-Haur Wang*, and Hung-Chi Chang Institute of Information Science, Academia Sinica, Taiwan *Department of Computer Science and
More informationPuneet Goel, Stergios I. Roumeliotis and Gaurav S. Sukhatme. Institute for Robotics and Intelligent Systems
obot Locaization Using eative and Absoute Position Estimates Puneet Goe, Stergios I. oumeiotis and Gaurav S. Sukhatme puneetjstergiosjgaurav@robotics:usc:edu Department of Computer Science Institute for
More informationTHE PERCENTAGE OCCUPANCY HIT OR MISS TRANSFORM
17th European Signa Processing Conference (EUSIPCO 2009) Gasgow, Scotand, August 24-28, 2009 THE PERCENTAGE OCCUPANCY HIT OR MISS TRANSFORM P. Murray 1, S. Marsha 1, and E.Buinger 2 1 Dept. of Eectronic
More informationFIRST BEZIER POINT (SS) R LE LE. φ LE FIRST BEZIER POINT (PS)
Singe- and Muti-Objective Airfoi Design Using Genetic Agorithms and Articia Inteigence A.P. Giotis K.C. Giannakogou y Nationa Technica University of Athens, Greece Abstract Transonic airfoi design probems
More informationArithmetic Coding. Prof. Ja-Ling Wu. Department of Computer Science and Information Engineering National Taiwan University
Arithmetic Coding Prof. Ja-Ling Wu Department of Computer Science and Information Engineering Nationa Taiwan University F(X) Shannon-Fano-Eias Coding W..o.g. we can take X={,,,m}. Assume p()>0 for a. The
More informationA Local Optimal Method on DSA Guiding Template Assignment with Redundant/Dummy Via Insertion
A Loca Optima Method on DSA Guiding Tempate Assignment with Redundant/Dummy Via Insertion Xingquan Li 1, Bei Yu 2, Jiani Chen 1, Wenxing Zhu 1, 24th Asia and South Pacific Design T h e p i c Automation
More informationAUTOMATIC IMAGE RETARGETING USING SALIENCY BASED MESH PARAMETERIZATION
S.Sai Kumar et a. / (IJCSIT Internationa Journa of Computer Science and Information Technoogies, Vo. 1 (4, 010, 73-79 AUTOMATIC IMAGE RETARGETING USING SALIENCY BASED MESH PARAMETERIZATION 1 S.Sai Kumar,
More informationAn Introduction to Design Patterns
An Introduction to Design Patterns 1 Definitions A pattern is a recurring soution to a standard probem, in a context. Christopher Aexander, a professor of architecture Why woud what a prof of architecture
More informationHandling Outliers in Non-Blind Image Deconvolution
Handing Outiers in Non-Bind Image Deconvoution Sunghyun Cho 1 Jue Wang 2 Seungyong Lee 1,2 sodomau@postech.ac.kr juewang@adobe.com eesy@postech.ac.kr 1 POSTECH 2 Adobe Systems Abstract Non-bind deconvoution
More informationFiltering. Yao Wang Polytechnic University, Brooklyn, NY 11201
Spatia Domain Linear Fitering Yao Wang Poytechnic University Brookyn NY With contribution rom Zhu Liu Onur Gueryuz and Gonzaez/Woods Digita Image Processing ed Introduction Outine Noise remova using ow-pass
More informationHuman Action Recognition Using Key Points Displacement
Human Action Recognition Using Key Points Dispacement Kuan-Ting Lai,, Chaur-Heh Hsieh 3, Mao-Fu Lai 4, and Ming-Syan Chen, Research Center for Information Technoogy Innovation, Academia Sinica, Taiwan
More informationApplication of Intelligence Based Genetic Algorithm for Job Sequencing Problem on Parallel Mixed-Model Assembly Line
American J. of Engineering and Appied Sciences 3 (): 5-24, 200 ISSN 94-7020 200 Science Pubications Appication of Inteigence Based Genetic Agorithm for Job Sequencing Probem on Parae Mixed-Mode Assemby
More information1682 IEEE TRANSACTIONS ON FUZZY SYSTEMS, VOL. 22, NO. 6, DECEMBER Backward Fuzzy Rule Interpolation
1682 IEEE TRANSACTIONS ON FUZZY SYSTEMS, VOL. 22, NO. 6, DECEMBER 2014 Bacward Fuzzy Rue Interpoation Shangzhu Jin, Ren Diao, Chai Que, Senior Member, IEEE, and Qiang Shen Abstract Fuzzy rue interpoation
More informationM. Badent 1, E. Di Giacomo 2, G. Liotta 2
DIEI Dipartimento di Ingegneria Eettronica e de informazione RT 005-06 Drawing Coored Graphs on Coored Points M. Badent 1, E. Di Giacomo 2, G. Liotta 2 1 University of Konstanz 2 Università di Perugia
More informationAs Michi Henning and Steve Vinoski showed 1, calling a remote
Reducing CORBA Ca Latency by Caching and Prefetching Bernd Brügge and Christoph Vismeier Technische Universität München Method ca atency is a major probem in approaches based on object-oriented middeware
More information