Universität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart.
|
|
- Brice Cunningham
- 6 years ago
- Views:
Transcription
1 Univerität Augburg à ÊÇÅÍÆ ËÀǼ Approximating Optimal Viual Senor Placement E. Hörter, R. Lienhart Report Januar 2006 Intitut für Informatik D Augburg
2 Copyright c E. Hörter, R. Lienhart Intitut für Informatik Univerität Augburg D Augburg, Germany all right reerved
3 APPROXIMATING OPTIMAL VISUAL SENSOR PLACEMENT E. Hörter Multimedia Computing Lab Univerity of Augburg Augburg, Germany R. Lienhart Multimedia Computing Lab Univerity of Augburg Augburg, Germany ABSTRACT Many novel multimedia application ue viual enor array. In thi paper we addre the problem of optimally placing multiple viual enor in a given pace. Our linear programming approach determine the minimum number of camera needed to cover the pace completely at a given ampling frequency. Simultaneouly it determine the optimal poition and poe of the viual enor. We alo how how to account for viual enor with different propertie and cot if more than one kind are available, and report performance reult. 1. INTRODUCTION Viual enor array are ued in many novel multimedia application uch a video urveillance, ening room, or mart conference room. An important iue in deigning enor array i the appropriate placement of the viual enor uch that they achieve a predefined goal. Our goal it to get complete coverage of a given pace at a predefined ampling rate guaranteeing that an object in the pace will be imaged at a minimum reolution (ee Section 2 for a precie definition). Currently deigner of multi-camera ytem place camera by hand a there exit no theoretical reearch on planning viual enor placement. A video enor array are getting larger, efficient camera placement trategie need to be developed. Often everal different type of camera are available. They differ in the range of view, intrinic parameter, image enor reolution, optic, and cot. Minimizing the cot of a viual enor array while maintaining the required reolution (i.e., minimal ampling frequency ) i alo an important iue we conider. Fig. 1 how one ineffective etup that not even achieve coverage. Although ignificant amount of reearch exit in deigning and calibrating video enor array, automated viual enor placement in general ha not been addreed. There i ome work in the area of grid coverage problem with enor ening event that occur within a ditance r (the ening range of the enor) [1, 2, 3]. Our work i baed on thoe approache, but differ in the enor model, ince camera do not poe circular ening range. Fig. 1. Example of an inefficient etup we deire to optimize The enor placement problem i alo cloely related to the guard placement problem (AGP) the problem of determining the minimum number of guard required to cover the interior of an art gallery. It i addreed by the art gallery theorem [4]. Our camera placement problem differ from the AGP in two way: (1)in the retriction of the field-of-view of camera in our enor model due to reolution and enor propertie; (2) in conidering camera with different fieldof-view at different level of cot. In AGP all guard are aumed to have imilar capabilitie. The paper i organized a follow. In Section 2 the problem i formulated. Our approach i preented in Section 3, before Section 4 give implementation detail and report reult. Section 5 conclude the paper. 2. PROBLEM STATEMENT Definition: In the following the term pace denote a phyical 2D or 3D room, which we want to cover by our viual enor. Currently, we aume that the room i rectangular. Coverage mean that every point of a given pace i ened with a pecified minimal reolution. In thi work, the minimal reolution i atified if a given point in pace i imaged by at leat one pixel of a camera that doe not aggregate more than x cm 2 of a urface parallel to the imaging plane through that point. x i expreed in term of the ampling frequency f and converted into the field-of-view of a camera. The fieldof-view i defined a a the area in which a pixel aggregate no 1 more that f cm 2 of a urface parallel to the imaging plane. Thu an object that appear in the camera field-of-view i imaged with at leat thi reolution auming the object ha
4 a planar urface orthogonal to the optical axi 1. Occluion are not conidered. To implify the derivation we conider only the 2D problem in thi paper; however, the preented approach can be extended eaily to the third dimenion. Problem Statement: Given a pace to be covered at a ampling frequency f by viual enor, we are intereted in the following two camera placement problem: Determine the minimum number of viual enor of a certain type a well a their poition and poe in the pace uch that coverage i achieved. Given different type of viual enor determine how to obtain coverage while minimizing the total cot of the enor array Modeling a camera field-of-view The field-of-view of a camera can be decribed by a triangle a hown in Fig. 2. The parameter of thi triangle can be eaily calculated given the (intrinic) camera parameter and the ampling frequency f uing well known geometric relation. Defining the field-of-view by a triangle enable u to decribe Fig. 2. Deriving the model of a camera field-of-view the area covered by a camera at poition (c x, c y ) and poe (ϕ) linearly. Therefore a camera field-of-view i firt tranlated to the origin of the coordinate ytem (Fig. 2 left): x = x c x, y = y c y (1) Then we rotate the field-of-view, o that the optical axi become parallel to the x-axi (Fig. 2 center): x = co(ϕ) x + in(ϕ) y (2) y = in(ϕ) x + co(ϕ) y (3) The reulting area covered by the triangle (Fig. 2 right) can now be decribed by three line equation l 1, l 2, l 3 : l2 : l1 : x d (4) y a 2d x (5) l3 : y a 2d x (6) 1 Clearly the reolution i maller if the urface i not orthogonal. Thu by ubtitution the following three equation define the area covered by the field-of-view of a certain camera: co(ϕ) (x c x ) + in(ϕ) (y c y ) d (7) in(ϕ) (x c x ) + co(ϕ) (y c y ) a 2d (co(ϕ) (x c x) + in(ϕ) (y c y )) (8) in(ϕ) (x c x ) + co(ϕ) (y c y ) a 2d (co(ϕ) (x c x) + in(ϕ) (y c y )) (9) 2.2. Modeling pace In the ideal cae camera can be placed continuouly in the pace, i.e. the variable c x, c y and ϕ that define a camera poition and poe are continuou variable. A we are not able to olve our problem for the continuou cae we approximate the pace by a two-dimenional grid of point. The minimum ditance between two grid point in the x- and y- direction i determined by the patial ampling frequency f a : = 1/f a. Camera can only be placed at thee dicrete grid point, and coverage i enured only for thee grid point. Thu our problem turn into a grid coverage problem. For f a our approximated olution converge to the continuou-cae olution. We only conider rectangular pace of width w and height h with no obtacle in the room contricting the field-of-view of our viual enor. Remark about more complex pace are made in Section LINEAR PROGRAMMING Conidering only one type of camera, i.e., only camera with the ame field-of-view, we formulate our camera placement problem in term of minimizing the number of camera needed ubject to the coverage contraint. We aume that our pace conit of x and y grid point in the x and y dimenion repectively 2. Viual enor location are retricted to thee grid point. Similarily we dicretize the angle ϕ defining a camera poe to ϕ different poe only. A camera at poition (c x, c y ) with orientation ϕ cover a grid point (x, y) if and only if Eq. 7 to 9 are atified. Thu, we can tate the optimization problem a follow: Problem 1: Given a et of grid point and a camera model, minimize the total number of camera (by optimally aigning camera to grid point and angel) while enuring that every grid point i covered by at leat one camera. In the following we derive an integer programming (ILP) model 2 Given a rectangular pace x and y can be eaily calculated given the room dimenion and the patial ampling rate f a.
5 to olve thi viual enor placement problem. Our approach i baed on the algorithm preented in [2]. Let a binary variable x ijϕ be defined by: 1 if a camera i placed at grid point (i, j) x ijϕ = with orientation ϕ 0 otherwie (10) The total number of camera N i then given by N = x ijϕ (11) Furthermore we define a binary variable c(i1, j1, ϕ1, i2, j2): c(i1, j1, ϕ1, i2, j2) = 1 if a camera placed at grid point (i1, j1) with orientation ϕ1 cover grid point (i2, j2) 0 otherwie (12) c(i1, j1, ϕ1, i2, j2) can be calculated in advance and tored in a table. Our enor deployment problem can now be formulated a an IPL model: ubject to ϕ1=0 i1=0 j1=0 min x ijϕ (13) x i1,j1,ϕ1 c(i1, j1, ϕ1, i2, j2) 1 (14) 0 i2 ( x 1), 0 j2 ( y 1) The contraint repreented by Eq. 14 enure that each grid point i covered by at leat one camera. The minimum number of camera that hould cover each grid point can be eaily changed to e.g. two or more camera. To enure that only one camera i located at each grid point, we can add the contraint: x ijϕ 1 (15) 0 i ( x 1), 0 j ( y 1) The number of variable x ijϕ in our ILP i x y ϕ. Thu, if we increae the number of grid point to achieve a better approximation of the continuou cae, the number of variable and contraint in our IPL increae accordingly Different type of camera A very imilar problem arie if everal type of camera with different enor reolution and optic (i.e. focal length) are available. Then we have for each type of camera k different field-of-view parameter d k and a k (ee Fig. 2) and a cot K k. Our objective i to find the configuration of camera that minimize the total cot of the viual enor while enuring coverage. The optimization problem i formulated a follow: Problem 2: Given a et of grid point and k type of viual enor with cot K k and field-of-view parameter d k, a k minimize the total cot of the enor array (by optimally aigning camera to grid point and angle) while enuring coverage for every grid point. To olve thi problem we need to modify the previou olution. We define a binary variable x ijϕk a follow: x ijϕk = 1 if a camera of type k i placed at grid point (i, j) with orientation ϕ 0 otherwie The total cot C of the viual enor i then calculated by: C = k K k ( k=1 ϕ 1 (16) x ijϕk ) (17) Similar to Eq. 12 a binary variable c k (i1, j1, ϕ1, i2, j2) i defined for each camera type k by: 1 if a camera of type k with orientation ϕ1 i placed at c k (i1, j1, ϕ1, i2, j)) = grid point (i1, j1) and cover grid point (i2, j2) 0 otherwie (18) Again the value of all variable c k (i1, j1, ϕ1, i2, j2) can be calculated in advance. Like in Problem 1 the olution to our viual enor placement problem i found by olving the following ILP model: Minimize the cot function ubject to k C = k K k ( k=1 ϕ 1 x i1,j1,ϕ1,k1 k1=1 ϕ1=0 i1=0 j1=0 x ijϕk ) (19) c k (i1, j1, ϕ1, k1, i2, j2) 1 (20) 0 i2 ( x 1), 0 j2 ( y 1) To enure that at each grid point only one camera i located we need to add the contraint: k x ijϕk 1 (21) k=1 0 i ( x 1), 0 j ( y 1)
6 Fig. 3. Reult of the ILP minimization for identical camera of two ample configuratation (a) and (b) Fig. 4. Reult of minimizing the total cot of the enor array for two different parameter etting The number of variable x ijϕk in our ILP i k x y ϕ, i.e. the number of variable increae with the number of grid point and available camera type a do the contraint. More complex pace: We have only conidered rectangular pace o far. More complex room can be eaily included a linear contraint into our framework a long a they are convex. Additionally, the ILP extenion to the third dimenion i traightforward, but ha been excluded in the dicuion due to pace limitation. 4. EXPERIMENTAL RESULTS The ILP have been implemented in C++ uing the lpolve package [5]. Firt we evaluated our propoed olution to Problem 1: Given a ingle camera type minimize the total number of camera ubject to the coverage contraint. Fig. 4 how two reult with two ample configuration. Blue dot mark camera location; red line mark the field-of-view of the camera. The ampling frequency f and the camera type were et equally in both experiment, the other parameter were et a follow: Experiment (a): room: , f a = 1 10, ϕ = 2 Experiment (b): room: , f a = 1 20, ϕ = 16 It can be oberved in Fig. 4(b) that ome area are uncovered. Thi i due to the low patial ampling frequency f a. Coverage i only aured for dicrete grid point and the ditance between two grid point depend on f a. To enure near complete coverage, f a need to be increaed. We alo evaluated the cot minimization ILP for two camera type with different field-of-view. A cot of $70 wa aumed for the camera with the larger field-of-view, while only $50 were aumed for the camera with the maller fieldof-view. Fig. 4 how two reult. Blue dot denote camera location, while blue and green line mark the field-of-view of the two different camera type. The ize of the room, the ampling and patial ampling frequency f and f a were contant for both experiment. In the firt and econd experiment we choe ϕ = 2 (Fig. 4(a)) and ϕ = 8 (Fig. 4(a)), repectively. The total cot of the enor array in Fig. 4(a) wa $440 and $420 in Fig. 4(b). The above preented ILP problem are practically olvable for only a mall number of grid point. For a large number Chakrabarty et al. [2] propoe a divide-and-conquer algorithm. 5. CONCLUSION AND FUTURE WORK We have preented an approach to optimally place viual enor in a given pace uch that coverage i achieved for dicrete grid point. We have propoed two different algorithm. The firt one minimize the number of camera covering a ening field at a given ampling frequency. The econd algorithm minimize the total cot of the enor array while covering a pace with enor of different propertie. Future work will include a lack variable for coverage, i.e., only a predefined percentage of grid point need to be covered. Additionally it ha to be invetigated how to handle a large number of grid point. 6. REFERENCES [1] S. Sahni and X. Xu, Algorithm for wirele enor network, Intl. Journal on Ditributed Senor Network, vol. 1(1), pp , [2] H. Qi K. Chakrabarty, S. S. Iyengar and E. Cho, Grid coverage for urveillance and target location in ditributed enor network, IEEE Tranaction on Computer, vol. 51(12), pp , [3] J. Wang and N. Zhong, Efficient point coverage in wirele enor network, Journal of Combinatorial Optimization, to appear. [4] J. O Rourke, Art Gallery Theorem and Algorithm, Oxford Univerity Pre, New York, [5] P. Notebaert M. Berkelaar and K. Eikland, lpolve: Open ouce (mixed-integer) linear programming ytem, Eindhoven U. of Technology, olve/file/verion5.5/.
UC Berkeley International Conference on GIScience Short Paper Proceedings
UC Berkeley International Conference on GIScience Short Paper Proceeding Title A novel method for probabilitic coverage etimation of enor network baed on 3D vector repreentation in complex urban environment
More informationPerformance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks
Performance of a Robut Filter-baed Approach for Contour Detection in Wirele Senor Network Hadi Alati, William A. Armtrong, Jr., and Ai Naipuri Department of Electrical and Computer Engineering The Univerity
More informationPlanning of scooping position and approach path for loading operation by wheel loader
22 nd International Sympoium on Automation and Robotic in Contruction ISARC 25 - September 11-14, 25, Ferrara (Italy) 1 Planning of cooping poition and approach path for loading operation by wheel loader
More informationIncreasing Throughput and Reducing Delay in Wireless Sensor Networks Using Interference Alignment
Int. J. Communication, Network and Sytem Science, 0, 5, 90-97 http://dx.doi.org/0.436/ijcn.0.50 Publihed Online February 0 (http://www.scirp.org/journal/ijcn) Increaing Throughput and Reducing Delay in
More informationA Multi-objective Genetic Algorithm for Reliability Optimization Problem
International Journal of Performability Engineering, Vol. 5, No. 3, April 2009, pp. 227-234. RAMS Conultant Printed in India A Multi-objective Genetic Algorithm for Reliability Optimization Problem AMAR
More informationOn successive packing approach to multidimensional (M-D) interleaving
On ucceive packing approach to multidimenional (M-D) interleaving Xi Min Zhang Yun Q. hi ankar Bau Abtract We propoe an interleaving cheme for multidimenional (M-D) interleaving. To achieved by uing a
More informationShortest Paths with Single-Point Visibility Constraint
Shortet Path with Single-Point Viibility Contraint Ramtin Khoravi Mohammad Ghodi Department of Computer Engineering Sharif Univerity of Technology Abtract Thi paper tudie the problem of finding a hortet
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each type of circuit will be implemented in two
More information3D SMAP Algorithm. April 11, 2012
3D SMAP Algorithm April 11, 2012 Baed on the original SMAP paper [1]. Thi report extend the tructure of MSRF into 3D. The prior ditribution i modified to atify the MRF property. In addition, an iterative
More informationMinimum congestion spanning trees in bipartite and random graphs
Minimum congetion panning tree in bipartite and random graph M.I. Otrovkii Department of Mathematic and Computer Science St. John Univerity 8000 Utopia Parkway Queen, NY 11439, USA e-mail: otrovm@tjohn.edu
More informationUniversität Augsburg. Institut für Informatik. On the Optimal Placement of Multiple Visual Sensors. E. Hörster, R. Lienhart.
Universität Augsburg à ÊÇÅÍÆ ËÀǼ On the Optimal Placement of Multiple Visual Sensors E. Hörster, R. Lienhart Report 2006-18 Juli 2006 Institut für Informatik D-86135 Augsburg Copyright c E. Hörster, R.
More informationMirror shape recovery from image curves and intrinsic parameters: Rotationally symmetric and conic mirrors. Abstract. 2. Mirror shape recovery
Mirror hape recovery from image curve and intrinic parameter: Rotationally ymmetric and conic mirror Nuno Gonçalve and Helder Araújo Λ Intitute of Sytem and Robotic Univerity of Coimbra Pinhal de Marroco
More informationDistributed Packet Processing Architecture with Reconfigurable Hardware Accelerators for 100Gbps Forwarding Performance on Virtualized Edge Router
Ditributed Packet Proceing Architecture with Reconfigurable Hardware Accelerator for 100Gbp Forwarding Performance on Virtualized Edge Router Satohi Nihiyama, Hitohi Kaneko, and Ichiro Kudo Abtract To
More informationCENTER-POINT MODEL OF DEFORMABLE SURFACE
CENTER-POINT MODEL OF DEFORMABLE SURFACE Piotr M. Szczypinki Iintitute of Electronic, Technical Univerity of Lodz, Poland Abtract: Key word: Center-point model of deformable urface for egmentation of 3D
More informationMAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc
MAT 155: Decribing, Exploring, and Comparing Data Page 1 of 8 001-oteCh-3.doc ote for Chapter Summarizing and Graphing Data Chapter 3 Decribing, Exploring, and Comparing Data Frequency Ditribution, Graphic
More informationxy-monotone path existence queries in a rectilinear environment
CCCG 2012, Charlottetown, P.E.I., Augut 8 10, 2012 xy-monotone path exitence querie in a rectilinear environment Gregory Bint Anil Mahehwari Michiel Smid Abtract Given a planar environment coniting of
More informationImage authentication and tamper detection using fragile watermarking in spatial domain
International Journal of Advanced Reearch in Computer Engineering & Technology (IJARCET) Volume 6, Iue 7, July 2017, ISSN: 2278 1323 Image authentication and tamper detection uing fragile watermarking
More informationDAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications
DAROS: Ditributed Uer-Server Aignment And Replication For Online Social Networking Application Thuan Duong-Ba School of EECS Oregon State Univerity Corvalli, OR 97330, USA Email: duongba@eec.oregontate.edu
More informationCutting Stock by Iterated Matching. Andreas Fritsch, Oliver Vornberger. University of Osnabruck. D Osnabruck.
Cutting Stock by Iterated Matching Andrea Fritch, Oliver Vornberger Univerity of Onabruck Dept of Math/Computer Science D-4909 Onabruck andy@informatikuni-onabrueckde Abtract The combinatorial optimization
More informationDrawing Lines in 2 Dimensions
Drawing Line in 2 Dimenion Drawing a traight line (or an arc) between two end point when one i limited to dicrete pixel require a bit of thought. Conider the following line uperimpoed on a 2 dimenional
More informationAn Intro to LP and the Simplex Algorithm. Primal Simplex
An Intro to LP and the Simplex Algorithm Primal Simplex Linear programming i contrained minimization of a linear objective over a olution pace defined by linear contraint: min cx Ax b l x u A i an m n
More informationA Linear Interpolation-Based Algorithm for Path Planning and Replanning on Girds *
Advance in Linear Algebra & Matrix Theory, 2012, 2, 20-24 http://dx.doi.org/10.4236/alamt.2012.22003 Publihed Online June 2012 (http://www.scirp.org/journal/alamt) A Linear Interpolation-Baed Algorithm
More informationAalborg Universitet. Published in: Proceedings of the Working Conference on Advanced Visual Interfaces
Aalborg Univeritet Software-Baed Adjutment of Mobile Autotereocopic Graphic Uing Static Parallax Barrier Paprocki, Martin Marko; Krog, Kim Srirat; Kritofferen, Morten Bak; Krau, Martin Publihed in: Proceeding
More informationSimulation of Rover Locomotion on Sandy Terrain - Modeling, Verification and Validation
Simulation of Rover Locomotion on Sandy Terrain - Modeling, Verification and Validation Rainer Krenn, Gerd Hirzinger German Aeropace Center, DLR, Intitute of Robotic and Mechatronic Oberpfaffenhofen, D-82234
More informationMotion Control (wheeled robots)
3 Motion Control (wheeled robot) Requirement for Motion Control Kinematic / dynamic model of the robot Model of the interaction between the wheel and the ground Definition of required motion -> peed control,
More informationKey Terms - MinMin, MaxMin, Sufferage, Task Scheduling, Standard Deviation, Load Balancing.
Volume 3, Iue 11, November 2013 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Tak Aignment in
More informationEdits in Xylia Validity Preserving Editing of XML Documents
dit in Xylia Validity Preerving diting of XML Document Pouria Shaker, Theodore S. Norvell, and Denni K. Peter Faculty of ngineering and Applied Science, Memorial Univerity of Newfoundland, St. John, NFLD,
More informationISSN: (Online) Volume 3, Issue 4, April 2015 International Journal of Advance Research in Computer Science and Management Studies
ISSN: 2321-7782 (Online) Volume 3, Iue 4, April 2015 International Journal Advance Reearch in Computer Science and Management Studie Reearch Article / Survey Paper / Cae Study Available online at: www.ijarcm.com
More informationFocused Video Estimation from Defocused Video Sequences
Focued Video Etimation from Defocued Video Sequence Junlan Yang a, Dan Schonfeld a and Magdi Mohamed b a Multimedia Communication Lab, ECE Dept., Univerity of Illinoi, Chicago, IL b Phyical Realization
More informationCompressed Sensing Image Processing Based on Stagewise Orthogonal Matching Pursuit
Senor & randucer, Vol. 8, Iue 0, October 204, pp. 34-40 Senor & randucer 204 by IFSA Publihing, S. L. http://www.enorportal.com Compreed Sening Image Proceing Baed on Stagewie Orthogonal Matching Puruit
More informationSLA Adaptation for Service Overlay Networks
SLA Adaptation for Service Overlay Network Con Tran 1, Zbigniew Dziong 1, and Michal Pióro 2 1 Department of Electrical Engineering, École de Technologie Supérieure, Univerity of Quebec, Montréal, Canada
More informationHow to Select Measurement Points in Access Point Localization
Proceeding of the International MultiConference of Engineer and Computer Scientit 205 Vol II, IMECS 205, March 8-20, 205, Hong Kong How to Select Meaurement Point in Acce Point Localization Xiaoling Yang,
More informationANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION
ANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION A. Váque-Nava * Ecuela de Ingeniería. CENTRO UNIVERSITARIO MEXICO. DIVISION DE ESTUDIOS SUPERIORES J. Figueroa
More informationA Practical Model for Minimizing Waiting Time in a Transit Network
A Practical Model for Minimizing Waiting Time in a Tranit Network Leila Dianat, MASc, Department of Civil Engineering, Sharif Univerity of Technology, Tehran, Iran Youef Shafahi, Ph.D. Aociate Profeor,
More informationQuadratic Optimal Control of Wireless Sensor Network Deployment
1 Quadratic Optimal Control of Wirele Senor Network Deployment Ratko R. Selmic 1, Jinko Kanno, Jack Buchart 1, and Nichola Richardon 3 1 Department of Electrical Engineering, Department of Mathematic 3
More informationAN ALGORITHM FOR RESTRICTED NORMAL FORM TO SOLVE DUAL TYPE NON-CANONICAL LINEAR FRACTIONAL PROGRAMMING PROBLEM
RAC Univerity Journal, Vol IV, No, 7, pp 87-9 AN ALGORITHM FOR RESTRICTED NORMAL FORM TO SOLVE DUAL TYPE NON-CANONICAL LINEAR FRACTIONAL PROGRAMMING PROLEM Mozzem Hoain Department of Mathematic Ghior Govt
More informationModeling of underwater vehicle s dynamics
Proceeding of the 11th WEA International Conference on YTEM, Agio Nikolao, Crete Iland, Greece, July 23-25, 2007 44 Modeling of underwater vehicle dynamic ANDRZEJ ZAK Department of Radiolocation and Hydrolocation
More informationA User-Attention Based Focus Detection Framework and Its Applications
A Uer-Attention Baed Focu Detection Framework and It Application Chia-Chiang Ho, Wen-Huang Cheng, Ting-Jian Pan, Ja-Ling Wu Communication and Multimedia Laboratory, Department of Computer Science and Information
More informationConnected Placement of Disaster Shelters in Modern Cities
Connected Placement of Diater Shelter in Modern Citie Huanyang Zheng and Jie Wu Department of Computer and Information Science Temple Univerity, USA {huanyang.zheng, jiewu}@temple.edu ABSTRACT Thi paper
More informationRouting Definition 4.1
4 Routing So far, we have only looked at network without dealing with the iue of how to end information in them from one node to another The problem of ending information in a network i known a routing
More informationQuadrilaterals. Learning Objectives. Pre-Activity
Section 3.4 Pre-Activity Preparation Quadrilateral Intereting geometric hape and pattern are all around u when we tart looking for them. Examine a row of fencing or the tiling deign at the wimming pool.
More informationSee chapter 8 in the textbook. Dr Muhammad Al Salamah, Industrial Engineering, KFUPM
Goal programming Objective of the topic: Indentify indutrial baed ituation where two or more objective function are required. Write a multi objective function model dla a goal LP Ue weighting um and preemptive
More informationLocalized Minimum Spanning Tree Based Multicast Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Sensor Networks
Localized Minimum Spanning Tree Baed Multicat Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Senor Network Hanne Frey Univerity of Paderborn D-3398 Paderborn hanne.frey@uni-paderborn.de
More informationA note on degenerate and spectrally degenerate graphs
A note on degenerate and pectrally degenerate graph Noga Alon Abtract A graph G i called pectrally d-degenerate if the larget eigenvalue of each ubgraph of it with maximum degree D i at mot dd. We prove
More informationOperational Semantics Class notes for a lecture given by Mooly Sagiv Tel Aviv University 24/5/2007 By Roy Ganor and Uri Juhasz
Operational emantic Page Operational emantic Cla note for a lecture given by Mooly agiv Tel Aviv Univerity 4/5/7 By Roy Ganor and Uri Juhaz Reference emantic with Application, H. Nielon and F. Nielon,
More informationA PROBABILISTIC NOTION OF CAMERA GEOMETRY: CALIBRATED VS. UNCALIBRATED
A PROBABILISTIC NOTION OF CAMERA GEOMETRY: CALIBRATED VS. UNCALIBRATED Jutin Domke and Yianni Aloimono Computational Viion Laboratory, Center for Automation Reearch Univerity of Maryland College Park,
More informationHassan Ghaziri AUB, OSB Beirut, Lebanon Key words Competitive self-organizing maps, Meta-heuristics, Vehicle routing problem,
COMPETITIVE PROBABIISTIC SEF-ORGANIZING MAPS FOR ROUTING PROBEMS Haan Ghaziri AUB, OSB Beirut, ebanon ghaziri@aub.edu.lb Abtract In thi paper, we have applied the concept of the elf-organizing map (SOM)
More informationMarkov Random Fields in Image Segmentation
Preented at SSIP 2011, Szeged, Hungary Markov Random Field in Image Segmentation Zoltan Kato Image Proceing & Computer Graphic Dept. Univerity of Szeged Hungary Zoltan Kato: Markov Random Field in Image
More informationMulti-Target Tracking In Clutter
Multi-Target Tracking In Clutter John N. Sander-Reed, Mary Jo Duncan, W.B. Boucher, W. Michael Dimmler, Shawn O Keefe ABSTRACT A high frame rate (0 Hz), multi-target, video tracker ha been developed and
More informationMid-term review ECE 161C Electrical and Computer Engineering University of California San Diego
Mid-term review ECE 161C Electrical and Computer Engineering Univerity of California San Diego Nuno Vaconcelo Spring 2014 1. We have een in cla that one popular technique for edge detection i the Canny
More informationStochastic Search and Graph Techniques for MCM Path Planning Christine D. Piatko, Christopher P. Diehl, Paul McNamee, Cheryl Resch and I-Jeng Wang
Stochatic Search and Graph Technique for MCM Path Planning Chritine D. Piatko, Chritopher P. Diehl, Paul McNamee, Cheryl Rech and I-Jeng Wang The John Hopkin Univerity Applied Phyic Laboratory, Laurel,
More informationOptimal Multi-Robot Path Planning on Graphs: Complete Algorithms and Effective Heuristics
Optimal Multi-Robot Path Planning on Graph: Complete Algorithm and Effective Heuritic Jingjin Yu Steven M. LaValle Abtract arxiv:507.0390v [c.ro] Jul 05 We tudy the problem of optimal multi-robot path
More informationLecture 14: Minimum Spanning Tree I
COMPSCI 0: Deign and Analyi of Algorithm October 4, 07 Lecture 4: Minimum Spanning Tree I Lecturer: Rong Ge Scribe: Fred Zhang Overview Thi lecture we finih our dicuion of the hortet path problem and introduce
More informationmapping reult. Our experiment have revealed that for many popular tream application, uch a networking and multimedia application, the number of VC nee
Reolving Deadlock for Pipelined Stream Application on Network-on-Chip Xiaohang Wang 1,2, Peng Liu 1 1 Department of Information Science and Electronic Engineering, Zheiang Univerity Hangzhou, Zheiang,
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
Thi article appeared in a journal publihed by Elevier. The attached copy i furnihed to the author for internal non-commercial reearch and education ue, including for intruction at the author intitution
More information/06/$ IEEE 364
006 IEEE International ympoium on ignal Proceing and Information Technology oie Variance Etimation In ignal Proceing David Makovoz IPAC, California Intitute of Technology, MC-0, Paadena, CA, 95 davidm@ipac.caltech.edu;
More informationKS3 Maths Assessment Objectives
KS3 Math Aement Objective Tranition Stage 9 Ratio & Proportion Probabilit y & Statitic Appreciate the infinite nature of the et of integer, real and rational number Can interpret fraction and percentage
More informationInterface Tracking in Eulerian and MMALE Calculations
Interface Tracking in Eulerian and MMALE Calculation Gabi Luttwak Rafael P.O.Box 2250, Haifa 31021,Irael Interface Tracking in Eulerian and MMALE Calculation 3D Volume of Fluid (VOF) baed recontruction
More informationIMPLEMENTATION OF CHORD LENGTH SAMPLING FOR TRANSPORT THROUGH A BINARY STOCHASTIC MIXTURE
Nuclear Mathematical and Computational Science: A Century in Review, A Century Anew Gatlinburg, Tenneee, April 6-, 003, on CD-ROM, American Nuclear Society, LaGrange Park, IL (003) IMPLEMENTATION OF CHORD
More informationOrienting Micro-Scale Parts with Squeeze and Roll Primitives
Orienting Micro-Scale Part with Squeeze and Roll Primitive Mark Moll Michael A. Erdmann Ron Fearing Ken Goldberg mmoll@c.cmu.edu me@c.cmu.edu ronf@eec.berkeley.edu goldberg@ieor.berkeley.edu Department
More informationKinematics Programming for Cooperating Robotic Systems
Kinematic Programming for Cooperating Robotic Sytem Critiane P. Tonetto, Carlo R. Rocha, Henrique Sima, Altamir Dia Federal Univerity of Santa Catarina, Mechanical Engineering Department, P.O. Box 476,
More informationTAM 212 Worksheet 3. Solutions
Name: Group member: TAM 212 Workheet 3 Solution The workheet i concerned with the deign of the loop-the-loop for a roller coater ytem. Old loop deign: The firt generation of loop wa circular, a hown below.
More informationA New Approach to Pipeline FFT Processor
A ew Approach to Pipeline FFT Proceor Shouheng He and Mat Torkelon Department of Applied Electronic, Lund Univerity S- Lund, SWEDE email: he@tde.lth.e; torkel@tde.lth.e Abtract A new VLSI architecture
More informationModeling and Analysis of Slow CW Decrease for IEEE WLAN
Modeling and Analyi of Slow CW Decreae for IEEE 82. WLAN Qiang Ni, Imad Aad 2, Chadi Barakat, and Thierry Turletti Planete Group 2 Planete Group INRIA Sophia Antipoli INRIA Rhône-Alpe Sophia Antipoli,
More informationComputer Arithmetic Homework Solutions. 1 An adder for graphics. 2 Partitioned adder. 3 HDL implementation of a partitioned adder
Computer Arithmetic Homework 3 2016 2017 Solution 1 An adder for graphic In a normal ripple carry addition of two poitive number, the carry i the ignal for a reult exceeding the maximum. We ue thi ignal
More informationDelaunay Triangulation: Incremental Construction
Chapter 6 Delaunay Triangulation: Incremental Contruction In the lat lecture, we have learned about the Lawon ip algorithm that compute a Delaunay triangulation of a given n-point et P R 2 with O(n 2 )
More informationComputing C-space Entropy for View Planning
Computing C-pace Entropy for View Planning for a Generic Range Senor Model Pengpeng Wang (pwangf@c.fu.ca) Kamal Gupta (kamal@c.fu.ca) Robotic Lab School of Engineering Science Simon Fraer Univerity Burnaby,
More information3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES
MAKARA, TEKNOLOGI, VOL. 9, NO., APRIL 5: 3-35 3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES Mochammad Zulianyah Informatic Engineering, Faculty of Engineering, ARS International Univerity,
More informationImage Morphing Using Deformation Techniques
Image Morphing Uing Deformation Technique Seung-Yong Lee, Kyung-Yong Chwa, Jame Hahn, and Sung Yong Shin Department of Computer Science Korea Advanced Intitute of Science and Technology 373-1 Kuong-dong
More informationTAM 212 Worksheet 3. The worksheet is concerned with the design of the loop-the-loop for a roller coaster system.
Name: Group member: TAM 212 Workheet 3 The workheet i concerned with the deign of the loop-the-loop for a roller coater ytem. Old loop deign: The firt generation of loop wa circular, a hown below. R New
More informationREVERSE KINEMATIC ANALYSIS OF THE SPATIAL SIX AXIS ROBOTIC MANIPULATOR WITH CONSECUTIVE JOINT AXES PARALLEL
Proceeding of the ASME 007 International Deign Engineering Technical Conference & Computer and Information in Engineering Conference IDETC/CIE 007 September 4-7, 007 La Vega, Nevada, USA DETC007-34433
More informationKeywords: Defect detection, linear phased array transducer, parameter optimization, phased array ultrasonic B-mode imaging testing.
Send Order for Reprint to reprint@benthamcience.ae 488 The Open Automation and Control Sytem Journal, 2014, 6, 488-492 Open Acce Parameter Optimization of Linear Phaed Array Tranducer for Defect Detection
More informationNearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks
Nearly Contant Approximation for Data Aggregation Scheduling in Wirele Senor Network Scott C.-H. Huang, Peng-Jun Wan, Chinh T. Vu, Yinghu Li and France Yao Computer Science Department, City Univerity of
More informationA Hybrid Deployable Dynamic Traffic Assignment Framework for Robust Online Route Guidance
A Hybrid Deployable Dynamic Traffic Aignment Framework for Robut Online Route Guidance Sriniva Peeta School of Civil Engineering, Purdue Univerity Chao Zhou Sabre, Inc. Sriniva Peeta School of Civil Engineering
More informationarxiv: v1 [cs.ms] 20 Dec 2017
CameraTranform: a Scientific Python Package for Perpective Camera Correction Richard Gerum, Sebatian Richter, Alexander Winterl, Ben Fabry, and Daniel Zitterbart,2 arxiv:72.07438v [c.ms] 20 Dec 207 Department
More informationKINEMATIC BENDING OF FIXED-HEAD PILES IN NON- HOMOGENEOUS SOIL
KINEMATIC BENDING OF FIXED-HEAD PILES IN NON- HOMOGENEOUS SOIL Raffaele Di Laora Univerity of Napoli Parthenope raffaele.dilaora@uniparthenope.it Emmanouil Rovithi Intitute of Engineering Seimology and
More informationEVen though remarkable progress has been made in
JOURNAL OF L A T E X CLASS FILES, VOL. 14, NO. 8, AUGUST 2015 1 Dene Semantic 3D Recontruction Chritian Häne, Chritopher Zach, Andrea Cohen, and Marc Pollefey, Fellow, IEEE Abtract Both image egmentation
More informationStress-Blended Eddy Simulation (SBES) - A new Paradigm in hybrid RANS-LES Modeling
Stre-Blended Eddy Simulation (SBES) - A new Paradigm in hybrid RANS-LES Modeling Menter F.R. ANSYS Germany GmbH Introduction It i oberved in many CFD imulation that RANS model how inherent technology limitation
More informationCross-Layer Interactions in Multihop Wireless Sensor Networks: A Constrained Queueing Model
Cro-Layer Interaction in Multihop Wirele Senor Network: A Contrained Queueing Model YANG SONG Univerity of Florida and YUGUANG FANG Univerity of Florida Xidian Univerity In thi article, we propoe a contrained
More informationFPGA Implementation of Closed Loop Control of Pan Tilt Mechanism
IJCTA, 9(39), 206, pp. 295-302 International Science Pre Cloed Loop Control of Soft Switched Forward Converter Uing Intelligent Controller 295 FPGA Implementation of Cloed Loop Control of Pan Tilt Mechanim
More informationelse end while End References
621-630. [RM89] [SK76] Roenfeld, A. and Melter, R. A., Digital geometry, The Mathematical Intelligencer, vol. 11, No. 3, 1989, pp. 69-72. Sklanky, J. and Kibler, D. F., A theory of nonuniformly digitized
More informationarxiv: v3 [cs.cg] 1 Oct 2018
Improved Time-Space Trade-off for Computing Voronoi Diagram Bahareh Banyaady Matia Korman Wolfgang Mulzer André van Renen Marcel Roeloffzen Paul Seiferth Yannik Stein arxiv:1708.00814v3 [c.cg] 1 Oct 2018
More informationShortest Path Routing in Arbitrary Networks
Journal of Algorithm, Vol 31(1), 1999 Shortet Path Routing in Arbitrary Network Friedhelm Meyer auf der Heide and Berthold Vöcking Department of Mathematic and Computer Science and Heinz Nixdorf Intitute,
More informationJoint Congestion Control and Media Access Control Design for Ad Hoc Wireless Networks
Joint Congetion Control and Media Acce Control Deign for Ad Hoc Wirele Network Lijun Chen, Steven H. Low and John C. Doyle Engineering & Applied Science Diviion, California Intitute of Technology Paadena,
More informationKeywords Cloud Computing, Service Level Agreements (SLA), CloudSim, Monitoring & Controlling SLA Agent, JADE
Volume 5, Iue 8, Augut 2015 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Verification of Agent
More informationChapter 13 Non Sampling Errors
Chapter 13 Non Sampling Error It i a general aumption in the ampling theory that the true value of each unit in the population can be obtained and tabulated without any error. In practice, thi aumption
More informationVariable Resolution Discretization in the Joint Space
Variable Reolution Dicretization in the Joint Space Chritopher K. Monon, David Wingate, and Kevin D. Seppi {c,wingated,keppi}@c.byu.edu Computer Science, Brigham Young Univerity Todd S. Peteron peterto@uvc.edu
More informationManeuverable Relays to Improve Energy Efficiency in Sensor Networks
Maneuverable Relay to Improve Energy Efficiency in Senor Network Stephan Eidenbenz, Luka Kroc, Jame P. Smith CCS-5, MS M997; Lo Alamo National Laboratory; Lo Alamo, NM 87545. Email: {eidenben, kroc, jpmith}@lanl.gov
More informationCourse Updates. Reminders: 1) Assignment #13 due Monday. 2) Mirrors & Lenses. 3) Review for Final: Wednesday, May 5th
Coure Update http://www.phy.hawaii.edu/~varner/phys272-spr0/phyic272.html Reminder: ) Aignment #3 due Monday 2) Mirror & Lene 3) Review for Final: Wedneday, May 5th h R- R θ θ -R h Spherical Mirror Infinite
More informationA Study of a Variable Compression Ratio and Displacement Mechanism Using Design of Experiments Methodology
A Study of a Variable Compreion Ratio and Diplacement Mechanim Uing Deign of Experiment Methodology Shugang Jiang, Michael H. Smith, Maanobu Takekohi Abtract Due to the ever increaing requirement for engine
More informationLinkGuide: Towards a Better Collection of Hyperlinks in a Website Homepage
Proceeding of the World Congre on Engineering 2007 Vol I LinkGuide: Toward a Better Collection of Hyperlink in a Webite Homepage A. Ammari and V. Zharkova chool of Informatic, Univerity of Bradford anammari@bradford.ac.uk,
More informationAn efficient resource allocation algorithm for OFDMA cooperative relay networks with fairness and QoS guaranteed
Univerity of Wollongong Reearch Online Faculty of Informatic - Paper (Archive) Faculty of Engineering and Information Science 200 An efficient reource allocation algorithm for OFDMA cooperative relay network
More informationAn Active Stereo Vision System Based on Neural Pathways of Human Binocular Motor System
Journal of Bionic Engineering 4 (2007) 185 192 An Active Stereo Viion Sytem Baed on Neural Pathway of Human Binocular Motor Sytem Yu-zhang Gu 1, Makoto Sato 2, Xiao-lin Zhang 2 1. Department of Advanced
More informationA Fast Association Rule Algorithm Based On Bitmap and Granular Computing
A Fat Aociation Rule Algorithm Baed On Bitmap and Granular Computing T.Y.Lin Xiaohua Hu Eric Louie Dept. of Computer Science College of Information Science IBM Almaden Reearch Center San Joe State Univerity
More informationES205 Analysis and Design of Engineering Systems: Lab 1: An Introductory Tutorial: Getting Started with SIMULINK
ES05 Analyi and Deign of Engineering Sytem: Lab : An Introductory Tutorial: Getting Started with SIMULINK What i SIMULINK? SIMULINK i a oftware package for modeling, imulating, and analyzing dynamic ytem.
More informationA Kinematic Calibration Method for Industrial Robots Using Autonomous Visual Measurement
A Kinematic Calibration Method for Indutrial obot Uing Autonomou Viual Meaurement A. Watanabe 1 (3), S. Sakakibara 1, K. Ban 1, M. Yamada 1, G. Shen 1 1 ANUC LD, Yamanahi, Japan Submitted by. Arai (1)
More informationA Novel Feature Line Segment Approach for Pattern Classification
12th International Conference on Information Fuion Seattle, WA, USA, July 6-9, 2009 A Novel Feature Line Segment Approach for Pattern Claification Yi Yang Intitute of Integrated Automation Xi an Jiaotong
More informationRepresentations and Transformations. Objectives
Repreentation and Tranformation Objective Derive homogeneou coordinate tranformation matrice Introduce tandard tranformation - Rotation - Tranlation - Scaling - Shear Scalar, Point, Vector Three baic element
More informationLandmark Selection and Greedy Landmark-Descent Routing for Sensor Networks
1 Landmark Selection and Greedy Landmark-Decent Routing for Senor Network An Nguyen Nikola Miloavljević Qing Fang Jie Gao Leonida J. Guiba Department of Computer Science, Stanford Univerity. {anguyen,nikolam,guiba}@c.tanford.edu
More informationAlgorithmic Discrete Mathematics 4. Exercise Sheet
Algorithmic Dicrete Mathematic. Exercie Sheet Department of Mathematic SS 0 PD Dr. Ulf Lorenz 0. and. May 0 Dipl.-Math. David Meffert Verion of May, 0 Groupwork Exercie G (Shortet path I) (a) Calculate
More information