|
|
- Lambert Ernest Mitchell
- 5 years ago
- Views:
Transcription
1 Daisuke Miyazaki, Katsushi Ikeuchi, "Inverse Polarization Raytracing: Estimating Surface Shae of Transarent Objects," in Proceedings of International Conference on Comuter Vision and Pattern Recognition, San Diego, CA USA, to aear htt://
2
3 Inverse Polarization Raytracing: Estimating Surface Shaes of Transarent Objects Daisuke Miyazaki Katsushi Ikeuchi Institute of Industrial Science, The University of Tokyo, JAPAN htt:// Abstract We roose a novel method for estimating the surface shaes of transarent objects by analyzing the olarization state of the light. Existing methods do not fully consider the reflection, refraction, and transmission of the light occurring inside a transarent object. We emloy a olarization raytracing method to comute both the ath of the light and its olarization state. Our roosed iterative comutation method estimates the surface shae of the transarent object by minimizing the difference between the olarization data rendered by the olarization raytracing method and the olarization data obtained from a real object.. Introduction In the field of comuter vision, few methods have been roosed for estimating the shae of transarent objects, because of the difficulty of dealing with mutual reflection, which is the henomenon that the light not only reflects at the surface of the transarent object but also transmits into the object and causes multile reflections and transmissions inside it. In this aer, we use the term interreflection for such internal reflection. Raytracer simulates the interreflection, and renders the 2D image from 3D shae: Image = Raytracer(Shae) : () If an inverse function of raytracing were to exist, the 3D shae could be obtained straightforwardly from 2D data; however, there is no closed-form solution for the inverse roblem of raytracing. This aer resents a novel method for estimating the surface shae of transarent objects by numerically solving the inverse roblem of raytracing and, at the same time, by analyzing the olarization of transarent objects. An examle for alying the roosed method is shown in Figure. Figure (a) is the target object, and Figure (b) is the result of roosed method. Figure (c) is a rendered examle of the raytracing method by using the estimated shae. Polarization is a henomenon in which the light oscillates in one direction. Recently, research to estimate the Figure : Result for heart-shaed glass: (a) Target object, (b) result of roosed method, (c) raytracing image. shae of the object by using olarization has increased [ 5]. Saito et al. [6] and Miyazaki et al. [7,8] estimated the surface shae of transarent objects by means of olarization analysis. Unfortunately, because these methods do not consider interreflection, they do not rovide sufficient accuracy for estimating the shae of transarent objects. Other methods that estimate the 3D shae of transarent objects without using olarization have been roosed. Murase [9] estimated the shae of a water surface by analyzing the undulation of the water surface. Hata et al. [0] estimated the surface shae of transarent objects by analyzing the deformation of the light rojected onto the transarent objects. Ohara et al. [] estimated the deth of the edge of a transarent object by using shae-from-focus. Ben-Ezra and Nayar [2] estimated the arameterized surface shae of transarent objects by using structure-from-motion. Kutulakos [3] estimated both the deth and the surface normal of transarent objects by multile viewoints and multile light sources. These methods, however, do not estimate arbitrary shaes of transarent objects. There are other works that deal with transarent objects by using methods such as environment matting [4 9] and reflection searation [20 23]; however, they do not rovide enough information about the shaes of the transarent objects. We simulate the interreflection of transarent objects by using a method called olarization raytracing, and we use this method to estimate the surface shaes of transarent objects with arbitrary shaes. In this aer, a forward-facing surface of the transarent object is called a front surface, and an object surface facing away from the camera is called
4 a back surface. Our roosed method estimates the shae of the front surface by using olarization raytracing when the refractive index, the shae of the back surface, and the illumination distribution are given. The rest of the aer is organized as follows. In Section 2, we describe the theoretical background of the olarization raytracing method. In Section 3, we exlain our estimation method, which solves the inverse roblem of olarization raytracing method. Our measurement results are shown in Section 4, and our conclusions are resented in Section Polarization Raytracing The theoretical details of the rincile of olarization, which aears in this section, are resented in the literature [24, 25]. 2.. Conventional Raytracing A conventional raytracing method renders a 2D image from 3D geometrical shae data of transarent objects or other kind of objects. The algorithm of the conventional raytracing method can be divided into two arts. The first art is the calculation of the roagation of the ray. The second art is the calculation of the intensity of the light. Figure 2 describes the light reflected and transmitted between material and material 2. Materials and 2 may be, resectively, the air and the transarent object, and vice versa. Incidence angle, reflection angle, and transmission angle are defined in Figure 2. We assume that the surface of transarent objects is otically smooth; thus, the incidence angle is equal to the reflection angle. The transmission angle is related to the incidence angle as the following Snell s law: sin = n sin 0 (2) where is the incidence angle, 0 is the transmission angle, and n is the ratio of the refractive index of material 2 to that of material. In this aer, we assume that the refractive index of one object is a scalar value which is, at the same time, constant throughout any art of the object. The lane of incidence (POI) is a lane that includes the surface normal direction, the incident light direction, the reflected light direction, and the transmitted light direction. The intensity ratio of reflected light to incident light is called intensity reflectivity R, and the intensity ratio of transmitted light to incident light is called intensity transmissivity T. Subscrits k and? reresent the comonents arallel and erendicular to POI, resectively. Thus, arallel and erendicular comonents of intensity reflectivity are reresented as R k and R?, resectively, while those of intensity transmissivity are reresented as T k and T?, resectively. These values are defined as follows: R k = tan2 ( ; 0 ) (3) tan 2 ( + 0 ) Figure 2: Reflection, refraction, and transmission. R? = sin2 ( ; 0 ) sin 2 ( + 0 ) sin 2 sin 2 0 T k = sin 2 ( + 0 ) cos 2 ( ; 0 ) sin 2 sin 20 T? = sin 2 : (6) ( + 0 ) If an incidence angle is larger than the critical angle, then the light does not transmit and totally reflects. This henomenon is called total reflection and occurs when the incidence light is inside the object (namely, when material is the object and material 2 is the air). Critical angle C is defined as follows: sin c = n : (7) For the total reflection, we must use R k = R? = and T k = T? =0. The conventional raytracing method calculates the roagation of the ray by using the Snell s law (Equation (2)), and calculates the intensity of the light by using the total intensity reflectivity R and the total intensity transmissivity T, which are defined as follows: R = R k + R? Mueller Calculus T = T k + T? 2 (4) (5) : (8) In this aer, we call the raytracing method that considers the olarization effect the olarization raytracing method. The algorithm of the olarization raytracing method can be divided into two arts. For the first art, the calculation of the roagation of the ray, we emloy the same algorithm used in the conventional raytracing method. For the second art, the calculation of the olarization state of the light, there are three famous methods: Mueller calculus, Jones calculus, and the method that uses the coherence matrix. In this aer, we emloy Mueller calculus because of its simlicity of descrition, along with its ease of understanding and imlementation. These three methods have
5 Figure 3: Reflected and transmitted light observed by the camera. almost identical functions; thus, all discussions resented in this aer are also alicable to other calculi. Some researchers [26 32] also imlemented and imroved the olarization raytracing or imroved these three methods, and also, there is some commercial software [33 35] that uses olarization raytracing. In Mueller calculus, the olarization state of the light is reresented as Stokes vector s = (s 0 s s 2 s 3 ) T. The Stokes vector is a 4D vector. Its first comonent s 0 reresents the intensity of the light; its second comonent s reresents the horizontal ower of the linear olarization; its third comonent s 2 reresents the +45 -oblique ower of the linear olarization; and its fourth comonent s 3 reresents the ower of the right circular olarization. The Mueller matrix M, which is a 4 4 matrix, reresents how the object changes the olarization state of the light. The oeration of Mueller calculus is a linear oeration Mueller Matrices In this section, we resent an examle of calculation using Mueller calculus. Suose the geometrical setu when the reflected and transmitted light is observed from the camera is as described in Figure 3. In this figure, there are two kinds of coordinates sytems: x 0 y 0 z 0 coordinates and xyz coordinates. Here, the z 0 axis and the z axis are the same. x 0 is included in the POI and is facing to the same side as the surface normal is facing. The angle between x 0 axis and x axis is called the POI angle in xyz coordinates. In the case resented in Figure 3, observed light is a comosition of reflected light and transmitted light. The Stokes vector s 0 of the observed light is calculated as follows: s 0 = C()D( n)r( n)c(;)s r + C()T( n)c(;)s t : (9) Stokes vectors of the incident light are reresented as s r and s t, and where s r and s t reresent the lights that are set in the origin of the reflection and transmission, resectively. C is the rotation Mueller matrix and is given by: 0 C() = cos 2 ; sin sin 2 cos C A : (0) R and T are the reflection Mueller matrix and the transmission Mueller matrix, resectively, which are reresented as follows: 0 R = T = 0 (R k + R? )=2 (R k ; R? )=2 0 0 (R k ; R? )=2 (R k + R? )= Rk R? Rk R? (T k + T? )=2 (T k ; T? )=2 0 0 (T k ; T? )=2 (T k + T? )= Tk T? Tk T? C A () C A : (2) However, if the total reflection occurs, that is, if the incidence angle is larger than critical angle C, then R and T are set to be identity matrix and zero matrix, resectively. D is the retardation Mueller matrix and is given as: 0 D() = cos sin 0 0 ; sin cos C A (3) where is the amount of the hase shift (or retardation). The hase of the reflected light shifts when the total reflection occurs. Thus, for the total reflection, in the following equation is used. tan 2 = cos sin 2 ; n 2 : (4) sin 2 The hase of the reflected light inverts when the incidence angle is smaller than the Brewster angle B, which is defined as follows: tan B = n : (5) Thus, the value of is set as follows: 8 < Eq:(4) = : 2.4. Degree of Polarization C 80 B 0 otherwise : (6) The olarization state of the light is calculated by observing the object with a monochrome camera, which has a linear olarizer in the front. For a certain ixel, we denote the maximum intensity observed by rotating the olarizer as I max and the minimum as I min. The angle of the olarizer when the minimum intensity I min is observed is called the hase angle. This angle is defined as the angle from +x axis to +y axis in xyz coordinates (Figure 3). Because the linear olarizer is used in this research, the fourth arameter s 3 of the Stokes vector cannot be determined. The relationshi between the Stokes vector (s s s 2 ) T and I max, I min, is: 0 0 s 0 s A cos 2 ; sin 2 A@ I max + I min I max ; I min A : (7) 0 sin 2 cos 2 0 s 2
6 The degree of olarization (DOP) reresents how much the light is olarized and is defined as follows: s 2 ^ = + s2 2 + s2 3 : (8) s 0 However, linear olarizer can only calculate the following degenerated DOP: = I max ; I min s 2 = + s2 2 : (9) I max + I min s 0 For the remainder of this aer, we refer to the ratio calculated by Equation (9) as DOP Illumination Distribution In this aer, we assume that all light sources are unolarized. We also assume that the front surface of the object is uniformly illuminated with the same intensity in every direction, and that the back surface of the object is also uniformly illuminated with the same intensity in every direction but with a different intensity from the intensity that illuminates the front surface. 3. Inverse Polarization Raytracing In this section, we introduce our method for estimating the front surface shae of a transarent object using the DOP and the hase angle as inuts under the assumtion that the refractive index, the shae of the back surface, and the illumination distribution are given. Details of numerical algorithms are shown in the literature [36]. We denote the inut olarization data as I E. Polarization data are reresented as an image (2-dimensionally distributed data) where the DOP and hase angle are set for each ixel. The olarization raytracing exlained in Section 2 can render the olarization data from the shae of the transarent object by tracing the light ray and by Mueller calculus. We denote this rendered olarization image as I R. The shae of transarent objects is reresented as the height H, set for each ixel. Heights artially differentiated by x and y are called gradients, and are reresented as and q, resectively: = H q = H : (20) Surface normal n =(; ;q ) T is reresented by these gradients. The rendered olarization image I R deends uon height and surface normal, so it can be reresented as I R (H q). Our roblem is finding the best values to reconstruct a surface H that satisfies the following equation: I E = I R (H q) : (2) We call this equation the olarization raytracing equation from the analogy of image irradiance equation used in the shae-from-shading roblem. A straightforward definition of the cost function, which we want to minimize, can be as follows: ZZ E (x y)dxdy (22) where, E =(I E ; I R (H q)) 2 : (23) We will sometimes omit the variables (x y) in the subsequent discussions for the simlicity of descritions. I R deends uon, q, and H, while, q, and H deend uon each other with Equation (20). Thus, the cost function must be modified as follows: ZZ (E + E 2 ) dxdy (24) where, E 2 =(H x ; ) 2 +(H y ; q) 2 : (25) is a Lagrange undetermined multilier. Euler equations that minimize Equation (24) are derived as follows: = H x (26) q = H y (27) H = H ; 4 ( x + q y ) (28) where H is a 4-neighbor average of H. Each of the above equations can be decomosed into two stes: (k) = H (k) x (29) (k+) = (k) ; (30) q (k) = H (k) y (3) q (k+) = q (k) ; (k) H (k+) = H (k) ; 4 (k+) x + q (k+) y (32) (33) H () = H () ; () : (34) Here,, 2, and 3 are scalar values that are determined for each ixel and for each iteration ste. Suerscrit (k) reresents the iteration number. We do not write down the iteration number for Equation (34) because we do not use this equation due to the following reasons. One reason is that the cost function E deends uon the change of surface normal rather than on the change of height. Another reason is that the cost function E smoothly changes when the surface normal changes, but it does not smoothly change when the height changes. This fact was emirically roved in the reliminary exeriments. The algorithm goes as follows. First, we set initial values of the shae H for each oint of the front surface. Next, and q are calculated by Equations (29)(3). Then, we
7 solve Equations (30)(32). and 2 should be otimal values; thus, we use Brent s method to determine and 2, which minimizes the cost function E. After comuting and q at every ixel, we solve Equation (33) by the relaxation method [37,38] to determine the height H. We use the alternating-direction imlicit method to solve the relaxation roblem. To conclude, the front surface shae of the transarent object is estimated by an iterative comutation, where each ste of iteration solves Equations (29) (33), and the iteration stos when Equation (22) is minimized. There are two reasons why we use Equations (29) (33) instead of Equations (26) (28): () If we solve Equations (26) (28) simultaneously by setting an arbitrary value, a arameter tuning roblem will occur where must be set to an otimal value in order to stably solve these equations; (2) We can aly adequate numerical algorithms for each of Equations (29) (33). 4. Measurement Result 4.. Acquisition System For obtaining olarization data, we develoed an acquisition system, which we named Cocoon (Figure 4). The target object is set inside the center of the lastic shere whose diameter is 35cm. This lastic shere is illuminated by 36 incandescent lams. These 36 light sources are almost uniformly distributed satially around the lastic shere. The lastic shere diffuses the light that comes from the light sources, and it behaves as a sherical light source, which illuminates the target object from every direction. Note that the measurement is ossible for arbitrary illumination conditions though the intensity and the olarization state of the illumination distribution must be known. The target object is observed by monochrome camera from the to of the lastic shere, which has a hole on the to. Linear olarizer is set in front of the camera. We ut the target object on the black ie to make the incoming light from the back surface uniform and unolarized. The camera, object, and light sources are fixed. From four images taken by rotating the olarizer at 0, 45, 90, and 35,we calculate I max, I min, and (Section 2.4) Rendering Result Before estimating the shae of the transarent object, we analyze the rendered image of forward olarization raytracing (Section 2). From the sherical art, we observe a transarent acrylic hemishere, whose refractive index is.5 and diameter is 3cm. Obtained olarization image of the real object is shown in Figure 5(a). The figure reresents the DOP, where DOP 0 and DOP are reresented as black and white, resectively. The rendered olarization image of olarization raytracing is shown in Figure 5(b). The refractive index and the Figure 4: Acquisition System Cocoon. Figure 5: DOP image; (a) obtained from real object, (b) rendered by olarization raytracing, and (c) rendered by assuming that the internal interreflection does not occur. shae of the object are known. As for the illumination distribution, we have to obtain the ratio of the intensity of the light illuminating the front surface to that illuminating the back surface. Unfortunately, it is imossible to observe the light illuminating the back surface without moving the object out of the way. Therefore, we find the most aroriate value of the intensity of the back surface where the difference of the obtained DOP (Figure 5(a)) and the rendered DOP (Figure 5(b)) minimizes, by solving such minimization roblem. Figure 5(b) is calculated by using the intensity obtained from such minimization. For comarison, a rendered image with no interreflection is shown in Figure 5(c). This DOP image is rendered by assuming that the light reflected at the object s surface once is just observed and that the transmission does not occur. The root mean square (RMS) error between real data (Figure 5(a)) and DOP data of no interreflection (Figure 5(c)) was 0.48, while the RMS error between real data and olarization raytracing data (Figure 5(b)) was Simulation Result Here, we will show the result of estimating the 2D shae of a simulated object for evaluating the robustness of our algorithm. This virtual transarent object is a concave shae whose refractive index is.5. The object is reresented as a dotted line in Figure 6. We render the olarization data of
8 Figure 6: Simulation result of concave shae: (a) Initial state, (b)(c) result after 5, 20 loos, resectively. the object observed from the uer osition to the lower direction, and after that, we estimate the front surface shae of the concave object by using the rendered olarization data as inut data. Illumination is distributed uniformly from every direction with the same intensity. The light is not illuminated at the bottom of the shae but is illuminated on the front surface. Illumination distribution, the back surface shae, and the refractive index are given. The estimation result is illustrated in Figure 6. The dotted line is the true shae, and the solid line is the estimated shae. Figure 6(a) indicates the initial value, and Figure 6(b) and Figure 6(c) indicate the results after 5 and 20 loos of the roosed method. The shae, which is generated by scaling the true height by.2, is used as the initial state of the shae. The shae converged to the true shae at 20 loos. The average comutation time was 4.8[sec] for loo with 320 ixels by using Pentium4 3.4GHz. Here, the maximum number of tracings is 00 reflections or transmissions; however, if the energy of the light ray becomes less than a certain threshold, the tracing of the light ray is stoed Measurement Results of Real Object Hemishere For the first measurement result, we observe an acrylic transarent hemishere from the sherical art, which is also used in the rendering exeriment (Section 4.2). We assume that the refractive index and the back surface shae are known. We use the same value for the intensity of the light source, which is obtained in Section 4.2. The value is obtained by observing the same object as Section 4.2, and we will rovide a more objective result in the next section. The estimation result is shown in Figure 7. Figure 7(a) reresents the result of the revious method [6 8] and, at the same time, it reresents the intial value. Figure 7(b) is the result after 0 loos of our method. The average comutation time was 36[sec] for loo with 7,854 ixels. Here, the maximum number of tracings is 0 reflections or transmissions. More detailed evaluation is done in the 2D lane that is a cross section of the 3D object, which includes the center of the base circle and the line erendicular to that circle. A light ray that is inside this lane does not go out, and a light ray that is outside this lane does not come in. The roosed algorithm estimates the front surface shae, a semicircle, by Figure 7: Estimation result of hemishere: (a) Initial state (result of revious method), (b) result after 0 loos. Figure 8: Estimation result: (a) Initial state (result of revious method), (b)(c) results after 5 and 50 loos, (2a) initial state (true shae), (2b)(2c) results after 5 and 50 loos. using the olarization data of the 2D lane as inut data. The result of alying the roosed method is given in Figure 8(c) and Figure 8(2c). In Figure 8, the solid line reresents the estimated shae, and the dotted line reresents the true shae. For the estimated result shown in Figure 8(c), the result of the revious method (Figure 8(a)) is used for the initial state of the shae. For the estimated result shown in Figure 8(2c), the true shae, hemishere (Figure 8(2a)), is used for the initial state of the shae. Figures 8(b)(2b) and Figures 8(c)(2c) are the result after 5 and 50 loos, resectively. The shaes converge to the same shae even if the initial shaes are different. The reason why there is a rotruding noise at the to of the estimated shae might be the failure of considering the hole on to of the lastic shere. Although we have assumed that the object is illuminated uniformly with the same intensity from all directions, we now believe that this assumtion might not strictly hold for this hole. Therefore, considering such illumination distribution will be our future work. The value of the cost function (Equation (22)) er each iteration is lotted in Figure 9. The vertical axis in Figure 9 reresents the value of Equation (22), while the horizontal axis reresents the iteration number. A diamond mark is the value of the result whose initial state is the result of the revious method (Figures 8(a)(b)(c)). A square mark is the value of the result whose initial state is the true shae (Figures 8(2a)(2b)(2c)). The leftmost value is the value of the cost function of the initial state. Both the value and the shae did not change after around 8 loos. The average comutation time was 5.9[sec] for loo with 320 ixels.
9 (a) (b) (c) Figure : Estimation result: (a) Initial value, (b)(c) result after 5, 20 loos. Figure 9: Error for each loo: (square) Result when true shae is initial value, (diamond) result when result of revious method is initial value. Figure 0: Bell-shaed transarent acrylic real object. The RMS error between the estimated value and the true value is used to comare the accuracy between the roosed method and the revious method. The RMS error of the surface normal was 23:3 for revious method, 9:09 for our method when the initial state was the result of the revious method, and 8:86 for our method when the initial state was the true shae. The RMS error of the height was 2.70mm for the revious method, 0.672mm for our method when the initial state was the result of revious method, and 0.548mm for our method when the initial state was the true shae Bell-shaed Object Finally, we observe the transarent object shown in Figure 0. This object is made of acrylic and is a body-ofrevolution. Its refractive index is.5 and its diameter of the base is 24mm. The object is observed from the rojected area of the object. The front surface is a curved surface and the back surface is a disk. The camera is set orthogonally to the disk. We assume that the refractive index and the back surface shae are known. We use the same value for the intensity of the light source that is obtained in Section 4.2. This aer only concentrates on roosing a method to estimate the shaes of transarent objects, and obtaining the correct illumination distribution will be a future work. We estimate the shae of a cross-section of the object to analyze the recision of the roosed method. The crosssection includes the center of the base circle and the line erendicular to that circle. Figure (c) illustrates the estimated shae of the object. The solid curve reresents the obtained front height, and the dotted line reresents the given back height. The initial value is set to be a semi- circle shown in Figure (a). The estimated shae after 5 and 20 loos is illustrated in Figure (b) and Figure (c), resectively. RMS of the height was 0.24mm, where the true shae was obtained from the silhouette extracted manually by a human oerator from the hotograh of the object taken from the side. The average comutation time was 7.0[sec] for loo with 320 ixels. 5. Conclusion In this aer, we have roosed a novel method for estimating the surface shae of transarent objects by minimizing the difference between the inut olarization data taken by observing the transarent object and the comuted olarization data rendered by the olarization raytracing method. We estimated the shae of transarent objects by an iterative comutation. We used a uniform illumination in this aer; however, Hata et al. [0] estimated the shae of transarent objects by an iterative comutation where the object was illuminated by structured light. Ben-Ezra and Nayar [2] estimated the shae of a transarent object observed from many viewoints by an iterative comutation. To imrove the recision of measuring the surface shae of transarent objects, we should robably observe the target object from multile viewoints or under various tyes of illumination. In any case, the iterative comutation is considered to be necessary. Our aer rovides the technique for measuring the surface shae of transarent objects using iterative comutation, and this technique might be used as the basis for further develoments. Most of the artificial transarent objects have a lanar base that enables them to stand by themselves. Also, the material (refractive index) of the artificial transarent objects is known in many cases. Thus, the assumtion we adoted in this aer, back surface shae and refractive index are known, is effective in many cases. However, not all objects meet these conditions; thus, we intend to develo a method that can measure the back surface shae and refractive index at the same time as well as the front surface shae. Acknowledgments This research was suorted in art by the Ministry of Education, Culture, Sorts, Science and Technology. Daisuke Miyazaki was suorted by the Jaan Society for the Promotion of Science. The authors thank Joan Kna
10 for roofreading and editing this manuscrit. They also thank anonymous reviewers for their careful reviews of the aer. References [] K. Koshikawa and Y. Shirai, A model-based recognition of glossy objects using their olarimetrical roerties, Advanced Robotics, Vol. 2, No. 2, , 987. [2] L. B. Wolff and T. E. Boult, Constraining object features using a olarization reflectance model, IEEE Trans. Patt. Anal. Mach. Intell., Vol. 3, No. 7, , 99. [3] S. Rahmann and N. Canterakis, Reconstruction of secular surfaces using olarization imaging, Proc. IEEE Conf. Comuter Vision and Pattern Recognition, , 200. [4] O. Drbohlav and R. Šára, Unambiguous determination of shae from hotometric stereo with unknown light sources, Proc. IEEE Int l Conf. Comuter Vision,. I:58-586, 200. [5] D. Miyazaki, R. T. Tan, K. Hara, and K. Ikeuchi, Polarizationbased inverse rendering from a single view, Proc. IEEE Int l Conf. Comuter Vision, , [6] M. Saito, Y. Sato, K. Ikeuchi, and H. Kashiwagi, Measurement of surface orientations of transarent objects by use of olarization in highlight, J. Ot. Soc. Am. A, Vol. 6, No. 9, , 999. [7] D. Miyazaki, M. Saito, Y. Sato, and K. Ikeuchi, Determining surface orientations of transarent objects based on olarization degrees in visible and infrared wavelengths, J. Ot. Soc. Am. A, Vol. 9, No. 4, , [8] D. Miyazaki, M. Kagesawa, and K. Ikeuchi, Transarent surface modeling from a air of olarization images, IEEE Trans. Patt. Anal. Mach. Intell., Vol. 26, No., , [9] H. Murase, Surface shae reconstruction of a nonrigid transarent object using refraction and motion, IEEE Trans. Patt. Anal. Mach. Intell., Vol. 4, No. 0, , 992. [0] S. Hata, Y. Saitoh, S. Kumamura, and K. Kaida, Shae extraction of transarent object using genetic algorithm, Proc. Int l Conf. Pattern Recognition, , 996. [] K. Ohara, M. Mizukawa, K. Ohba, and K. Taki, 3D modeling of micro transarent object with integrated vision, Proc. IEEE Conf. Multisensor Fusion and Integration for Intelligent Systems,. 07-2, [2] M. Ben-Ezra and S. K. Nayar, What does motion reveal about transarency?, Proc. IEEE Int l Conf. Comuter Vision, , [3] K. N. Kutulakos, Refractive and secular 3D shae by lightath triangulation, Proc. Int l Symosium on the CREST Digital Archiving Project, , [4] D. E. Zongker, D. M. Warner, B. Curless, and D. H. Salesin, Environmental matting and comositing, Proc. SIGGRAPH, , 999. [5] Y. Chuang, D. E. Zongker, J. Hindorff, B. Curless, D. H. Salesin, and R. Szeliski, Environment matting extensions: towards higher accuracy and real-time cature, Proc. SIG- GRAPH,. 2-30, [6] Z. S. Hakura and J. M. Snyder, Realistic reflections and refractions on grahics hardware with hybrid rendering and layered environment mas, Proc. Eurograhics Worksho on Rendering, , 200. [7] W. Matusik, H. Pfister, R. Ziegler, A. Ngan, and L. McMillan, Acquisition and rendering of transarent and refractive objects, Proc. Eurograhics Worksho on Rendering, , [8] Y. Wexler, A. W. Fitzgibbon, and A. Zisserman, Imagebased environment matting, Proc. Eurograhics Worksho on Rendering, , [9] P. Peers and P. Dutré, Wavelet environment matting, Proc. Eurograhics Worksho on Rendering, , [20] Y. Y. Schechner, J. Shamir, and N. Kiryati, Polarization and statistical analysis of scenes containing a semireflector, J. Ot. Soc. Am. A, Vol. 7, No. 2, , [2] Y. Y. Schechner, N. Kiryati, and R. Basri, Searation of transarent layers using focus, Int l J. Comuter Vision, Vol. 39, No., , [22] R. Szeliski, S. Avidan, and P. Anandan, Layer extraction from multile images containing reflections and transarency, Proc. IEEE Conf. Comuter Vision and Pattern Recognition, , [23] H. Farid and E. H. Adelson, Searating reflections from images by use of indeendent comonent analysis, J. Ot. Soc. Am. A, Vol. 6, No. 9, , 999. [24] M. Born and E. Wolf, Princiles of otics, Pergamon Press, 959. [25] W. A. Shurcliff, Polarized light: roduction and use, Harvard University Press, 962. [26] R. A. Chiman, Mechanics of olarizaiton ray tracing, Otical Engineering, Vol. 34, No. 6, , 995. [27] L. B. Wolff and D. J. Kurlander, Ray tracing with olarization arameters, IEEE Comuter Grahics and Alications, Vol. 0, No. 6, , 990. [28] C. Gu and P. Yeh, Extended Jones matrix method. II, J. Ot. Soc. Am. A, Vol. 0, No. 5, , 993. [29] J. S. Gondek, G. W. Meyer, and J. G. Newman, Wavelength deendent reflectance functions, Proc. SIGGRAPH, , 994. [30] D. C. Tannenbaum, P. Tannenbaum, and M. J. Wozny, Polarization and birefringency considerations in rendering, Proc. SIGGRAPH, , 994. [3] A. Wilkie, R. F. Tobler, and W. Purgathofer, Combined rendering of olarization and fluorescence effects, Proc. Eurograhics Worksho on Rendering, , 200. [32] S. Guy and C. Soler, Grahics gems revisited: fast and hysically-basedrendering of gemstones, Proc. SIGGRAPH, , [33] LightTools, htt:// [34] ZEMAX, htt:// [35] OtiCAD, htt:// [36] W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery, Numerical recies in C: the art of scientific comuting, Cambridge University Press, 992. [37] K. Ikeuchi, Reconstructing a deth ma from intensity mas, Proc. Int l Conf. Pattern Recognition, , 984. [38] B. K. P. Horn, Height and Gradient from Shading, Int l J. Comuter Vision, Vol. 5, No., , 990.
Polarization-based Transparent Surface Modeling from Two Views
Polarization-based Transparent Surface Modeling from Two Views Daisuke Miyazaki Masataka Kagesawa y Katsushi Ikeuchi y The University of Tokyo, Japan http://www.cvl.iis.u-tokyo.ac.jp/ Abstract In this
More informationDetermining Shapes of Transparent Objects. Daisuke Miyazaki Masataka Kagesawa Katsushi Ikeuchi. The University oftokyo
Determining Shapes of Transparent Objects from Two Polarization Images Daisuke Miyazaki Masataka Kagesawa Katsushi Ikeuchi Institute of Industrial Science The University oftokyo Abstract In the eld of
More informationDetermining surface orientations of transparent objects based on polarization degrees in visible and infrared wavelengths
Miyazaki et al. Vol. 19, No. 4/April 2002/J. Opt. Soc. Am. A 687 Determining surface orientations of transparent objects based on polarization degrees in visible and infrared wavelengths Daisuke Miyazaki
More information521493S Computer Graphics Exercise 3 (Chapters 6-8)
521493S Comuter Grahics Exercise 3 (Chaters 6-8) 1 Most grahics systems and APIs use the simle lighting and reflection models that we introduced for olygon rendering Describe the ways in which each of
More informationGlobal Illumination with Photon Map Compensation
Institut für Comutergrahik und Algorithmen Technische Universität Wien Karlslatz 13/186/2 A-1040 Wien AUSTRIA Tel: +43 (1) 58801-18688 Fax: +43 (1) 58801-18698 Institute of Comuter Grahics and Algorithms
More informationPerception of Shape from Shading
1 Percetion of Shae from Shading Continuous image brightness variation due to shae variations is called shading Our ercetion of shae deends on shading Circular region on left is erceived as a flat disk
More informationStereo Disparity Estimation in Moment Space
Stereo Disarity Estimation in oment Sace Angeline Pang Faculty of Information Technology, ultimedia University, 63 Cyberjaya, alaysia. angeline.ang@mmu.edu.my R. ukundan Deartment of Comuter Science, University
More informationAn Efficient Coding Method for Coding Region-of-Interest Locations in AVS2
An Efficient Coding Method for Coding Region-of-Interest Locations in AVS2 Mingliang Chen 1, Weiyao Lin 1*, Xiaozhen Zheng 2 1 Deartment of Electronic Engineering, Shanghai Jiao Tong University, China
More informationA Novel Iris Segmentation Method for Hand-Held Capture Device
A Novel Iris Segmentation Method for Hand-Held Cature Device XiaoFu He and PengFei Shi Institute of Image Processing and Pattern Recognition, Shanghai Jiao Tong University, Shanghai 200030, China {xfhe,
More informationAUTOMATIC 3D SURFACE RECONSTRUCTION BY COMBINING STEREOVISION WITH THE SLIT-SCANNER APPROACH
AUTOMATIC 3D SURFACE RECONSTRUCTION BY COMBINING STEREOVISION WITH THE SLIT-SCANNER APPROACH A. Prokos 1, G. Karras 1, E. Petsa 2 1 Deartment of Surveying, National Technical University of Athens (NTUA),
More information11/2/2010. In the last lecture. Monte-Carlo Ray Tracing : Path Tracing. Today. Shadow ray towards the light at each vertex. Path Tracing : algorithm
Comuter Grahics Global Illumination: Monte-Carlo Ray Tracing and Photon Maing Lecture 11 In the last lecture We did ray tracing and radiosity Ray tracing is good to render secular objects but cannot handle
More informationEarthenware Reconstruction Based on the Shape Similarity among Potsherds
Original Paer Forma, 16, 77 90, 2001 Earthenware Reconstruction Based on the Shae Similarity among Potsherds Masayoshi KANOH 1, Shohei KATO 2 and Hidenori ITOH 1 1 Nagoya Institute of Technology, Gokiso-cho,
More informationGrouping of Patches in Progressive Radiosity
Grouing of Patches in Progressive Radiosity Arjan J.F. Kok * Abstract The radiosity method can be imroved by (adatively) grouing small neighboring atches into grous. Comutations normally done for searate
More informationShading Models. Simulate physical phenomena
Illumination Models & Shading Shading Models Simulate hysical henomena Real illumination simulation is comlicated & exensive Use aroximation and heuristics with little hysical basis that looks surrisingly
More informationIllumination Model. The governing principles for computing the. Apply the lighting model at a set of points across the entire surface.
Illumination and Shading Illumination (ighting) Model the interaction of light with surface oints to determine their final color and brightness OenG comutes illumination at vertices illumination Shading
More informationLearning Motion Patterns in Crowded Scenes Using Motion Flow Field
Learning Motion Patterns in Crowded Scenes Using Motion Flow Field Min Hu, Saad Ali and Mubarak Shah Comuter Vision Lab, University of Central Florida {mhu,sali,shah}@eecs.ucf.edu Abstract Learning tyical
More informationP Z. parametric surface Q Z. 2nd Image T Z
Direct recovery of shae from multile views: a arallax based aroach Rakesh Kumar. Anandan Keith Hanna Abstract Given two arbitrary views of a scene under central rojection, if the motion of oints on a arametric
More informationLast time: Disparity. Lecture 11: Stereo II. Last time: Triangulation. Last time: Multi-view geometry. Last time: Epipolar geometry
Last time: Disarity Lecture 11: Stereo II Thursday, Oct 4 CS 378/395T Prof. Kristen Grauman Disarity: difference in retinal osition of same item Case of stereo rig for arallel image lanes and calibrated
More informationA Low Distortion Map Between Disk and Square
A Low Distortion Ma Between Disk and Square Peter Shirley Comuter Science Deartment 3190 MEB University of Utah Salt Lake City, UT 8411 shirley@cs.utah.edu Kenneth Chiu Comuter Science Deartment Lindley
More informationA Combinatorial Transparent Surface Modeling from Polarization Images
A Combinatorial Transparent Surface Modeling from Polarization Images Mohamad Ivan Fanany 1, Kiichi Kobayashi 1, and Itsuo Kumazawa 2 1 NHK Engineering Service Inc., 1-10-11 Kinuta Setagaya-ku Tokyo, Japan,
More informationExtracting Optimal Paths from Roadmaps for Motion Planning
Extracting Otimal Paths from Roadmas for Motion Planning Jinsuck Kim Roger A. Pearce Nancy M. Amato Deartment of Comuter Science Texas A&M University College Station, TX 843 jinsuckk,ra231,amato @cs.tamu.edu
More informationCS 450: COMPUTER GRAPHICS 2D TRANSFORMATIONS SPRING 2016 DR. MICHAEL J. REALE
CS 45: COMUTER GRAHICS 2D TRANSFORMATIONS SRING 26 DR. MICHAEL J. REALE INTRODUCTION Now that we hae some linear algebra under our resectie belts, we can start ug it in grahics! So far, for each rimitie,
More informationShape from Second-bounce of Light Transport
Shae from Second-bounce of Light Transort Siying Liu 1, Tian-Tsong Ng 1, and Yasuyuki Matsushita 2 1 Institute for Infocomm Research Singaore 2 Microsoft Research Asia Abstract. This aer describes a method
More informationGEOMETRIC CONSTRAINT SOLVING IN < 2 AND < 3. Department of Computer Sciences, Purdue University. and PAMELA J. VERMEER
GEOMETRIC CONSTRAINT SOLVING IN < AND < 3 CHRISTOPH M. HOFFMANN Deartment of Comuter Sciences, Purdue University West Lafayette, Indiana 47907-1398, USA and PAMELA J. VERMEER Deartment of Comuter Sciences,
More informationDr Pavan Chakraborty IIIT-Allahabad
GVC-43 Lecture - 5 Ref: Donald Hearn & M. Pauline Baker, Comuter Grahics Foley, van Dam, Feiner & Hughes, Comuter Grahics Princiles & Practice Dr Pavan Chakraborty IIIT-Allahabad Summary of line drawing
More informationAUTOMATIC EXTRACTION OF BUILDING OUTLINE FROM HIGH RESOLUTION AERIAL IMAGERY
AUTOMATIC EXTRACTION OF BUILDING OUTLINE FROM HIGH RESOLUTION AERIAL IMAGERY Yandong Wang EagleView Technology Cor. 5 Methodist Hill Dr., Rochester, NY 1463, the United States yandong.wang@ictometry.com
More informationA Model-Adaptable MOSFET Parameter Extraction System
A Model-Adatable MOSFET Parameter Extraction System Masaki Kondo Hidetoshi Onodera Keikichi Tamaru Deartment of Electronics Faculty of Engineering, Kyoto University Kyoto 66-1, JAPAN Tel: +81-7-73-313
More informationDense 3D Reconstruction from Specularity Consistency
Dense 3D Reconstruction from Secularity Consistency Diego Nehab Microsoft Research Tim Weyrich Princeton University Szymon Rusinkiewicz Princeton University Abstract In this work, we consider the dense
More informationFace Recognition Using Legendre Moments
Face Recognition Using Legendre Moments Dr.S.Annadurai 1 A.Saradha Professor & Head of CSE & IT Research scholar in CSE Government College of Technology, Government College of Technology, Coimbatore, Tamilnadu,
More informationIEEE Coyright Notice Personal use of this material is ermitted. However, ermission to rerint/reublish this material for advertising or romotional uroses or for creating new collective works for resale
More informationEE678 Application Presentation Content Based Image Retrieval Using Wavelets
EE678 Alication Presentation Content Based Image Retrieval Using Wavelets Grou Members: Megha Pandey megha@ee. iitb.ac.in 02d07006 Gaurav Boob gb@ee.iitb.ac.in 02d07008 Abstract: We focus here on an effective
More informationTexture Mapping with Vector Graphics: A Nested Mipmapping Solution
Texture Maing with Vector Grahics: A Nested Mimaing Solution Wei Zhang Yonggao Yang Song Xing Det. of Comuter Science Det. of Comuter Science Det. of Information Systems Prairie View A&M University Prairie
More informationTrigonometric Functions
Similar Right-Angled Triangles Trigonometric Functions We lan to introduce trigonometric functions as certain ratios determined by similar right-angled triangles. By de nition, two given geometric gures
More informationWhat Does Motion Reveal About Transparency?
What Does Motion Reveal About Transparency? Moshe Ben-Ezra and Shree K. Nayar Computer Science Department, Columbia University New York, NY, USA E-mail: {moshe, nayar}@cs.columbia.edu Abstract The perception
More informationDepth Estimation for 2D to 3D Football Video Conversion
International Research Journal of Alied and Basic Sciences 2013 Available online at www.irjabs.com ISSN 2251-838X / Vol, 6 (4): 475-480 Science Exlorer ublications Deth Estimation for 2D to 3D Football
More informationSensitivity Analysis for an Optimal Routing Policy in an Ad Hoc Wireless Network
1 Sensitivity Analysis for an Otimal Routing Policy in an Ad Hoc Wireless Network Tara Javidi and Demosthenis Teneketzis Deartment of Electrical Engineering and Comuter Science University of Michigan Ann
More informationA CLASS OF STRUCTURED LDPC CODES WITH LARGE GIRTH
A CLASS OF STRUCTURED LDPC CODES WITH LARGE GIRTH Jin Lu, José M. F. Moura, and Urs Niesen Deartment of Electrical and Comuter Engineering Carnegie Mellon University, Pittsburgh, PA 15213 jinlu, moura@ece.cmu.edu
More informationCross products. p 2 p. p p1 p2. p 1. Line segments The convex combination of two distinct points p1 ( x1, such that for some real number with 0 1,
CHAPTER 33 Comutational Geometry Is the branch of comuter science that studies algorithms for solving geometric roblems. Has alications in many fields, including comuter grahics robotics, VLSI design comuter
More informationAn accurate and fast point-to-plane registration technique
Pattern Recognition Letters 24 (23) 2967 2976 www.elsevier.com/locate/atrec An accurate and fast oint-to-lane registration technique Soon-Yong Park *, Murali Subbarao Deartment of Electrical and Comuter
More informationMining Association rules with Dynamic and Collective Support Thresholds
Mining Association rules with Dynamic and Collective Suort Thresholds C S Kanimozhi Selvi and A Tamilarasi Abstract Mining association rules is an imortant task in data mining. It discovers the hidden,
More informationEVALUATION OF THE ACCURACY OF A LASER SCANNER-BASED ROLL MAPPING SYSTEM
EVALUATION OF THE ACCURACY OF A LASER SCANNER-BASED ROLL MAPPING SYSTEM R.S. Radovanovic*, W.F. Teskey*, N.N. Al-Hanbali** *University of Calgary, Canada Deartment of Geomatics Engineering rsradova@ucalgary.ca
More informationMATHEMATICAL MODELING OF COMPLEX MULTI-COMPONENT MOVEMENTS AND OPTICAL METHOD OF MEASUREMENT
MATHEMATICAL MODELING OF COMPLE MULTI-COMPONENT MOVEMENTS AND OPTICAL METHOD OF MEASUREMENT V.N. Nesterov JSC Samara Electromechanical Plant, Samara, Russia Abstract. The rovisions of the concet of a multi-comonent
More informationConvex Hulls. Helen Cameron. Helen Cameron Convex Hulls 1/101
Convex Hulls Helen Cameron Helen Cameron Convex Hulls 1/101 What Is a Convex Hull? Starting Point: Points in 2D y x Helen Cameron Convex Hulls 3/101 Convex Hull: Informally Imagine that the x, y-lane is
More informationAUTOMATIC GENERATION OF HIGH THROUGHPUT ENERGY EFFICIENT STREAMING ARCHITECTURES FOR ARBITRARY FIXED PERMUTATIONS. Ren Chen and Viktor K.
inuts er clock cycle Streaming ermutation oututs er clock cycle AUTOMATIC GENERATION OF HIGH THROUGHPUT ENERGY EFFICIENT STREAMING ARCHITECTURES FOR ARBITRARY FIXED PERMUTATIONS Ren Chen and Viktor K.
More informationSPARSE SIGNAL REPRESENTATION FOR COMPLEX-VALUED IMAGING Sadegh Samadi 1, M üjdat Çetin 2, Mohammad Ali Masnadi-Shirazi 1
SPARSE SIGNAL REPRESENTATION FOR COMPLEX-VALUED IMAGING Sadegh Samadi 1, M üjdat Çetin, Mohammad Ali Masnadi-Shirazi 1 1. Shiraz University, Shiraz, Iran,. Sabanci University, Istanbul, Turkey ssamadi@shirazu.ac.ir,
More informationAn empirical analysis of loopy belief propagation in three topologies: grids, small-world networks and random graphs
An emirical analysis of looy belief roagation in three toologies: grids, small-world networks and random grahs R. Santana, A. Mendiburu and J. A. Lozano Intelligent Systems Grou Deartment of Comuter Science
More informationCSE4421/5324: Introduction to Robotics
CSE442/5324: Introduction to Robotics Contact Information Burton Ma Lassonde 246 burton@cse.yorku.ca EECS442/5324 lectures Monday, Wednesday, Friday :3-2:3PM (SLH C) Lab Thursday 2:3-2:3, Prism 4 Lab 2
More informationEFFICIENT STOCHASTIC GRADIENT SEARCH FOR AUTOMATIC IMAGE REGISTRATION
ISSN 76-459 Int j simul model 6 (7), 4-3 Original scientific aer EFFICIENT STOCHASTIC GRADIENT SEARCH FOR AUTOMATIC IMAGE REGISTRATION Li, Q.; Sato, I. & Murakami, Y. GSJ/AIST - National Institute of Advanced
More informationSpace-efficient Region Filling in Raster Graphics
"The Visual Comuter: An International Journal of Comuter Grahics" (submitted July 13, 1992; revised December 7, 1992; acceted in Aril 16, 1993) Sace-efficient Region Filling in Raster Grahics Dominik Henrich
More informationA STUDY ON CALIBRATION OF DIGITAL CAMERA
A STUDY ON CALIBRATION OF DIGITAL CAMERA Ryuji Matsuoka a, *, Kiyonari Fukue a, Kohei Cho a, Haruhisa Shimoda a, Yoshiaki Matsumae a, Kenji Hongo b, Seiju Fujiwara b a Tokai University Research & Information
More informationCENTRAL AND PARALLEL PROJECTIONS OF REGULAR SURFACES: GEOMETRIC CONSTRUCTIONS USING 3D MODELING SOFTWARE
CENTRAL AND PARALLEL PROJECTIONS OF REGULAR SURFACES: GEOMETRIC CONSTRUCTIONS USING 3D MODELING SOFTWARE Petra Surynková Charles University in Prague, Faculty of Mathematics and Physics, Sokolovská 83,
More informationInteractive Image Segmentation
Interactive Image Segmentation Fahim Mannan (260 266 294) Abstract This reort resents the roject work done based on Boykov and Jolly s interactive grah cuts based N-D image segmentation algorithm([1]).
More informationImage Segmentation Using Topological Persistence
Image Segmentation Using Toological Persistence David Letscher and Jason Fritts Saint Louis University Deartment of Mathematics and Comuter Science {letscher, jfritts}@slu.edu Abstract. This aer resents
More informationAn Efficient and Highly Accurate Technique for Periodic Planar Scanner Calibration with the Antenna Under Test in Situ
An Efficient and Highly Accurate echnique for Periodic Planar Scanner Calibration with the Antenna Under est in Situ Scott Pierce I echnologies 1125 Satellite Boulevard, Suite 100 Suwanee, Georgia 30024
More informationWide-baseline Hair Capture using Strand-based Refinement
2013 IEEE Conference on Comuter Vision and Pattern Recognition Wide-baseline Hair Cature using Strand-based Refinement Linjie Luo Princeton University Cha Zhang Microsoft Research Zhengyou Zhang Microsoft
More informationPivot Selection for Dimension Reduction Using Annealing by Increasing Resampling *
ivot Selection for Dimension Reduction Using Annealing by Increasing Resamling * Yasunobu Imamura 1, Naoya Higuchi 1, Tetsuji Kuboyama 2, Kouichi Hirata 1 and Takeshi Shinohara 1 1 Kyushu Institute of
More informationImproved Image Super-Resolution by Support Vector Regression
Proceedings of International Joint Conference on Neural Networks, San Jose, California, USA, July 3 August 5, 0 Imroved Image Suer-Resolution by Suort Vector Regression Le An and Bir Bhanu Abstract Suort
More informationHomographies and Mosaics
Tri reort Homograhies and Mosaics Jeffrey Martin (jeffrey-martin.com) CS94: Image Maniulation & Comutational Photograhy with a lot of slides stolen from Alexei Efros, UC Berkeley, Fall 06 Steve Seitz and
More informationGraph Cut Matching In Computer Vision
Grah Cut Matching In Comuter Vision Toby Collins (s0455374@sms.ed.ac.uk) February 2004 Introduction Many of the roblems that arise in early vision can be naturally exressed in terms of energy minimization.
More informationFeature Selection and Pose Estimation From Known Planar Objects Using Monocular Vision
Feature Selection and Pose Estimation From Known Planar Objects Using Monocular ision Shengdong Xu and Ming Liu 2 ETH Zurich, Switzerland, Email: Samuel.xu988@gmail.com 2 The Hong Kong University of Science
More informationCALCULATION METHOD OF MILLING CONTACT AREA FOR BALL-END MILLING TOOL WITH TOOL INCLINATION ANGLE
U.P.B. Sci. Bull., Series D, Vol. 76, Iss. 3, 214 ISSN 1454-2358 CALCULATION METHOD OF MILLING CONTACT AREA FOR BALL-END MILLING TOOL WITH TOOL INCLINATION ANGLE Yishu HAO 1, Guoqing TANG 2, Meng ZHANG
More informationWeight Co-occurrence based Integrated Color and Intensity Matrix for CBIR
Weight Co-occurrence based Integrated Color and Intensity Matrix for CBIR Megha Agarwal, 2R.P. Maheshwari Indian Institute of Technology Roorkee 247667, Uttarakhand, India meghagarwal29@gmail.com, 2rmaheshwari@gmail.com
More informationA simulated Linear Mixture Model to Improve Classification Accuracy of Satellite. Data Utilizing Degradation of Atmospheric Effect
A simulated Linear Mixture Model to Imrove Classification Accuracy of Satellite Data Utilizing Degradation of Atmosheric Effect W.M Elmahboub Mathematics Deartment, School of Science, Hamton University
More informationEffects of fiber cladding on UV beams and fringe patterns in side-exposure FBG writing
University of Wollongong Research Online Faculty of Informatics - Paers (Archive) Faculty of Engineering and Information Sciences Effects of fiber cladding on UV beams and fringe atterns in side-exosure
More informationUse of Multivariate Statistical Analysis in the Modelling of Chromatographic Processes
Use of Multivariate Statistical Analysis in the Modelling of Chromatograhic Processes Simon Edwards-Parton 1, Nigel itchener-hooker 1, Nina hornhill 2, Daniel Bracewell 1, John Lidell 3 Abstract his aer
More informationIntroduction to Visualization and Computer Graphics
Introduction to Visualization and Comuter Grahics DH2320, Fall 2015 Prof. Dr. Tino Weinkauf Introduction to Visualization and Comuter Grahics Grids and Interolation Next Tuesday No lecture next Tuesday!
More informationEfficient Parallel Hierarchical Clustering
Efficient Parallel Hierarchical Clustering Manoranjan Dash 1,SimonaPetrutiu, and Peter Scheuermann 1 Deartment of Information Systems, School of Comuter Engineering, Nanyang Technological University, Singaore
More informationShort Papers. Symmetry Detection by Generalized Complex (GC) Moments: A Close-Form Solution 1 INTRODUCTION
466 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE VOL 2 NO 5 MAY 999 Short Paers Symmetry Detection by Generalized Comlex (GC) Moments: A Close-Form Solution Dinggang Shen Horace HS I
More informationMatlab Virtual Reality Simulations for optimizations and rapid prototyping of flexible lines systems
Matlab Virtual Reality Simulations for otimizations and raid rototying of flexible lines systems VAMVU PETRE, BARBU CAMELIA, POP MARIA Deartment of Automation, Comuters, Electrical Engineering and Energetics
More informationLENS FOR A COMPUTER MODEL OF A POLARIZING MICROSCOPE
MATHEMATICA MONTISNIGRI Vol XLI (218) COMPUTER SCIENCE APPLICATIONS LENS FOR A COMPUTER MODEL OF A POLARIZING MICROSCOPE VICTOR A. DEBELOV *, KONSTANTIN G. KUSHNER AND LUDMILA F. VASILYEVA * * Institute
More informationA New and Efficient Algorithm-Based Fault Tolerance Scheme for A Million Way Parallelism
A New and Efficient Algorithm-Based Fault Tolerance Scheme for A Million Way Parallelism Erlin Yao, Mingyu Chen, Rui Wang, Wenli Zhang, Guangming Tan Key Laboratory of Comuter System and Architecture Institute
More informationxy plane was set to coincide with the dorsal surface of the pronotum. (4) The locust coordinate
4 5 6 7 8 9 0 4 5 6 7 8 9 0 Sulementary text Coordinate systems and kinematic analysis. Four coordinate systems were defined in order to analyse data obtained from the video (Fig. S): () the video coordinate
More informationConstrained Path Optimisation for Underground Mine Layout
Constrained Path Otimisation for Underground Mine Layout M. Brazil P.A. Grossman D.H. Lee J.H. Rubinstein D.A. Thomas N.C. Wormald Abstract The major infrastructure comonent reuired to develo an underground
More informationRobust Motion Estimation for Video Sequences Based on Phase-Only Correlation
Robust Motion Estimation for Video Sequences Based on Phase-Only Correlation Loy Hui Chien and Takafumi Aoki Graduate School of Information Sciences Tohoku University Aoba-yama 5, Sendai, 98-8579, Jaan
More informationTo appear in IEEE TKDE Title: Efficient Skyline and Top-k Retrieval in Subspaces Keywords: Skyline, Top-k, Subspace, B-tree
To aear in IEEE TKDE Title: Efficient Skyline and To-k Retrieval in Subsaces Keywords: Skyline, To-k, Subsace, B-tree Contact Author: Yufei Tao (taoyf@cse.cuhk.edu.hk) Deartment of Comuter Science and
More informationarxiv: v1 [cs.mm] 18 Jan 2016
Lossless Intra Coding in with 3-ta Filters Saeed R. Alvar a, Fatih Kamisli a a Deartment of Electrical and Electronics Engineering, Middle East Technical University, Turkey arxiv:1601.04473v1 [cs.mm] 18
More informationOptical Design with Zemax
Otical Design with Zemax Lecture 5: Imaging and illumination 01-09-11 Herbert Gross Summer term 01 www.ia.uni-jena.de Time schedule Contents 3 1. Fundamentals of Fourier otics. Physical otical image formation
More informationPatterned Wafer Segmentation
atterned Wafer Segmentation ierrick Bourgeat ab, Fabrice Meriaudeau b, Kenneth W. Tobin a, atrick Gorria b a Oak Ridge National Laboratory,.O.Box 2008, Oak Ridge, TN 37831-6011, USA b Le2i Laboratory Univ.of
More informationDetection of Occluded Face Image using Mean Based Weight Matrix and Support Vector Machine
Journal of Comuter Science 8 (7): 1184-1190, 2012 ISSN 1549-3636 2012 Science Publications Detection of Occluded Face Image using Mean Based Weight Matrix and Suort Vector Machine 1 G. Nirmala Priya and
More informationMETHOD OF LANDSLIDE MEASUREMENT BY GROUND BASED LIDAR
METHOD OF LANDSLIDE MEASUREMENT BY GROUND BASED LIDAR Ryo INADA* and Masataka TAKAGI** Kochi University of Technology, Kami-shi, Kochi, 782-8502, Jaan *135082@gs.kochi-tech.ac.j **takagi.masataka@kochi-tech.ac.j
More informationFace Recognition Based on Wavelet Transform and Adaptive Local Binary Pattern
Face Recognition Based on Wavelet Transform and Adative Local Binary Pattern Abdallah Mohamed 1,2, and Roman Yamolskiy 1 1 Comuter Engineering and Comuter Science, University of Louisville, Louisville,
More informationTheoretical Analysis of Graphcut Textures
Theoretical Analysis o Grahcut Textures Xuejie Qin Yee-Hong Yang {xu yang}@cs.ualberta.ca Deartment o omuting Science University o Alberta Abstract Since the aer was ublished in SIGGRAPH 2003 the grahcut
More informationIntroduction to Image Compresion
ENEE63 Fall 2 Lecture-7 Introduction to Image Comresion htt://www.ece.umd.edu/class/enee63/ minwu@eng.umd.edu M. Wu: ENEE63 Digital Image Processing (Fall') Min Wu Electrical & Comuter Engineering Univ.
More informationSource-to-Source Code Generation Based on Pattern Matching and Dynamic Programming
Source-to-Source Code Generation Based on Pattern Matching and Dynamic Programming Weimin Chen, Volker Turau TR-93-047 August, 1993 Abstract This aer introduces a new technique for source-to-source code
More informationPREDICTING LINKS IN LARGE COAUTHORSHIP NETWORKS
PREDICTING LINKS IN LARGE COAUTHORSHIP NETWORKS Kevin Miller, Vivian Lin, and Rui Zhang Grou ID: 5 1. INTRODUCTION The roblem we are trying to solve is redicting future links or recovering missing links
More informationComputing the Convex Hull of. W. Hochstattler, S. Kromberg, C. Moll
Reort No. 94.60 A new Linear Time Algorithm for Comuting the Convex Hull of a Simle Polygon in the Plane by W. Hochstattler, S. Kromberg, C. Moll 994 W. Hochstattler, S. Kromberg, C. Moll Universitat zu
More informationIMS Network Deployment Cost Optimization Based on Flow-Based Traffic Model
IMS Network Deloyment Cost Otimization Based on Flow-Based Traffic Model Jie Xiao, Changcheng Huang and James Yan Deartment of Systems and Comuter Engineering, Carleton University, Ottawa, Canada {jiexiao,
More informationSwift Template Matching Based on Equivalent Histogram
Swift emlate Matching ased on Equivalent istogram Wangsheng Yu, Xiaohua ian, Zhiqiang ou * elecommunications Engineering Institute Air Force Engineering University Xi an, PR China *corresonding author:
More informationCross products Line segments The convex combination of two distinct points p
CHAPTER Comutational Geometry Is the branch of comuter science that studies algorithms for solving geometric roblems. Has alications in many fields, including comuter grahics robotics, VLSI design comuter
More informationCASCH - a Scheduling Algorithm for "High Level"-Synthesis
CASCH a Scheduling Algorithm for "High Level"Synthesis P. Gutberlet H. Krämer W. Rosenstiel Comuter Science Research Center at the University of Karlsruhe (FZI) HaidundNeuStr. 1014, 7500 Karlsruhe, F.R.G.
More informationConstrained Empty-Rectangle Delaunay Graphs
CCCG 2015, Kingston, Ontario, August 10 12, 2015 Constrained Emty-Rectangle Delaunay Grahs Prosenjit Bose Jean-Lou De Carufel André van Renssen Abstract Given an arbitrary convex shae C, a set P of oints
More informationClipping. Administrative. Assignment 1 Gallery. Questions about previous lectures? Overview of graphics pipeline? Assignment 2
Cliing MIT EECS 6.837 Frédo Durand and Seth Teller Some slides and images courtesy of Leonard McMillan MIT EECS 6.837, Teller and Durand 1 MIT EECS 6.837, Teller and Durand 2 Administrative Assignment
More informationBuilding Polygonal Maps from Laser Range Data
ECAI Int. Cognitive Robotics Worksho, Valencia, Sain, August 2004 Building Polygonal Mas from Laser Range Data Longin Jan Latecki and Rolf Lakaemer and Xinyu Sun and Diedrich Wolter Abstract. This aer
More informationA Simple and Robust Approach to Computation of Meshes Intersection
A Simle and Robust Aroach to Comutation of Meshes Intersection Věra Skorkovská 1, Ivana Kolingerová 1 and Bedrich Benes 2 1 Deartment of Comuter Science and Engineering, University of West Bohemia, Univerzitní
More informationOptimal Multiple Sprite Generation based on Physical Camera Parameter Estimation
Otimal Multile Srite Generation based on Physical Camera Parameter Estimation Matthias Kunter* a, Andreas Krutz a, Mrinal Mandal b, Thomas Sikora a a Commun. Systems Grou, Technische Universität Berlin,
More informationTOPP Probing of Network Links with Large Independent Latencies
TOPP Probing of Network Links with Large Indeendent Latencies M. Hosseinour, M. J. Tunnicliffe Faculty of Comuting, Information ystems and Mathematics, Kingston University, Kingston-on-Thames, urrey, KT1
More informationDenoising of Laser Scanning Data using Wavelet
27 Denoising of Laser Scanning Data using Wavelet Jašek, P. and Štroner, M. Czech Technical University in Prague, Faculty of Civil Engineering, Deartment of Secial Geodesy, Thákurova 7, 16629 Praha 6,
More informationDistributed Estimation from Relative Measurements in Sensor Networks
Distributed Estimation from Relative Measurements in Sensor Networks #Prabir Barooah and João P. Hesanha Abstract We consider the roblem of estimating vectorvalued variables from noisy relative measurements.
More informationIntroduction to Parallel Algorithms
CS 1762 Fall, 2011 1 Introduction to Parallel Algorithms Introduction to Parallel Algorithms ECE 1762 Algorithms and Data Structures Fall Semester, 2011 1 Preliminaries Since the early 1990s, there has
More informationCitation for the original published paper (version of record):
htt://www.diva-ortal.org Prerint This is the submitted version of a aer ublished in Robotics and Autonomous Systems. Citation for the original ublished aer (version of record): Andreasson, H., Lilienthal,
More information