Using the disparity space to compute occupancy grids from stereo-vision
|
|
- Kory Blake
- 5 years ago
- Views:
Transcription
1 The 2010 IEEE/RSJ International Conference on Intelligent Robots an Systems October 18-22, 2010, Taipei, Taiwan Using the isparity space to compute occupancy gris from stereo-vision Mathias Perrollaz, John-Davi Yoer, Anne Spalanzani an Christian Laugier Abstract The occupancy gri is a popular tool for probabilistic robotics, use for a variety of applications. Such gris are typically base on ata from range sensors (e.g. laser, ultrasoun), an the computation process is well known [1]. The use of stereo-vision in this framework is less common, an typically treats the stereo sensor as a istance sensor, or fails to account for the uncertainties specific to vision. In this paper, we propose a novel approach to compute occupancy gris from stereo-vision, for the purpose of intelligent vehicles. Occupancy is initially compute irectly in the stereoscopic sensor s isparity space, using the sensor s pixel-wise precision uring the computation process an allowing the hanling of occlusions in the observe area. It is also computationally efficient, since it uses the u-isparity approach to avoi processing a large point clou. In a secon stage, this isparity-space occupancy is transforme into a Cartesian space occupancy gri to be use by subsequent applications. In this paper, we present the metho an show results obtaine with real roa ata, comparing this approach with others. I. INTRODUCTION Creating (or having a priori) a moel of the local environment has always been one of the requirements for successful implementation of a mobile robot. One common approach has been to buil an occupancy gri. These gris are often create base on ata from one or more range sensors, such as laser or ultrasoun. Because of the imperfection in such sensors, it is current practice to create the gri by using a probabilistic approach [1][2]. While stereo camera pairs have been wiely use on mobile robots, their use for the creation of occupancy gris has been somewhat less common. In some cases, researchers have use the stereo cameras purely as a istance sensor, an use the same approach as with a laser sensor [3]. Others have use stereospecific methos, but have not completely consiere the nature of the stereoscopic ata. In [4] or [5], the authors only consier the first etecte object for each column an suppose that it occlues the fiel ahea. This paper presents a novel approach for the construction of occupancy gris using a stereo camera pair, specifically create for the application of an on-roa intelligent vehicle. As such, the occupancy gri create will be a plane representing the area in front of the vehicle. The iea is not to map the environnement at a global scale, but rather to estimate the free space in front of the vehicle. Also, processing time is critical for this application, as the system will be require to execute in real-time. Finally, it is important to see all M. Perrollaz (mathias.perrollaz@inrialpes.fr), A. Spalanzani (anne.spalanzani@inrialpes.fr) an C. Laugier (christian.laugier@inrialpes.fr) are with the INRIA Grenoble. J-D. Yoer (j-yoer@onu.eu) is with Ohio Northern University, currently invite professor at INRIA Grenoble. obstacles, even those which may be behin another obstacle, such as a peestrian stepping from behin a car. For example, if a car is parke on the curb, it may present no risk to the ego-vehicle. But a person stepping out from behin the car woul present a risk - an by the time the person is no longer occlue behin the car, it may be too late to safely stop the vehicle. One of the critical avantages of cameras over 2-D laser sensors for this application is precisely the ability to see such obstacles. A 3D laser sensor has similar avantages, but is much more expensive an slower than a vision sensor. The metho presente here provies a formal probabilistic moel to calculate the probability of occupancy base on the isparity space of the stereoscopic sensor. The metho also formally consiers the visibility of the ifferent regions of the image in the calculation, an thus can eal with partiallyocclue objects. Because of its use of the u-isparity space, it is computationally efficient. Finally, the metho formally consiers the reuction in accuracy of the isparity image with istance from the sensor. The paper will etail the methoology, an show results with ata from real images obtaine on the roa. Section II provies a brief review of the use of the isparity space, with specifics relate to the intelligent vehicle application. Section III explains the overall methoology. Section IV shows results, an compares the metho with other approaches. Finally, Section V iscusses future work an conclusions. II. THE DATA IN THE DISPARITY SPACE A. Geometrical consierations In this paper the stereoscopic sensor is consiere as perfectly rectifie. Cameras are suppose ientical an classically represente by a pinhole moel, (α u, α v, u 0, v 0 ) being the intrinsic parameters. Pixel coorinates in left an right cameras are respectively name (u l, v) an (u r, v). The length of the stereo baseline is b s. It shoul be note that this application only calls for the visual sensor to create an instantaneous occupancy gri of the area in front of the vehicle. A worl coorinate system is enote R w. Each point P of coorinates X w = (x w, y w, z w ) can be projecte onto the left an right image planes, respectively on positions (u l, v) an (u r, v). Consequently, in the isparity space associate to the stereoscopic sensor, the coorinates of P are U = (u,, v), with u = u l an = u l u r, namely the isparity value of the pixel. The u, an v axes efine the isparity coorinate system R. The transform U = F(X w ) is invertible, so the coorinates in R w can be retrieve from images coorinates through a reconstruction function /10/$ IEEE 2721
2 For simplicity in notation, an without loss of generality, the yaw, pitch an roll angles of the camera, relative to R w, are set to zero. Assuming that the center of the stereo baseline is situate at position (x o, y o, z o ), the transform from the worl coorinate system to isparity space is given by [6]: B. The u-isparity approach u = u 0 + α u x w x o b s/2 y w y o v = z v 0 + α w z o v y w y o (1) = b α s u y w y o 1) The iea: The u-isparity approach [7] is a complement to the v-isparity originally escribe in [8]. The iea is to project the pixels of the isparity map along the columns, with accumulation. The resulting image is similar to a bir s eye view representation of the scene in the isparity space, as illustrate on figure 1. On this image, the lower lines correspon to close areas, while the upper lines contain information about the long istances. Vertical objects (i.e. with constant isparity, e.g. the peestrians) appear as portion of straight lines. an y = y w. Arbitrarily, one can ecie to set the etection plane to z w = 0. x bs Right camera xs0 z Os O ys0 Left camera zs0 y Detection plane Fig. 2. Simplifie geometrical configuration of the stereoscopic sensor, an reference to the common coorinate system R D. Consiering equation 1, it appears that an orthogonal projection on P D is equivalent to an orthogonal projection in R on any plane of constant v. Therefore, since computation of u-isparity images is not costly, this approach irectly implements the vertical projection on P D of the observe points from the scene. Moreover, it is equivalent to process the ata in the u-isparity plane or in P D. For the remainer of this paper, we will call U D the coorinates of a point in the u-isparity plan an X D its coorinates in the etection plane. The transform between U D an X D is given by the observation function G D : G D : R 2 R 2 U D X D (2) Fig. 1. Left image from a stereo pair (top), the associate isparity image (mi) an u-isparity representation of the scene (bottom). 2) The etection plane: For occupancy gri computation, we have to consier a etection plane P D, that is the support for the gri. As shown on figure 2, P D is chosen to be parallel to the plane efine by the baseline an the optical axes. This constaint is possible, since the objective is to buil an occupancy gri in the vehicle s frame. A coorinate system R D (O D, x, y ) is associate with the etection plane. For a given point P of the space, x = x w with: { x = x o s + b 2 + b(u uo) y = y o s + αubs 3) The alignment of rays: Another avantage of the u- isparity approach for occupancy gri computation is that, contrary to the cartesian representation, it lets appear as parrallel the rays of light that go through the camera matrix. Inee, a set of vertically aligne rays is represente by a column in the u-isparity image. In a similar way, the lines of the v-isparity image correspon to sets of horizontally aligne rays. This behavior is promising since it allows easy estimation of occlue areas. C. Roa-obstacle separation For the reminer of the paper, it is assume that pixels can be istinguishe as being from the roa surface or from the obstacles. There are several methos to o this, such as estimating the roa surface an thresholing the height of the pixels, as in [3]. We choose to use a ouble correlation framework, which exploits ifferent matching hypotheses for vertical an horizontal objects, as escribe in [9] an etaile in [6]. It provies immeiate classification of the pixels uring the matching process. After this classification, we obtain two isparity images I obst an I roa (3) an two 2722
3 u-isparity images, IU obst an IU roa, respectively containing pixels from the obstacles an from the roa surface. III. OCCUPANCY GRID COMPUTATION FROM THE A. The approach DISPARITY SPACE The approach presente here is to compute an occupancy gri irectly in the u-isparity plane. This gri will later be transforme into a cartesian gri, explicitly moeling the uncertainty of the stereoscopic sensor. There are two main avantages to this approach. First, this allows irect consieration of visible an occlue portions of the image. Secon, this approach allows use of equally-space measurement points to create the initial gri. By contrast, moving to a Cartesian space first woul give a varying ensity of measurements. B. Estimation of the occupancy of a cell We seek to calculate P(O U ), the probability that a cell U is occupie by an obstacle. This probability will epen on the visibility, V U, an on the confience on the observation of an obstacle, C U. V U an C U are binary ranom variables (i.e. P(V U = 1) measures the probability that the cell U is visible, P(C U = 1) is the probability that an obstacle has been observe in cell U). Experience provies knowlege about the shape of the probability ensity function P(O U V U, C U ), that is, the probability of a cell being occupie, knowing V U an C U. Inee, some bounary conitions of P(O U V U, C U ) are known. For example, if the cell is not visible, nothing is known about its occupancy, so: P(O U (V U = 0, C U = c) = 0.5, c 0, 1 (4) Similarly, if a cell is fully visible an there is full confience that an obstacle was observe, then: P(O U V U = 1, C U = 1) = 1 P FP (5) that is, the only way the cell is not occupie is in the event of a false positive. Also: P(O U V U = 1, C U = 0) = P FN (6) that is, a cell can only be occupie, when nothing is observe, if there was a false negative. P FP an P FN are respectively the probability that a false positive or a false negative can occur uring the matching process. These are assume to be constant an arbitrarily set accoring to the sensor s features. Finally, the laws of probability are use to obtain the full ecomposition of P(O U ): P(O U ) = v,c P(V U = v) P(C U = c) P(O U V U = v, C U = c) (7) V U an C U being boolean variables, this means: P(O U ) = P(V U = 1) P(C U = 1) (1 P FP ) +P(V U = 1) (1 P(C U = 1)) P FN +(1 P(V U = 1)) 0.5 (8) So to compute the occupancy probability, it is necessary to estimate the values P(V U = 1) an P(C U = 1) with respect to the isparity ata. Let us efine the maximum etection height h. For a given cell U of the gri, we efine the number of possible measurement points as: N P (U) = v 0 () v h () (9) v 0 () an v h () being respectively the v-coorinates of the pixels situate on the groun (z w = 0) an at the maximum etection height (z w = h) for the value of the isparity. Consiering equation 1: N P (U) = α v α u h. b s (10) The number of observe obstacle pixels for the cell is the number of possible pixels whose isparity value is. It can be irectly measure in the obstacle u-isparity image: N O (U) = I obst U (u, ) (11) 1) Estimation of the visibility of a cell: To estimate the probability that a cell U is visible, we classify the pixels of the obstacle isparity image whose coorinates are (u, v [v h, v 0 ]) (i.e. possible pixels): if I obst (u, v) >, the point (u,, v) is occlue, if I obst (u, v) = 0, there is no observation for the ray (u, v) (i.e. it is not visible), else the pixel (u,, v) is sai to be visible. The number of visible pixels for any cell U is N V (U). The probability of visibility is estimate to be the ratio between visible pixels an possible pixels: P(V U = 1) = N V (U) N P (U) (12) 2) Estimation of the confience of observation: We choose to express the confience on the observation of an obstacle as a function of the ratio: r O (U) = N O(U) N V (U) (13) This means that if more of the visible pixels are fille with an observation, we are more confient we have observe an obstacle. An exponential function is use to represent the knowlege that the confience shoul grow quickly with respect to the number of observe pixels: P(C U = 1) = 1 e r O (U) τ O (14) where τ O is a constant. Note that although C U is a binary variable (either true or false), this probability ensity function is continuous. 3) Resulting probability ensity function: Figure 3 illustrates equation 8, the probability ensity function of occupancy with respect to the visibility an to r O. For this plot, parameters are set to: P FP = 0.01, P FN = 0.05 an τ O = These parameters were set manually. 2723
4 the surface S U (U) of a pixel U = (u, ) as the region of the u-isparity image elimite by the intervals [u 0.5, u+0.5[ an [ 0.5, + 0.5[. The area of influence of this pixel in the etection plane is: S X (U) = G(S U (U)). To compute the occupancy gri, the occupancy probability of a pixel U is simply attribute to the area S X (U) of the etection plane. For short istances, several pixels can have an influence on the same cell of the metric gri. Therefore, it is necessary to estimate the occupancy accoring to this set of ata. For this purpose, we choose to use a max estimator, which ensures a conservative estimation of the probability of occupancy: P(O X ) = max(p(o U )/X S X (U)) (15) Fig. 3. Probability ensity function P(O U ). C. Resulting gri in the u-isparity plane Knowing the probability ensity function P(O U V U, C U ), the computation of the occupancy gri in the u-isparity image is straightforwar. Figure 4 shows a etail of a scene an the associate occupancy gri in the u-isparity plane. Regions with obstacles appear in light color, while free space appears in ark color. It is noticeable that regions situate in front of obstacles are seen as free. Thanks to our approach which formally consiers the visibility, the peestrian is etecte even if it is partially occlue by the box. Fig. 4. Detail of a scene (a), associate isparity map (b) an occupancy gri in u-isparity. The box an the peestrian behin the box are both apparent on the u-isparity occupancy gri. This woul not have been possible without consiering the visibility. D. Computation of the occupancy gri in Cartesian space The cartesian occupancy gri requires the calculation of which pixels from the occupancy gri in u-isparity have an influence on a given cell of the cartesian gri. Let us efine A. Experimental setup IV. EXPERIMENTAL RESULTS The algorithm has been evaluate on sequences from the French LOVe project [10], ealing with peestrian etection. The images are taken with a pair of SMAl CMOS cameras, which provie images every 30 ms. They are reuce to quarter VGA resolution (320*240 pixels) before the matching process. The length of the stereo baseline is 43 cm. The observe region is 7.5m < x < 7.5m an 0m < y < 35m, maximum height is h = 2.0m, an the cell size is 0.25m 0.25m. The correlation winow measures 7pixels in with an 19pixels in height. The occupancy gri computation parameters are set to: P FP = 0.01, P FN = 0.05 an τ O = B. Results Figure 5 shows typical results. For each of the cases (af), the left camera s image is shown in the top left, the u- isparity occupancy gri in the bottom left, an the cartesian occupancy gri on the right. For the occupancy gris, lighter colors inicate an increase likelihoo of occupation, while the backgroun color represents a probability of occupation of 0.5 (which means that there is no knowlege about the likelihoo of occupation of that cell). In case a), the closest obstacle is the truck to the right. In both occupancy gris, we can see the truck to the right, an a variety of obstacles at a further istance in front an to the left. In case b), we see a more cluttere scene, an in the cartesian gri, the various obstacles are visible. Left to right in the gri, note the oncoming car, the peestrian further away, the stoplight pole in the center, the truck as a large obstacle further away, an the car on the far right. Case c) shows that obstacles are seen at longer istance. Note that the area between the camera an the other vehicles is seen as free space. Case ) shows one of the avantages of this metho, as we can ientify both the car turning in front (the bottom right of the cartesian gri), an the sign behin it. This effect is easily seen in the u-isparity gri, on the right, where one can clearly see two obstacles. The algorithm also correctly notes that there is some likelihoo that the area between the car an the sign is unoccupie. Cases e) an f) show two scenes cluttere with peestrian traffic. In the u-isparity gri, it is obvious that objects are 2724
5 Fig. 5. Typical results obtaine with a ataset from the French project LOVe. For each result: the left image of the stereo pair, the occupancy gri in the u-isparity plane an the occupancy gri in cartesian space. etecte at a wie variety of istances. In the cartesian gri, note the peestrians, as well as a few of the vertical posts on the right. Because the obstacles are close to the vehicle, most of the occupancy gri in these cases remains unknown. Figure 6 compares this approach to two other methos of using a stereoscopic sensor to create an occupancy gri, using case c from figure 5. Metho a) etects the maximum isparity of each column (as in [5]) occupancy probability is P FN for higher isparity values, an 0.5 behin the etecte object. This approach is very sensitive to noise in the isparity map an can not percieve partially occlue parts of the scene. Metho b) relies only on filling the gri base on knowlege of the roa an obstacles pixels, as escribe in [6]. As such, much of the image has no information (leaing to large areas of 0.5 occupancy probability), an the resulting gri tens to have high certainty. Finally, the metho escribe in this paper is shown in c). The metho formally takes into account the probability of false measurements, making it less susceptible to noise, an fins the obsacle behin the car whereas metho a) foun only the part of the obstacle in front of the car. The probabilistic moel has also provie a more realistic variation in the occupancy probablity values. C. Computation time On a stanar laptop, without optimizations, the algorithm for the u-isparity occupancy gri computation runs in 10 ms. The conversion into cartesian gri runs in 40 ms. Consiering that all the columns of the occupancy gri in u- isparity can be processe inepenantly, many operations can be performe in parallel. Thus it can be efficiently implemente on a parellel architecture, e.g. a GPU, to furter reuce computation time. We are now working on such implementation of the algorithm on GPU, using NVIDIA s 2725
6 for his review of this probabilistic moel an Dr. Amaury Negre for its work on the GPU implementation. Dr Yoer woul like to thank INRIA an Ohio Northern University for allowing him to spen this year with the E-motion team at INRIA Grenoble. REFERENCES a) b) c) Fig. 6. Comparison of three approaches to compute the occupancy gri. a) etection of the maximum isparity of each colum, b) exploitation of obstacle an roa u-isparity images as measurement point, c) computation in the u-isparity plane. CUDA. Preliminary tests showe that it is possible to run the complete algorithm at vieo framerate (25fps), from the stereo matching to the construction of the cartesian gri. V. CONCLUSION AND FUTURE WORK The algorithm escribe in this paper offers several avantages over other approaches using stereo vision to create an occupancy gri. First, using the u-isparity as a starting point allows computationally efficient calculations. Secon, computing the initial occupancy gri in the u-isparity space allows for simpler calculation of the visibility. It also allows the use of ata with a pixel-wise precision all along the computation process. Thir, we have presente a formal means of consiering the occupation as a function of the probability that an obstacle is visible, an of the confience in the observation of the obstacle. In summary, the contribution of this paper is to calculate occupancy gris from stereo images in a computationally efficient way, which formally accounts for the probabilistic nature of the sensor. Much work remains to be one. It is expecte that this algorithm will soon be teste on a vehicle also equippe with ual laser range finers. The three sensors (2 lasers an stereo-vision) will all provie occupancy gris to a Bayesian Occupancy Filter. Comparing an fusing these occupancy gris will provie another means of evaluating the output of this algorithm. Thir, the metho will be upate to formally consier the semi-occlusions in the stereoscopic images (i.e. pixels next to isparity iscontinuities). We also hope to refine the approach by consiering relationships between parameters in the system (for example, the probability of a false negative, or false positive, is relate to the ensity of the isparity image). Finally, work is being one to filter the Cartesian gri base on the uncertainty of the stereo sensor, an to take avantage of pixels that are ientifie as roa pixels. [1] S. Thrun, W. Burgar, an D. Fox, Probabilistic Robotics. The MIT Press, [2] A. Elfes, Using occupancy gris for mobile robot perception an navigation, IEEE Computer, vol. 22-6, [3] C. Braillon, C. Praalier, K. Usher, J. Crowley, an C. Laugier, Occupancy gris from stereo an optical flow ata, in International Symposium on Experimental Robotics (ISER). [4] L. Matthies an A. Elfes, Integration of sonar an stereo range ata using a gri-base representation, in IEEE International Conference on Robotics an Automation (ICRA), [5] D. Murray an J. Little, Using real-time stereo vision for mobile robot navigation, Autonomous Robots,, vol. 8, January [6] M. Perrollaz, A. Spalanzani, an D. Aubert, A probabilistic representation of the uncertainty of stereo-vision an its application to obstacle etection, in IEEE Intelligent Vehicles Symposium (IV), [7] Z. Hu, F. Lamosa, an K. Uchimura, A complete u-v-isparity stuy for stereovision base 3 riving environment analysis, in International Conference on 3-D Digital Imaging an Moeling(3DIM), [8] R. Labayrae, D. Aubert, an J. Tarel, Real time obstacles etection on non flat roa geometry through v-isparity representation, in IEEE Intelligent Vehicles Symposium (IV), [9] P. Burt, L. Wixson, an G. Salgian, Electronically irecte focal stereo, in IEEE International Conference on Computer Vision (ICCV), vol. 0, [10] Love : [11] C. Coue, C. Praalier, C. Laugier, T. Fraichar, an P. Bessiere, Bayesian occupancy filtering for multi-target tracking: an automotive application, International Journal of Robotics Research (IJRR), vol. 25, January ACKNOWLEDGMENT This work has been one within the context of the Arosyn project. The authors woul like to thank Dr. Pierre Bessiere 2726
Probabilistic representation of the uncertainty of stereo-vision and application to obstacle detection
2010 IEEE Intelligent Vehicles Symposium University of California, San Diego, CA, USA June 21-24, 2010 TuE1.11 Probabilistic representation of the uncertainty of stereo-vision and application to obstacle
More informationFast Window Based Stereo Matching for 3D Scene Reconstruction
The International Arab Journal of Information Technology, Vol. 0, No. 3, May 203 209 Fast Winow Base Stereo Matching for 3D Scene Reconstruction Mohamma Mozammel Chowhury an Mohamma AL-Amin Bhuiyan Department
More informationRefinement of scene depth from stereo camera ego-motion parameters
Refinement of scene epth from stereo camera ego-motion parameters Piotr Skulimowski, Pawel Strumillo An algorithm for refinement of isparity (epth) map from stereoscopic sequences is propose. The metho
More informationReal Time On Board Stereo Camera Pose through Image Registration*
28 IEEE Intelligent Vehicles Symposium Einhoven University of Technology Einhoven, The Netherlans, June 4-6, 28 Real Time On Boar Stereo Camera Pose through Image Registration* Fai Dornaika French National
More informationRobust Camera Calibration for an Autonomous Underwater Vehicle
obust Camera Calibration for an Autonomous Unerwater Vehicle Matthew Bryant, Davi Wettergreen *, Samer Aballah, Alexaner Zelinsky obotic Systems Laboratory Department of Engineering, FEIT Department of
More informationComputing Occupancy Grids from Multiple Sensors using Linear Opinion Pools
Computing Occupancy Grids from Multiple Sensors using Linear Opinion Pools Juan David Adarve, Mathias Perrollaz, Alexandros Makris, Christian Laugier To cite this version: Juan David Adarve, Mathias Perrollaz,
More informationDense Disparity Estimation in Ego-motion Reduced Search Space
Dense Disparity Estimation in Ego-motion Reuce Search Space Luka Fućek, Ivan Marković, Igor Cvišić, Ivan Petrović University of Zagreb, Faculty of Electrical Engineering an Computing, Croatia (e-mail:
More informationQadeer Baig, Mathias Perrollaz, Jander Botelho Do Nascimento, Christian Laugier
Using Fast Classification of Static and Dynamic Environment for Improving Bayesian Occupancy Filter (BOF) and Tracking Qadeer Baig, Mathias Perrollaz, Jander Botelho Do Nascimento, Christian Laugier e-motion
More informationAlmost Disjunct Codes in Large Scale Multihop Wireless Network Media Access Control
Almost Disjunct Coes in Large Scale Multihop Wireless Network Meia Access Control D. Charles Engelhart Anan Sivasubramaniam Penn. State University University Park PA 682 engelhar,anan @cse.psu.eu Abstract
More informationDual Arm Robot Research Report
Dual Arm Robot Research Report Analytical Inverse Kinematics Solution for Moularize Dual-Arm Robot With offset at shouler an wrist Motivation an Abstract Generally, an inustrial manipulator such as PUMA
More informationW4. Perception & Situation Awareness & Decision making
W4. Perception & Situation Awareness & Decision making Robot Perception for Dynamic environments: Outline & DP-Grids concept Dynamic Probabilistic Grids Bayesian Occupancy Filter concept Dynamic Probabilistic
More informationImage Segmentation using K-means clustering and Thresholding
Image Segmentation using Kmeans clustering an Thresholing Preeti Panwar 1, Girhar Gopal 2, Rakesh Kumar 3 1M.Tech Stuent, Department of Computer Science & Applications, Kurukshetra University, Kurukshetra,
More informationShift-map Image Registration
Shift-map Image Registration Svärm, Linus; Stranmark, Petter Unpublishe: 2010-01-01 Link to publication Citation for publishe version (APA): Svärm, L., & Stranmark, P. (2010). Shift-map Image Registration.
More informationStereo Vision-based Subpixel Level Free Space Boundary Detection Using Modified u-disparity and Preview Dynamic Programming
2015 IEEE Intelligent Vehicles Symposium (IV) June 28 - July 1, 2015. COEX, Seoul, Korea Stereo Vision-base Subpixel Level Free Space Bounary Detection Using Moifie u-isparity an Preview Dynamic Programming
More information[2006] IEEE. Reprinted, with permission, from [Damith C. Herath, Sarath Kodagoda and Gamini Dissanayake, Simultaneous Localisation and Mapping: A
[6] IEEE. Reprinte, with permission, from [Damith C. Herath, Sarath Koagoa an Gamini Dissanayake, Simultaneous Localisation an Mapping: A Stereo Vision Base Approach, Intelligent Robots an Systems, 6 IEEE/RSJ
More informationA Duality Based Approach for Realtime TV-L 1 Optical Flow
A Duality Base Approach for Realtime TV-L 1 Optical Flow C. Zach 1, T. Pock 2, an H. Bischof 2 1 VRVis Research Center 2 Institute for Computer Graphics an Vision, TU Graz Abstract. Variational methos
More informationOnline Appendix to: Generalizing Database Forensics
Online Appenix to: Generalizing Database Forensics KYRIACOS E. PAVLOU an RICHARD T. SNODGRASS, University of Arizona This appenix presents a step-by-step iscussion of the forensic analysis protocol that
More informationMultimodal Stereo Image Registration for Pedestrian Detection
Multimoal Stereo Image Registration for Peestrian Detection Stephen Krotosky an Mohan Trivei Abstract This paper presents an approach for the registration of multimoal imagery for peestrian etection when
More information1/5/2014. Bedrich Benes Purdue University Dec 12 th 2013 INRIA Imagine. Modeling is an open problem in CG
Berich Benes Purue University Dec 12 th 213 INRIA Imagine Inverse Proceural Moeling (IPM) Motivation IPM Classification Case stuies IPM of volumetric builings IPM of stochastic trees Urban reparameterization
More informationClassifying Facial Expression with Radial Basis Function Networks, using Gradient Descent and K-means
Classifying Facial Expression with Raial Basis Function Networks, using Graient Descent an K-means Neil Allrin Department of Computer Science University of California, San Diego La Jolla, CA 9237 nallrin@cs.ucs.eu
More informationExploring Context with Deep Structured models for Semantic Segmentation
1 Exploring Context with Deep Structure moels for Semantic Segmentation Guosheng Lin, Chunhua Shen, Anton van en Hengel, Ian Rei between an image patch an a large backgroun image region. Explicitly moeling
More informationSMART IMAGE PROCESSING OF FLOW VISUALIZATION
SMAR IMAGE PROCESSING OF FLOW VISUALIZAION H Li (A Rinoshika) 1, M akei, M Nakano 1, Y Saito 3 an K Horii 4 1 Department of Mechanical Systems Engineering, Yamagata University, Yamagata 99-851, JAPAN Department
More informationEstimating Velocity Fields on a Freeway from Low Resolution Video
Estimating Velocity Fiels on a Freeway from Low Resolution Vieo Young Cho Department of Statistics University of California, Berkeley Berkeley, CA 94720-3860 Email: young@stat.berkeley.eu John Rice Department
More informationNew Geometric Interpretation and Analytic Solution for Quadrilateral Reconstruction
New Geometric Interpretation an Analytic Solution for uarilateral Reconstruction Joo-Haeng Lee Convergence Technology Research Lab ETRI Daejeon, 305 777, KOREA Abstract A new geometric framework, calle
More information1/5/2014. Bedrich Benes Purdue University Dec 6 th 2013 Prague. Modeling is an open problem in CG
Berich Benes Purue University Dec 6 th 213 Prague Inverse Proceural Moeling (IPM) Motivation IPM Classification Case stuies IPM of volumetric builings IPM of stochastic trees Urban reparameterization IPM
More informationTHE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE
БСУ Международна конференция - 2 THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE Evgeniya Nikolova, Veselina Jecheva Burgas Free University Abstract:
More informationCAMERAS AND GRAVITY: ESTIMATING PLANAR OBJECT ORIENTATION. Zhaoyin Jia, Andrew Gallagher, Tsuhan Chen
CAMERAS AND GRAVITY: ESTIMATING PLANAR OBJECT ORIENTATION Zhaoyin Jia, Anrew Gallagher, Tsuhan Chen School of Electrical an Computer Engineering, Cornell University ABSTRACT Photography on a mobile camera
More informationDepth Measurement and 3-D Reconstruction of Multilayered Surfaces by Binocular Stereo Vision with Parallel Axis Symmetry Using Fuzzy
Depth Measurement and 3-D Reconstruction of Multilayered Surfaces by Binocular Stereo Vision with Parallel Axis Symmetry Using Fuzzy Sharjeel Anwar, Dr. Shoaib, Taosif Iqbal, Mohammad Saqib Mansoor, Zubair
More informationComputer Graphics Chapter 7 Three-Dimensional Viewing Viewing
Computer Graphics Chapter 7 Three-Dimensional Viewing Outline Overview of Three-Dimensional Viewing Concepts The Three-Dimensional Viewing Pipeline Three-Dimensional Viewing-Coorinate Parameters Transformation
More informationMulti-camera tracking algorithm study based on information fusion
International Conference on Avance Electronic Science an Technolog (AEST 016) Multi-camera tracking algorithm stu base on information fusion a Guoqiang Wang, Shangfu Li an Xue Wen School of Electronic
More informationFigure 1: 2D arm. Figure 2: 2D arm with labelled angles
2D Kinematics Consier a robotic arm. We can sen it commans like, move that joint so it bens at an angle θ. Once we ve set each joint, that s all well an goo. More interesting, though, is the question of
More informationAdjacency Matrix Based Full-Text Indexing Models
1000-9825/2002/13(10)1933-10 2002 Journal of Software Vol.13, No.10 Ajacency Matrix Base Full-Text Inexing Moels ZHOU Shui-geng 1, HU Yun-fa 2, GUAN Ji-hong 3 1 (Department of Computer Science an Engineering,
More informationTransient analysis of wave propagation in 3D soil by using the scaled boundary finite element method
Southern Cross University epublications@scu 23r Australasian Conference on the Mechanics of Structures an Materials 214 Transient analysis of wave propagation in 3D soil by using the scale bounary finite
More informationUsing Vector and Raster-Based Techniques in Categorical Map Generalization
Thir ICA Workshop on Progress in Automate Map Generalization, Ottawa, 12-14 August 1999 1 Using Vector an Raster-Base Techniques in Categorical Map Generalization Beat Peter an Robert Weibel Department
More informationRobust Ground Plane Tracking in Cluttered Environments from Egocentric Stereo Vision
Robust Groun Plane Tracking in Cluttere Environments from Egocentric Stereo Vision Tobias Schwarze an Martin Lauer 1 Abstract Estimating the groun plane is often one of the first steps in geometric reasoning
More information6 Gradient Descent. 6.1 Functions
6 Graient Descent In this topic we will iscuss optimizing over general functions f. Typically the function is efine f : R! R; that is its omain is multi-imensional (in this case -imensional) an output
More informationLearning convex bodies is hard
Learning convex boies is har Navin Goyal Microsoft Research Inia navingo@microsoftcom Luis Raemacher Georgia Tech lraemac@ccgatecheu Abstract We show that learning a convex boy in R, given ranom samples
More informationYet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama and Hayato Ohwada Faculty of Sci. and Tech. Tokyo University of Scien
Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama an Hayato Ohwaa Faculty of Sci. an Tech. Tokyo University of Science, 2641 Yamazaki, Noa-shi, CHIBA, 278-8510, Japan hiroyuki@rs.noa.tus.ac.jp,
More informationVision-based Multi-Robot Simultaneous Localization and Mapping
Vision-base Multi-Robot Simultaneous Localization an Mapping Hassan Hajjiab an Robert Laganière VIVA Research Lab School of Information Technology an Engineering University of Ottawa, Ottawa, Canaa, K1N
More informationCalculation on diffraction aperture of cube corner retroreflector
November 10, 008 / Vol., No. 11 / CHINESE OPTICS LETTERS 8 Calculation on iffraction aperture of cube corner retroreflector Song Li (Ó Ø, Bei Tang (», an Hui Zhou ( ï School of Electronic Information,
More informationExploring Context with Deep Structured models for Semantic Segmentation
APPEARING IN IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, APRIL 2017. 1 Exploring Context with Deep Structure moels for Semantic Segmentation Guosheng Lin, Chunhua Shen, Anton van en
More informationState Indexed Policy Search by Dynamic Programming. Abstract. 1. Introduction. 2. System parameterization. Charles DuHadway
State Inexe Policy Search by Dynamic Programming Charles DuHaway Yi Gu 5435537 503372 December 4, 2007 Abstract We consier the reinforcement learning problem of simultaneous trajectory-following an obstacle
More informationMORA: a Movement-Based Routing Algorithm for Vehicle Ad Hoc Networks
: a Movement-Base Routing Algorithm for Vehicle A Hoc Networks Fabrizio Granelli, Senior Member, Giulia Boato, Member, an Dzmitry Kliazovich, Stuent Member Abstract Recent interest in car-to-car communications
More informationJo-Car2 Autonomous Mode. Path Planning (Cost Matrix Algorithm)
Chapter 8.2 Jo-Car2 Autonomous Mode Path Planning (Cost Matrix Algorithm) Introduction: In order to achieve its mission and reach the GPS goal safely; without crashing into obstacles or leaving the lane,
More informationComparison of Methods for Increasing the Performance of a DUA Computation
Comparison of Methos for Increasing the Performance of a DUA Computation Michael Behrisch, Daniel Krajzewicz, Peter Wagner an Yun-Pang Wang Institute of Transportation Systems, German Aerospace Center,
More informationEstimation of large-amplitude motion and disparity fields: Application to intermediate view reconstruction
c 2000 SPIE. Personal use of this material is permitte. However, permission to reprint/republish this material for avertising or promotional purposes or for creating new collective works for resale or
More informationA PSO Optimized Layered Approach for Parametric Clustering on Weather Dataset
Vol.3, Issue.1, Jan-Feb. 013 pp-504-508 ISSN: 49-6645 A PSO Optimize Layere Approach for Parametric Clustering on Weather Dataset Shikha Verma, 1 Kiran Jyoti 1 Stuent, Guru Nanak Dev Engineering College
More information1 Surprises in high dimensions
1 Surprises in high imensions Our intuition about space is base on two an three imensions an can often be misleaing in high imensions. It is instructive to analyze the shape an properties of some basic
More informationFINDING OPTICAL DISPERSION OF A PRISM WITH APPLICATION OF MINIMUM DEVIATION ANGLE MEASUREMENT METHOD
Warsaw University of Technology Faculty of Physics Physics Laboratory I P Joanna Konwerska-Hrabowska 6 FINDING OPTICAL DISPERSION OF A PRISM WITH APPLICATION OF MINIMUM DEVIATION ANGLE MEASUREMENT METHOD.
More informationQueueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks
Queueing Moel an Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Marc Aoun, Antonios Argyriou, Philips Research, Einhoven, 66AE, The Netherlans Department of Computer an Communication
More informationSkyline Community Search in Multi-valued Networks
Syline Community Search in Multi-value Networs Rong-Hua Li Beijing Institute of Technology Beijing, China lironghuascut@gmail.com Jeffrey Xu Yu Chinese University of Hong Kong Hong Kong, China yu@se.cuh.eu.h
More informationLocal Path Planning with Proximity Sensing for Robot Arm Manipulators. 1. Introduction
Local Path Planning with Proximity Sensing for Robot Arm Manipulators Ewar Cheung an Vlaimir Lumelsky Yale University, Center for Systems Science Department of Electrical Engineering New Haven, Connecticut
More informationOn Board 6D Visual Sensors for Intersection Driving Assistance Systems
On Board 6D Visual Sensors for Intersection Driving Assistance Systems S. Nedevschi, T. Marita, R. Danescu, F. Oniga, S. Bota, I. Haller, C. Pantilie, M. Drulea, C. Golban Sergiu.Nedevschi@cs.utcluj.ro
More informationSLAM in Dynamic Environments via ML-RANSAC
*Manuscript Clic here to view line References SLAM in Dynamic Environments via ML-RANSAC Masou S. Bahraini 1,2, Mohamma Bozorg 2, Ahma B. Ra 1* 1 School of Mechatronic Systems Engineering, Simon Fraser
More informationEXACT SIMULATION OF A BOOLEAN MODEL
Original Research Paper oi:10.5566/ias.v32.p101-105 EXACT SIMULATION OF A BOOLEAN MODEL CHRISTIAN LANTUÉJOULB MinesParisTech 35 rue Saint-Honoré 77305 Fontainebleau France e-mail: christian.lantuejoul@mines-paristech.fr
More informationCharacterizing Decoding Robustness under Parametric Channel Uncertainty
Characterizing Decoing Robustness uner Parametric Channel Uncertainty Jay D. Wierer, Wahee U. Bajwa, Nigel Boston, an Robert D. Nowak Abstract This paper characterizes the robustness of ecoing uner parametric
More informationA Versatile Model-Based Visibility Measure for Geometric Primitives
A Versatile Moel-Base Visibility Measure for Geometric Primitives Marc M. Ellenrieer 1,LarsKrüger 1, Dirk Stößel 2, an Marc Hanheie 2 1 DaimlerChrysler AG, Research & Technology, 89013 Ulm, Germany 2 Faculty
More informationKinematic Analysis of a Family of 3R Manipulators
Kinematic Analysis of a Family of R Manipulators Maher Baili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S. 6597 1, rue e la Noë, BP 92101,
More informationSpatio-Temporal Stereo Disparity Integration
Spatio-Temporal Stereo Disparity Integration Sandino Morales and Reinhard Klette The.enpeda.. Project, The University of Auckland Tamaki Innovation Campus, Auckland, New Zealand pmor085@aucklanduni.ac.nz
More informationShift-map Image Registration
Shift-map Image Registration Linus Svärm Petter Stranmark Centre for Mathematical Sciences, Lun University {linus,petter}@maths.lth.se Abstract Shift-map image processing is a new framework base on energy
More informationAN INVESTIGATION OF FOCUSING AND ANGULAR TECHNIQUES FOR VOLUMETRIC IMAGES BY USING THE 2D CIRCULAR ULTRASONIC PHASED ARRAY
AN INVESTIGATION OF FOCUSING AND ANGULAR TECHNIQUES FOR VOLUMETRIC IMAGES BY USING THE D CIRCULAR ULTRASONIC PHASED ARRAY S. Monal Lonon South Bank University; Engineering an Design 103 Borough Roa, Lonon
More informationResearch Article Inviscid Uniform Shear Flow past a Smooth Concave Body
International Engineering Mathematics Volume 04, Article ID 46593, 7 pages http://x.oi.org/0.55/04/46593 Research Article Invisci Uniform Shear Flow past a Smooth Concave Boy Abullah Mura Department of
More informationParticle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 17, No 3 Sofia 017 Print ISSN: 1311-970; Online ISSN: 1314-4081 DOI: 10.1515/cait-017-0030 Particle Swarm Optimization Base
More informationFusion Between Laser and Stereo Vision Data For Moving Objects Tracking In Intersection Like Scenario
Fusion Between Laser and Stereo Vision Data For Moving Objects Tracking In Intersection Like Scenario Qadeer Baig, Olivier Aycard, Trung Dung Vu and Thierry Fraichard Abstract Using multiple sensors in
More informationExercises of PIV. incomplete draft, version 0.0. October 2009
Exercises of PIV incomplete raft, version 0.0 October 2009 1 Images Images are signals efine in 2D or 3D omains. They can be vector value (e.g., color images), real (monocromatic images), complex or binary
More informationNEW METHOD FOR FINDING A REFERENCE POINT IN FINGERPRINT IMAGES WITH THE USE OF THE IPAN99 ALGORITHM 1. INTRODUCTION 2.
JOURNAL OF MEDICAL INFORMATICS & TECHNOLOGIES Vol. 13/009, ISSN 164-6037 Krzysztof WRÓBEL, Rafał DOROZ * fingerprint, reference point, IPAN99 NEW METHOD FOR FINDING A REFERENCE POINT IN FINGERPRINT IMAGES
More informationA Plane Tracker for AEC-automation Applications
A Plane Tracker for AEC-automation Applications Chen Feng *, an Vineet R. Kamat Department of Civil an Environmental Engineering, University of Michigan, Ann Arbor, USA * Corresponing author (cforrest@umich.eu)
More informationVerifying performance-based design objectives using assemblybased vulnerability
Verying performance-base esign objectives using assemblybase vulnerability K.A. Porter Calornia Institute of Technology, Pasaena, Calornia, USA A.S. Kiremijian Stanfor University, Stanfor, Calornia, USA
More informationEFFICIENT STEREO MATCHING BASED ON A NEW CONFIDENCE METRIC. Won-Hee Lee, Yumi Kim, and Jong Beom Ra
th European Signal Processing Conference (EUSIPCO ) Bucharest, omania, August 7-3, EFFICIENT STEEO MATCHING BASED ON A NEW CONFIDENCE METIC Won-Hee Lee, Yumi Kim, an Jong Beom a Department of Electrical
More informationSpherical Billboards and their Application to Rendering Explosions
Spherical Billboars an their Application to Renering Explosions Tamás Umenhoffer László Szirmay-Kalos Gábor Szijártó Department of Control Engineering an Information Technology Buapest University of Technology,
More informationModule13:Interference-I Lecture 13: Interference-I
Moule3:Interference-I Lecture 3: Interference-I Consier a situation where we superpose two waves. Naively, we woul expect the intensity (energy ensity or flux) of the resultant to be the sum of the iniviual
More informationd 3 d 4 d d d d d d d d d d d 1 d d d d d d
Proceeings of the IASTED International Conference Software Engineering an Applications (SEA') October 6-, 1, Scottsale, Arizona, USA AN OBJECT-ORIENTED APPROACH FOR MANAGING A NETWORK OF DATABASES Shu-Ching
More informationMachine vision. Summary # 11: Stereo vision and epipolar geometry. u l = λx. v l = λy
1 Machine vision Summary # 11: Stereo vision and epipolar geometry STEREO VISION The goal of stereo vision is to use two cameras to capture 3D scenes. There are two important problems in stereo vision:
More informationUNIT 9 INTERFEROMETRY
UNIT 9 INTERFEROMETRY Structure 9.1 Introuction Objectives 9. Interference of Light 9.3 Light Sources for 9.4 Applie to Flatness Testing 9.5 in Testing of Surface Contour an Measurement of Height 9.6 Interferometers
More informationfiltering LETTER An Improved Neighbor Selection Algorithm in Collaborative Taek-Hun KIM a), Student Member and Sung-Bong YANG b), Nonmember
107 IEICE TRANS INF & SYST, VOLE88 D, NO5 MAY 005 LETTER An Improve Neighbor Selection Algorithm in Collaborative Filtering Taek-Hun KIM a), Stuent Member an Sung-Bong YANG b), Nonmember SUMMARY Nowaays,
More informationGeneralized Edge Coloring for Channel Assignment in Wireless Networks
Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu Institute of Information Science Acaemia Sinica Taipei, Taiwan Da-wei Wang Jan-Jan Wu Institute of Information Science
More informationFlexible Calibration of a Portable Structured Light System through Surface Plane
Vol. 34, No. 11 ACTA AUTOMATICA SINICA November, 2008 Flexible Calibration of a Portable Structured Light System through Surface Plane GAO Wei 1 WANG Liang 1 HU Zhan-Yi 1 Abstract For a portable structured
More informationComputer Organization
Computer Organization Douglas Comer Computer Science Department Purue University 250 N. University Street West Lafayette, IN 47907-2066 http://www.cs.purue.eu/people/comer Copyright 2006. All rights reserve.
More informationAn Investigation in the Use of Vehicle Reidentification for Deriving Travel Time and Travel Time Distributions
An Investigation in the Use of Vehicle Reientification for Deriving Travel Time an Travel Time Distributions Carlos Sun Department of Civil an Environmental Engineering, University of Missouri-Columbia,
More informationNavigation Around an Unknown Obstacle for Autonomous Surface Vehicles Using a Forward-Facing Sonar
Navigation Aroun an nknown Obstacle for Autonomous Surface Vehicles sing a Forwar-Facing Sonar Patrick A. Plonski, Joshua Vaner Hook, Cheng Peng, Narges Noori, Volkan Isler Abstract A robotic boat is moving
More informationA T-Step Ahead Constrained Optimal Target Detection Algorithm for a Multi Sensor Surveillance System
A T-Step Ahea Constraine Optimal Target Detection Algorithm for a Multi Sensor Surveillance System K Mahava Krishna Henry Hexmoor an Shravan Sogani International Institute of Information Technology CSCE
More informationSection 20. Thin Prisms
OPTI-0/0 Geometrical an Instrumental Optics opyright 08 John E. Greivenkamp 0- Section 0 Thin Prisms Thin Prism Deviation Thin prisms introuce small angular beam eviations an are useful as alignment evices.
More informationA multiple wavelength unwrapping algorithm for digital fringe profilometry based on spatial shift estimation
University of Wollongong Research Online Faculty of Engineering an Information Sciences - Papers: Part A Faculty of Engineering an Information Sciences 214 A multiple wavelength unwrapping algorithm for
More informationLinear First-Order PDEs
MODULE 2: FIRST-ORDER PARTIAL DIFFERENTIAL EQUATIONS 9 Lecture 2 Linear First-Orer PDEs The most general first-orer linear PDE has the form a(x, y)z x + b(x, y)z y + c(x, y)z = (x, y), (1) where a, b,
More informationComparative Study of Projection/Back-projection Schemes in Cryo-EM Tomography
Comparative Stuy of Projection/Back-projection Schemes in Cryo-EM Tomography Yu Liu an Jong Chul Ye Department of BioSystems Korea Avance Institute of Science an Technology, Daejeon, Korea ABSTRACT In
More informationCS 106 Winter 2016 Craig S. Kaplan. Module 01 Processing Recap. Topics
CS 106 Winter 2016 Craig S. Kaplan Moule 01 Processing Recap Topics The basic parts of speech in a Processing program Scope Review of syntax for classes an objects Reaings Your CS 105 notes Learning Processing,
More informationStudy of Network Optimization Method Based on ACL
Available online at www.scienceirect.com Proceia Engineering 5 (20) 3959 3963 Avance in Control Engineering an Information Science Stuy of Network Optimization Metho Base on ACL Liu Zhian * Department
More informationTechnical Report TR Navigation Around an Unknown Obstacle for Autonomous Surface Vehicles Using a Forward-Facing Sonar
Technical Report Department of Computer Science an Engineering niversity of Minnesota 4-192 Keller Hall 2 nion Street SE Minneapolis, MN 55455-159 SA TR 15-5 Navigation Aroun an nknown Obstacle for Autonomous
More informationA new fuzzy visual servoing with application to robot manipulator
2005 American Control Conference June 8-10, 2005. Portlan, OR, USA FrA09.4 A new fuzzy visual servoing with application to robot manipulator Marco A. Moreno-Armenariz, Wen Yu Abstract Many stereo vision
More informationGeometry of Multiple views
1 Geometry of Multiple views CS 554 Computer Vision Pinar Duygulu Bilkent University 2 Multiple views Despite the wealth of information contained in a a photograph, the depth of a scene point along the
More informationStereo camera de-calibration detection based on observing kinematic attributes of detected objects and the camera rig
Technical University of Dortmund Stereo camera de-calibration detection based on observing kinematic attributes of detected objects and the camera rig by Venkata Rama Prasad Donda A thesis submitted in
More informationChapter 5 Proposed models for reconstituting/ adapting three stereoscopes
Chapter 5 Propose moels for reconstituting/ aapting three stereoscopes - 89 - 5. Propose moels for reconstituting/aapting three stereoscopes This chapter offers three contributions in the Stereoscopy area,
More informationAn Algorithm for Building an Enterprise Network Topology Using Widespread Data Sources
An Algorithm for Builing an Enterprise Network Topology Using Wiesprea Data Sources Anton Anreev, Iurii Bogoiavlenskii Petrozavosk State University Petrozavosk, Russia {anreev, ybgv}@cs.petrsu.ru Abstract
More informationTransactions on Information and Communications Technologies vol 16, 1996 WIT Press, ISSN
ransactions on Information and Communications echnologies vol 6, 996 WI Press, www.witpress.com, ISSN 743-357 Obstacle detection using stereo without correspondence L. X. Zhou & W. K. Gu Institute of Information
More informationCoupling the User Interfaces of a Multiuser Program
Coupling the User Interfaces of a Multiuser Program PRASUN DEWAN University of North Carolina at Chapel Hill RAJIV CHOUDHARY Intel Corporation We have evelope a new moel for coupling the user-interfaces
More informationFeature Extraction and Rule Classification Algorithm of Digital Mammography based on Rough Set Theory
Feature Extraction an Rule Classification Algorithm of Digital Mammography base on Rough Set Theory Aboul Ella Hassanien Jafar M. H. Ali. Kuwait University, Faculty of Aministrative Science, Quantitative
More informationData Mining: Clustering
Bi-Clustering COMP 790-90 Seminar Spring 011 Data Mining: Clustering k t 1 K-means clustering minimizes Where ist ( x, c i t i c t ) ist ( x m j 1 ( x ij i, c c t ) tj ) Clustering by Pattern Similarity
More informationA Panoramic Stereo Imaging System for Aircraft Guidance
A Panoramic Stereo Imaging System for Aircraft Guiance Saul Thurrowgoo 1, Wolfgang Stuerzl 2, Dean Soccol 1, Manyam Srinivasan 1 1 Biorobotics Laboratory, Queenslan Brain Institute The University of Queenslan,
More informationComputer Graphics Inf4/MSc. Computer Graphics. Lecture 6 View Projection Taku Komura
Computer Graphics Lecture 6 View Projection Taku Komura 1 Overview 1. View transformation 2. Rasterisation Implementation of viewing. Transform into camera coorinates. Perform projection into view volume
More informationA Framework for Dialogue Detection in Movies
A Framework for Dialogue Detection in Movies Margarita Kotti, Constantine Kotropoulos, Bartosz Ziólko, Ioannis Pitas, an Vassiliki Moschou Department of Informatics, Aristotle University of Thessaloniki
More information