Size: px
Start display at page:

Download ""

Transcription

1 IEEE 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 or redistribution to servers or lists, or to reuse any coyrighted comonent of this work in other works must be obtained from the IEEE. Contact: Manager, Coyrights and Permissions / IEEE Service Center / 445 Hoes Lane / P.O. Box 11 / Piscataway, NJ , USA. Telehone: + Intl

2

3 Worksho on New Trends in Image-based Robot Servoing, IROS'97,. 45-5, Grenoble, France, Setember D 1/ visual servoing with resect to a lanar object Francois Chaumette Ezio Malis Sylvie Boudet IRISA / INRIA Rennes EDF-DER Camus de Beaulieu 6 Quai Watier 5 4 Rennes, France Chatou, France fchaumett, emalisg@irisa.fr, sylvie.boudet@edfgdf.fr Abstract In this aer, we roose a new vision-based robot control aroach which is halfway between the classical osition-based and image-based visual servoings. It allows to avoid their resective disadvantages. For a lanar object, the homograhy between the feature oints extracted from two images (corresonding to the current and desired camera oses) is comuted at each iteration of the control law. From this homograhy, an aroximate artial-ose, where the translational term is known only u to a scale factor, is deduced. Using arameters of this artial ose and image features, it is ossible to design a closed-loo control law controlling the six camera d.o.f. Contrarily to the osition-based visual servoing, our scheme does not need any geometric D model of the object. Furthermore and contrarily to the image-based visual servoing, our aroach ensures the convergence of the control law in all the task sace. 1 Introduction Vision-based robot control using an eye-in-hand system is generally erformed using two dierent aroaches [11, 8, 9]: osition-based and image-based control systems. In a osition-based control system, the control error function is comuted in the D Cartesian sace [1] (for this reason this aroach can be called D visual servoing). The ose of the target with resect to the camera, which describes its D osition and D orientation, is estimated from image features corresonding to the ersective rojection of the target in the image. Numerous methods exist to recover the ose of an object (see [4] for examle). They are all based on the knowledge of a erfect geometric model of the object and necessitate a calibrated camera to obtain unbiased results. The main advantage of D visual servoing is that it controls the camera trajectory in the Cartesian sace, which allows to easily combine the visual ositioning task with obstacles avoidance and/or joint limits and singularities avoidance. On the other hand, in an image-based control system, the control error function is comuted in the D image sace (for this reason this aroach can be called D visual servoing). This local aroach is based on the use of an image Jacobian (also called interaction matrix [5]) and the control laws rovide at each iteration the camera velocity for minimizing the observed error in the image. This aroach is known to be very robust with resect to camera and robot calibration errors [6]. However, the convergence is ensured only in a region (quite imossible to determine) around the desired osition. Furthermore, the Cartesian trajectory of the camera is uncontrolled, and some image features may get out of the camera eld of view during the servoing, which generally gives rise to its failure. The urose of this aer is to design a new visual servoing system which combines the advantages of D and D visual servoings and avoids their drawbacks. We oint out our attention to one of the tyical alications of visual servoing: ositioning a camera mounted on a robot end-eector relative to a target, for a grasing task for instance. The ositioning task is divided into two stes. In the rst o-line learning ste, the camera is moved to its desired osition. The image of the target corresonding to this osition is acquired and the extracted desired features are stored. In the second on-line ste, after the camera and/or the target have been moved, the camera is commanded so that the current features reach their desired osition in the image. In such alication, the target geometry is not always recisely known. Furthermore, the convergence has to be obtained in all the task sace. Our aroach can be called D 1/ visual servoing since the control error function is comuted in art in the D Cartesian sace and in art in the D image sace. More recisely, the homograhy between the feature oints extracted from two images (corresonding to the current and desired camera oses) is comuted at each iteration. From the homograhy, the rotation of the camera between the two views is estimated. Consequently, the rotational control loo 45

4 can be decouled from the translational one. A such decouled system allows to obtain the convergence in all the task sace. It must be emhasized that the use of an homograhy does not need neither a D model of the target (the method we actually use to estimate the homograhy is however only valid for lanar objects) nor a recisely calibrated camera. As far as the camera translational dislacement is concerned, it can only be estimated u to a scale factor. It is therefore controlled using D image features and the ratio, obtained from the homograhy, of the unknown desired and current distances between the camera and the target. Finally, in site of the artial-ose estimation, exeriments show that the aroach is robust to calibration errors. The aer is organized as follows. In Section and Section we briey recall D and D visual servoings resectively. In Section 4 we resent the D 1/ visual servoing aroach. The exerimental results are given in Section 5. D Visual Servoing Let F be the coordinate frame attached to the target, F 1 and F be the coordinate frames attached to the camera in its desired and current osition resectively (see Figure 1). 1 T ose estimation always aear in the camera eld of view. This can not be guaranteed if the camera or the robot are only coarse-calibrated. Let us also note that if the camera is not accurately calibrated, or if the D model of the considered object is not erfectly known, the estimated current and desired camera oses will be biased. However, this is not a drawback if a closedloo scheme is erformed. The corresonding block diagram of the D visual servoing aroach is given in Figure. T + - T Cartesian Control law Pose Estimation ; V Model of the target Features Extraction Robot Camera Figure : Block diagram of the D visual servoing D Visual Servoing The control error function is now exressed directly in the D image sace (see Figure ). target oint target oint F F1 F1 s? s T F F Figure 1: Modelisation of camera dislacement for D visual servoing Knowing the coordinates, exressed in F, of at least four oints of the target [4], it is ossible from their measure in the image to comute the desired camera ose (reresented in Figure 1 by the transformation matrix 1 T ) and the current camera ose (reresented in Figure 1 by the transformation matrix T ). The camera dislacement T 1 to reach the desired osition is thus easily obtained ( T 1 =? T 1?1 T ), and can be erformed either in oen loo or, more robustly, in closed loo by comuting T at each iteration of the control law. Finally, the control law has to be designed in order that the image features used in the Figure : Modelisation of camera dislacement for D visual servoing Let s be the current value of visual features observed by the camera and s be the desired value of s to be reached in the image. The time variation of s is related to camera velocity by [5]: _s = L(s; Z)T (1) where T = V is the camera velocity screw and L(s; Z) is the interaction matrix related to s. For examle, if the chosen features are the coordinates s = u v T = X=Z Y =Z T in the image of a D oint P of coordinates X Y Z T in the 46

5 camera frame, the interaction matrix related to u and v is given by: where: L! (s) = L(s; Z) = 1 Z L v(s) L! (s) () L v (s) =?1 u?1 v uv?(1 + u ) v (1 + v )?uv?u () (4) The interaction matrix for more comlex image features can be found in [5]. The vision-based task e (to be regulated to ), corresonding to the regulation of s to s, is dened by: e = C(s? s ) (5) where C is a matrix which has to be selected such that CL(s; Z) > in order to ensure the convergence of the control law. The otimal choice seems to consider C as the seudo-inverse L(s; Z) + of the interaction matrix. The matrix C thus deends on the deth Z of each target oint used in the visual servoing. An estimation of the deth can be obtained using, as in D visual servoing, a ose determination algorithm (if a D target model is available), or using a structure from known motion algorithm (if the camera motion can be measured). However, using this choice for C may lead the system to near, or even reach, a singularity of the interaction matrix. Furthermore, the convergence may also not be attained due to local minima reached because of the comutation by the control law of unrealizable motions in the image []. Another choice is to consider C as a constant matrix equal to L(s ; Z ) +, the seudo-inverse of the interaction matrix comuted for s = s and Z = Z, where Z is an aroximate value of Z at the desired camera osition. In this simle case, the condition for convergence is however only satised in the neighborhood of the desired osition, which means that the convergence may not be ensured if the initial camera osition is too far away from the desired one. If an exonential convergence is desired (_e =?e where is a ositive scalar), a simle control law is given by [5]: T =?e =?C(s? s ) (6) The block diagram of the D visual servoing aroach is given in Figure 4. 4 D 1/ Visual Servoing If n D oints P j on a lanar target are used, it is well known that each image oint j, of coordinates s + - s Features Control law Features Extraction ; V Deth Estimation or aroximation Robot Camera Figure 4: Block diagram of the D visual servoing u v 1 T in the current camera frame F, is related to the corresonding image oint j, of coordinates u v 1 T in the desired camera frame F 1, by an homograhy such that [7]: j j = H j fj = ; 1; ; :::; n? 1g (7) where j is a ositive scalar and H is a ( ) homograhy matrix. More recisely, H can be written [7]: H = R + n t T d (8) where R and t are the rotational matrix and the translational vector between the current camera frame F and the desired camera frame F 1 resectively (see Figure 5), n = n x n y n T z is the unit vector normal to the target lane exressed in F 1 and d is the distance between the origin of F 1 and. F1 H d F target oint Figure 5: Modelisation of camera dislacement for D 1/ visual servoing Let us remark that H is dened u to a scalar factor, therefore one of the unknown j can be set to 1 without loss of generality (for examle = 1). Equation (7) is available for each feature oint in the image, d 47

6 thus, for n oints, we have to solve a linear system of n equations and n + 8 unknowns: that is n? 1 unknowns j (fj = 1; ; :::; n? 1g since = 1), and 9 unknown elements of H. A minimum of four oints is needed to erform a linear estimation. Let us emhasize that the estimation of H does not necessitate the knowledge of the D osition of the target oints on lane, which makes unnecessary a D model of the target. After matrix H is comuted, R, t=d and n can be estimated [7]. Unfortunately, in the most general case we have two dierent solutions. The indetermination is eliminated by choosing the solution which is such that the vector n is as co-linear as ossible with the desired orientation of the camera otical axis. Let us note that the translational vector t is estimated only u to a scale factor since the desired distance d is unknown. D visual servoing can thus not be emloyed. It is ossible to design a control law such that R and t=d resectively have to reach the identity matrix I and T (which thus imlies the achievement of the ositioning task). However, such a control law does not ensure that the considered object will always remain in the camera eld of view since it is only based on D estimated arameters. Getting out of the image may thus occur in the resence of imortant errors in the intrinsic arameters of the camera or in the robot Jacobian. We have therefore referred another more robust solution. The block diagram of the D 1/ visual servoing aroach is given in Figure 6. We now describe its dierents arts. Our control scheme is based on the D estimated rotation between F and F 1 (which has to reach the identity matrix). We also use the ratio r which controls the deth between the camera and the target (and which has to reach the desired value r = 1). Indeed, the distances d and d are unknown, but the ratio r = d=d can easily be estimated using R, t=d and n. We remark that the current normal vector n to the lane, exressed in F, and the current distance d between frame F and can be written in function of vector n and distance d : From equations (9) and (1) we get: n = Rn (9) d = d + n T t (1) r = d = 1 + t d nt = 1 + t R d nt T (11) d Finally, in order to control the 6 camera d.o.f and to maintain the target in the camera eld of view, we also introduce the use of two indeendent visual features, such as the image coordinates of a target oint, which can be controlled by using classical D visual servoing. s r R + -+ s -+ r - R Partial ose Estimation Features and Deth Rotation Control law Features Extraction V Robot Camera Figure 6: Block diagram of the D 1/ visual servoing We rst consider the control of the camera orientation. Let u be the rotation axis and the rotation angle obtained from the revious artial-ose estimation. The rotational velocity of the camera can be exressed in function of the angular velocity _ around the axis of rotation u: u _ = (1) The translational degrees of freedom are used to maintain the target in the image and to control the ratio r between the current distance d and the desired distance d. A oint is chosen in the desired image, such as for examle the nearest from the image center. As done for the D visual servoing, the chosen features are its coordinates s = u v T in the image. By using equations (1) and (), the relationshi between the time variation of the chosen features and the velocity of the camera is: _s = 1 Z L v(s)v + L! (s) (1) where Z is the deth of the corresonding D oint. Since the D oint belongs to the target lane, Z can be written as: Z = d n T and from equation (11), we get: (14) 1 = nt = (15) Z rd d where = nt can be comuted from image measurement and the artial-ose algorithm. Furthermore, by r derivating equation (11) with resect to time, we get: _r = nt d (RT _t + _R T t) (16) = nt d RT (_t + R _R T t) (17) = nt d ( _t + t) (18) =? nt d V (19) 48

7 since, from the fundamental kinematics equation, we have _t =?V? t. Combining equation 19 to equation (1) and equation (1), we get the following system: where: 4 M! = _s _r u _ 5 = M v = 4 4 " 1 d M v M! I? u? v?n x?n y?n z # V uv?(1 + u ) v (1 + v ) uv?u () 5 (1) 5 () Equation () is similar to equation (1). The task function aroach [5] can thus be alied. If we desire an exonential convergence of s towards s, of r towards r = 1 and u towards u = (with decreasing velocity ), we obtain: 4 _s _r u _ 5 =? 4 s? s r? 1 u 5 () From equations () and (), the control law is given by: V =? where M?1 v M?1 v =?1 n T d M?1 v?d M?1 v M! I 4 s? s r? 1 5 u (4), the inverse matrix of M v, is given by: n z + n y v? n yu u ? n xv n z + n x u v 7 7 5?n x?n y 1 (5) The determinant of matrix M v is? (n T ). This determinant is null only if the otical axis of the camera belongs to lane (in this singular case, all the image oints are collinear), which ensures the stability of the system in all the task sace (more recisely, the half sace in front of the target lane) if and n are correctly estimated. We note that the ositive scalar only inuences the time-to-convergence of the translational control loo. Indeed, if is estimated as the ositive scalar and vector n is well-estimated, the matrix M?1 v ()M v () = I is always denite ositive. We can also note that the camera translational velocity is roortional to the desired distance d between F and. An aroximate value has thus to be chosen during the o-line learning stage. However, this value has not to be recisely determined (by hand in the following exeriments) since it does not inuence the stability of the system, but only the time-to-convergence of the translational velocity and the amlitude of the ossible tracking error due to a wrong comensation of the rotational motion. As far as the tracking error is concerned, it is roortional to the rotational velocity and thus disaears when the camera is correctly oriented. 5 Exerimental results The control law has been tested on a seven d.o.f. industrial robot MITSUBISHI PA1 (at EDF DER Chatou) and a six d.o.f. cartesian robot AFMA (at IRISA - see Figure 7). The camera is mounted on the endeector of the robot. The target is a black board with seven white marks (see Figure 8). The extracted visual features are the image coordinates of the center of gravity of each mark. As far as camera calibration is concerned, we have used the ixel and focal lengths given by the constructor in order to comute the image coordinates u and v from their measured values in the image. The center of the image has been used for the rojection of the otical axis in the image. The images corresonding to the desired and initial camera osition are lotted in Figure 8a and 8b resectively. Figure 7: Exerimental cell at IRISA Classical D visual servoing has rst been tested, but without success due to the too much imortant 49

8 (a) (b) On the obtained lots, we can note the divergence of the visual features, which induces the getting out of the target outside the camera eld of view, and thus the failure of the D visual servoing. The corresonding translational and rotational velocity are given together in Figure Figure 8: Images of the target for the desired (a) and the initial (b) camera osition 1.5 dislacement between the initial and desired ositions. Matrix C of equation (5) was chosen always equal to L + (s ; Z ) because Z cannot be calculated without a geometric model of the target. The errors on the coordinates of the center of gravity of each mark are given in Figure 9. The corresonding trajectory in the image is given in Figure Figure 9: Error on the coordinates of the image features (ixels) versus iteration number using D visual servoing Figure 1: Trajectory of target oints in the image using D visual servoing Figure 11: Translational velocity V (cm/s), rotational velocity (dg/s) versus iteration number using D visual servoing We now resent the results obtained using our new D 1/ visual servoing scheme. In the resented exeriment, d is set to cm. From the estimated homograhy, we get a artial estimation of the camera dislacement. For examle, the estimated rotational dislacement, using the initial and desired images, was r x = 9.6 dg, r y = -.5 dg, r z = 95.9 dg (while the real dislacement was r x = 8.1 dg, r y = -4. dg, r z = 96.1 dg). Similarly, the estimated direction of translation was tx =?:19, t y = :95, t z =?: (while jtk jtk jtk the real dislacement was t x = -.8 cm, t y =.6 cm, t z = -5.9 cm, which imlies tx =?:15, t y = :95, ktk jtk t z =?:. The used algorithm is thus quite recise ktk (maximal rotational error is around dg, as well as the angle error on the direction of translation) in desite of the coarse calibration which has been used. The exonential decreasing of the estimated rotation, of ratio r = d=d and of the coordinates u and v of the target oint in the image are given in Figure 1, Figure 1 and Figure 14 resectively. As can be seen on the lots, the obtained results are articularly stable and robust. In this exeriment, is set to :1. A smaller value just imlies a slower timeto-convergence. Higher values could also be chosen. However, the system (whose rate is 1 Hz) becomes unstable when > :5. A good aroximation of d reduces the amlitude of the tracking error due to the rotational movement. A such small erturbation can be observed in Figure 14 from iteration 1 to 5 where the tracking error is aroximately ixels. Let us note that the tracking 5

9 1 8 error comletely disaears (after iteration 5) when the rotational motion has no more inuence. The oututs of the control law, V and are given in Figure Figure 1: Rotation u (dg) versus iteration number Figure 15: Translational velocity V (cm/s), rotational velocity (dg/s) versus iteration number using D 1/ visual servoing Once again, we can note the stability and the robustness of the control law. Finally, the error on the image coordinates of each target oint is given in Figure 16 and the corresonding trajectory in the image is given in Figure Figure 1: Ratio r = d=d versus iteration number Figure 14: Error on the coordinates of the target center of gravity (ixels) versus iteration number Figure 16: Error on the coordinates of the image features (ixels) versus iteration number using D 1/ visual servoing We can note the convergence of the coordinates to their desired values (the control scheme is stoed when maximal error is less than.5 ixels), which demonstrates the correct achievement of the ositioning task. Let us recall that these image coordinates are only used to comute the homograhy between initial and nal camera ositions. 51

10 Figure 17: Trajectory of target oints in the image using D 1/ visual servoing 6 Conclusion In this aer, we have roosed a new aroach to vision-based robot control. Contrarily to the osebased aroach, the roosed control law does not need any geometric model of the target. Furthermore, the domain of convergence for the D 1/ visual servoing (the half sace in front of the target) is larger than for the D visual servoing. Finally, exeriments show that a recise camera calibration is not needed. This is due to the fact that the homograhy estimation is iteratively erformed in conjunction with a closedloo control law. The main hyothesis of our actual scheme is that the image oints used to estimate the homograhy corresond to colanar D oints. Future work will thus concern the generalization of homograhy estimation in the case of any non-lanar target using algorithms such as those resented in [] and [1]. Acknowledgements This work was suorted by the national French Comany of Electricity Power: EDF. We are grateful to the team manager and the researchers of the Teleoeration/Robotics grou, at DER Chatou, for their articiation and hel. [] B. Couael, K.E. Bainian. Stereo vision with the use of a virtual lane in the sace. Chinese Journal of Electronics, 4():{9, Aril [4] D. Dementhon, L.. Davis. Model-based object ose in 5 lines of code. International Journal of Comuter Vision, 15:1{141, [5] B. Esiau, F. Chaumette, P. Rives. A new aroach to visual servoing in robotics. IEEE Trans. on Robotics and Automation, 8():1{6, June 199. [6] B. Esiau. Eect of camera calibration errors on visual servoing in robotics. In rd International Symosium on Exerimental Robotics, Kyoto, Jaan, October 199. [7] O. Faugeras, F. Lustman. Motion and structure from motion in a iecewise lanar environment. International Journal of Pattern Recognition and Articial Intelligence, ():485{58, [8] K. Hashimoto, ed. Visual Servoing: Real Time Control of Robot maniulators based on visual sensory feedback, volume 7 of World Scientic Series in Robotics and Automated Systems. World Scientic Press, Singaore, 199. [9] S. Hutchinson, G.D. Hager, P.I. Corke. A tutorial on visual servo control. IEEE Trans. on Robotics and Automation, 1(5):651{67, October [1] W.J. Wilson, C.C. Williams Hulls, G.S. Bell. Relative end-eector control using cartesian ositionbased visual servoing. IEEE Trans. on Robotics and Automation, 1(5):684{696, October [11] L.E. Weiss, A.C. Sanderson, C.P. Neuman. Dynamic sensor-based control of robots with visual feedback. IEEE Journal of Robotics and Automation, (5):44{417, October References [1] B. Boufama, R. Mohr. Eiole and fundamental matrix estimation using the virtual arallax roerty. In IEEE International Conference on Comuter Vision, ages 1{16, Cambridge, USA, [] F. Chaumette. Potential roblems of stability and convergence in image-based and osition-based visual servoing. Worksho on Vision and Control, Block Island, USA, To aear, June

P Z. parametric surface Q Z. 2nd Image T Z

P 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 information

New shortest-path approaches to visual servoing

New shortest-path approaches to visual servoing New shortest-path approaches to visual servoing Ville Laboratory of Information rocessing Lappeenranta University of Technology Lappeenranta, Finland kyrki@lut.fi Danica Kragic and Henrik I. Christensen

More information

Learning Motion Patterns in Crowded Scenes Using Motion Flow Field

Learning 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 information

MATHEMATICAL MODELING OF COMPLEX MULTI-COMPONENT MOVEMENTS AND OPTICAL METHOD OF MEASUREMENT

MATHEMATICAL 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 information

An Efficient Coding Method for Coding Region-of-Interest Locations in AVS2

An 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 information

Analysis and Design of a 3-DOF Flexure-based Zero-torsion Parallel Manipulator for Nano-alignment Applications

Analysis and Design of a 3-DOF Flexure-based Zero-torsion Parallel Manipulator for Nano-alignment Applications 211 IEEE International Conference on Robotics and Automation Shanghai International Conference Center May 9-1, 211, Shanghai, China Analysis and Design of a -DOF Flexure-based Zero-torsion Parallel Maniulator

More information

Last time: Disparity. Lecture 11: Stereo II. Last time: Triangulation. Last time: Multi-view geometry. Last time: Epipolar geometry

Last 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 information

Robot Vision Control of robot motion from video. M. Jagersand

Robot Vision Control of robot motion from video. M. Jagersand Robot Vision Control of robot motion from video M. Jagersand Vision-Based Control (Visual Servoing) Initial Image User Desired Image Vision-Based Control (Visual Servoing) : Current Image Features : Desired

More information

This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.

This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore. This document is downloaded from DR-NTU, Nanyang Technological University Library, Singaore. Title Automatic Robot Taing: Auto-Path Planning and Maniulation Author(s) Citation Yuan, Qilong; Lembono, Teguh

More information

Robust Motion Estimation for Video Sequences Based on Phase-Only Correlation

Robust 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 information

Implementations of Partial Document Ranking Using. Inverted Files. Wai Yee Peter Wong. Dik Lun Lee

Implementations of Partial Document Ranking Using. Inverted Files. Wai Yee Peter Wong. Dik Lun Lee Imlementations of Partial Document Ranking Using Inverted Files Wai Yee Peter Wong Dik Lun Lee Deartment of Comuter and Information Science, Ohio State University, 36 Neil Ave, Columbus, Ohio 4321, U.S.A.

More information

Stereo Disparity Estimation in Moment Space

Stereo 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 information

Kinematics, Workspace, Design and Accuracy Analysis of RPRPR Medical Parallel Robot

Kinematics, Workspace, Design and Accuracy Analysis of RPRPR Medical Parallel Robot HSI 009 Catania, Italy, May 1-3, 009. Kinematics, Worksace, Design and Accuracy Analysis of RPRPR Medical Parallel Robot Cristian Sze, Sergiu-Dan Stan, Member, IEEE, Vencel Csibi, Milos Manic, Senior Member,

More information

A STUDY ON CALIBRATION OF DIGITAL CAMERA

A 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 information

Extracting Optimal Paths from Roadmaps for Motion Planning

Extracting 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 information

AUTOMATIC 3D SURFACE RECONSTRUCTION BY COMBINING STEREOVISION WITH THE SLIT-SCANNER APPROACH

AUTOMATIC 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 information

Efficient Processing of Top-k Dominating Queries on Multi-Dimensional Data

Efficient Processing of Top-k Dominating Queries on Multi-Dimensional Data Efficient Processing of To-k Dominating Queries on Multi-Dimensional Data Man Lung Yiu Deartment of Comuter Science Aalborg University DK-922 Aalborg, Denmark mly@cs.aau.dk Nikos Mamoulis Deartment of

More information

Sensitivity Analysis for an Optimal Routing Policy in an Ad Hoc Wireless Network

Sensitivity 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 information

Matlab Virtual Reality Simulations for optimizations and rapid prototyping of flexible lines systems

Matlab 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 information

Face Recognition Using Legendre Moments

Face 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 information

Pivot Selection for Dimension Reduction Using Annealing by Increasing Resampling *

Pivot 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 information

Efficient Parallel Hierarchical Clustering

Efficient 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 information

Efficient stereo vision for obstacle detection and AGV Navigation

Efficient stereo vision for obstacle detection and AGV Navigation Efficient stereo vision for obstacle detection and AGV Navigation Rita Cucchiara, Emanuele Perini, Giuliano Pistoni Diartimento di Ingegneria dell informazione, University of Modena and Reggio Emilia,

More information

An Efficient and Highly Accurate Technique for Periodic Planar Scanner Calibration with the Antenna Under Test in Situ

An 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 information

Keeping features in the camera s field of view: a visual servoing strategy

Keeping features in the camera s field of view: a visual servoing strategy Keeping features in the camera s field of view: a visual servoing strategy G. Chesi, K. Hashimoto,D.Prattichizzo,A.Vicino Department of Information Engineering, University of Siena Via Roma 6, 3 Siena,

More information

Feature Selection and Pose Estimation From Known Planar Objects Using Monocular Vision

Feature 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 information

Using Rational Numbers and Parallel Computing to Efficiently Avoid Round-off Errors on Map Simplification

Using Rational Numbers and Parallel Computing to Efficiently Avoid Round-off Errors on Map Simplification Using Rational Numbers and Parallel Comuting to Efficiently Avoid Round-off Errors on Ma Simlification Maurício G. Grui 1, Salles V. G. de Magalhães 1,2, Marcus V. A. Andrade 1, W. Randolh Franklin 2,

More information

Ioannis PITAS b. TIMC-IMAG Grenoble laboratory, UMR CNRS 5525, Domaine de la Merci, LA TRONCHE Cedex, FRANCE,

Ioannis PITAS b. TIMC-IMAG Grenoble laboratory, UMR CNRS 5525, Domaine de la Merci, LA TRONCHE Cedex, FRANCE, ylindrical Surface Localization in Monocular Vision William PUEH a Jean-Marc HASSERY a and Ioannis PITAS b a TIM-IMAG Grenoble laboratory, UMR NRS 5525, Domaine de la Merci, 38706 LA TRONHE edex, FRANE,

More information

Distributed Estimation from Relative Measurements in Sensor Networks

Distributed 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 information

OMNI: An Efficient Overlay Multicast. Infrastructure for Real-time Applications

OMNI: An Efficient Overlay Multicast. Infrastructure for Real-time Applications OMNI: An Efficient Overlay Multicast Infrastructure for Real-time Alications Suman Banerjee, Christoher Kommareddy, Koushik Kar, Bobby Bhattacharjee, Samir Khuller Abstract We consider an overlay architecture

More information

GEOMETRIC CONSTRAINT SOLVING IN < 2 AND < 3. Department of Computer Sciences, Purdue University. and PAMELA J. VERMEER

GEOMETRIC 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 information

Combining IBVS and PBVS to ensure the visibility constraint

Combining IBVS and PBVS to ensure the visibility constraint Combining IBVS and PBVS to ensure the visibility constraint Olivier Kermorgant and François Chaumette Abstract In this paper we address the issue of hybrid 2D/3D visual servoing. Contrary to popular approaches,

More information

arxiv: v1 [cs.mm] 18 Jan 2016

arxiv: 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 information

Multi-robot SLAM with Unknown Initial Correspondence: The Robot Rendezvous Case

Multi-robot SLAM with Unknown Initial Correspondence: The Robot Rendezvous Case Multi-robot SLAM with Unknown Initial Corresondence: The Robot Rendezvous Case Xun S. Zhou and Stergios I. Roumeliotis Deartment of Comuter Science & Engineering, University of Minnesota, Minneaolis, MN

More information

Abstract In camera calibration, due to the correlations between certain camera arameters, e.g, the correlation between the image center and the camera

Abstract In camera calibration, due to the correlations between certain camera arameters, e.g, the correlation between the image center and the camera 1 Accuracy Analysis on the Estimation of Camera Parameters for Active Vision Systems y ShengWen Shih, z YiPing Hung, and y WeiSong Lin y Institute of Electrical Engineering, National Taiwan University

More information

Theoretical Analysis of Graphcut Textures

Theoretical 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 information

Lecture 3: Geometric Algorithms(Convex sets, Divide & Conquer Algo.)

Lecture 3: Geometric Algorithms(Convex sets, Divide & Conquer Algo.) Advanced Algorithms Fall 2015 Lecture 3: Geometric Algorithms(Convex sets, Divide & Conuer Algo.) Faculty: K.R. Chowdhary : Professor of CS Disclaimer: These notes have not been subjected to the usual

More information

Motion accuracy of NC machine tools

Motion accuracy of NC machine tools otion accurac of NC machine tools ARIN DOINA, STANCIU IOAN, ARIN DAN IHAIL Dnamics Sstems Deartment Institute of Solid echanics-romanian Academ 15, Constantin ille Street, Bucharest, 1141 S.C. Turbomecanica

More information

Chapter 7, Part B Sampling and Sampling Distributions

Chapter 7, Part B Sampling and Sampling Distributions Slides Preared by JOHN S. LOUCKS St. Edward s University Slide 1 Chater 7, Part B Samling and Samling Distributions Samling Distribution of Proerties of Point Estimators Other Samling Methods Slide 2 Samling

More information

Shape from Second-bounce of Light Transport

Shape 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 information

Kinematics. Why inverse? The study of motion without regard to the forces that cause it. Forward kinematics. Inverse kinematics

Kinematics. Why inverse? The study of motion without regard to the forces that cause it. Forward kinematics. Inverse kinematics Kinematics Inverse kinematics The study of motion without regard to the forces that cause it Forward kinematics Given a joint configuration, what is the osition of an end oint on the structure? Inverse

More information

Privacy Preserving Moving KNN Queries

Privacy Preserving Moving KNN Queries Privacy Preserving Moving KNN Queries arxiv:4.76v [cs.db] 4 Ar Tanzima Hashem Lars Kulik Rui Zhang National ICT Australia, Deartment of Comuter Science and Software Engineering University of Melbourne,

More information

CMSC 425: Lecture 16 Motion Planning: Basic Concepts

CMSC 425: Lecture 16 Motion Planning: Basic Concepts : Lecture 16 Motion lanning: Basic Concets eading: Today s material comes from various sources, including AI Game rogramming Wisdom 2 by S. abin and lanning Algorithms by S. M. LaValle (Chats. 4 and 5).

More information

Swift Template Matching Based on Equivalent Histogram

Swift 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 information

Fast Algorithm to Estimate Dense Disparity Fields

Fast Algorithm to Estimate Dense Disparity Fields Fast Algorithm to Estimate Dense Disarity Fields M Kardouchi a, E Hervet a University of Moncton, Comuter Science Det, Moncton, NB, Canada {kardoum,hervete}@umonctonca This aer describes a method to comute

More information

Space-efficient Region Filling in Raster Graphics

Space-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 information

An empirical analysis of loopy belief propagation in three topologies: grids, small-world networks and random graphs

An 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 information

Research on Inverse Dynamics and Trajectory Planning for the 3-PTT Parallel Machine Tool

Research on Inverse Dynamics and Trajectory Planning for the 3-PTT Parallel Machine Tool 06 International Conference on aterials, Information, echanical, Electronic and Comuter Engineering (IECE 06 ISBN: 978--60595-40- Research on Inverse Dynamics and rajectory Planning for the 3-P Parallel

More information

Structure from Motion

Structure from Motion 04/4/ Structure from Motion Comuter Vision CS 543 / ECE 549 University of Illinois Derek Hoiem Many slides adated from Lana Lazebnik, Silvio Saverese, Steve Seitz his class: structure from motion Reca

More information

Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.

Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission. An Interactive Programming Method for Solving the Multile Criteria Problem Author(s): Stanley Zionts and Jyrki Wallenius Source: Management Science, Vol. 22, No. 6 (Feb., 1976),. 652-663 Published by:

More information

MULTI-CAMERA SURVEILLANCE WITH VISUAL TAGGING AND GENERIC CAMERA PLACEMENT. Jian Zhao and Sen-ching S. Cheung

MULTI-CAMERA SURVEILLANCE WITH VISUAL TAGGING AND GENERIC CAMERA PLACEMENT. Jian Zhao and Sen-ching S. Cheung MULTI-CAMERA SURVEILLANCE WITH VISUAL TAGGING AND GENERIC CAMERA PLACEMENT Jian Zhao and Sen-ching S. Cheung University of Kentucky Center for Visualization and Virtual Environment 1 Quality Street, Suite

More information

Improved heuristics for the single machine scheduling problem with linear early and quadratic tardy penalties

Improved heuristics for the single machine scheduling problem with linear early and quadratic tardy penalties Imroved heuristics for the single machine scheduling roblem with linear early and quadratic tardy enalties Jorge M. S. Valente* LIAAD INESC Porto LA, Faculdade de Economia, Universidade do Porto Postal

More information

The Edge-flipping Distance of Triangulations

The Edge-flipping Distance of Triangulations The Edge-fliing Distance of Triangulations Sabine Hanke (Institut für Informatik, Universität Freiburg, Germany hanke@informatik.uni-freiburg.de) Thomas Ottmann (Institut für Informatik, Universität Freiburg,

More information

Optimal Multiple Sprite Generation based on Physical Camera Parameter Estimation

Optimal 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 information

Improving Trust Estimates in Planning Domains with Rare Failure Events

Improving Trust Estimates in Planning Domains with Rare Failure Events Imroving Trust Estimates in Planning Domains with Rare Failure Events Colin M. Potts and Kurt D. Krebsbach Det. of Mathematics and Comuter Science Lawrence University Aleton, Wisconsin 54911 USA {colin.m.otts,

More information

Short Papers. Symmetry Detection by Generalized Complex (GC) Moments: A Close-Form Solution 1 INTRODUCTION

Short 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 information

Leak Detection Modeling and Simulation for Oil Pipeline with Artificial Intelligence Method

Leak Detection Modeling and Simulation for Oil Pipeline with Artificial Intelligence Method ITB J. Eng. Sci. Vol. 39 B, No. 1, 007, 1-19 1 Leak Detection Modeling and Simulation for Oil Pieline with Artificial Intelligence Method Pudjo Sukarno 1, Kuntjoro Adji Sidarto, Amoranto Trisnobudi 3,

More information

Grouping of Patches in Progressive Radiosity

Grouping 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 information

CENTRAL 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 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 information

Face Recognition Based on Wavelet Transform and Adaptive Local Binary Pattern

Face 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 information

CSE4421/5324: Introduction to Robotics

CSE4421/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 information

AUTOMATIC GENERATION OF HIGH THROUGHPUT ENERGY EFFICIENT STREAMING ARCHITECTURES FOR ARBITRARY FIXED PERMUTATIONS. Ren Chen and Viktor K.

AUTOMATIC 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 information

Lecture 2: Fixed-Radius Near Neighbors and Geometric Basics

Lecture 2: Fixed-Radius Near Neighbors and Geometric Basics structure arises in many alications of geometry. The dual structure, called a Delaunay triangulation also has many interesting roerties. Figure 3: Voronoi diagram and Delaunay triangulation. Search: Geometric

More information

Measuring and modeling per-element angular visibility in multiview displays

Measuring and modeling per-element angular visibility in multiview displays Measuring and modeling er-element angular visibility in multiview dislays Atanas Boev, Robert Bregovic, Atanas Gotchev Deartment of Signal Processing, Tamere University of Technology, Tamere, Finland firstname.lastname@tut.fi

More information

Learning Robust Locality Preserving Projection via p-order Minimization

Learning Robust Locality Preserving Projection via p-order Minimization Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence Learning Robust Locality Preserving Projection via -Order Minimization Hua Wang, Feiing Nie, Heng Huang Deartment of Electrical

More information

A Simple and Robust Approach to Computation of Meshes Intersection

A 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 information

Effects of fiber cladding on UV beams and fringe patterns in side-exposure FBG writing

Effects 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 information

PREDICTING LINKS IN LARGE COAUTHORSHIP NETWORKS

PREDICTING 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 information

Pattern Recognition Letters

Pattern Recognition Letters Pattern Recognition Letters 30 (2009) 114 122 Contents lists available at ScienceDirect Pattern Recognition Letters journal homeage: www.elsevier.com/locate/atrec A stroke filter and its alication to text

More information

Earthenware Reconstruction Based on the Shape Similarity among Potsherds

Earthenware 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 information

Building Polygonal Maps from Laser Range Data

Building 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 information

Perception of Shape from Shading

Perception 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 information

PRECISION ROBOTIC ASSEMBLY USING ATTRACTIVE REGIONS

PRECISION ROBOTIC ASSEMBLY USING ATTRACTIVE REGIONS PRECISION ROBOTIC ASSEMBLY USING ATTRACTIVE REGIONS Matteo Gilli, 1 and Ron Lumia, 2 and Stefano Pastorelli 1 1 Mech Eng. Det., Politecnico de Torino, Torino, Italy 2 Mech Eng. Det. University of New Mexico,

More information

Survey on Visual Servoing for Manipulation

Survey on Visual Servoing for Manipulation Survey on Visual Servoing for Manipulation Danica Kragic and Henrik I Christensen Centre for Autonomous Systems, Numerical Analysis and Computer Science, Fiskartorpsv. 15 A 100 44 Stockholm, Sweden {danik,

More information

Computing the Convex Hull of. W. Hochstattler, S. Kromberg, C. Moll

Computing 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 information

Visualization, Estimation and User-Modeling for Interactive Browsing of Image Libraries

Visualization, Estimation and User-Modeling for Interactive Browsing of Image Libraries Visualization, Estimation and User-Modeling for Interactive Browsing of Image Libraries Qi Tian, Baback Moghaddam 2 and Thomas S. Huang Beckman Institute, University of Illinois, Urbana-Chamaign, IL 680,

More information

Image Segmentation Using Topological Persistence

Image 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 information

521493S Computer Graphics Exercise 3 (Chapters 6-8)

521493S 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 information

Constrained Path Optimisation for Underground Mine Layout

Constrained 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 information

Depth Estimation for 2D to 3D Football Video Conversion

Depth 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 information

AUTOMATIC ROAD VECTOR EXTRACTION FOR MOBILE MAPPING SYSTEMS

AUTOMATIC ROAD VECTOR EXTRACTION FOR MOBILE MAPPING SYSTEMS AUTOMATIC ROAD VECTOR EXTRACTION FOR MOBILE MAPPING SYSTEMS WANG Cheng a, T. Hassan b, N. El-Sheimy b, M. Lavigne b a School of Electronic Science and Engineering, National University of Defence Technology,

More information

Interactive Image Segmentation

Interactive 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 information

A Novel Iris Segmentation Method for Hand-Held Capture Device

A 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 information

Constrained Empty-Rectangle Delaunay Graphs

Constrained 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 information

IMAGE MOMENTS have been widely used in computer vision

IMAGE MOMENTS have been widely used in computer vision IEEE TRANSACTIONS ON ROBOTICS, VOL. 20, NO. 4, AUGUST 2004 713 Image Moments: A General Useful Set of Features for Visual Servoing François Chaumette, Member, IEEE Abstract In this paper, we determine

More information

AFRL-RW-EG-TR Integrated Multi-Aperture Sensor and Navigation Fusion

AFRL-RW-EG-TR Integrated Multi-Aperture Sensor and Navigation Fusion STINFO COPY AFRL-RW-EG-TR-2010-013 Integrated Multi-Aerture Sensor and Navigation Fusion Andrey Soloviev Jimmy Touma Timothy Klausutis Mikel Miller Adam Rutkowski Kyle Fontaine AFRL/RWGI 101 W Eglin Blvd

More information

split split (a) (b) split split (c) (d)

split split (a) (b) split split (c) (d) International Journal of Foundations of Comuter Science c World Scientic Publishing Comany ON COST-OPTIMAL MERGE OF TWO INTRANSITIVE SORTED SEQUENCES JIE WU Deartment of Comuter Science and Engineering

More information

On the Efficient Second Order Minimization and Image-Based Visual Servoing

On the Efficient Second Order Minimization and Image-Based Visual Servoing 2008 IEEE International Conference on Robotics and Automation Pasadena, CA, USA, May 19-23, 2008 On the Efficient Second Order Minimization and Image-Based Visual Servoing Omar Tahri and Youcef Mezouar

More information

Relations with Relation Names as Arguments: Algebra and Calculus. Kenneth A. Ross. Columbia University.

Relations with Relation Names as Arguments: Algebra and Calculus. Kenneth A. Ross. Columbia University. Relations with Relation Names as Arguments: Algebra and Calculus Kenneth A. Ross Columbia University kar@cs.columbia.edu Abstract We consider a version of the relational model in which relation names may

More information

A Fast, Affordable System for Augmented Reality

A Fast, Affordable System for Augmented Reality A Fast, Affordable System for Augmented Reality David LaRose CMU-RI-TR-98-2 The Robotics Institute Carnegie Mellon University Pittsburgh, Pennsylvania Submitted in artial fulfillment of the requirements

More information

SPITFIRE: Scalable Parallel Algorithms for Test Set Partitioned Fault Simulation

SPITFIRE: Scalable Parallel Algorithms for Test Set Partitioned Fault Simulation To aear in IEEE VLSI Test Symosium, 1997 SITFIRE: Scalable arallel Algorithms for Test Set artitioned Fault Simulation Dili Krishnaswamy y Elizabeth M. Rudnick y Janak H. atel y rithviraj Banerjee z y

More information

Shuigeng Zhou. May 18, 2016 School of Computer Science Fudan University

Shuigeng Zhou. May 18, 2016 School of Computer Science Fudan University Query Processing Shuigeng Zhou May 18, 2016 School of Comuter Science Fudan University Overview Outline Measures of Query Cost Selection Oeration Sorting Join Oeration Other Oerations Evaluation of Exressions

More information

Randomized algorithms: Two examples and Yao s Minimax Principle

Randomized algorithms: Two examples and Yao s Minimax Principle Randomized algorithms: Two examles and Yao s Minimax Princile Maximum Satisfiability Consider the roblem Maximum Satisfiability (MAX-SAT). Bring your knowledge u-to-date on the Satisfiability roblem. Maximum

More information

MOTION. Feature Matching/Tracking. Control Signal Generation REFERENCE IMAGE

MOTION. Feature Matching/Tracking. Control Signal Generation REFERENCE IMAGE Head-Eye Coordination: A Closed-Form Solution M. Xie School of Mechanical & Production Engineering Nanyang Technological University, Singapore 639798 Email: mmxie@ntuix.ntu.ac.sg ABSTRACT In this paper,

More information

To appear in IEEE TKDE Title: Efficient Skyline and Top-k Retrieval in Subspaces Keywords: Skyline, Top-k, Subspace, B-tree

To 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 information

Probabilistic Visual Cryptography Schemes

Probabilistic Visual Cryptography Schemes The Comuter Journal Advance Access ublished December, 25 The Author 25. Published by Oxford University Press on behalf of The British Comuter Society. All rights reserved. For Permissions, lease email:

More information

Visual Servo...through the Pages of the Transactions on Robotics (... and Automation)

Visual Servo...through the Pages of the Transactions on Robotics (... and Automation) Dick Volz Festschrift p. 1 Visual Servo...through the Pages of the Transactions on Robotics (... and Automation) Seth Hutchinson University of Illinois Dick Volz Festschrift p. 2 Visual Servo Control The

More information

We will then introduce the DT, discuss some of its fundamental properties and show how to compute a DT directly from a given set of points.

We will then introduce the DT, discuss some of its fundamental properties and show how to compute a DT directly from a given set of points. Voronoi Diagram and Delaunay Triangulation 1 Introduction The Voronoi Diagram (VD, for short) is a ubiquitious structure that aears in a variety of discilines - biology, geograhy, ecology, crystallograhy,

More information

Weighted Page Rank Algorithm based on In-Out Weight of Webpages

Weighted Page Rank Algorithm based on In-Out Weight of Webpages Indian Journal of Science and Technology, Vol 8(34), DOI: 10.17485/ijst/2015/v8i34/86120, December 2015 ISSN (Print) : 0974-6846 ISSN (Online) : 0974-5645 eighted Page Rank Algorithm based on In-Out eight

More information

A CLASS OF STRUCTURED LDPC CODES WITH LARGE GIRTH

A 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 information