Shift-map Image Registration
|
|
- Abigail Goodman
- 6 years ago
- Views:
Transcription
1 Shift-map Image Registration Linus Svärm Petter Stranmark Centre for Mathematical Sciences, Lun University Abstract Shift-map image processing is a new framework base on energy minimization over a large space of labels. The optimization utilizes α-expansion moves an iterative refinement over a Gaussian pyrami. In this paper we exten the range of applications to image registration. To o this, new ata an smoothness terms have to be constructe. We note a great improvement when we measure pixel similarities with the ense DAISY escriptor. The main contributions of this paper are: The extension of the shift-map framework to inclue image registration. We register images for which SIFT only provies 3 correct matches. A publicly available implementation of shift-map image processing (e.g. inpainting, registration). We conclue by comparing shift-map registration to a recent metho for optical flow with favorable results. 1 Introuction to shift-maps Shift-map image processing has recently [8] been introuce an applie to image inpainting, content aware resizing, texture synthesis an image rearrangement. This paper will exten the range of applications to image registration. The motivation behin this work is the fact that we alreay were in possession of images we foun to be impossible to register using stanar methos (e.g. SIFT corresponences). The results we obtaine with shift-map registration seem promising. 1.1 Problem formulation Registration can be performe using a parametric moel, e.g. an affine or a projective transformation estimate from point corresponences between the two images. In this paper, we consier a non-parametric (c) shift-map () final location of pixels Figure 1. Registration of two images using a shift-map. Each pixel in the input image is place on the base image as escribe by the shift-map. moel. We have a base image B(i, j) an an input image I(i, j). These two image nee not have the same size. The goal is to register the pixels of the input image ( onto the base ) image using a shift-map T(i, j) = t i (i, j), t j (i, j). The pixel I(i, j) is registere onto ( ) B i + t i (i, j), j + t j (i, j). Figure 1 shows the input an base images an the resulting image obtaine by moving all pixels in the input image as specifie by the compute shift-map. Each possible shift-map is assigne an energy, base on a priori assumptions on what a goo shift-map typically looks like an how well the two images match each other. The goal is then to fin the optimal shift-
2 efficient ense computation. In orer to choose relevant parameters, we foun [10] helpful. Figure 2. Shift-map between two images map, that is, the shift-map with the lowest energy: E(T) = α (T(i, j))+ 1 i m (i,j ) 1 j n 1 i m 1 j n s (T(i, j), T(i, j )), where the last summation refers to summations over all (i, j ) in a neighborhoo N (i, j) of (i, j). Figure 2 one such neighbor. We have use 4-connectivity of ajacent pixels throughout this paper. an Eij s are the ata terms an smoothness terms, respectively. They will be escribe in separate sections below. 2 Registration energy terms (1) The methos in [8] eal with constructing a new image from an ol one an the registration problem is about fining a map between two existing images. Hence the energy previously use for fining shift-maps is not suitable for registration an new energy terms must be constructe. Comparison of pixels A relate problem to image registration is ense epth estimation from two images of the same object with known camera positions. This problem has been stuie extensively, see for example [5]. Recently a new escriptor, DAISY, was propose by Tola et al. [9], tailore to ense stereo estimation where the position of the two cameras iffer by a large amount. This escriptor is shown to outperform other approaches (e.g. SIFT, SURF an pixel ifferences) in extensive experiments. Therefore, it seems relevant to try an apply this escriptor to the relate problem of estimating a ense image registration. Not unlike SIFT [7], a DAISY escriptor samples the image erivative in ifferent irections. Eight ifferent irections an three ifferent scales are use. By sampling these fiels at ifferent points aroun the feature location, a escriptor of imensionality 200 is obtaine. Since the same fiels are use for all image locations, a ense fiel of escriptors can be compute in a couple of secons. The main goal of the DAISY escriptor was Data terms The ata terms were previously use in [8] to enforce har constraints on the shift-map. When inpainting an image, the ata term makes sure no pixels in the hole are use in the output image by assigning such shifts a cost of. In this paper, where image registration is consiere, we nee to evelop more complex ata terms to incorporate the fact that we want to fin a mapping between two images such that similar pixels are mappe to similar pixels The ata terms ictates that similar parts of the images shoul en up on top of each other. To measure similarity, ense DAISY is use. It might only be possible to register parts of the input image, so shifting pixels outsie the base image is permitte, at a constant cost P per pixel. The ata terms are then given by (T) = { Î(i, j) ˆB( (i, j) + T(i, j) ) 2 P when (i, j) + T(i, j) is outsie B, (2) where Î(i, j) is the DAISY escriptor escribing the image I at pixel location (i, j). If the shift takes pixel (i, j) outsie the bouns of the base image, a constant cost is issue. Otherwise, issimilarity of the pixels etermines the cost of the assignment. Figure 6f shows a heat map of the istance from the circle feature in the first row to all locations in the image in row 2. Smoothness terms The smoothness terms are use to enforce global consistency to the shift-map, while allowing iscontinuities at a limite number of places. In [8], the smoothness terms compare the color an graient pixel-wise. Where a iscontinuity in the shiftmap occurs, the penalty is compute as the ifference in color an graients. Our smoothness function takes the form of the Eucliean istance between the enpoints of the two shifts: s (T(i, j), T(i, j )) = (i, j ) + T(i, j ) (i, j) T(i, j) 2. (3) Here, (i, j) an (i, j ) are neighboring pixels, see (1). Using the shift ifference T(i, j ) T(i, j) 2 will penalize smoothly varying shift-maps too much, an hence it is important to compare the en points (as in (3)). Color information The DAISY escriptor oes not use color information, yet intuitively it makes little
3 sense to match pixels of very ifferent colors. Because of this, we have also mae experiments where the color information of the images are incorporate into the above ata terms. The color moel use assigne a cost of P to pixels with large ifference in hue, given that the intensity an saturation allowe a reliable value of the hue. This moel improve the result of the registration in Fig. 6. We i not use color information in the experiment shown in Fig Experiments To minimize the energy (1), we use α-expansion as escribe by Boykov an Veksler [3] with the graph algorithms escribe in [2, 4]. Each possible shift value T(i, j) { m... m} { n... n} is mappe to a 1D label space. The number of labels for even moerately size images then becomes very large. In orer to make it tractable, a Gaussian pyrami was use. For the images in Fig. 6, an initial size of was use. The size was ouble 3 times until the final resolution of was reache. Each oubling of the image size is followe by a linear interpolation of the shiftmap. This shift-map was use as a starting guess for the optimization at the larger level. At each level after the first, only 9 possible shifts then nee to be consiere: { 1, 0, 1} in each irection. To verify our implementation, we inpainte an example image use in [8], see Fig. 5. We trie to follow their implementation as closely as possible an got ifferent, but qualitatively similar results. We i not allow the pixels outsie the area to be remove to move at all, which is in contrast to [8], where all pixels except the borer of the image were allowe to be shifte. Figures 1 an 3 show shift-map registration results. The bear image in Fig. 1 shows the same object from two ifferent views an is from [6]. The builing images in 3 register correctly, except for the light pole, which is very thin an oes not have a large enough ata term. We have also conucte an experiment where we use shift-maps to recover a known image eformation. The results are isplaye in Fig. 4. During large-scale reconstruction of a city using images taken with a cylinrical camera [1], we have encountere many ifficult image pairs where SIFT is unable to provie useful corresponences. The top two rows in Fig. 6 show one of the harest. Compute SIFT features for the two images (794 an 1019 feature points, respectively) only yiele 3 correct matches. The main reason for this was the image geometry an large, repetitive patterns. Using shift-map we obtaine a ense, mostly correct map between the images. This (c) final location of pixels Figure 3. Registration of two images of a builing. was then use as an ai to compute SIFT corresponences. We then obtaine 28 matches, of which 12 were correct. The runtime for this image was about 2 minutes. We compare shift-map registration to the optical flow algorithm escribe in [11]. This algorithm i not prouce useful results for the street images, see bottom of Fig. 6. Optical flow techniques are arguably not suitable for these kins of registration tasks. 4 Conclusion an further work We have stuie the application of shift-maps to image registration. Computing the smoothness term with color an graient ifferences as in [8] i not give satisfactory results when extene to image registra-
4 (a) base image (b) input image (c) Shift-map result () Groun truth (e) error Figure 4. Recovering a known image istorsion. The maximum an mean error was 7.3 an 0.7 pixels, respectively. Photo by Tristan Savatier obtaine through Flickr. gramme Wearable Visual Information Systems an by the European Research Council (GlobalVision grant no ). The authors ha several useful iscussions with Klas Josephson an Olof Enqvist. References Figure 5. Our reimplementation of the algorithm in [8]. The complete running time for this example was secons2. tion, but we foun a great improvement with the ense DAISY escriptor. For relatively easy cases (Figs. 1 an 3), we obtaine very goo results. For very har cases (Fig. 6) we obtaine results which prove very useful for obtaining corresponences between the images. We compare shift-map registration to the optical flow algorithm escribe in [11] (Fig. 6e), which was significantly less accurate. One interesting future line of work woul be to investigate whether shift-map inpainting can be improve by the DAISY escriptor as well. We have also not investigate large rotations in this paper, which woul require aitional consierations. The source coe for our shift-map implementation an for all experiments in this paper has been release to the public1. Acknowlegements This work has been fune by the Sweish Founation for Strategic Research (SSF) through the pro1 2 The fact that the running time in secons closely approximates π is purely coinciental. [1] Hitta.se streetview, C3 Technologies, [2] Y. Boykov an V. Kolmogorov. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Trans. Pattern Analysis an Machine Intelligence, 26(9): , Sept [3] Y. Boykov, O. Veksler, an R. Zabih. Fast approximate energy minimization via graph cuts. IEEE Trans. Pattern Analysis an Machine Intelligence, 23(11): , Nov [4] V. Kolmogorov an R. Zabih. What energy functions can be minimize via graph cuts? IEEE Trans. Pattern Analysis an Machine Intelligence, 26(2): , [5] V. Kolmogorov an R. Zabih. Graph cut algorithms for binocular stereo with occlusions. In Hanbook of Mathematical Moels in Computer Vision. Springer, [6] A. Kushal an J. Ponce. Moeling 3D objects from stereo views an recognizing them in photographs. In European Conf. Computer Vision, [7] D. Lowe. Distinctive image features from scaleinvariant keypoints. Int. Journal Computer Vision, 20:91 110, [8] Y. Pritch, E. Kav-Venaki, an S. Peleg. Shift-map image eiting. In Int. Conf. Computer Vision, [9] E. Tola, V. Lepetit, an P. Fua. Daisy: An efficient ense escriptor applie to wie baseline stereo. IEEE Trans. Pattern Analysis an Machine Intelligence, [10] S. Winer, G. Hua, an M. Brown. Picking the best DAISY. In Conf. Computer Vision an Pattern Recognition, pages IEEE, [11] C. Zach, T. Pock, an H. Bischof. A uality base approach for realtime TV-L1 optical flow. In Pattern Recognition (Proc. DAGM), pages , 2007.
5 (c) final locations of the pixels in I () resulting shift-map (e) result using the metho in [11] (f) DAISY istance between the circle feature in I to all pixel locations in B Figure 6. Registration of Hitta images. We note that we achieve a ense, highly nonlinear registration. This shift-map allowe us to obtain useful point-corresponences between the images, which was not possible using SIFT alone.
Shift-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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationOptimal path planning in a constant wind with a bounded turning rate
Optimal path planning in a constant win with a boune turning rate Timothy G. McGee, Stephen Spry an J. Karl Herick Center for Collaborative Control of Unmanne Vehicles, University of California, Berkeley,
More informationIntensive Hypercube Communication: Prearranged Communication in Link-Bound Machines 1 2
This paper appears in J. of Parallel an Distribute Computing 10 (1990), pp. 167 181. Intensive Hypercube Communication: Prearrange Communication in Link-Boun Machines 1 2 Quentin F. Stout an Bruce Wagar
More informationA Cost Model For Nearest Neighbor Search. High-Dimensional Data Space
A Cost Moel For Nearest Neighbor Search in High-Dimensional Data Space Stefan Berchtol University of Munich Germany berchtol@informatikuni-muenchene Daniel A Keim University of Munich Germany keim@informatikuni-muenchene
More informationA Discrete Search Method for Multi-modal Non-Rigid Image Registration
A Discrete Search Metho for Multi-moal on-rigi Image Registration Alexaner Shekhovtsov Juan D. García-Arteaga Tomáš Werner Center for Machine Perception, Dept. of Cybernetics Faculty of Electrical Engineering,
More informationVideo-based Characters Creating New Human Performances from a Multi-view Video Database
Vieo-base Characters Creating New Human Performances from a Multi-view Vieo Database Feng Xu Yebin Liu? Carsten Stoll? James Tompkin Gaurav Bharaj? Qionghai Dai Hans-Peter Seiel? Jan Kautz Christian Theobalt?
More informationMultilevel Linear Dimensionality Reduction using Hypergraphs for Data Analysis
Multilevel Linear Dimensionality Reuction using Hypergraphs for Data Analysis Haw-ren Fang Department of Computer Science an Engineering University of Minnesota; Minneapolis, MN 55455 hrfang@csumneu ABSTRACT
More informationGeneralized Edge Coloring for Channel Assignment in Wireless Networks
TR-IIS-05-021 Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu, Pangfeng Liu, Da-Wei Wang, Jan-Jan Wu December 2005 Technical Report No. TR-IIS-05-021 http://www.iis.sinica.eu.tw/lib/techreport/tr2005/tr05.html
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 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 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 informationCluster Center Initialization Method for K-means Algorithm Over Data Sets with Two Clusters
Available online at www.scienceirect.com Proceia Engineering 4 (011 ) 34 38 011 International Conference on Avances in Engineering Cluster Center Initialization Metho for K-means Algorithm Over Data Sets
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 informationBIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES
BIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES OLIVIER BERNARDI AND ÉRIC FUSY Abstract. We present bijections for planar maps with bounaries. In particular, we obtain bijections for triangulations an quarangulations
More informationCONSTRUCTION AND ANALYSIS OF INVERSIONS IN S 2 AND H 2. Arunima Ray. Final Paper, MATH 399. Spring 2008 ABSTRACT
CONSTUCTION AN ANALYSIS OF INVESIONS IN S AN H Arunima ay Final Paper, MATH 399 Spring 008 ASTACT The construction use to otain inversions in two-imensional Eucliean space was moifie an applie to otain
More informationHere are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.
Preface Here are my online notes for my Calculus I course that I teach here at Lamar University. Despite the fact that these are my class notes, they shoul be accessible to anyone wanting to learn Calculus
More informationEvolutionary Optimisation Methods for Template Based Image Registration
Evolutionary Optimisation Methos for Template Base Image Registration Lukasz A Machowski, Tshilizi Marwala School of Electrical an Information Engineering University of Witwatersran, Johannesburg, South
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 informationImage compression predicated on recurrent iterated function systems
2n International Conference on Mathematics & Statistics 16-19 June, 2008, Athens, Greece Image compression preicate on recurrent iterate function systems Chol-Hui Yun *, Metzler W. a an Barski M. a * Faculty
More informationAnimated Surface Pasting
Animate Surface Pasting Clara Tsang an Stephen Mann Computing Science Department University of Waterloo 200 University Ave W. Waterloo, Ontario Canaa N2L 3G1 e-mail: clftsang@cgl.uwaterloo.ca, smann@cgl.uwaterloo.ca
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 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 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 informationRough Set Approach for Classification of Breast Cancer Mammogram Images
Rough Set Approach for Classification of Breast Cancer Mammogram Images Aboul Ella Hassanien Jafar M. H. Ali. Kuwait University, Faculty of Aministrative Science, Quantitative Methos an Information Systems
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 informationCONTENT-BASED RETRIEVAL OF DEFECT IMAGES. Jukka Iivarinen and Jussi Pakkanen
Proceeings of ACIVS 2002 (Avance Concepts for Intelligent Vision Systems), Ghent, Belgium, September 9-11, 2002 CONTENT-BASED RETRIEVAL OF DEFECT IMAGES Jukka Iivarinen an Jussi Pakkanen jukka.iivarinen@hut.fi,
More informationModifying ROC Curves to Incorporate Predicted Probabilities
Moifying ROC Curves to Incorporate Preicte Probabilities Cèsar Ferri DSIC, Universitat Politècnica e València Peter Flach Department of Computer Science, University of Bristol José Hernánez-Orallo DSIC,
More informationSampling the Disparity Space Image
Accepte for publication, June 2003. To appear in IEEE Transactions on Pattern Analysis an Machine Intelligence (PAMI) Sampling the Disparity Space Image Richar Szeliski Daniel Scharstein Microsoft Research
More informationUsing Ray Tracing for Site-Specific Indoor Radio Signal Strength Analysis 1
Using Ray Tracing for Site-Specific Inoor Raio Signal Strength Analysis 1 Michael Ni, Stephen Mann, an Jay Black Computer Science Department, University of Waterloo, Waterloo, Ontario, NL G1, Canaa Abstract
More informationApproximation with Active B-spline Curves and Surfaces
Approximation with Active B-spline Curves an Surfaces Helmut Pottmann, Stefan Leopolseer, Michael Hofer Institute of Geometry Vienna University of Technology Wiener Hauptstr. 8 10, Vienna, Austria pottmann,leopolseer,hofer
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 informationPolygon Simplification by Minimizing Convex Corners
Polygon Simplification by Minimizing Convex Corners Yeganeh Bahoo 1, Stephane Durocher 1, J. Mark Keil 2, Saee Mehrabi 3, Sahar Mehrpour 1, an Debajyoti Monal 1 1 Department of Computer Science, University
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 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 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 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 informationIntroduction à la vision artificielle X
Introduction à la vision artificielle X Jean Ponce Email: ponce@di.ens.fr Web: http://www.di.ens.fr/~ponce Planches après les cours sur : http://www.di.ens.fr/~ponce/introvis/lect10.pptx http://www.di.ens.fr/~ponce/introvis/lect10.pdf
More informationNon-homogeneous Generalization in Privacy Preserving Data Publishing
Non-homogeneous Generalization in Privacy Preserving Data Publishing W. K. Wong, Nios Mamoulis an Davi W. Cheung Department of Computer Science, The University of Hong Kong Pofulam Roa, Hong Kong {wwong2,nios,cheung}@cs.hu.h
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 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 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 informationAPPLYING GENETIC ALGORITHM IN QUERY IMPROVEMENT PROBLEM. Abdelmgeid A. Aly
International Journal "Information Technologies an Knowlege" Vol. / 2007 309 [Project MINERVAEUROPE] Project MINERVAEUROPE: Ministerial Network for Valorising Activities in igitalisation -
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 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 informationA Convex Clustering-based Regularizer for Image Segmentation
Vision, Moeling, an Visualization (2015) D. Bommes, T. Ritschel an T. Schultz (Es.) A Convex Clustering-base Regularizer for Image Segmentation Benjamin Hell (TU Braunschweig), Marcus Magnor (TU Braunschweig)
More informationObject Recognition Using Colour, Shape and Affine Invariant Ratios
Object Recognition Using Colour, Shape an Affine Invariant Ratios Paul A. Walcott Centre for Information Engineering City University, Lonon EC1V 0HB, Englan P.A.Walcott@city.ac.uk Abstract This paper escribes
More informationSTEREOSCOPIC ROBOT VISION SYSTEM
Palinko Oskar, ipl. eng. Facult of Technical Sciences, Department of Inustrial Sstems Engineering an Management, 21 000 Novi Sa, Dositej Obraovic Square 6, Serbia & Montenegro STEREOSCOPIC ROBOT VISION
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 informationPolitehnica University of Timisoara Mobile Computing, Sensors Network and Embedded Systems Laboratory. Testing Techniques
Politehnica University of Timisoara Mobile Computing, Sensors Network an Embee Systems Laboratory ing Techniques What is testing? ing is the process of emonstrating that errors are not present. The purpose
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 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 informationTracking and Regulation Control of a Mobile Robot System With Kinematic Disturbances: A Variable Structure-Like Approach
W. E. Dixon e-mail: wixon@ces.clemson.eu D. M. Dawson e-mail: awson@ces.clemson.eu E. Zergeroglu e-mail: ezerger@ces.clemson.eu Department of Electrical & Computer Engineering, Clemson University, Clemson,
More informationDigital fringe profilometry based on triangular fringe patterns and spatial shift estimation
University of Wollongong Research Online Faculty of Engineering an Information Sciences - Papers: Part A Faculty of Engineering an Information Sciences 4 Digital fringe profilometry base on triangular
More informationPDE-BASED INTERPOLATION METHOD FOR OPTICALLY VISUALIZED SOUND FIELD. Kohei Yatabe and Yasuhiro Oikawa
4 IEEE International Conference on Acoustic, Speech an Signal Processing (ICASSP) PDE-BASED INTERPOLATION METHOD FOR OPTICALLY VISUALIZED SOUND FIELD Kohei Yatabe an Yasuhiro Oikawa Department of Intermeia
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 informationBends, Jogs, And Wiggles for Railroad Tracks and Vehicle Guide Ways
Ben, Jogs, An Wiggles for Railroa Tracks an Vehicle Guie Ways Louis T. Klauer Jr., PhD, PE. Work Soft 833 Galer Dr. Newtown Square, PA 19073 lklauer@wsof.com Preprint, June 4, 00 Copyright 00 by Louis
More informationUninformed search methods
CS 1571 Introuction to AI Lecture 4 Uninforme search methos Milos Hauskrecht milos@cs.pitt.eu 539 Sennott Square Announcements Homework assignment 1 is out Due on Thursay, September 11, 014 before the
More informationNearest Neighbor Search using Additive Binary Tree
Nearest Neighbor Search using Aitive Binary Tree Sung-Hyuk Cha an Sargur N. Srihari Center of Excellence for Document Analysis an Recognition State University of New York at Buffalo, U. S. A. E-mail: fscha,sriharig@cear.buffalo.eu
More informationPreamble. Singly linked lists. Collaboration policy and academic integrity. Getting help
CS2110 Spring 2016 Assignment A. Linke Lists Due on the CMS by: See the CMS 1 Preamble Linke Lists This assignment begins our iscussions of structures. In this assignment, you will implement a structure
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 informationAd-Hoc Networks Beyond Unit Disk Graphs
A-Hoc Networks Beyon Unit Disk Graphs Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger Department of Computer Science ETH Zurich 8092 Zurich, Switzerlan {kuhn, wattenhofer, zollinger}@inf.ethz.ch ABSTRACT
More informationLesson 11 Interference of Light
Physics 30 Lesson 11 Interference of Light I. Light Wave or Particle? The fact that light carries energy is obvious to anyone who has focuse the sun's rays with a magnifying glass on a piece of paper an
More informationBayesian localization microscopy reveals nanoscale podosome dynamics
Nature Methos Bayesian localization microscopy reveals nanoscale poosome ynamics Susan Cox, Ewar Rosten, James Monypenny, Tijana Jovanovic-Talisman, Dylan T Burnette, Jennifer Lippincott-Schwartz, Gareth
More informationImplicit and Explicit Functions
60_005.q //0 :5 PM Page SECTION.5 Implicit Differentiation Section.5 EXPLORATION Graphing an Implicit Equation How coul ou use a graphing utilit to sketch the graph of the equation? Here are two possible
More informationSolution Representation for Job Shop Scheduling Problems in Ant Colony Optimisation
Solution Representation for Job Shop Scheuling Problems in Ant Colony Optimisation James Montgomery, Carole Faya 2, an Sana Petrovic 2 Faculty of Information & Communication Technologies, Swinburne University
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 informationInvestigation into a new incremental forming process using an adjustable punch set for the manufacture of a doubly curved sheet metal
991 Investigation into a new incremental forming process using an ajustable punch set for the manufacture of a oubly curve sheet metal S J Yoon an D Y Yang* Department of Mechanical Engineering, Korea
More information3D CITY REGISTRATION AND ENRICHMENT
3D CITY REGISTRATION AND ENRICHMENT J. A. Quinn, P. D. Smart an C. B. Jones School of Computer Science, Cariff University {j.a.quinn, p.smart, c.b.jones}@cs.cf.ac.uk KEY WORDS: City moels, registration,
More informationI. Introuction With the evolution of imaging technology, an increasing number of image moalities becomes available. In remote sensing, sensors are use
A multivalue image wavelet representation base on multiscale funamental forms P. Scheuners Vision Lab, Department ofphysics, University ofantwerp, Groenenborgerlaan 7, 00 Antwerpen, Belgium Tel.: +3/3/8
More informationA Formal Model and Efficient Traversal Algorithm for Generating Testbenches for Verification of IEEE Standard Floating Point Division
A Formal Moel an Efficient Traversal Algorithm for Generating Testbenches for Verification of IEEE Stanar Floating Point Division Davi W. Matula, Lee D. McFearin Department of Computer Science an Engineering
More informationWhat have we leaned so far?
What have we leaned so far? Camera structure Eye structure Project 1: High Dynamic Range Imaging What have we learned so far? Image Filtering Image Warping Camera Projection Model Project 2: Panoramic
More informationSURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH
SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH Galen H Sasaki Dept Elec Engg, U Hawaii 2540 Dole Street Honolul HI 96822 USA Ching-Fong Su Fuitsu Laboratories of America 595 Lawrence Expressway
More informationOn the Placement of Internet Taps in Wireless Neighborhood Networks
1 On the Placement of Internet Taps in Wireless Neighborhoo Networks Lili Qiu, Ranveer Chanra, Kamal Jain, Mohamma Mahian Abstract Recently there has emerge a novel application of wireless technology that
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 informationImproving Spatial Reuse of IEEE Based Ad Hoc Networks
mproving Spatial Reuse of EEE 82.11 Base A Hoc Networks Fengji Ye, Su Yi an Biplab Sikar ECSE Department, Rensselaer Polytechnic nstitute Troy, NY 1218 Abstract n this paper, we evaluate an suggest methos
More informationA shortest path algorithm in multimodal networks: a case study with time varying costs
A shortest path algorithm in multimoal networks: a case stuy with time varying costs Daniela Ambrosino*, Anna Sciomachen* * Department of Economics an Quantitative Methos (DIEM), University of Genoa Via
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 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 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 information1 Shortest Path Problems
CS268: Geometric Algorithms Hanout #7 Design an Analysis Original Hanout #18 Stanfor University Tuesay, 25 February 1992 Original Lecture #8: 4 February 1992 Topics: Shortest Path Problems Scribe: Jim
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 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 informationThe Panum Proxy algorithm for dense stereo matching over a volume of interest
The Panum Proxy algorithm for ense stereo matching over a volume of interest A. Agarwal an A. Blake Microsoft Research Lt. 7 J J Thomson Ave, Cambrige, CB3 FB, UK http://research.microsoft.com/vision/cambrige
More information