Object Pose from a Single Image
|
|
- Dominic Atkinson
- 6 years ago
- Views:
Transcription
1 Object Pose from a Single Image
2 How Do We See Objects in Depth? Stereo Use differences between images in or left and right eye How mch is this difference for a car at 00 m? Moe or head sideways Or, the scene is moing Or we are moing in a car We know the sie and shape of objects raffic lights, car headlights and taillights
3 Headlights in the Dark A robot cold ealate its distance from incoming cars at night partly from a model of cars Distance between headlights known D m d Z Z = f d D Image plane f Center of projection 3
4 Object Pose with D Image Plane What happens if we don t know object s angle? 4
5 More Points Limited nmber of object poses ( or ) Head lights and one taillight ransparent car 5
6 Correspondence Problem When we know correspondences (i.e. matchings), pose is easier to find When we know the pose, correspondences are easier to find. Bt we need to find both at the same time Below, we first assme we know correspondences and describe how to sole the pose gien n corresponding points in image and object Perspectie n-point Problem hen we explore what to do when we don t know correspondences 6
7 7 Pose s. Calibration Problem Now we know calibration matrix K We can transform image points by K - transformation Projection matrix is now Soling pose problem consists of finding R and 6 nknowns = K 0 0 y x s y x α α = ' ' ' w w - K [ ] = S S S Z Y X w R 0 I K K [ ] = S S S Z Y X w R ] P = [R Canonical perspectie projection with f =
8 Iteratie Pose Calclation First we derie a linear system for the nknown parameters of rotation and translation that contains the known world coordinates of points and the homogenos coordinates of their images. Problem: Does not contain the wi components he wi components are reqired for compting homogeneos coordinates of images from the pixel locations hey can be compted once the rotation and translation parameters are estimated Soltion: Make a gess on wi, compte R and, then recompte wi, and recompte R and, etc 8
9 9 Iteratie Pose Calclation = S S S y x Z Y X w 3 r r r X r r r 3 = y x w i i i i Z Y X w ),,.( + r 3 = X r r = y x [ ] = y x r r X = y x Z Y X Z Y X Z Y X Z Y X r r = y x - M r r Non coplanar points needed (otherwise matrix M is singlar). At least 4 points.
10 0 Iteratie Pose Calclation Compte model matrix M and its inerse Assme Compte i = w i x i, i = w i y i Compte Compte, x, y, r, r, then r 3 = r x r Compte Go back to step and iterate ntil conergence i i i i Z Y X w ),,.( + r 3 = = y x - M r r ),, ( = = i i i i w Z Y X. r 3
11 Iteratie Pose Calclation. Find object pose nder scaled orthographic projection. Project object points on lines of sight 3. Find scaled orthographic projection images of those points 4. Loop sing those images in step r 3
12 POSI for a Cbe Left: Actal perspectie image for cbe with known model op: Eoltion of perspectie image dring iteration Bottom: Eoltion of scaled orthographic projection
13 Application: 3D Mose 3
14 3 Points Each correspondence between scene point and image point determines eqations Since there are 6 degrees of freedom in the pose problems, the correspondences between 3 scene points in a known configration and 3 image points shold proide enogh eqations for compting the pose of the 3 scene points the pose of a triangle of known dimension is defined from a single image of the triangle Bt nonlinear method, to 4 soltions 4
15 riangle Pose Problem here are two basic approaches Analytically soling for nknown pose parameters Soling a 4th degree eqation in one pose parameter, and then sing the 4 soltions to the eqation to sole for remaining pose parameters problem: errors in estimating location of image featres can lead to either large pose errors or failre to sole the 4th degree eqation Approximate nmerical algorithms find soltions when exact methods fail de to image measrement error more comptation 5
16 Nmerical Method for riangle Pose A α B C' A' B' γ δ C Center of Projection β If distance R c to C is known, then possible locations of A (and B) can be compted they lie on the intersections of the line of sight throgh A' and the sphere of radis AC centered at C Once A and B are located, their distance can be compted and compared against the actal distance 6 AB
17 Nmerical Method for riangle Pose H A A' α C' γ δ B' C β B Not practical to search on R c since it is nbonded Instead, search on one anglar pose parameter, α. R c = AC cos α sin δ R a = R c cos δ ± AC sin α R b = R c cos γ ± [(BC -(RC sin γ) ] his reslts in for possible lengths for side AB Keep poses with the right AB length 7
18 Choosing Points on Objects Gien a 3-D object, how do we decide which points from its srface to choose for its model? Choose points that will gie rise to detectable featres in images For polyhedra, the images of its ertices will be points in the images where two or more long lines meet hese can be detected by edge detection methods Points on the interiors of regions, or along straight lines are not 8easily identified in images.
19 Example images 9
20 Choosing the Points Example: why not choose the midpoints of the edges of a polyhedra as featres midpoints of projections of line segments are not the projections of the midpoints of line segments if the entire line segment in the image is not identified, then we introdce error in locating midpoint 0
21 Strategy: Objects and Unknown Correspondences Pick p a small grop of points (3 or 4) on object, and candidate image points in image Find object pose for these correspondences Check or accmlate eidence by one of following techniqes: Clstering in pose space Image-Model Alignment and RANSAC
22 4-3--? 4 - point perspectie soltion Uniqe soltion for 6 pose parameters Comptational complexity of n 4 m point perspectie soltion Generally two soltions per triangle pair, bt sometimes for. Redced complexity of n 3 m 3
23 Redcing the Combinatorics of Pose Estimation How can we redce the nmber of matches Consider only qadrples of object featres that are simltaneosly isible extensie preprocessing 3
24 Redcing the Combinatorics of Pose Estimation Redcing the nmber of matches Consider only qadrples of image featres that Are connected by edges Are close to one another Bt not too close or the ineitable errors in estimating the position of an image ertex will lead to large errors in pose estimation Generally, try to grop the image featres into sets that are probably from a single object, and then only constrct qadrples from within a single grop 4
25 Image-Model Alignment Gien: A 3-D object modeled as a collection of points Image of a scene sspected to inclde an instance of the object, segmented into featre points Goal Hypothesie the pose of the object in the scene by matching (collections of) n model points against n featre points, enabling s to sole for the rigid body transformation from the object to world coordinate systems, and Verify that hypothesis by projecting the remainder of the model into the image and matching Look for edges connecting predicted ertex locations Srface markings 5
26 RANSAC RANdom SAmple Consenss Randomly select a set of 3 points in the image and a select a set of 3 points in the model Compte triangle pose and pose of model Project model at compted pose onto image Determine the set of projected model points that are within a distance threshold t of image points, called the consenss set After N trials, select pose with largest consenss set 6
27 Clstering in Pose Space Each matching of n model points against n featre points proides R and Each correct matching proides a similar rotation and translation Represent each pose by a point in a 6D space. hen points from correct matchings shold clster Or find clsters for points and find the clster where the rotations are most consistent Generalied Hogh transform if bins are sed 7
28 Scope of the Problem Flat objects s. 3D objects Grabbing flat tools on a tray s. grabbing handle of cp Ronded objects s. polyhedral objects Cp s. keyboard or CD cassette Rigid objects s. deformable objects 8
29 Pose and Recognition Soling the Pose Problem can be sed to sole the Recognition Problem for 3D objects: ry to find the pose of each item in the database of objects we want to identify Select the items whose projected points match the largest amonts of image points in the erification stage, and label the corresponding image regions with the item names. Bt many alternatie recognition techniqes do not proide the pose of the recognied item. 9
30 References VAS literatre on the sbject (larger than for calibration) Search for pose & object & model & USC Search in citeseer.nj.nec.com 30
SINGLE VIEW GEOMETRY AND SOME APPLICATIONS
SINGLE VIEW GEOMERY AND SOME APPLICAIONS hank you for the slides. hey come mostly from the following sources. Marc Pollefeys U. on North Carolina Daniel DeMenthon U. of Maryland Alexei Efros CMU Action
More informationABSOLUTE DEFORMATION PROFILE MEASUREMENT IN TUNNELS USING RELATIVE CONVERGENCE MEASUREMENTS
Proceedings th FIG Symposim on Deformation Measrements Santorini Greece 00. ABSOUTE DEFORMATION PROFIE MEASUREMENT IN TUNNES USING REATIVE CONVERGENCE MEASUREMENTS Mahdi Moosai and Saeid Khazaei Mining
More informationA sufficient condition for spiral cone beam long object imaging via backprojection
A sfficient condition for spiral cone beam long object imaging via backprojection K. C. Tam Siemens Corporate Research, Inc., Princeton, NJ, USA Abstract The response of a point object in cone beam spiral
More informationCMSC 828D: Fundamentals of Computer Vision Homework 7
CMSC 828D: Homework 7 Instrctors: Larr Dais, Ramani Draiswami, Daniel DeMenthon, and Yiannis Aloimonos Soltion based on homework sbmitted b Haiing Li 1. Write a Matlab fnction that otpts the homogeneos
More informationOPTI-502 Optical Design and Instrumentation I John E. Greivenkamp Homework Set 7 Fall, 2018
Assigned: 10/10/18 Lectre 15 De: 10/17/18 Lectre 17 Midterm Exam: Wednesda October 24 (Lectre 19) The eqation sheet for the exam has been posted on the corse website. This eqation sheet will be inclded
More informationOptimal Sampling in Compressed Sensing
Optimal Sampling in Compressed Sensing Joyita Dtta Introdction Compressed sensing allows s to recover objects reasonably well from highly ndersampled data, in spite of violating the Nyqist criterion. In
More informationOn Plane Constrained Bounded-Degree Spanners
On Plane Constrained Bonded-Degree Spanners Prosenjit Bose 1, Rolf Fagerberg 2, André an Renssen 1, Sander Verdonschot 1 1 School of Compter Science, Carleton Uniersity, Ottaa, Canada. Email: jit@scs.carleton.ca,
More informationEvaluating Influence Diagrams
Evalating Inflence Diagrams Where we ve been and where we re going Mark Crowley Department of Compter Science University of British Colmbia crowley@cs.bc.ca Agst 31, 2004 Abstract In this paper we will
More information7. Texture Mapping. Idea. Examples Image Textures. Motivation. Textures can be images or procedures. Textures can be 2D or 3D
3 4 Idea Add srface detail withot raising geometric complexity Textres can be images or procedres Textres can be D or 3D Motiation Wireframe Model + Lighting & Shading + Textre Mapping http://www.3drender.com/jbirn/prodctions.html
More informationMaximal Cliques in Unit Disk Graphs: Polynomial Approximation
Maximal Cliqes in Unit Disk Graphs: Polynomial Approximation Rajarshi Gpta, Jean Walrand, Oliier Goldschmidt 2 Department of Electrical Engineering and Compter Science Uniersity of California, Berkeley,
More informationStereo (Part 2) Introduction to Computer Vision CSE 152 Lecture 9
Stereo (Part 2) CSE 152 Lectre 9 Annoncements Homework 3 is de May 9 11:59 PM Reading: Chapter 7: Stereopsis Stereo Vision Otline Offline: Calibrate cameras & determine B epipolar geometry Online C D A
More information3D SURFACE RECONSTRUCTION BASED ON COMBINED ANALYSIS OF REFLECTANCE AND POLARISATION PROPERTIES: A LOCAL APPROACH
3D SURFACE RECONSTRUCTION BASED ON COMBINED ANALYSIS OF REFLECTANCE AND POLARISATION PROPERTIES: A LOCAL APPROACH Pablo d Angelo and Christian Wöhler DaimlerChrysler Research and Technology, Machine Perception
More information5.0 Curve and Surface Theory
5. Cre and Srface Theor 5.1 arametric Representation of Cres Consider the parametric representation of a cre as a ector t: t [t t t] 5.1 The deriatie of sch a ector ealated at t t is gien b t [ t t t ]
More information[1] Hopcroft, J., D. Joseph and S. Whitesides, Movement problems for twodimensional
Acknoledgement. The athors thank Bill Lenhart for interesting discssions on the recongration of rlers. References [1] Hopcroft, J., D. Joseph and S. Whitesides, Moement problems for todimensional linkages,
More informationPlanarity-Preserving Clustering and Embedding for Large Planar Graphs
Planarity-Presering Clstering and Embedding for Large Planar Graphs Christian A. Dncan, Michael T. Goodrich, and Stephen G. Koboro Center for Geometric Compting The Johns Hopkins Uniersity Baltimore, MD
More informationChapter 4: Network Layer
Chapter 4: Introdction (forarding and roting) Reie of qeeing theor Roting algorithms Link state, Distance Vector Roter design and operation IP: Internet Protocol IP4 (datagram format, addressing, ICMP,
More informationA Hybrid Weight-Based Clustering Algorithm for Wireless Sensor Networks
Open Access Library Jornal A Hybrid Weight-Based Clstering Algorithm for Wireless Sensor Networks Cheikh Sidy Mohamed Cisse, Cheikh Sarr * Faclty of Science and Technology, University of Thies, Thies,
More informationPipelining. Chapter 4
Pipelining Chapter 4 ake processor rns faster Pipelining is an implementation techniqe in which mltiple instrctions are overlapped in eection Key of making processor fast Pipelining Single cycle path we
More informationARRAY ANTENNA DIAGNOSTICS WITH THE 3D RECONSTRUCTION ALGORITHM
ARRAY ANTENNA DIAGNOSTICS WITH THE 3D RECONSTRUCTION ALGORITHM Cecilia Cappellin 1, Peter Meincke 1, Sergey Pinenko 2, Erik Jørgensen 1 1 TICRA, Læderstræde 34, DK-1201 Copenhagen, Denmark 2 DTU Elektro,
More informationChapter 5. Plane Graphs and the DCEL
Chapter 5 Plane Graphs and the DCEL So far we hae been talking abot geometric strctres sch as trianglations of polygons and arrangements of line segments withot paying mch attention to how to represent
More informationHardware-Accelerated Free-Form Deformation
Hardware-Accelerated Free-Form Deformation Clint Cha and Ulrich Nemann Compter Science Department Integrated Media Systems Center University of Sothern California Abstract Hardware-acceleration for geometric
More informationAnnouncements. Motion. Motion. Continuous Motion. Background Subtraction
Annoncements Motion CSE 5A Lectre 13 Homework is de toda, 11:59 PM Reading: Section 10.6.1: Optical Flow and Motion Section 10.6.: Flow Models Introdctor echniqes or 3-D Compter Vision, rcco and Verri
More informationIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 5, MAY On the Analysis of the Bluetooth Time Division Duplex Mechanism
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 5, MAY 2007 1 On the Analysis of the Bletooth Time Division Dplex Mechanism Gil Zssman Member, IEEE, Adrian Segall Fellow, IEEE, and Uri Yechiali
More informationTu P7 15 First-arrival Traveltime Tomography with Modified Total Variation Regularization
T P7 15 First-arrival Traveltime Tomography with Modified Total Variation Reglarization W. Jiang* (University of Science and Technology of China) & J. Zhang (University of Science and Technology of China)
More informationDiscrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods
Annals of Operations Research 106, 19 46, 2001 2002 Klwer Academic Pblishers. Manfactred in The Netherlands. Discrete Cost Mlticommodity Network Optimization Problems and Exact Soltion Methods MICHEL MINOUX
More informationUncertainty Determination for Dimensional Measurements with Computed Tomography
Uncertainty Determination for Dimensional Measrements with Compted Tomography Kim Kiekens 1,, Tan Ye 1,, Frank Welkenhyzen, Jean-Pierre Krth, Wim Dewlf 1, 1 Grop T even University College, KU even Association
More informationCS 4204 Computer Graphics
CS 424 Compter Graphics Crves and Srfaces Yong Cao Virginia Tech Reference: Ed Angle, Interactive Compter Graphics, University of New Mexico, class notes Crve and Srface Modeling Objectives Introdce types
More informationCompound Catadioptric Stereo Sensor for Omnidirectional Object Detection
Compond Catadioptric Stereo Sensor for mnidirectional bject Detection Ryske Sagawa Naoki Krita Tomio Echigo Yasshi Yagi The Institte of Scientific and Indstrial Research, saka University 8-1 Mihogaoka,
More informationAssignments. Computer Networks LECTURE 7 Network Layer: Routing and Addressing. Network Layer Function. Internet Architecture
ompter Netorks LETURE Netork Laer: Roting and ddressing ssignments Project : Web Pro Serer DUE OT Sandha Darkadas Department of ompter Science Uniersit of Rochester Internet rchitectre Bottom-p: phsical:
More informationDYNAMIC ROAD STRUCTURE ESTIMATION
Blletin of the Transilania Uniersity of Braşo Vol. 8 (57) No. - 15 Series I: Engineering Sciences DYNAMIC ROAD STRUCTURE ESTIMATION S.M. GRIGORESCU 1 G. MĂCEŞANU 1 Abstract: The paper presents a roa strctre
More informationBias of Higher Order Predictive Interpolation for Sub-pixel Registration
Bias of Higher Order Predictive Interpolation for Sb-pixel Registration Donald G Bailey Institte of Information Sciences and Technology Massey University Palmerston North, New Zealand D.G.Bailey@massey.ac.nz
More informationOn Plane Constrained Bounded-Degree Spanners
Algorithmica manscript No. (ill be inserted by the editor) 1 On Plane Constrained Bonded-Degree Spanners 2 3 Prosenjit Bose Rolf Fagerberg André an Renssen Sander Verdonschot 4 5 Receied: date / Accepted:
More informationOPTI-502 Optical Design and Instrumentation I John E. Greivenkamp Homework Set 9 Fall, 2018
OPTI-502 Optical Design and Instrmentation I John E. Greivenkamp Assigned: 10/31/18 Lectre 21 De: 11/7/18 Lectre 23 Note that in man 502 homework and exam problems (as in the real world!!), onl the magnitde
More informationSummer 2017 MATH Suggested Solution to Exercise Find the tangent hyperplane passing the given point P on each of the graphs: (a)
Smmer 2017 MATH2010 1 Sggested Soltion to Exercise 6 1 Find the tangent hyperplane passing the given point P on each of the graphs: (a) z = x 2 y 2 ; y = z log x z P (2, 3, 5), P (1, 1, 1), (c) w = sin(x
More informationAUTOMATIC REGISTRATION FOR REPEAT-TRACK INSAR DATA PROCESSING
AUTOMATIC REGISTRATION FOR REPEAT-TRACK INSAR DATA PROCESSING Mingsheng LIAO, Li ZHANG, Zxn ZHANG, Jiangqing ZHANG Whan Technical University of Srveying and Mapping, Natinal Lab. for Information Eng. in
More informationThe single-cycle design from last time
lticycle path Last time we saw a single-cycle path and control nit for or simple IPS-based instrction set. A mlticycle processor fies some shortcomings in the single-cycle CPU. Faster instrctions are not
More informationPicking and Curves Week 6
CS 48/68 INTERACTIVE COMPUTER GRAPHICS Picking and Crves Week 6 David Breen Department of Compter Science Drexel University Based on material from Ed Angel, University of New Mexico Objectives Picking
More informationThe extra single-cycle adders
lticycle Datapath As an added bons, we can eliminate some of the etra hardware from the single-cycle path. We will restrict orselves to sing each fnctional nit once per cycle, jst like before. Bt since
More informationCS 557 Lecture IX. Drexel University Dept. of Computer Science
CS 7 Lectre IX Dreel Uniersity Dept. of Compter Science Fall 00 Shortest Paths Finding the Shortest Paths in a graph arises in many different application: Transportation Problems: Finding the cheapest
More informationStereopsis Raul Queiroz Feitosa
Stereopsis Ral Qeiroz Feitosa 5/24/2017 Stereopsis 1 Objetie This chapter introdces the basic techniqes for a 3 dimensional scene reconstrction based on a set of projections of indiidal points on two calibrated
More informationThe effectiveness of PIES comparing to FEM and BEM for 3D elasticity problems
The effectiveness of PIES comparing to FEM and BEM for 3D elasticit problems A. Boltc, E. Zienik, K. Sersen Faclt of Mathematics and Compter Science, Universit of Bialstok, Sosnowa 64, 15-887 Bialstok,
More informationNew-Sum: A Novel Online ABFT Scheme For General Iterative Methods
New-Sm: A Novel Online ABFT Scheme For General Iterative Methods Dingwen Tao (University of California, Riverside) Shaiwen Leon Song (Pacific Northwest National Laboratory) Sriram Krishnamoorthy (Pacific
More informationA Layered Approach to Stereo Reconstruction
Appeared in the 1998 Conference on Compter Vision and Pattern Recognition, Santa Barbara, CA, Jne 1998. A Layered Approach to Stereo Reconstrction Simon Baker Richard Szeliski and P. Anandan Department
More informationFINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES
FINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES RICARDO G. DURÁN AND ARIEL L. LOMBARDI Abstract. We consider the nmerical approximation of a model convection-diffsion
More informationHidden Line and Surface
Copyright@00, YZU Optimal Design Laboratory. All rights resered. Last updated: Yeh-Liang Hsu (00--). Note: This is the course material for ME550 Geometric modeling and computer graphics, Yuan Ze Uniersity.
More information3-D D Euclidean Space - Vectors
3-D D Euclidean Space - Vectors Rigid Body Motion and Image Formation A free vector is defined by a pair of points : Jana Kosecka http://cs.gmu.edu/~kosecka/cs682.html Coordinates of the vector : 3D Rotation
More informationComputer-Aided Mechanical Design Using Configuration Spaces
Compter-Aided Mechanical Design Using Configration Spaces Leo Joskowicz Institte of Compter Science The Hebrew University Jersalem 91904, Israel E-mail: josko@cs.hji.ac.il Elisha Sacks (corresponding athor)
More informationImproving Network Connectivity Using Trusted Nodes and Edges
Improing Network Connectiity Using Trsted Nodes and Edges Waseem Abbas, Aron Laszka, Yegeniy Vorobeychik, and Xenofon Kotsokos Abstract Network connectiity is a primary attribte and a characteristic phenomenon
More informationReal-time mean-shift based tracker for thermal vision systems
9 th International Conference on Qantitative InfraRed Thermography Jly -5, 008, Krakow - Poland Real-time mean-shift based tracker for thermal vision systems G. Bieszczad* T. Sosnowski** * Military University
More informationNetwork layer. Two Key Network-Layer Functions. Datagram Forwarding table. IP datagram format. IP Addressing: introduction
Netork laer transport segment sending to receiing host on sending side encapslates segments into grams on rcing side, deliers segments to transport laer laer protocols in eer host, roter roter eamines
More informationEFFECTS OF OPTICALLY SHALLOW BOTTOMS ON WATER-LEAVING RADIANCES. Curtis D. Mobley and Lydia Sundman Sequoia Scientific, Inc. th
EFFECTS OF OPTICALLY SHALLOW BOTTOMS ON WATER-LEAVING RADIANCES Crtis D. Mobley and Lydia Sndman Seqoia Scientific, Inc. th 15317 NE 90 Street Redmond, WA 98052 USA mobley@seqoiasci.com phone: 425-867-2464
More informationFast Obstacle Detection using Flow/Depth Constraint
Fast Obstacle etection sing Flow/epth Constraint S. Heinrich aimlerchrylser AG P.O.Box 2360, -89013 Ulm, Germany Stefan.Heinrich@aimlerChrysler.com Abstract The early recognition of potentially harmfl
More informationChapter 7 TOPOLOGY CONTROL
Chapter TOPOLOGY CONTROL Oeriew Topology Control Gabriel Graph et al. XTC Interference SINR & Schedling Complexity Distribted Compting Grop Mobile Compting Winter 00 / 00 Distribted Compting Grop MOBILE
More informationEEC 483 Computer Organization
EEC 83 Compter Organization Chapter.6 A Pipelined path Chans Y Pipelined Approach 2 - Cycle time, No. stages - Resorce conflict E E A B C D 3 E E 5 E 2 3 5 2 6 7 8 9 c.y9@csohio.ed Resorces sed in 5 Stages
More informationSZ-1.4: Significantly Improving Lossy Compression for Scientific Data Sets Based on Multidimensional Prediction and Error- Controlled Quantization
SZ-1.4: Significantly Improving Lossy Compression for Scientific Data Sets Based on Mltidimensional Prediction and Error- Controlled Qantization Dingwen Tao (University of California, Riverside) Sheng
More informationSecond Order Variational Optic Flow Estimation
Second Order Variational Optic Flow Estimation L. Alvarez, C.A. Castaño, M. García, K. Krissian, L. Mazorra, A. Salgado, and J. Sánchez Departamento de Informática y Sistemas, Universidad de Las Palmas
More informationPERFORMANCE EVALUATION AND HILS TEST OF CONTROL ALLOCATION METHODS FOR RECONFIGURATION CONTROL
6 TH INTENATIONA CONGESS OF THE AEONAUTICA SCIENCES Abstract PEFOMANCE EVAUATION AND HIS TEST OF CONTO AOCATION METHODS FO ECONFIGUATION CONTO Byong-Mn Min*, Bong-J Kim**, Eng-Tai Kim***, and Min-Jea Tahk*
More informationThe final datapath. M u x. Add. 4 Add. Shift left 2. PCSrc. RegWrite. MemToR. MemWrite. Read data 1 I [25-21] Instruction. Read. register 1 Read.
The final path PC 4 Add Reg Shift left 2 Add PCSrc Instrction [3-] Instrction I [25-2] I [2-6] I [5 - ] register register 2 register 2 Registers ALU Zero Reslt ALUOp em Data emtor RegDst ALUSrc em I [5
More information11 - Bump Mapping. Bump-Mapped Objects. Bump-Mapped Objects. Bump-Mapped Objects. Limitations Of Texture Mapping. Bumps: Perturbed Normals
CSc 155 Advanced Compter Graphics Limitations Of extre Mapping extre mapping paints srfaces o extre image is typically fixed Some characteristics are difficlt to textre o Roghness, Wrinkles extre illmination
More informationMobility Control and Its Applications in Mobile Ad Hoc Networks
Mobility Control and Its Applications in Mobile Ad Hoc Netorks Jie W and Fei Dai Department of Compter Science and Engineering Florida Atlantic Uniersity Boca Raton, FL 3331 Abstract Most existing localized
More informationMa Lesson 18 Section 1.7
Ma 15200 Lesson 18 Section 1.7 I Representing an Ineqality There are 3 ways to represent an ineqality. (1) Using the ineqality symbol (sometime within set-bilder notation), (2) sing interval notation,
More informationLast lecture: finishing up Chapter 22
Last lectre: finishing p Chapter 22 Hygens principle consider each point on a wavefront to be sorce of secondary spherical wavelets that propagate at the speed of the wave at a later time t, new wavefront
More informationAppearance Based Tracking with Background Subtraction
The 8th International Conference on Compter Science & Edcation (ICCSE 213) April 26-28, 213. Colombo, Sri Lanka SD1.4 Appearance Based Tracking with Backgrond Sbtraction Dileepa Joseph Jayamanne Electronic
More informationChapter 6: Pipelining
CSE 322 COPUTER ARCHITECTURE II Chapter 6: Pipelining Chapter 6: Pipelining Febrary 10, 2000 1 Clothes Washing CSE 322 COPUTER ARCHITECTURE II The Assembly Line Accmlate dirty clothes in hamper Place in
More informationREPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS. M. Meulpolder, D.H.J. Epema, H.J. Sips
REPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS M. Melpolder, D.H.J. Epema, H.J. Sips Parallel and Distribted Systems Grop Department of Compter Science, Delft University of Technology, the Netherlands
More informationAn Introduction to GPU Computing. Aaron Coutino MFCF
An Introdction to GPU Compting Aaron Cotino acotino@waterloo.ca MFCF What is a GPU? A GPU (Graphical Processing Unit) is a special type of processor that was designed to render and maniplate textres. They
More informationBlended Deformable Models
Blended Deformable Models (In IEEE Trans. Pattern Analysis and Machine Intelligence, April 996, 8:4, pp. 443-448) Doglas DeCarlo and Dimitri Metaxas Department of Compter & Information Science University
More informationImage Restoration Image Degradation and Restoration
Image Degradation and Restoration hxy Image Degradation Model: Spatial domain representation can be modeled by: g x y h x y f x y x y Freqency domain representation can be modeled by: G F N Prepared By:
More informationFaster Random Walks By Rewiring Online Social Networks On-The-Fly
1 Faster Random Walks By Rewiring Online ocial Networks On-The-Fly Zhojie Zho 1, Nan Zhang 2, Zhigo Gong 3, Gatam Das 4 1,2 Compter cience Department, George Washington Uniersity 1 rexzho@gw.ed 2 nzhang10@gw.ed
More informationThe multicycle datapath. Lecture 10 (Wed 10/15/2008) Finite-state machine for the control unit. Implementing the FSM
Lectre (Wed /5/28) Lab # Hardware De Fri Oct 7 HW #2 IPS programming, de Wed Oct 22 idterm Fri Oct 2 IorD The mlticycle path SrcA Today s objectives: icroprogramming Etending the mlti-cycle path lti-cycle
More informationFaster Random Walks By Rewiring Online Social Networks On-The-Fly
Faster Random Walks By Rewiring Online ocial Networks On-The-Fly Zhojie Zho 1, Nan Zhang 2, Zhigo Gong 3, Gatam Das 4 1,2 Compter cience Department, George Washington Uniersity 1 rexzho@gw.ed 2 nzhang10@gw.ed
More informationAdaptive Influence Maximization in Microblog under the Competitive Independent Cascade Model
International Jornal of Knowledge Engineering, Vol. 1, No. 2, September 215 Adaptie Inflence Maximization in Microblog nder the Competitie Independent Cascade Model Zheng Ding, Kai Ni, and Zhiqiang He
More informationReal-Time Robot Path Planning via a Distance-Propagating Dynamic System with Obstacle Clearance
POSTPRINT OF: IEEE TRANS. SYST., MAN, CYBERN., B, 383), 28, 884 893. 1 Real-Time Robot Path Planning ia a Distance-Propagating Dynamic System with Obstacle Clearance Allan R. Willms, Simon X. Yang Member,
More informationFault Tolerance in Hypercubes
Falt Tolerance in Hypercbes Shobana Balakrishnan, Füsn Özgüner, and Baback A. Izadi Department of Electrical Engineering, The Ohio State University, Colmbs, OH 40, USA Abstract: This paper describes different
More informationarxiv: v1 [cs.cg] 26 Sep 2018
Convex partial transversals of planar regions arxiv:1809.10078v1 [cs.cg] 26 Sep 2018 Vahideh Keikha Department of Mathematics and Compter Science, University of Sistan and Balchestan, Zahedan, Iran va.keikha@gmail.com
More informationEFFICIENT SOLUTION OF SYSTEMS OF ORIENTATION CONSTRAINTS
EFFICIENT SOLUTION OF SSTEMS OF OIENTATION CONSTAINTS Joseh L. Ganley Cadence Design Systems, Inc. ganley@cadence.com ABSTACT One sbtask in constraint-drien lacement is enforcing a set of orientation constraints
More informationCurves and Surfaces. CS 537 Interactive Computer Graphics Prof. David E. Breen Department of Computer Science
Crves and Srfaces CS 57 Interactive Compter Graphics Prof. David E. Breen Department of Compter Science E. Angel and D. Shreiner: Interactive Compter Graphics 6E Addison-Wesley 22 Objectives Introdce types
More informationAppeared in Proceedings of ISSAC'95 USA. bounds. of a matrix polynomial (or a ratio of matrix polynomials).
Appeared in Proceedings of ISSA'95 Nmeric-Symbolic Algorithms for Ealating One-Dimensional Algebraic Sets Shankar Krishnan Dinesh Manocha Department of ompter Science Uniersity of North arolina hapel Hill,
More informationMultiView: Improving Trust in Group Video Conferencing Through Spatial Faithfulness David T. Nguyen, John F. Canny
MltiView: Improving Trst in Grop Video Conferencing Throgh Spatial Faithflness David T. Ngyen, John F. Canny CHI 2007, April 28 May 3, 2007, San Jose, California, USA Presented by: Stefan Stojanoski 1529445
More informationReview: Computer Organization
Review: Compter Organization Pipelining Chans Y Landry Eample Landry Eample Ann, Brian, Cathy, Dave each have one load of clothes to wash, dry, and fold Washer takes 3 mintes A B C D Dryer takes 3 mintes
More informationC Puzzles! Taken from old exams. Integers Sep 3, Encoding Integers Unsigned. Encoding Example (Cont.) The course that gives CMU its Zip!
15-13 The corse that gies CMU its Zip! Topics class3.ppt Integers Sep 3,! Nmeric Encodings " Unsigned & Two s complement! Programming Implications " C promotion rles! Basic operations " Addition, negation,
More informationOPTI-202R Homework John E. Greivenkamp Spring ) An air-spaced triplet objective is comprised of three thin lenses in air:
Set #5 Assigned: De: 2/7/18 (Wed) 2/14/18 (Wed) MIDTERM I: Frida March 16 8:00-8:50 5-1) An air-spaced triplet objective is comprised of three thin lenses in air: Focal Length Spacing Lens 1 100 mm 25
More informationPOWER-OF-2 BOUNDARIES
Warren.3.fm Page 5 Monday, Jne 17, 5:6 PM CHAPTER 3 POWER-OF- BOUNDARIES 3 1 Ronding Up/Down to a Mltiple of a Known Power of Ronding an nsigned integer down to, for eample, the net smaller mltiple of
More informationFixed-Parameter Algorithms for Cluster Vertex Deletion
Fixed-Parameter Algorithms for Clster Vertex Deletion Falk Hüffner Christian Komsieicz Hannes Moser Rolf Niedermeier Institt für Informatik, Friedrich-Schiller-Uniersität Jena, Ernst-Abbe-Platz 2, D-07743
More informationTowards applications based on measuring the orbital angular momentum of light
CHAPTER 8 Towards applications based on measring the orbital anglar momentm of light Efficient measrement of the orbital anglar momentm (OAM) of light has been a longstanding problem in both classical
More informationPerspective Projection
Perspectie Projection (Com S 477/77 Notes) Yan-Bin Jia Aug 9, 7 Introduction We now moe on to isualization of three-dimensional objects, getting back to the use of homogeneous coordinates. Current display
More informationOPTI-502 Optical Design and Instrumentation I John E. Greivenkamp Final Exam In Class Page 1/15 Fall, 2012
OPTI-502 Optical Design and Instrmentation I John E. Greivenkamp Final Exam In Class Page 1/15 Fall, 2012 Name Closed book; closed notes. Time limit: 2 hors. An eqation sheet is attached and can be removed.
More informationVessel Tracking for Retina Images Based on Fuzzy Ant Colony Algorithm
Vessel Tracking for Retina Images Based on Fzzy Ant Colony Algorithm Sina Hooshyar a, Rasol Khayati b and Reza Rezai c a,b,c Department of Biomedical Engineering, Engineering Faclty, Shahed University,
More informationarxiv: v1 [cs.cg] 31 Aug 2017
Lombardi Drawings of Knots and Links Philipp Kindermann 1, Stephen Koboro 2, Maarten Löffler 3, Martin Nöllenbrg 4, André Schlz 1, and Birgit Vogtenhber 5 arxi:1708.098191 [cs.cg] 31 Ag 2017 1 FernUniersität
More informationVertex Guarding in Weak Visibility Polygons
Vertex Garding in Weak Visibility Polygons Pritam Bhattacharya, Sbir Kmar Ghosh*, Bodhayan Roy School of Technology and Compter Science Tata Institte of Fndamental Research Mmbai 400005, India arxi:1409.46212
More informationUnit 8 Chapter 3 Properties of Angles and Triangles
Unit 8 Chapter 3 Properties of Angles and Triangles May 16 7:01 PM Types of lines 1) Parallel Lines lines that do not (and will not) cross each other are labeled using matching arrowheads are always the
More informationFunctions of Combinational Logic
CHPTER 6 Fnctions of Combinational Logic CHPTER OUTLINE 6 6 6 6 6 5 6 6 6 7 6 8 6 9 6 6 Half and Fll dders Parallel inary dders Ripple Carry and Look-head Carry dders Comparators Decoders Encoders Code
More informationDigital Image Processing Chapter 5: Image Restoration
Digital Image Processing Chapter 5: Image Restoration Concept of Image Restoration Image restoration is to restore a degraded image back to the original image while image enhancement is to maniplate the
More informationStatistical Methods in functional MRI. Standard Analysis. Data Processing Pipeline. Multiple Comparisons Problem. Multiple Comparisons Problem
Statistical Methods in fnctional MRI Lectre 7: Mltiple Comparisons 04/3/13 Martin Lindqist Department of Biostatistics Johns Hopkins University Data Processing Pipeline Standard Analysis Data Acqisition
More informationMulti-lingual Multi-media Information Retrieval System
Mlti-lingal Mlti-media Information Retrieval System Shoji Mizobchi, Sankon Lee, Fmihiko Kawano, Tsyoshi Kobayashi, Takahiro Komats Gradate School of Engineering, University of Tokshima 2-1 Minamijosanjima,
More informationBuilding Facade Detection, Segmentation, and Parameter Estimation for Mobile Robot Localization and Guidance
Bilding Facade etection, Segmentation, and Parameter Estimation for Mobile Robot Localization and Gidance Jeffrey A. elmerico SUNY at Bffalo jad12@bffalo.ed Philip aid Army Research Laboratory Adelphi,
More informationPrimary and Derived Variables with the Same Accuracy in Interval Finite Elements
Primary and Deried Variables with the Same Accracy in Interal inite Elements M. V. Rama Rao R. L. Mllen 2 and R. L. Mhanna 3 Vasai College of Engineering Hyderabad - 5 3 INDIA dr.mrr@gmail.com 2 Case Western
More informationConstructing and Comparing User Mobility Profiles for Location-based Services
Constrcting and Comparing User Mobility Profiles for Location-based Services Xihi Chen Interdisciplinary Centre for Secrity, Reliability and Trst, University of Lxemborg Jn Pang Compter Science and Commnications,
More informationChapter 6 Enhancing Performance with. Pipelining. Pipelining. Pipelined vs. Single-Cycle Instruction Execution: the Plan. Pipelining: Keep in Mind
Pipelining hink of sing machines in landry services Chapter 6 nhancing Performance with Pipelining 6 P 7 8 9 A ime ask A B C ot pipelined Assme 3 min. each task wash, dry, fold, store and that separate
More informationSensor-Based Fast Thermal Evaluation Model For Energy Efficient High-Performance Datacenters
Sensor-ased Fast Thermal valation Model For nergy fficient High-Performance atacenters Qinghi Tang Tridib Mkherjee, Sandeep K. S. Gpta Phil ayton ept. of lectrical ng. ept. of ompter Science and ng. Intel
More information