Relative Positioning from Model Indexing

Size: px
Start display at page:

Download "Relative Positioning from Model Indexing"

Transcription

1 Reative Positioning from Mode Indexing Stefan Carsson Computationa Vision and Active Perception Laboratory (CVAP)* Roya Institute of Technoogy (KTH), Stockhom, Sweden Abstract We show how to determine the position of a camera reative to a mode of the environment using features extracted from one image. The method is based on view variation of cross-ratios and is independent of camera caibration. Mode Indexing From Images Recognition and pose estimation of objects in images is in genera based on extracting features such as points and ines from the image and finding corresponding features in mode objects. The combinatoria compexity of matching image descriptors to modes can be considerabe. A way to reduce this is to use index tabes where image descriptors are used as indexes to a tabe containing corresponding mode descriptors. These tabes can be constructed off-ine which means that space is traded off for time [] [] [] []. Another factor affecting the compexity of recognition is the fact that the image of an object, depends on the viewpoint of the camera. This has initiated work in finding feature descriptors invariant to viewpoint [] []. For configurations of points and ines invariants can in genera be found ony when they are contained in a panar surface. For genera configurations of points and ines, any descriptor computed from image data wi vary with viewpoint. [] [5]. Since camera viewpoint in D is parameterized by parameters, variation of image descriptors wi in genera be -dimensiona. It is however possibe to choose descriptors that have far ess dimensionaity of variation than. In the case when imaging is approximated by an affine mapping, it has been shown [] [] that it is possibe to compute image descriptors from points that exhibit ony -dimensiona variation of viewpoint. For a specific configuration of points, the -D image descriptor wi be contained in a -D surface. In this work we wi consider the more genera case of imaging by perspective mapping. Since one of the main appications we have in mind is moving patform navigation, perspective effects can be substantia. In projective and perspective transformations the cross ratio is a fundamenta invariant of point and ine sets. We wi show that for points in an image, cross ratios can be computed. These cross ratios wi exhibit -dimensiona variation with viewpoint. This is a very simpe resut due to the fact that the cross ratios are invariant to rotations of the camera around the point of projection. The variation is therefore due entirey to camera transation. In the imit of arge reative viewing distances the image mapping wi become parae and the dependence of image data on camera position *Adcress: NADA, KTH, S- Stockhom, Sweden Emai: stefanc@bion.kth.se BMVC doi:.5/c..

2 wi reduce to that of the direction to the camera described by parameters, The cross ratios wi therefore asymptoticay be contained in a -D surface. An interesting aspect of using cross ratios for indexing is the fact that they are independent of camera caibration. This is assuming that the imaging is inear. Cross ratios wi be reated to camera position in a non inear way. When imagemode feature correspondence has been estabished, this reation can be inverted and the camera position reative to the mode can be found in a caibration independent way. Due to the compexity of non inear inversion this is impemented as a tabe ookup where cross ratios are used to index directy into a tabe of camera positions. In an appication we wi consider the probem of finding the position of a camera reative to a mode of the environment. By considering camera motion restricted to a panar ground, the variation of cross ratios on viewpoint wi be - dimensiona even in the perspective mapping case, and -dimensiona in the affine imit. By using ony the horizonta coordinates of vertica edge segments, cross ratios can be computed from points. This fact has previousy been expoited for navigation. [] In our case, we can use cross ratios computed from points as entries to the index tabe. This wi reduce the compexity of the index tabes consideraby. View Variation of Cross Ratios Since a genera viewpoint in R has degrees of freedom, the In image coordinates of a set of n points wi be confined to fi-dimensiona surface in R n. Having a -parameter variation is definitey too arge to be manageabe for recognition and pose estimation using indexing. We therefore consider the cross ratio of a group of 5 points arbitrariy paced in R. A cross-ratio of a set of 5 points in R with image coordinates (xi, j/i)... (xx,, j/s) can be defined as: / yi / / ys /5 y / y «/ ys y5 If a points are copanar in R a change of viewpoint wi correspond to a projective transform of the image coordinates. The projective transform is inear in the homogeneous coordinates (a:,-, j/,-, ) and the cross ratio wi therefore be invariant. If the points are not a copanar, a change of viewpoint wi no onger correspond to a projective transformation. The cross ratio wi therefore vary with the viewpoint. The image coordinates are reated to the position of a point in a camera centered coordinate system as: () x,- = Z? Y () The coordinates of the points in a word centered reference frame are denoted as (X\,Y\,Z\)... (XSJYS, Z5) and the coordinates of the projection point of the camera is (X C,Y C,Z C ) This point is taken as the origin of the camera centered

3 system. The coordinates in the camera centered system are reated to those of the word centered system by a inear transformation: ^ () This transformation can be factored into camera rotation R and projection matrix P The projection matrix contains scae parameters for image coordinates and other parameters that can in principe be obtained by caibration. By using cross ratios as image descriptors however, both the rotation and projection matrix wi cance out and there wi be no need for camera caibration. Using eq. and in the expression for the cross ratio we get: () a = X\ X c X X c X$ X c Yi Y - Y c n - Y c Z\ Z c Z Z c Zx, Z c X\ X c X X c X5 X c Y x Y - Y c y 5 - Y c Z\ Z c Z Z c Zz Z c X X c X X c X5 X c Y y - Y c Y 5 - Y c Z Z c Z^ Zc Z5 Z c X X c X X c X5 X c Y - y c y - Y C y 5 - Y C Z Z c Z^ Z c Z$ Z c where the factors /Zf and determinant of the inear transformation matrix Pi? are canceed out. We see that the cross ratio computed from the image coordinates of 5 points in genera position in R is the ratio of two poynomias in the camera coordinates (X C,Y C, Z c ) and totay independent of camera rotation. The set of cross ratios <i... <Tjt computed from a set of points are therefore in genera contained in a -dimensiona surface in fc-space. This -dimensiona surface is a characteristic of the point set, independent of viewpoint. Using cross ratios we have therefore reduced the parametric variation on viewpoint from to. In the imit of parae projection this variation is reduced even further, from to. The determinants in eq. 5 can be expanded as: (5) X\ X c X X c Y Y - Y c Z\ Z c Z Z c Yh - Yc /S5 ZJC X\ X Vi Y Z\ Z X c X c Yx y Y c Z\ x Y c x 5 Y c z z 5 V V V Y V V Z c Z c Z c etc. A determinants in eq. 5 can therefore be expressed in Xc,Y c,zc as:... = A n X c + B n Y c + C n Z c + D n n=... () and the cross ratio: _ (A t X c + BjY e + C X Z C + A)(^ X C + g y c + C Z C + >a) (A X C + B Y C + C Z C + D ){A A X C + B Y C + C Z C + D A ) ()

4 8 If wefix the coordinates of the points in the word centered system and introduce spherica coordinates for the camera position (X C,Y C, Z c ), we get: X c = r Y c = Z c = r f z (,<f>) (8) Inserting this into eq. and taking the imit of arge observation distance r we get: r-&* = (*/!(»;*) C f z {,<j>)) The variation of the cross ratio with viewpoint is therefore reduced to variation with respect to the two parameters and <f>, i.e. the anguar position of the camera reative to the word reference frame. This resut shoud be compared with that of [] where it is shown that assuming para perspective projection, it is possibe to choose image descriptors from points that wi have -dimensiona variation with viewpoint. The price for generaizing to perspective projection is that we need points instead of. Feature Indexing and Pose Estimation for a Camera on Panar Ground. Construction of Index Tabes and Feature Matching The cross ratios computed from image data can be used as indexes to a tabe containing mode features. In order to be efficient these tabes must not be too arge. The tabes are quantized versions of the index space with each axis representing an index feature. A critica factor is of course the dimensionaity of the tabe. For points in genera position in R and perspective projection we woud in genera need a -D index space with each axis representing a cross ratio. Various point configurations wi be represented as -D surfaces in this -D index space. In the imit when parae projection is vaid we can consider -D surfaces in the -D index space. The dimensionaity of the index space can aso be reduced by restricting the camera positions. This wi be the case e.g. when a camera is constrained to move on a panar surface. Our probem is to find the position reative to a mode of the environment, of a camera moving on a panar ground foor. In this case perspective effects cannot in genera be negected, since the extent of the object, in this case the spatia environment, wi be of the same order of magnitude as the distance to the object features. The fact that we are moving on a panar ground foor means however that ony two position parameters X C,Y C need to be considered. Features groups in the form of cross ratios can therefore be represented as a -D surface and the dimensionaity of the index space can be taken to be. As features we wi consider horizonta coordinates V{ of vertica ines in the image. Cross ratios can then be computed from groups of coordinates xi... x and from eq. 5 we see that they wi vary with camera position as: X x x x X x X A Vi *i Vi -y e -n x Y x Y x Y x Y x n XA Y

5 MO I ^ Jk > f> p \ - - Camera position ima e ^^ Came a position image I 5 cm D D Figure : Map of the mode environment with mode features. The area and samping grid for computing tripe cross ratio indexes is indicated and the two camera positions for testing position estimation are marked by the shaded circes The mode in our case is a ist of X, Y coordinates of features in the environment that coud give rise to vertica ines in the image. The environment is part of a room with a door opening into a corridoor. A map of the room with mode features is shown in fig The index space was constructed in the foowing way:. For X c, Y c camera positions chosen on a grid with cm spacing within the rectange in the map fig. and a combinations of features in the mode, ordered cockwise as seen from the camera position, cross ratios were computed by seection od sets of points.. The cross ratios were used as indexes to a -dimensiona index tabe. The tabe was divided into bins chosen as cubes with sides.. Whenever a cross ratio tripet indexed a bin of the tabe, the mode features ji... je together with the position X c, Y c were recorded in that bin. The indexing for feature matching works as foows:

6 . A combinations of horizonta coordinates of extracted vertica ines i'i...ie are used to compute cross ratio tripets.. The cross ratiotripets are used to index into the tabe. For each mode group of features ji...je found in the bin, an association tabe of image and mode features is incremented one step at positions (n, ji)...(i,j ). Position Estimation Pose estimation in the genera -D case invoves determining the parameters of rotation and transation describing camera position. This requires at east image points and their corresponding mode points. Methods have been presented based on seecting point tripets from image and mode and for each tripet pair compute a tentative pose. Correct tripet pairs wi then give custers in pose parameter space. [] Since this method is based on seecting groups of features from both image and mode the compexity wi in genera be higher than using indexing where seection is ony of features in the image. In the case where a priori information about possibe image mode matchings is avaiabe the compexity of this method can be reduced. Given matched image and mode features from indexing, pose estimation is in genera a non inear over determined probem provided more than features have been matched. With a caibrated camera both rotation and transation parameters of the camera can be obtained. In the case of no caibration information we can sti obtain camera position parameters X c, Y c, Z c by using the reation between cross ratios and camera position of eq. 5 From eq. we see that given cross ratios and mode coordinates, the position parameters are reated by a second order poynomia equation. Soving these equations is a non-trivia matter. In order to avoid compicated non-inear equation soving the index tabes were equipped with the information about position corresponding to each tripe cross ratio entry. Every tripet cross ratio therefore indexes a number of positions corresponding to those from which this tripet was computed from mode data. Using ony index tabe positions corresponding to correcty matched features the indexed positions can be accumuated in a matrix and arge vaues of this matrix shoud correspond to probabe camera positions. Note that, camera rotation is not obtained by this method but requires some form of caibration of the camera. Experimenta Resuts In order to test mode indexing and pose estimation the camera was paced in two different positions indicated in fig.. For each position vertica edge segments were extracted by a very simpe and robust procedure based on averaging image intensity in the vertica direction for each horizonta image coordinate. In order to cope with sight, variations from ideay vertica edges, the image was divided into horizonta stripes. In each stripe vertica edges were extracted independenty and subsequenty inked across stripes based on horizonta proximity. Figs. and show extracted edge segments and resuting number of associations between image and mode features using the indexing method described earier. The size of the number at position i,j of this tabe can be seen as a measure of support for the hypothesis that image feature i shoud be matched to

7 mode feature j. Finding the best association for each image feature wi in genera be combinatoriay very compex. By simpe threshoding severa hypothetica matches can be discarded at the outset however. From figs. and it can be seen that for most image features the correct mode feature dominates the row in the association tabe. Another factor reducing the compexity of finding associations is the fact that feature ordering from eft to right wi in genera be invariant over a positions. This imposes constraints on possibe pairwise matchings of image and mode features. The main factors determining the compexity of finding correct associations wi be the presence of cutter ines that are not modeed and the disappearance of modeed ines from the image. Work is presenty going on in testing the robustness of the method against extra cutter and disappearing mode features. Every cross ratio tripet associated with correcty matched features can be used to index the ook up tabe containing the position from which this tripet was computed. These positions are accumuated and figs. and 5 shows the argest accumuated positions obtained using correcty matched features together with correct camera positions. Note that the grid spacing is cm so the accuracy averaged argest accumuated positions is around - cm. From the spread of the accumuated positions we see that position uncertainty is argest in the direction to the features and substantiay ess in the orthogona direction. This effect is more pronounced in position. This can be expected since especiay in position the image mapping shoud be cose to parae and the features are concentrated in a rather sma anguar sector, which means that perspective wi be very sma, i.e. cross ratios wi not vary substantiay in the direction to the imaged features. References [] Y. Lamdan, J.T. Schwartz, and H. J. Wofson, Object recognition by affine invariant matching. In: Proc. CVPR-88, pp. 5-, (88) [] C.A. Rothwe, A.P. Zisserman, J.L. Mundy, D.A. Forsyth, Efficient Mode Library Access by Projectivey Invariant Indexing Functions, In: Proc. CVPR-, pp. -, () [] D.T. Cemens and D.W. Jacobs, Space and time bounds on indexing -D modes from -D images, IEEE Trans, on Pattern Anaysis and Machine Inteigence,, pp -. () [] D. Jacobs, Space efficient D mode indexing, IU-workshop pp. -5 () [5] J. B. Burns, R. S. Weiss and E.M. Riseman, View variation of point-set and ine-segment features, IEEE Trans, on Pattern Anaysis and Machine Inteigence, 5, pp 5-8, () [] K. Astrom, A Correspondence Probem in Laser Guided Navigation, Proc. Symposium on Image Anaysis, Uppsaa, Sweden,pp. -, - March () [] G. Stockman, Object recognition and ocaization via pose custering, CVGIP, -8, (8)

8 Vertica ines extracted: Image 5 8 IS <O> <> <5> <8> <> 8 5 <> <> <888> <> <> <85> <> < outside picture ii ode f eat u r e Figure : Number of associations between image feature (i) and mode feature (j) from indexing. Correct associations are marked with < >. Image feature which is a shadow edge and feature do not have any corresponding mode features.

9 Vertica ines extracted: Image : ) <> 8 8 <> <> <> 8 <EO> 8 8 <> 8 8 <> 5 <> <> 8 5 <E> outside picture M O de f e a t u r e - outside picture Figure : Number of associations between image feature (i) and mode feature (j) from indexing. Correct associations are marked with < >. Image features and and features and are the same edge spit into two. Feature is an extra edge not present in the mode.

10 I!!!!!! I I I I I I I I I I I I I I I I I I I I I I I I I I I I I cm I!... _ _ I I I I I *8 -I I I 8MMI 5 L:LI_^-_-_-_-_-_-_-_-_-_-_:_:_I^^^.;LL_-_-_J -c- >. 5 cm Figure : argest numbers accumuated positions from the index tabe representing reations between cross ratio tripets and x-y position. The grey circe is the correct camera position for image. * I II 8 I I I too 8 J cm I I 8 O ' II 8 -I I v L-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_H 5 cm Figure 5: argest numbers accumuated positions from the index tabe representing reations between cross ratio tripets and x-y position. The grey circe is the correct camera position for image.

Language Identification for Texts Written in Transliteration

Language Identification for Texts Written in Transliteration Language Identification for Texts Written in Transiteration Andrey Chepovskiy, Sergey Gusev, Margarita Kurbatova Higher Schoo of Economics, Data Anaysis and Artificia Inteigence Department, Pokrovskiy

More information

Lecture outline Graphics and Interaction Scan Converting Polygons and Lines. Inside or outside a polygon? Scan conversion.

Lecture outline Graphics and Interaction Scan Converting Polygons and Lines. Inside or outside a polygon? Scan conversion. Lecture outine 433-324 Graphics and Interaction Scan Converting Poygons and Lines Department of Computer Science and Software Engineering The Introduction Scan conversion Scan-ine agorithm Edge coherence

More information

A Memory Grouping Method for Sharing Memory BIST Logic

A Memory Grouping Method for Sharing Memory BIST Logic A Memory Grouping Method for Sharing Memory BIST Logic Masahide Miyazai, Tomoazu Yoneda, and Hideo Fuiwara Graduate Schoo of Information Science, Nara Institute of Science and Technoogy (NAIST), 8916-5

More information

A Petrel Plugin for Surface Modeling

A Petrel Plugin for Surface Modeling A Petre Pugin for Surface Modeing R. M. Hassanpour, S. H. Derakhshan and C. V. Deutsch Structure and thickness uncertainty are important components of any uncertainty study. The exact ocations of the geoogica

More information

Jacobian Range Space

Jacobian Range Space Kinematic Redundanc A manipuator ma have more DOFs than are necessar to contro a desired variabe What do ou do w/ the etra DOFs? However, even if the manipuator has enough DOFs, it ma sti be unabe to contro

More information

A New Supervised Clustering Algorithm Based on Min-Max Modular Network with Gaussian-Zero-Crossing Functions

A New Supervised Clustering Algorithm Based on Min-Max Modular Network with Gaussian-Zero-Crossing Functions 2006 Internationa Joint Conference on Neura Networks Sheraton Vancouver Wa Centre Hote, Vancouver, BC, Canada Juy 16-21, 2006 A New Supervised Custering Agorithm Based on Min-Max Moduar Network with Gaussian-Zero-Crossing

More information

Hiding secrete data in compressed images using histogram analysis

Hiding secrete data in compressed images using histogram analysis University of Woongong Research Onine University of Woongong in Dubai - Papers University of Woongong in Dubai 2 iding secrete data in compressed images using histogram anaysis Farhad Keissarian University

More information

Collinearity and Coplanarity Constraints for Structure from Motion

Collinearity and Coplanarity Constraints for Structure from Motion Coinearity and Copanarity Constraints for Structure from Motion Gang Liu 1, Reinhard Kette 2, and Bodo Rosenhahn 3 1 Institute of Information Sciences and Technoogy, Massey University, New Zeaand, Department

More information

Further Concepts in Geometry

Further Concepts in Geometry ppendix F Further oncepts in Geometry F. Exporing ongruence and Simiarity Identifying ongruent Figures Identifying Simiar Figures Reading and Using Definitions ongruent Trianges assifying Trianges Identifying

More information

TechTest2017. Solutions Key. Final Edit Copy. Merit Scholarship Examination in the Sciences and Mathematics given on 1 April 2017, and.

TechTest2017. Solutions Key. Final Edit Copy. Merit Scholarship Examination in the Sciences and Mathematics given on 1 April 2017, and. TechTest07 Merit Schoarship Examination in the Sciences and Mathematics given on Apri 07, and sponsored by The Sierra Economics and Science Foundation Soutions Key V9feb7 TechTest07 Soutions Key / 9 07

More information

Research of Classification based on Deep Neural Network

Research of  Classification based on Deep Neural Network 2018 Internationa Conference on Sensor Network and Computer Engineering (ICSNCE 2018) Research of Emai Cassification based on Deep Neura Network Wang Yawen Schoo of Computer Science and Engineering Xi

More information

(0,l) (0,0) (l,0) (l,l)

(0,l) (0,0) (l,0) (l,l) Parae Domain Decomposition and Load Baancing Using Space-Fiing Curves Srinivas Auru Fatih E. Sevigen Dept. of CS Schoo of EECS New Mexico State University Syracuse University Las Cruces, NM 88003-8001

More information

AN EVOLUTIONARY APPROACH TO OPTIMIZATION OF A LAYOUT CHART

AN EVOLUTIONARY APPROACH TO OPTIMIZATION OF A LAYOUT CHART 13 AN EVOLUTIONARY APPROACH TO OPTIMIZATION OF A LAYOUT CHART Eva Vona University of Ostrava, 30th dubna st. 22, Ostrava, Czech Repubic e-mai: Eva.Vona@osu.cz Abstract: This artice presents the use of

More information

Lecture Notes for Chapter 4 Part III. Introduction to Data Mining

Lecture Notes for Chapter 4 Part III. Introduction to Data Mining Data Mining Cassification: Basic Concepts, Decision Trees, and Mode Evauation Lecture Notes for Chapter 4 Part III Introduction to Data Mining by Tan, Steinbach, Kumar Adapted by Qiang Yang (2010) Tan,Steinbach,

More information

DETERMINING INTUITIONISTIC FUZZY DEGREE OF OVERLAPPING OF COMPUTATION AND COMMUNICATION IN PARALLEL APPLICATIONS USING GENERALIZED NETS

DETERMINING INTUITIONISTIC FUZZY DEGREE OF OVERLAPPING OF COMPUTATION AND COMMUNICATION IN PARALLEL APPLICATIONS USING GENERALIZED NETS DETERMINING INTUITIONISTIC FUZZY DEGREE OF OVERLAPPING OF COMPUTATION AND COMMUNICATION IN PARALLEL APPLICATIONS USING GENERALIZED NETS Pave Tchesmedjiev, Peter Vassiev Centre for Biomedica Engineering,

More information

Guardian 365 Pro App Guide. For more exciting new products please visit our website: Australia: OWNER S MANUAL

Guardian 365 Pro App Guide. For more exciting new products please visit our website: Australia:   OWNER S MANUAL Guardian 365 Pro App Guide For more exciting new products pease visit our website: Austraia: www.uniden.com.au OWNER S MANUAL Privacy Protection Notice As the device user or data controer, you might coect

More information

Further Optimization of the Decoding Method for Shortened Binary Cyclic Fire Code

Further Optimization of the Decoding Method for Shortened Binary Cyclic Fire Code Further Optimization of the Decoding Method for Shortened Binary Cycic Fire Code Ch. Nanda Kishore Heosoft (India) Private Limited 8-2-703, Road No-12 Banjara His, Hyderabad, INDIA Phone: +91-040-3378222

More information

Nearest Neighbor Learning

Nearest Neighbor Learning Nearest Neighbor Learning Cassify based on oca simiarity Ranges from simpe nearest neighbor to case-based and anaogica reasoning Use oca information near the current query instance to decide the cassification

More information

A Design Method for Optimal Truss Structures with Certain Redundancy Based on Combinatorial Rigidity Theory

A Design Method for Optimal Truss Structures with Certain Redundancy Based on Combinatorial Rigidity Theory 0 th Word Congress on Structura and Mutidiscipinary Optimization May 9 -, 03, Orando, Forida, USA A Design Method for Optima Truss Structures with Certain Redundancy Based on Combinatoria Rigidity Theory

More information

Pneumo-Mechanical Simulation of a 2 Dof Planar Manipulator

Pneumo-Mechanical Simulation of a 2 Dof Planar Manipulator Pneumo-Mechanica Simuation of a 2 Dof Panar Manipuator Hermes GIBERTI, Simone CINQUEMANI Mechanica Engineering Department, Poitecnico di Miano, Campus Bovisa Sud, via La Masa 34, 2156, Miano, Itay ABSTRACT

More information

As Michi Henning and Steve Vinoski showed 1, calling a remote

As Michi Henning and Steve Vinoski showed 1, calling a remote Reducing CORBA Ca Latency by Caching and Prefetching Bernd Brügge and Christoph Vismeier Technische Universität München Method ca atency is a major probem in approaches based on object-oriented middeware

More information

Joint disparity and motion eld estimation in. stereoscopic image sequences. Ioannis Patras, Nikos Alvertos and Georgios Tziritas y.

Joint disparity and motion eld estimation in. stereoscopic image sequences. Ioannis Patras, Nikos Alvertos and Georgios Tziritas y. FORTH-ICS / TR-157 December 1995 Joint disparity and motion ed estimation in stereoscopic image sequences Ioannis Patras, Nikos Avertos and Georgios Tziritas y Abstract This work aims at determining four

More information

INTRODUCTION TO THREE DIMENSIONAL GEOMETRY

INTRODUCTION TO THREE DIMENSIONAL GEOMETRY Introduction to Three Dimensiona Geometry 33 INTRODUCTION TO THREE DIMENSIONAL GEOMETRY You have read in your earier essons that given a point in a pane, it is possibe to find two numbers, caed its co-ordinates

More information

Stereo. CS 510 May 2 nd, 2014

Stereo. CS 510 May 2 nd, 2014 Stereo CS 510 May 2 nd, 2014 Where are we? We are done! (essentiay) We covered image matching Correation & Correation Fiters Fourier Anaysis PCA We covered feature-based matching Bag of Features approach

More information

Endoscopic Motion Compensation of High Speed Videoendoscopy

Endoscopic Motion Compensation of High Speed Videoendoscopy Endoscopic Motion Compensation of High Speed Videoendoscopy Bharath avuri Department of Computer Science and Engineering, University of South Caroina, Coumbia, SC - 901. ravuri@cse.sc.edu Abstract. High

More information

Outerjoins, Constraints, Triggers

Outerjoins, Constraints, Triggers Outerjoins, Constraints, Triggers Lecture #13 Autumn, 2001 Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 358 Outerjoin R S = R S with danging tupes padded with nus and incuded in

More information

index.pdf March 17,

index.pdf March 17, index.pdf March 17, 2013 1 ITI 1121. Introduction to omputing II Marce Turcotte Schoo of Eectrica Engineering and omputer Science Linked List (Part 2) Tai pointer ouby inked ist ummy node Version of March

More information

Mobile App Recommendation: Maximize the Total App Downloads

Mobile App Recommendation: Maximize the Total App Downloads Mobie App Recommendation: Maximize the Tota App Downoads Zhuohua Chen Schoo of Economics and Management Tsinghua University chenzhh3.12@sem.tsinghua.edu.cn Yinghui (Catherine) Yang Graduate Schoo of Management

More information

file://j:\macmillancomputerpublishing\chapters\in073.html 3/22/01

file://j:\macmillancomputerpublishing\chapters\in073.html 3/22/01 Page 1 of 15 Chapter 9 Chapter 9: Deveoping the Logica Data Mode The information requirements and business rues provide the information to produce the entities, attributes, and reationships in ogica mode.

More information

Outline. Parallel Numerical Algorithms. Forward Substitution. Triangular Matrices. Solving Triangular Systems. Back Substitution. Parallel Algorithm

Outline. Parallel Numerical Algorithms. Forward Substitution. Triangular Matrices. Solving Triangular Systems. Back Substitution. Parallel Algorithm Outine Parae Numerica Agorithms Chapter 8 Prof. Michae T. Heath Department of Computer Science University of Iinois at Urbana-Champaign CS 554 / CSE 512 1 2 3 4 Trianguar Matrices Michae T. Heath Parae

More information

Stereo Matching with Energy Minimizing Snake Grid for 3D Face Modeling

Stereo Matching with Energy Minimizing Snake Grid for 3D Face Modeling Stereo Matching with Energy Minimizing Snake Grid for 3D Face Modeing Shafik Huq 1, Besma Abidi 1, Ardeshir Goshtasby 2, and Mongi Abidi 1 1 Imaging, Robotics, and Inteigent System (IRIS) Laboratory, Department

More information

Crossing Minimization Problems of Drawing Bipartite Graphs in Two Clusters

Crossing Minimization Problems of Drawing Bipartite Graphs in Two Clusters Crossing Minimiation Probems o Drawing Bipartite Graphs in Two Custers Lanbo Zheng, Le Song, and Peter Eades Nationa ICT Austraia, and Schoo o Inormation Technoogies, University o Sydney,Austraia Emai:

More information

Reference trajectory tracking for a multi-dof robot arm

Reference trajectory tracking for a multi-dof robot arm Archives of Contro Sciences Voume 5LXI, 5 No. 4, pages 53 57 Reference trajectory tracking for a muti-dof robot arm RÓBERT KRASŇANSKÝ, PETER VALACH, DÁVID SOÓS, JAVAD ZARBAKHSH This paper presents the

More information

A Comparison of a Second-Order versus a Fourth- Order Laplacian Operator in the Multigrid Algorithm

A Comparison of a Second-Order versus a Fourth- Order Laplacian Operator in the Multigrid Algorithm A Comparison of a Second-Order versus a Fourth- Order Lapacian Operator in the Mutigrid Agorithm Kaushik Datta (kdatta@cs.berkeey.edu Math Project May 9, 003 Abstract In this paper, the mutigrid agorithm

More information

Bridge Talk Release Notes for Meeting Exchange 5.0

Bridge Talk Release Notes for Meeting Exchange 5.0 Bridge Tak Reease Notes for Meeting Exchange 5.0 This document ists new product features, issues resoved since the previous reease, and current operationa issues. New Features This section provides a brief

More information

Elements of Computer Vision: Multiple View Geometry. 1 Introduction. 2 Elements of Geometry. Andrea Fusiello

Elements of Computer Vision: Multiple View Geometry. 1 Introduction. 2 Elements of Geometry. Andrea Fusiello Eements of Computer Vision: Mutipe View Geometry. Andrea Fusieo http://www.sci.univr.it/~fusieo June 20, 2005 Fig. 1. Exampe of reconstruction from the five images shown in the top row. 3 1 Introduction

More information

Automatic Hidden Web Database Classification

Automatic Hidden Web Database Classification Automatic idden Web atabase Cassification Zhiguo Gong, Jingbai Zhang, and Qian Liu Facuty of Science and Technoogy niversity of Macau Macao, PRC {fstzgg,ma46597,ma46620}@umac.mo Abstract. In this paper,

More information

On-Chip CNN Accelerator for Image Super-Resolution

On-Chip CNN Accelerator for Image Super-Resolution On-Chip CNN Acceerator for Image Super-Resoution Jung-Woo Chang and Suk-Ju Kang Dept. of Eectronic Engineering, Sogang University, Seou, South Korea {zwzang91, sjkang}@sogang.ac.kr ABSTRACT To impement

More information

Readme ORACLE HYPERION PROFITABILITY AND COST MANAGEMENT

Readme ORACLE HYPERION PROFITABILITY AND COST MANAGEMENT ORACLE HYPERION PROFITABILITY AND COST MANAGEMENT Reease 11.1.2.4.000 Readme CONTENTS IN BRIEF Purpose... 2 New Features in This Reease... 2 Instaation Information... 2 Supported Patforms... 2 Supported

More information

A Fast Block Matching Algorithm Based on the Winner-Update Strategy

A Fast Block Matching Algorithm Based on the Winner-Update Strategy In Proceedings of the Fourth Asian Conference on Computer Vision, Taipei, Taiwan, Jan. 000, Voume, pages 977 98 A Fast Bock Matching Agorithm Based on the Winner-Update Strategy Yong-Sheng Chenyz Yi-Ping

More information

Chapter Multidimensional Direct Search Method

Chapter Multidimensional Direct Search Method Chapter 09.03 Mutidimensiona Direct Search Method After reading this chapter, you shoud be abe to:. Understand the fundamentas of the mutidimensiona direct search methods. Understand how the coordinate

More information

Special Edition Using Microsoft Excel Selecting and Naming Cells and Ranges

Special Edition Using Microsoft Excel Selecting and Naming Cells and Ranges Specia Edition Using Microsoft Exce 2000 - Lesson 3 - Seecting and Naming Ces and.. Page 1 of 8 [Figures are not incuded in this sampe chapter] Specia Edition Using Microsoft Exce 2000-3 - Seecting and

More information

NCH Software Spin 3D Mesh Converter

NCH Software Spin 3D Mesh Converter NCH Software Spin 3D Mesh Converter This user guide has been created for use with Spin 3D Mesh Converter Version 1.xx NCH Software Technica Support If you have difficuties using Spin 3D Mesh Converter

More information

A METHOD FOR GRIDLESS ROUTING OF PRINTED CIRCUIT BOARDS. A. C. Finch, K. J. Mackenzie, G. J. Balsdon, G. Symonds

A METHOD FOR GRIDLESS ROUTING OF PRINTED CIRCUIT BOARDS. A. C. Finch, K. J. Mackenzie, G. J. Balsdon, G. Symonds A METHOD FOR GRIDLESS ROUTING OF PRINTED CIRCUIT BOARDS A C Finch K J Mackenzie G J Basdon G Symonds Raca-Redac Ltd Newtown Tewkesbury Gos Engand ABSTRACT The introduction of fine-ine technoogies to printed

More information

Dipartimento di Elettronica, Informazione e Bioingegneria Robotics

Dipartimento di Elettronica, Informazione e Bioingegneria Robotics Dipartimento di Eettronica, Informazione e Bioingegneria Robotics Basic mechanica definitions @ 015 1 - mechanics subsystem MECHANICS (arm, whees, ) subsystem PROCESS (task, environment) Mobiity degrees

More information

WATERMARKING GIS DATA FOR DIGITAL MAP COPYRIGHT PROTECTION

WATERMARKING GIS DATA FOR DIGITAL MAP COPYRIGHT PROTECTION WATERMARKING GIS DATA FOR DIGITAL MAP COPYRIGHT PROTECTION Shen Tao Chinese Academy of Surveying and Mapping, Beijing 100039, China shentao@casm.ac.cn Xu Dehe Institute of resources and environment, North

More information

M. Badent 1, E. Di Giacomo 2, G. Liotta 2

M. Badent 1, E. Di Giacomo 2, G. Liotta 2 DIEI Dipartimento di Ingegneria Eettronica e de informazione RT 005-06 Drawing Coored Graphs on Coored Points M. Badent 1, E. Di Giacomo 2, G. Liotta 2 1 University of Konstanz 2 Università di Perugia

More information

Optimization and Application of Support Vector Machine Based on SVM Algorithm Parameters

Optimization and Application of Support Vector Machine Based on SVM Algorithm Parameters Optimization and Appication of Support Vector Machine Based on SVM Agorithm Parameters YAN Hui-feng 1, WANG Wei-feng 1, LIU Jie 2 1 ChongQing University of Posts and Teecom 400065, China 2 Schoo Of Civi

More information

Arithmetic Coding. Prof. Ja-Ling Wu. Department of Computer Science and Information Engineering National Taiwan University

Arithmetic Coding. Prof. Ja-Ling Wu. Department of Computer Science and Information Engineering National Taiwan University Arithmetic Coding Prof. Ja-Ling Wu Department of Computer Science and Information Engineering Nationa Taiwan University F(X) Shannon-Fano-Eias Coding W..o.g. we can take X={,,,m}. Assume p()>0 for a. The

More information

Backing-up Fuzzy Control of a Truck-trailer Equipped with a Kingpin Sliding Mechanism

Backing-up Fuzzy Control of a Truck-trailer Equipped with a Kingpin Sliding Mechanism Backing-up Fuzzy Contro of a Truck-traier Equipped with a Kingpin Siding Mechanism G. Siamantas and S. Manesis Eectrica & Computer Engineering Dept., University of Patras, Patras, Greece gsiama@upatras.gr;stam.manesis@ece.upatras.gr

More information

Neural Network Enhancement of the Los Alamos Force Deployment Estimator

Neural Network Enhancement of the Los Alamos Force Deployment Estimator Missouri University of Science and Technoogy Schoars' Mine Eectrica and Computer Engineering Facuty Research & Creative Works Eectrica and Computer Engineering 1-1-1994 Neura Network Enhancement of the

More information

ACTIVE LEARNING ON WEIGHTED GRAPHS USING ADAPTIVE AND NON-ADAPTIVE APPROACHES. Eyal En Gad, Akshay Gadde, A. Salman Avestimehr and Antonio Ortega

ACTIVE LEARNING ON WEIGHTED GRAPHS USING ADAPTIVE AND NON-ADAPTIVE APPROACHES. Eyal En Gad, Akshay Gadde, A. Salman Avestimehr and Antonio Ortega ACTIVE LEARNING ON WEIGHTED GRAPHS USING ADAPTIVE AND NON-ADAPTIVE APPROACHES Eya En Gad, Akshay Gadde, A. Saman Avestimehr and Antonio Ortega Department of Eectrica Engineering University of Southern

More information

Complex Human Activity Searching in a Video Employing Negative Space Analysis

Complex Human Activity Searching in a Video Employing Negative Space Analysis Compex Human Activity Searching in a Video Empoying Negative Space Anaysis Shah Atiqur Rahman, Siu-Yeung Cho, M.K.H. Leung 3, Schoo of Computer Engineering, Nanyang Technoogica University, Singapore 639798

More information

JOINT IMAGE REGISTRATION AND EXAMPLE-BASED SUPER-RESOLUTION ALGORITHM

JOINT IMAGE REGISTRATION AND EXAMPLE-BASED SUPER-RESOLUTION ALGORITHM JOINT IMAGE REGISTRATION AND AMPLE-BASED SUPER-RESOLUTION ALGORITHM Hyo-Song Kim, Jeyong Shin, and Rae-Hong Park Department of Eectronic Engineering, Schoo of Engineering, Sogang University 35 Baekbeom-ro,

More information

arxiv: v1 [math.qa] 31 Aug 2018

arxiv: v1 [math.qa] 31 Aug 2018 arxiv:808.0575v [math.qa] 3 Aug 208 A new approach to the SL n spider Stephen Bigeow September 3, 208 Abstract The SL n spider gives adiagrammatic way toencode therepresentation category of the quantum

More information

Space-Time Trade-offs.

Space-Time Trade-offs. Space-Time Trade-offs. Chethan Kamath 03.07.2017 1 Motivation An important question in the study of computation is how to best use the registers in a CPU. In most cases, the amount of registers avaiabe

More information

Multi-Robot Pose Graph Localization and Data Association from Unknown Initial Relative Poses

Multi-Robot Pose Graph Localization and Data Association from Unknown Initial Relative Poses 1 Muti-Robot Pose Graph Locaization and Data Association from Unknown Initia Reative Poses Vadim Indeman, Erik Neson, Nathan Michae and Frank Deaert Institute of Robotics and Inteigent Machines (IRIM)

More information

Large-Scale Modeling of Parametric Surfaces using Spherical Harmonics

Large-Scale Modeling of Parametric Surfaces using Spherical Harmonics Large-Scae Modeing of Parametric Surfaces using Spherica Harmonics Li Shen Dept of Computer and Info Science University of Massachusetts Dartmouth N Dartmouth, MA 2747 shen@umassdedu Moo K Chung Department

More information

Multi-level Shape Recognition based on Wavelet-Transform. Modulus Maxima

Multi-level Shape Recognition based on Wavelet-Transform. Modulus Maxima uti-eve Shape Recognition based on Waveet-Transform oduus axima Faouzi Aaya Cheikh, Azhar Quddus and oncef Gabbouj Tampere University of Technoogy (TUT), Signa Processing aboratory, P.O. Box 553, FIN-33101

More information

Solving Large Double Digestion Problems for DNA Restriction Mapping by Using Branch-and-Bound Integer Linear Programming

Solving Large Double Digestion Problems for DNA Restriction Mapping by Using Branch-and-Bound Integer Linear Programming The First Internationa Symposium on Optimization and Systems Bioogy (OSB 07) Beijing, China, August 8 10, 2007 Copyright 2007 ORSC & APORC pp. 267 279 Soving Large Doube Digestion Probems for DNA Restriction

More information

Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, January 1997, pp. 777{ Partial Matching of Planar Polylines

Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, January 1997, pp. 777{ Partial Matching of Planar Polylines Eighth Annua ACM-SIAM Symposium on Discrete Agorithm January 997, pp. 777{786 Partia Matching of Panar Poyines Under Simiarity Transformations Scott D. Cohen Leonidas J. Guibas fscohen,guibasg@cs.stanford.edu

More information

Sample of a training manual for a software tool

Sample of a training manual for a software tool Sampe of a training manua for a software too We use FogBugz for tracking bugs discovered in RAPPID. I wrote this manua as a training too for instructing the programmers and engineers in the use of FogBugz.

More information

Infinity Connect Web App Customization Guide

Infinity Connect Web App Customization Guide Infinity Connect Web App Customization Guide Contents Introduction 1 Hosting the customized Web App 2 Customizing the appication 3 More information 8 Introduction The Infinity Connect Web App is incuded

More information

Sensitivity Analysis of Hopfield Neural Network in Classifying Natural RGB Color Space

Sensitivity Analysis of Hopfield Neural Network in Classifying Natural RGB Color Space Sensitivity Anaysis of Hopfied Neura Network in Cassifying Natura RGB Coor Space Department of Computer Science University of Sharjah UAE rsammouda@sharjah.ac.ae Abstract: - This paper presents a study

More information

Path-Based Protection for Surviving Double-Link Failures in Mesh-Restorable Optical Networks

Path-Based Protection for Surviving Double-Link Failures in Mesh-Restorable Optical Networks Path-Based Protection for Surviving Doube-Link Faiures in Mesh-Restorabe Optica Networks Wensheng He and Arun K. Somani Dependabe Computing and Networking Laboratory Department of Eectrica and Computer

More information

Supporting Top-k Join Queries in Relational Databases

Supporting Top-k Join Queries in Relational Databases Supporting Top-k Join Queries in Reationa Databases Ihab F. Iyas Waid G. Aref Ahmed K. Emagarmid Department of Computer Sciences, Purdue University West Lafayette IN 47907-1398 {iyas,aref,ake}@cs.purdue.edu

More information

Understanding the Mixing Patterns of Social Networks: The Impact of Cores, Link Directions, and Dynamics

Understanding the Mixing Patterns of Social Networks: The Impact of Cores, Link Directions, and Dynamics Understanding the Mixing Patterns of Socia Networks: The Impact of Cores, Link Directions, and Dynamics [Last revised on May 22, 2011] Abedeaziz Mohaisen Huy Tran Nichoas Hopper Yongdae Kim University

More information

Load Balancing by MPLS in Differentiated Services Networks

Load Balancing by MPLS in Differentiated Services Networks Load Baancing by MPLS in Differentiated Services Networks Riikka Susitaiva, Jorma Virtamo, and Samui Aato Networking Laboratory, Hesinki University of Technoogy P.O.Box 3000, FIN-02015 HUT, Finand {riikka.susitaiva,

More information

An Introduction to Design Patterns

An Introduction to Design Patterns An Introduction to Design Patterns 1 Definitions A pattern is a recurring soution to a standard probem, in a context. Christopher Aexander, a professor of architecture Why woud what a prof of architecture

More information

University of Illinois at Urbana-Champaign, Urbana, IL 61801, /11/$ IEEE 162

University of Illinois at Urbana-Champaign, Urbana, IL 61801, /11/$ IEEE 162 oward Efficient Spatia Variation Decomposition via Sparse Regression Wangyang Zhang, Karthik Baakrishnan, Xin Li, Duane Boning and Rob Rutenbar 3 Carnegie Meon University, Pittsburgh, PA 53, wangyan@ece.cmu.edu,

More information

Digital Image Watermarking Algorithm Based on Fast Curvelet Transform

Digital Image Watermarking Algorithm Based on Fast Curvelet Transform J. Software Engineering & Appications, 010, 3, 939-943 doi:10.436/jsea.010.310111 Pubished Onine October 010 (http://www.scirp.org/journa/jsea) 939 igita Image Watermarking Agorithm Based on Fast Curveet

More information

IrDA IrLAP Throughput Optimisation with Physical Layer Consideration

IrDA IrLAP Throughput Optimisation with Physical Layer Consideration IrDA IrLAP Throughput Optimisation with Physica Layer onsideration Abstract Barker, P. & Boucouvaas, A.. Mutimedia ommunications Research Group Schoo of Design, Engineering & omputing Bournemouth University,

More information

Proceedings of the International Conference on Systolic Arrays, San Diego, California, U.S.A., May 25-27, 1988 AN EFFICIENT ASYNCHRONOUS MULTIPLIER!

Proceedings of the International Conference on Systolic Arrays, San Diego, California, U.S.A., May 25-27, 1988 AN EFFICIENT ASYNCHRONOUS MULTIPLIER! [1,2] have, in theory, revoutionized cryptography. Unfortunatey, athough offer many advantages over conventiona and authentication), such cock synchronization in this appication due to the arge operand

More information

TSR: Topology Reduction from Tree to Star Data Grids

TSR: Topology Reduction from Tree to Star Data Grids 03 Seventh Internationa Conference on Innovative Mobie and Internet Services in biquitous Computing TSR: Topoogy Reduction from Tree to Star Data Grids Ming-Chang Lee #, Fang-Yie Leu *, Ying-ping Chen

More information

Adaptive 360 VR Video Streaming: Divide and Conquer!

Adaptive 360 VR Video Streaming: Divide and Conquer! Adaptive 360 VR Video Streaming: Divide and Conquer! Mohammad Hosseini *, Viswanathan Swaminathan * University of Iinois at Urbana-Champaign (UIUC) Adobe Research, San Jose, USA Emai: shossen2@iinois.edu,

More information

A Discriminative Global Training Algorithm for Statistical MT

A Discriminative Global Training Algorithm for Statistical MT Discriminative Goba Training gorithm for Statistica MT Christoph Timann IBM T.J. Watson Research Center Yorktown Heights, N.Y. 10598 cti@us.ibm.com Tong Zhang Yahoo! Research New York Cit, N.Y. 10011 tzhang@ahoo-inc.com

More information

Constellation Models for Recognition of Generic Objects

Constellation Models for Recognition of Generic Objects 1 Consteation Modes for Recognition of Generic Objects Wei Zhang Schoo of Eectrica Engineering and Computer Science Oregon State University zhangwe@eecs.oregonstate.edu Abstract Recognition of generic

More information

Replication of Virtual Network Functions: Optimizing Link Utilization and Resource Costs

Replication of Virtual Network Functions: Optimizing Link Utilization and Resource Costs Repication of Virtua Network Functions: Optimizing Link Utiization and Resource Costs Francisco Carpio, Wogang Bziuk and Admea Jukan Technische Universität Braunschweig, Germany Emai:{f.carpio, w.bziuk,

More information

A VIDEO-BASED APPROACH FOR RAILWAY BRIDGE SURFACE CRACK DETECTION

A VIDEO-BASED APPROACH FOR RAILWAY BRIDGE SURFACE CRACK DETECTION 6 th Internationa Symposium on Mobie Mapping Technoogy, Presidente Prudente, São Pauo, Brazi, Juy 21-24, 2009 A VIDEO-BASED APPROACH FOR RAILWAY BRIDGE SURFACE CRACK DETECTION LI Qingquan a,c, CHEN Long

More information

Performance of data networks with random links

Performance of data networks with random links Performance of data networks with random inks arxiv:adap-org/9909006 v2 4 Jan 2001 Henryk Fukś and Anna T. Lawniczak Department of Mathematics and Statistics, University of Gueph, Gueph, Ontario N1G 2W1,

More information

InnerSpec: Technical Report

InnerSpec: Technical Report InnerSpec: Technica Report Fabrizio Guerrini, Aessandro Gnutti, Riccardo Leonardi Department of Information Engineering, University of Brescia Via Branze 38, 25123 Brescia, Itay {fabrizio.guerrini, a.gnutti006,

More information

Response Surface Model Updating for Nonlinear Structures

Response Surface Model Updating for Nonlinear Structures Response Surface Mode Updating for Noninear Structures Gonaz Shahidi a, Shamim Pakzad b a PhD Student, Department of Civi and Environmenta Engineering, Lehigh University, ATLSS Engineering Research Center,

More information

A Method for Calculating Term Similarity on Large Document Collections

A Method for Calculating Term Similarity on Large Document Collections $ A Method for Cacuating Term Simiarity on Large Document Coections Wofgang W Bein Schoo of Computer Science University of Nevada Las Vegas, NV 915-019 bein@csunvedu Jeffrey S Coombs and Kazem Taghva Information

More information

CSE120 Principles of Operating Systems. Prof Yuanyuan (YY) Zhou Lecture 4: Threads

CSE120 Principles of Operating Systems. Prof Yuanyuan (YY) Zhou Lecture 4: Threads CSE120 Principes of Operating Systems Prof Yuanyuan (YY) Zhou Lecture 4: Threads Announcement Project 0 Due Project 1 out Homework 1 due on Thursday Submit it to Gradescope onine 2 Processes Reca that

More information

Incremental Discovery of Object Parts in Video Sequences

Incremental Discovery of Object Parts in Video Sequences Incrementa Discovery of Object Parts in Video Sequences Stéphane Drouin, Patrick Hébert and Marc Parizeau Computer Vision and Systems Laboratory, Department of Eectrica and Computer Engineering Lava University,

More information

Data Management Updates

Data Management Updates Data Management Updates Jenny Darcy Data Management Aiance CRP Meeting, Thursday, November 1st, 2018 Presentation Objectives New staff Update on Ingres (JCCS) conversion project Fina IRB cosure at study

More information

An Adaptive Two-Copy Delayed SR-ARQ for Satellite Channels with Shadowing

An Adaptive Two-Copy Delayed SR-ARQ for Satellite Channels with Shadowing An Adaptive Two-Copy Deayed SR-ARQ for Sateite Channes with Shadowing Jing Zhu, Sumit Roy zhuj@ee.washington.edu Department of Eectrica Engineering, University of Washington Abstract- The paper focuses

More information

Identifying and Tracking Pedestrians Based on Sensor Fusion and Motion Stability Predictions

Identifying and Tracking Pedestrians Based on Sensor Fusion and Motion Stability Predictions Sensors 2010, 10, 8028-8053; doi:10.3390/s100908028 OPEN ACCESS sensors ISSN 1424-8220 www.mdpi.com/journa/sensors Artice Identifying and Tracking Pedestrians Based on Sensor Fusion and Motion Stabiity

More information

Lines and Angles. introduction

Lines and Angles. introduction 9 Lines and nges intrductin In cass VI, you have earnt soe basic concepts and ters of geoetry point, ine, pane, ine segent, ray, ange and types of anges. In this chapter, we sha earn about soe pairs of

More information

Distance Weighted Discrimination and Second Order Cone Programming

Distance Weighted Discrimination and Second Order Cone Programming Distance Weighted Discrimination and Second Order Cone Programming Hanwen Huang, Xiaosun Lu, Yufeng Liu, J. S. Marron, Perry Haaand Apri 3, 2012 1 Introduction This vignette demonstrates the utiity and

More information

Image Segmentation Using Semi-Supervised k-means

Image Segmentation Using Semi-Supervised k-means I J C T A, 9(34) 2016, pp. 595-601 Internationa Science Press Image Segmentation Using Semi-Supervised k-means Reza Monsefi * and Saeed Zahedi * ABSTRACT Extracting the region of interest is a very chaenging

More information

Genetic Algorithms for Parallel Code Optimization

Genetic Algorithms for Parallel Code Optimization Genetic Agorithms for Parae Code Optimization Ender Özcan Dept. of Computer Engineering Yeditepe University Kayışdağı, İstanbu, Turkey Emai: eozcan@cse.yeditepe.edu.tr Abstract- Determining the optimum

More information

CLOUD RADIO ACCESS NETWORK WITH OPTIMIZED BASE-STATION CACHING

CLOUD RADIO ACCESS NETWORK WITH OPTIMIZED BASE-STATION CACHING CLOUD RADIO ACCESS NETWORK WITH OPTIMIZED BASE-STATION CACHING Binbin Dai and Wei Yu Ya-Feng Liu Department of Eectrica and Computer Engineering University of Toronto, Toronto ON, Canada M5S 3G4 Emais:

More information

Forgot to compute the new centroids (-1); error in centroid computations (-1); incorrect clustering results (-2 points); more than 2 errors: 0 points.

Forgot to compute the new centroids (-1); error in centroid computations (-1); incorrect clustering results (-2 points); more than 2 errors: 0 points. Probem 1 a. K means is ony capabe of discovering shapes that are convex poygons [1] Cannot discover X shape because X is not convex. [1] DBSCAN can discover X shape. [1] b. K-means is prototype based and

More information

MACHINE learning techniques can, automatically,

MACHINE learning techniques can, automatically, Proceedings of Internationa Joint Conference on Neura Networks, Daas, Texas, USA, August 4-9, 203 High Leve Data Cassification Based on Network Entropy Fiipe Aves Neto and Liang Zhao Abstract Traditiona

More information

1682 IEEE TRANSACTIONS ON FUZZY SYSTEMS, VOL. 22, NO. 6, DECEMBER Backward Fuzzy Rule Interpolation

1682 IEEE TRANSACTIONS ON FUZZY SYSTEMS, VOL. 22, NO. 6, DECEMBER Backward Fuzzy Rule Interpolation 1682 IEEE TRANSACTIONS ON FUZZY SYSTEMS, VOL. 22, NO. 6, DECEMBER 2014 Bacward Fuzzy Rue Interpoation Shangzhu Jin, Ren Diao, Chai Que, Senior Member, IEEE, and Qiang Shen Abstract Fuzzy rue interpoation

More information

AUTOMATIC gender classification based on facial images

AUTOMATIC gender classification based on facial images SUBMITTED TO IEEE TRANSACTIONS ON NEURAL NETWORKS 1 Gender Cassification Using a Min-Max Moduar Support Vector Machine with Incorporating Prior Knowedge Hui-Cheng Lian and Bao-Liang Lu, Senior Member,

More information

A Robust Method for Shape-based 3D Model Retrieval

A Robust Method for Shape-based 3D Model Retrieval A Robust Method for Shape-based 3D Mode Retrieva Yi Liu, Jiantao Pu, Guyu Xin, Hongbin Zha Weibin Liu 1, Yusue Uehara ationa Laboratory on Machine Perception Internet Appication Lab, Fujitsu R&D Center

More information

Fast Methods for Kernel-based Text Analysis

Fast Methods for Kernel-based Text Analysis Proceedings of the 41st Annua Meeting of the Association for Computationa Linguistics, Juy 2003, pp. 24-31. Fast Methods for Kerne-based Text Anaysis Taku Kudo and Yuji Matsumoto Graduate Schoo of Information

More information

Archive Software with value add services:

Archive Software with value add services: E-Mai Archive Software with vaue add services: Protect your emais from data oss through reasonabe and secure backup features. Increase the productivity of your team by using the integrated search engine

More information