AUTOMATIC 3D SURFACE RECONSTRUCTION BY COMBINING STEREOVISION WITH THE SLIT-SCANNER APPROACH
|
|
- Herbert Bradford
- 6 years ago
- Views:
Transcription
1 AUTOMATIC 3D SURFACE RECONSTRUCTION BY COMBINING STEREOVISION WITH THE SLIT-SCANNER APPROACH A. Prokos 1, G. Karras 1, E. Petsa 2 1 Deartment of Surveying, National Technical University of Athens (NTUA), GR Athens, Greece 2 Deartment of Surveying, Technological Educational Institute of Athens (TEI-A), GR Athens, Greece anthro@central.ntua.gr, gkarras@central.ntua.gr, etsa@teiath.gr KEY WORDS: hotogrammetric scanning, surface reconstruction, triangulation, eiolar geometry, camera calibration ABSTRACT: In this aer, a 3D surface scanner is resented. Combining stereovision and slit-scanning, our system is comosed of two cameras and a hand-held laser lane. The camera air is calibrated using synchronized image airs of a coded chessboard; its imaged nodes are automatically identified, referred to the object oints and introduced into a self-calibrating bundle adjustment. For the scanning rocess, stereoscoic rofiles are continuously recorded as the 3D surface is swet by the laser line. After eiolar resamling of the synchronized image airs, search for oint corresondences is thus reduced to identifying intersections of image rows with the recorded laser rofiles. The maxima of Gaussian curves fitted to the gray-value data along the eiolar image rows rovide initial estimates for eak ositions, which are then refined using information from their neighbourhood. In our setu, 3D reconstruction by simle stereovision is strengthened by enforcing extra geometric constraints. First, the colanarity constraint is imosed on all 3D oints reconstructed from a single laser strie, and the coefficients of all laser lanes articiate as unknowns in the 3D reconstruction adjustment. Additionally, this also allows identifying mismatches since eiolar lines may have more than one eaks; the correct 3D oint is established according to a distance threshold from the laser lane. The solution is further reinforced by lacing the object in a corner formed by two background lanes (which are scanned along with the object), whose coefficients are also unknowns in the 3D reconstruction adjustment. The linear laser segments roduced on either side of the object have to satisfy the equation of both the corresonding lane and the laser lane. Image airs of the corner without the object (longer laser segments) are added to the dataset for a more accurate determination of lane equations. Results are resented and evaluated from this setu, whose tyical accuracy is estimated in the order of 0.2 mm in 3D deth estimation. 1. INTRODUCTION Recent years are witness to a growing demand for 3D surface models in several fields (e.g. cultural heritage documentation or industrial metrology). Ideally, the 3D models must be generated raidly and accurately by automatic techniques. As a resonse to this demand, a number of image-based scanners, both commercial and low-cost ones, have been reorted (Forest & Salvi, 2002; Blais, 2004). Of course, stereovision remains a standard aroach. Its main roblem is finding oint corresondences, in articular when dealing with surfaces of low texture. A way to overcome this roblem is relacing the second camera by devices which roject various atterns (e.g. structured light) but can be as simle as a laser lane. Most common among such triangulation-based range-finders are those using laser lanes (i.e. rojection of laser stries), also referred to a slit-scanners. Such systems tyically combine a camera and a rojected laser lane which intersects the object surface to highlight a rofile. The 3D oints of each rofile are found (without redundancy) as intersections of the laser lane and the rojection rays defined by the resective image oints of the rofile. Thanks to its simlicity, several low-cost systems of the slitscanner tye have been reorted. If the laser lane is moved by hand indeendently from the camera, its osition in sace must be calculated for each image. In Zagorchev & Goshtasby (2006) this is achieved through the intersection of the laser lane with a reference double-frame, whereas Winkelbach et al. (2006) use two external orthogonal lanes intersected by the laser lane. A scanner with simler comonents is that of Bouguet & Perona (1998) using one camera and the shadow roduced form a handheld moving rod. In a very interesting imlementation, Kawasaki & Furukawa (2007) use the mere fact that laser lines define colanar object rofiles (imlicit colanarity) to acquire dense 3D data, while also exloiting colanarity information from object lanes in the scene (exlicit colanarity). Projective results are ugraded to Euclidean via suitable constraints, e.g. orthogonal lanes (if necessary, the constraints are sulied by a device roducing two orthogonal laser lanes). Following Prokos et al. (2009), this aer resents a low-cost hotogrammetric range-finder which combines stereovision and the slit-scanner rincile. The two web cameras are automatically calibrated to rovide both their interior orientations and their true to scale relative orientation. A laser lane generator is used to code the scene and, hence, simlify the corresondence roblem to a eak detection question. Our setu is, essentially, similar to that of Davis & Chen (2001), yet the straightforward solution from stereovision is here enhanced by additional geometric constraints. The fact that all oints on a single laser rofile belong to the same lane (laser lane) is exloited to ose a colanarity constraint to these oints. Furthermore, the 3D object is laced in the corner formed by two unknown intersecting lanes; thus, the end-segments of the deicted laser rofiles (intersections s 1, s 2 with the background lanes 1, 2 in Fig. 1) are straight. This is exloited to introduce a further colanarity constraint as each such segment also belongs to the corresonding background lane. The equations of these lanes are estimated in the reconstruction algorithm (in which, along with the image airs for surface scanning, images of the lanes without the object may also articiate). It is to note that this (otional) second colanarity constraint is not always used, since the linear rofile end-segments may not be sufficiently long to rovide reliable data if larger image arts are occuied by the 3D object (this allows higher resolution in object sace). 505
2 2. SYSTEM DESCRIPTION The system consists of a air of web cameras in fixed relative osition and a hand-held laser strie generator. The 3D object is laced close to the intersection of two (unknown) background lanes. Thus, the hardware comonents of the system are: Two 640x480 colour web cameras, fixed in a constant relative osition throughout the rocess. The system is calibrated automatically as exlained below. In a tyical alication, the mean ixel size in object sace is ~0.8 mm. A green line laser with adjustable focus, allowing width of the laser line ~0.5 mm. A tyical black-and-white chessboard attern (with one red square to fix the object system) for calibration uroses. Two lanes 1, 2 forming a corner (otional). O left image q hand-held laser Figure 1. The system setu Q s 1 s 2 2 laser lane 1 right image As the 3D object surface is manually swet over with the laser strie, the cameras cature synchronized frames of the scene recording the object, the background lanes and the laser strie which codes the scene. If homologous oints q, q of the laser rofile are identified, the rojective rays thereby defined intersect at the 3D oint Q (Fig. 1). In addition, all 3D oints resulting from a single laser rofile are bound to be colanar (on the laser lane). Furthermore, all 3D oints reconstructed from laser rofiles on a background lane must simultaneously belong to yet another lane (the corresonding background lane). These two constraints introduce a significant redundancy in the adjustment, thereby allowing higher accuracy and reliability. q O x x o1 y y o1 c 1 = λ R 1 X X o1 Y Y o1 Z Z o1 is modified for the right camera to accommodate the matrix of relative rotations R 12 and the three base comonents: x x o2 y y o2 c 2 = λ R 12 R 1 X Y Z X o1 Y o1 + R T 1 Z o1 B x B y B z In all calibration adjustments erformed, the standard error was about 0.2 ixels. A tyical calibration outut is seen in Table 1 (k i, i are the coefficients of lens distortion). In Fig. 2 a tyical stereo air used for calibration is shown. Table 1. Calibration results (from 20 image airs) ο = 0.21ixel left camera right camera cx (ix) ± ± 0.25 cy (ix) ± ± 0.28 x o (ix) ± ± 0.73 y o (ix) ± ± 0.51 k 1 ( ) ± ± 0.02 k 2 ( 10 ) ± ± ( 10 ) ± ± ( 10 ) ± ± 0.19 relative orientation Bx (cm) ± 0.01 By (cm) 2.00 ± 0.00 Bz (cm) ± 0.02 ω ± 0.04 φ ± 0.05 κ ± System calibration 3. THE SCANNING PROCESS Our grou has resented an algorithm * which accets a number of images of simle lanar chessboard atterns to automatically estimate the interior orientation of the camera used (Douskos et al., 2008). The algorithm first extracts the chessboard nodes via a Harris oerator, orders them and finally determines the camera geometry elements by bundle adjustment. Since here the scaled relative orientation of the cameras is also required, inut to our modified calibration algorithm is synchronized image airs of a chessboard attern of known grid size and with one of its black squares changed to red. The latter is automatically detected, and thus the origin of the chessboard coordinate system can be fixed (see Prokos et al., 2009, for more details). Evidently, the collinearity equation used for the left camera * The source code in Matlab of the calibration toolbox FAUCCAL, with documentation, tis and test imagery, is available on the Internet at: htt:// 506 Figure 2. A stereo air used for the calibration. 3.2 Image acquisition and subtraction For scanning, stereo airs are continuously taken from each osition of the static camera system; each air records the instantaneous rofile of the 3D surface which is intersected by the laser lane as the latter is slowly moved manually over the surface. Dull surfaces may be scanned with normal illumination of the scene (which may also be sufficient for caturing object texture of good quality); shiny surfaces need to be scanned with no exterior light source. Either way, laser rofiles have to be isolated from the background, i.e. from all frames a reference image (generated here as the temoral median of a few images) has to be subtracted. If illumination is good, a further use of these background images is to suly all surface oints with their secific hoto-texture for the uroses of visualization; else, from each scanning osition an extra image air may be taken under suitable illumination simly for hoto-texturing.
3 3.3 Peak detection on eiolar images Using the calibration data all image airs are transformed to eiolar airs, whereby known systematic images errors (here lens distortion) are removed. Thus, the search for homologous oints on the laser rofile is confined on corresonding eiolar lines (image rows), i.e. eaks must be determined on each image row. Several eak detection aroaches have been reorted (Fisher & Naidu, 1996). Here, a Gaussian curve is adated directly to the intensity values of each row: f x = ae x b 2 2σ 2 + d First, a threshold is alied to each row, roviding an estimation of the osition of the eak (or eaks) on an eiolar line as well as eak width. Curves are fitted only to ositions which yielded widths below a limit, in order to exclude stretched stries due to laser lanes intersecting the 3D surface at a small angle. The subixel estimation of the eak osition is given by arameter b in the above equation. However, this eak estimation uses data only in the direction of the image row. Thus, in order to relax the strictness of 1D interolation, two additional Gaussian curves with a common b arameter in the image x-direction are simultaneously fitted, namely in the directions of the two main diagonals through the initial eak estimation. The data from the two diagonals contribute in the estimation with smaller weight. Consequently, the final eak osition remains on the eiolar line, but is influenced by gray values from the neighborhood of the initial estimation. In Fig. 3 one may see the effect of this rocedure. X = Bx 1 Y = By Z = Bc ( = x 1 x 2 ) The oints of the background lanes must be searated into two grous, each reresenting the resective lane. This is done for each image air by fitting two 3D lines using RANSAC. End result is two oint clouds, from which coefficients of the background lanes are estimated. 3.5 Reconstruction algorithm As regards object scanning, very good initial estimations of the 3D osition of all oints of a laser rofile are obtained from the arallax equations; from these the coefficients of the laser lane are estimated. Together with the coefficients of the background lanes, this allows sorting rofile oints in three grous, namely oints on the two background lanes and object oints. But the arallax equations yield 3D object oints without redundancy (i.e. without a means for estimating recision or for gross error detection). In our aroach the answer to this, as mentioned, is the introduction of extra geometric constraints. First, triangulation is strengthened by the additional constraint that all 3D oints reconstructed from a recorded laser strie are colanar. Thus, the coefficients of all laser lanes are involved as unknown arameters in the adjustment. A further constraint is enforced by means of the two background lanes (also intersected by the laser lane). Obviously, the end-arts of the laser rofiles on either side of the object are straight (Fig. 4). Therefore, their oints must simultaneously satisfy the equations of the corresonding laser lane as well as those of the corresonding background lane. Estimates for the coefficients of the two background lanes are known from scanning the corner beforehand. Figure 3. Profile along an eiolar line. Curve fitted only along the image row (red) and curve fitted together with curves along the main diagonals (green). Before extracting eak ositions, a 3x3 Gaussian filter removes image noise. This mild filter was generally sufficient, due to the good quality of the emloyed laser (for lasers of oorer quality used in revious exeriments a median filter had to be alied first). It is ointed out that an increase of the window size of the filters may give better recision in eak detection; however, the end result of the 3D oint cloud will robably be too smooth. For lines with multile eak encounters (e.g. close to occlusion borders or due to reflections) the eaks are stored searately and rocessed as exlained later. 3.4 Background lanes Prior to scanning the object, the background lanes are scanned. After eaks on eiolar lines have been identified for all oint airs as outlined above, their x 1, x 2 and y image coordinates are used in the simle arallax equations in order to reconstruct the 3D oints: Figure 4. A tyical stereo air used in the scanning rocess. Besides the object, the laser lane intersects the two background lanes roducing linear segments on either side of the object. In Prokos et al. (2009) each laser rofile was adjusted indeendently, i.e. the arallax equations were combined with the laser lane equation and soft constraints for the linear end-segments. Consequently, in each adjustment a total of 2 N + 3 unknowns were involved, namely the X and Z coordinates of all N oints of the laser rofile (Y-values are directly found afterwards from the final -values) and the laser lane coefficients. Here, on the contrary, the robust aroach of a unified 3D reconstruction adjustment has been adoted. This means that all laser rofiles recorded from a articular viewoint of the camera system are adjusted together, with individual oints forced to belong to their (unknown) laser lane and, if they are oints of end-segments, also constrained to lie on the corresonding (unknown) background lane. Thus, unknowns here are the X and Z coordinates of all oints of the n rofiles lus 3 n coefficients of the laser lanes lus 6 coefficients of the background lanes (which are the common unknowns). It is noted that, in order to have longer linear end-segments and also include observations close to the 507
4 intersection of the lanes, the images of the background lanes without the object are also included in the fitting adjustment. The second constraint is otional, in the sense that the object might not be laced in a corner or, if laced, background lanes might be only marginally visible in the images to allow the object to occuy the largest ossible image art (higher resolution in object sace). In such a case, an overall adjustment is clearly ointless, i.e. each rofile is rocessed indeendently. hase which, at the moment, takes several minutes. Under these circumstances, the result (seen in Fig. 5, bottom) is satisfactory. The images used to drae this 3D model with texture where not created with the temoral median aroach but taken searately, since the 3D oint cloud was acquired with the subject s eyes closed. An extra ste is to back-roject all 3D oints onto the air of reference images in order to interolate sets of RGB values which comlement the 3D data to roduce a final XYZ RGB set. Finally, the results from the different scanning sessions (from the different viewoints of the camera systems) are co-registered in a single 3D surface model using ICP. 3.6 Multile eaks Eiolar lines which roduce more than one eak are stored searately and do not articiate in the solution, i.e. reconstructed are at first only oints resulting from eiolar lines with a single eak. After the adjustment, 3D oints are calculated for all ossible combinations of stored multile eaks on eiolar lines. The actual object oints among them are searated from the outliers by means of a distance threshold from the estimated laser lane (Prokos et al., 2009). This is a further exloitation of the fact that all oints of a rofile are colanar. 4. APPLICATION AND EVALUATION 4.1 Exected accuracy The recision of 3D coordinates is directly related to the error σ of the x-arallax (), which is the result of the uncertainty σ x in the x-direction of eak ositions estimated through Gaussian curve fitting (arameter b). The arallax error is roagated in 3D sace through the image scale and the base-to-distance ratio. For the setu of Table 1 (c = 950 ixel, B = 40 cm), an average imaging distance of 70 cm in scanning the test cylinder (see below) and σ x = 0.1 ixel for the uncertainty of eak estimation (i.e. σ = 0.15 ixel), the tyical exected recision in deth is estimated as σ z = 0.2 mm. 4.2 Evaluation of accuracy The validity of the above estimation was checked by scanning a white PVC lumbing tube with a nominal diameter of 125 mm. A cylinder was fitted to the 3670 XYZ values of the oint cloud from one scanning osition which reresented aroximately 2/5 of the erimeter. The standard error of the surface-fitting adjustment was 0.2mm (the same as in Prokos et al., 2009). 4.3 Practical alications Objects scanned with our system were a olyester souvenir statue of Venus (height ~15cm), a 1985 Australian dollar coin and the face of one of the authors. The first object was scanned with a 20 cm base; the 3D model is seen in Fig. 5 (to). The coin is a rather extreme case, since the system has not been designed for very small objects. A 10 cm base was used. Crucial was here the width of the laser strie: ixel size was less than 0.1mm, but the laser line could not be narrower than 0.5mm, i.e. 5 ixels. The end result, shown in Fig. 5 (middle), was noisy but the surface aears to be adequately catured. The last object, scanned with a 30 cm base from two viewoints, also reresents an extreme case since the erson should remain frozen during the scanning Figure 5. Images and final 3D models: small statue of Venus (to), coin (middle) and face of the rimary author (bottom). 508
5 5. CONCLUSION An imlementation of a low-cost 3D scanner has been reorted, based on the combination of the stereovision and the slit scanner rinciles, accomanied by the introduction of extra geometric constraints. Comared to revious work (Prokos et al., 2009), a main goal here was to imrove the overall reconstruction reliability. This has been achieved by the unified adjustment of all laser rofiles from each scanning osition. Some comutational roblems have to be solved if all laser rofiles from all scanning viewoints are to be adjusted in a single solution. Future tasks include establishing further means for detecting outliers within but also between oint clouds from different scanning ositions. REFERENCES Blais F., Review of 20 years of range sensor develoment. Journal of Electronic Imaging, 13(1), Bouguet J.-Y., Perona P., D hotograhy on your desk. Proc. IEEE Int. Conf. on Comuter Vision, Davis, J., Chen, X., A laser range scanner designed for minimum calibration comlexity. Proceedings of Third International Conference on 3-D Digital Imaging and Modeling Arch. Phot. Rem. Sens., 37(B5), Fisher R.B., Naidu D.K., A comarison of algorithms for subixel eak detection. Advances in Image Processing, Multimedia and Machine Vision. Sringer, Forest J., Salvi J., A review of laser scanning three-dimensional digitisers. IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, 1, Kawasaki H., Furukawa R., Dense 3D reconstruction method using colanarities and metric constraints for line laser scanning. 6 th IEEE Int. Conf. on 3D Digital Imaging and Modeling (3DIM 07), Prokos A., Karras G., Grammatikooulos L., Design and evaluation of a hotogrammetric 3D surface scanner. Proc. 22 nd CIPA Symosium, October 11-15, Kyoto, Jaan. Winkelbach S., Molkenstruck S., Wahl F.M., Low-cost laser range scanner and fast surface registration aroach. Proc. DAGM 06, Lecture Notes in Comuter Science, 4174, Sringer, Zagorchev L., Goshtasby A.A., A aint-brush laser range scanner. Comuter Vision & Image Understanding, 101, Douskos V., Kaliserakis I., Karras G.E., Petsa E., Fully automatic camera calibration using regular lanar atterns. Int. 509
DESIGN AND EVALUATION OF A PHOTOGRAMMETRIC 3D SURFACE SCANNER
DESIGN AND EVALUATION OF A PHOTOGRAMMETRIC 3D SURFACE SCANNER A. Prokos 1, G. Karras 1, L. Grammatikopoulos 2 1 Department of Surveying, National Technical University of Athens (NTUA), GR-15780 Athens,
More informationGabriel Taubin. Desktop 3D Photography
Sring 06 ENGN50 --- D Photograhy Lecture 7 Gabriel Taubin Brown University Deskto D Photograhy htt://www.vision.caltech.edu/bouguetj/iccv98/.index.html D triangulation: ray-lane Intersection lane ray intersection
More informationA Novel Iris Segmentation Method for Hand-Held Capture Device
A Novel Iris Segmentation Method for Hand-Held Cature Device XiaoFu He and PengFei Shi Institute of Image Processing and Pattern Recognition, Shanghai Jiao Tong University, Shanghai 200030, China {xfhe,
More information521493S Computer Graphics Exercise 3 (Chapters 6-8)
521493S Comuter Grahics Exercise 3 (Chaters 6-8) 1 Most grahics systems and APIs use the simle lighting and reflection models that we introduced for olygon rendering Describe the ways in which each of
More informationAn Efficient Coding Method for Coding Region-of-Interest Locations in AVS2
An Efficient Coding Method for Coding Region-of-Interest Locations in AVS2 Mingliang Chen 1, Weiyao Lin 1*, Xiaozhen Zheng 2 1 Deartment of Electronic Engineering, Shanghai Jiao Tong University, China
More informationStereo Disparity Estimation in Moment Space
Stereo Disarity Estimation in oment Sace Angeline Pang Faculty of Information Technology, ultimedia University, 63 Cyberjaya, alaysia. angeline.ang@mmu.edu.my R. ukundan Deartment of Comuter Science, University
More informationLearning Motion Patterns in Crowded Scenes Using Motion Flow Field
Learning Motion Patterns in Crowded Scenes Using Motion Flow Field Min Hu, Saad Ali and Mubarak Shah Comuter Vision Lab, University of Central Florida {mhu,sali,shah}@eecs.ucf.edu Abstract Learning tyical
More informationAUTOMATIC EXTRACTION OF BUILDING OUTLINE FROM HIGH RESOLUTION AERIAL IMAGERY
AUTOMATIC EXTRACTION OF BUILDING OUTLINE FROM HIGH RESOLUTION AERIAL IMAGERY Yandong Wang EagleView Technology Cor. 5 Methodist Hill Dr., Rochester, NY 1463, the United States yandong.wang@ictometry.com
More informationMatlab Virtual Reality Simulations for optimizations and rapid prototyping of flexible lines systems
Matlab Virtual Reality Simulations for otimizations and raid rototying of flexible lines systems VAMVU PETRE, BARBU CAMELIA, POP MARIA Deartment of Automation, Comuters, Electrical Engineering and Energetics
More informationLast time: Disparity. Lecture 11: Stereo II. Last time: Triangulation. Last time: Multi-view geometry. Last time: Epipolar geometry
Last time: Disarity Lecture 11: Stereo II Thursday, Oct 4 CS 378/395T Prof. Kristen Grauman Disarity: difference in retinal osition of same item Case of stereo rig for arallel image lanes and calibrated
More informationA STUDY ON CALIBRATION OF DIGITAL CAMERA
A STUDY ON CALIBRATION OF DIGITAL CAMERA Ryuji Matsuoka a, *, Kiyonari Fukue a, Kohei Cho a, Haruhisa Shimoda a, Yoshiaki Matsumae a, Kenji Hongo b, Seiju Fujiwara b a Tokai University Research & Information
More informationP Z. parametric surface Q Z. 2nd Image T Z
Direct recovery of shae from multile views: a arallax based aroach Rakesh Kumar. Anandan Keith Hanna Abstract Given two arbitrary views of a scene under central rojection, if the motion of oints on a arametric
More informationPrivacy Preserving Moving KNN Queries
Privacy Preserving Moving KNN Queries arxiv:4.76v [cs.db] 4 Ar Tanzima Hashem Lars Kulik Rui Zhang National ICT Australia, Deartment of Comuter Science and Software Engineering University of Melbourne,
More informationEVALUATION OF THE ACCURACY OF A LASER SCANNER-BASED ROLL MAPPING SYSTEM
EVALUATION OF THE ACCURACY OF A LASER SCANNER-BASED ROLL MAPPING SYSTEM R.S. Radovanovic*, W.F. Teskey*, N.N. Al-Hanbali** *University of Calgary, Canada Deartment of Geomatics Engineering rsradova@ucalgary.ca
More informationPHOTOGRAMMETRIC TECHNIQUES FOR ROAD SURFACE ANALYSIS
The International Archives of the Photogrammetry, Remote Sensing and Satial Information Sciences, Volume XLI-B5, 6 XXIII ISPRS Congress, 9 July 6, Prague, Czech Reublic PHOTOGRAMMETRIC TECHNIQUES FOR ROAD
More informationA system for airport surveillance: detection of people running, abandoned objects and pointing gestures
SPIE Defense & Security Symosium: Visual Information Processing 2011 A system for airort surveillance: detection of eole running, abandoned objects and ointing gestures Samuel Foucher, Marc Lalonde, Langis
More informationAn Efficient VLSI Architecture for Adaptive Rank Order Filter for Image Noise Removal
International Journal of Information and Electronics Engineering, Vol. 1, No. 1, July 011 An Efficient VLSI Architecture for Adative Rank Order Filter for Image Noise Removal M. C Hanumantharaju, M. Ravishankar,
More informationImproved Image Super-Resolution by Support Vector Regression
Proceedings of International Joint Conference on Neural Networks, San Jose, California, USA, July 3 August 5, 0 Imroved Image Suer-Resolution by Suort Vector Regression Le An and Bir Bhanu Abstract Suort
More informationDense 3D Reconstruction from Specularity Consistency
Dense 3D Reconstruction from Secularity Consistency Diego Nehab Microsoft Research Tim Weyrich Princeton University Szymon Rusinkiewicz Princeton University Abstract In this work, we consider the dense
More informationFigure 8.1: Home age taken from the examle health education site (htt:// Setember 14, 2001). 201
200 Chater 8 Alying the Web Interface Profiles: Examle Web Site Assessment 8.1 Introduction This chater describes the use of the rofiles develoed in Chater 6 to assess and imrove the quality of an examle
More informationAUTOMATIC GENERATION OF HIGH THROUGHPUT ENERGY EFFICIENT STREAMING ARCHITECTURES FOR ARBITRARY FIXED PERMUTATIONS. Ren Chen and Viktor K.
inuts er clock cycle Streaming ermutation oututs er clock cycle AUTOMATIC GENERATION OF HIGH THROUGHPUT ENERGY EFFICIENT STREAMING ARCHITECTURES FOR ARBITRARY FIXED PERMUTATIONS Ren Chen and Viktor K.
More informationImage Segmentation Using Topological Persistence
Image Segmentation Using Toological Persistence David Letscher and Jason Fritts Saint Louis University Deartment of Mathematics and Comuter Science {letscher, jfritts}@slu.edu Abstract. This aer resents
More informationSingle character type identification
Single character tye identification Yefeng Zheng*, Changsong Liu, Xiaoqing Ding Deartment of Electronic Engineering, Tsinghua University Beijing 100084, P.R. China ABSTRACT Different character recognition
More informationAUTOMATIC POINT CLOUD GENERATION AND REGISTRATION WITH A STEREOVISION SLIT-SCANNER
AUTOMATIC POINT CLOUD GENERATION AND REGISTRATION WITH A STEREOVISION SLIT-SCANNER A. Prokos 1, I. Kalisperakis 2, G. Karras 1 1 Department of Surveying, National Technical University of Athens (NTUA),
More informationTexture Mapping with Vector Graphics: A Nested Mipmapping Solution
Texture Maing with Vector Grahics: A Nested Mimaing Solution Wei Zhang Yonggao Yang Song Xing Det. of Comuter Science Det. of Comuter Science Det. of Information Systems Prairie View A&M University Prairie
More informationAn Efficient and Highly Accurate Technique for Periodic Planar Scanner Calibration with the Antenna Under Test in Situ
An Efficient and Highly Accurate echnique for Periodic Planar Scanner Calibration with the Antenna Under est in Situ Scott Pierce I echnologies 1125 Satellite Boulevard, Suite 100 Suwanee, Georgia 30024
More information3D RECONSTRUCTION OF ROADS AND TREES FOR CITY MODELLING
3D RECONSTRUCTION OF ROADS AND TREES FOR CITY MODELLING George Vosselman Deartment of Geodesy, Delft University of Technology, Thijsseweg 11, NL-2629 JA Delft, The Netherlands g.vosselman@geo.tudelft.nl
More informationLecture 2: Fixed-Radius Near Neighbors and Geometric Basics
structure arises in many alications of geometry. The dual structure, called a Delaunay triangulation also has many interesting roerties. Figure 3: Voronoi diagram and Delaunay triangulation. Search: Geometric
More informationEfficient stereo vision for obstacle detection and AGV Navigation
Efficient stereo vision for obstacle detection and AGV Navigation Rita Cucchiara, Emanuele Perini, Giuliano Pistoni Diartimento di Ingegneria dell informazione, University of Modena and Reggio Emilia,
More informationA Method to Determine End-Points ofstraight Lines Detected Using the Hough Transform
RESEARCH ARTICLE OPEN ACCESS A Method to Detere End-Points ofstraight Lines Detected Using the Hough Transform Gideon Kanji Damaryam Federal University, Lokoja, PMB 1154, Lokoja, Nigeria. Abstract The
More informationInteractive Image Segmentation
Interactive Image Segmentation Fahim Mannan (260 266 294) Abstract This reort resents the roject work done based on Boykov and Jolly s interactive grah cuts based N-D image segmentation algorithm([1]).
More informationCS 229 Final Project: Single Image Depth Estimation From Predicted Semantic Labels
CS 229 Final Project: Single Image Deth Estimation From Predicted Semantic Labels Beyang Liu beyangl@cs.stanford.edu Stehen Gould sgould@stanford.edu Prof. Dahne Koller koller@cs.stanford.edu December
More informationCENTRAL AND PARALLEL PROJECTIONS OF REGULAR SURFACES: GEOMETRIC CONSTRUCTIONS USING 3D MODELING SOFTWARE
CENTRAL AND PARALLEL PROJECTIONS OF REGULAR SURFACES: GEOMETRIC CONSTRUCTIONS USING 3D MODELING SOFTWARE Petra Surynková Charles University in Prague, Faculty of Mathematics and Physics, Sokolovská 83,
More informationMETHOD OF LANDSLIDE MEASUREMENT BY GROUND BASED LIDAR
METHOD OF LANDSLIDE MEASUREMENT BY GROUND BASED LIDAR Ryo INADA* and Masataka TAKAGI** Kochi University of Technology, Kami-shi, Kochi, 782-8502, Jaan *135082@gs.kochi-tech.ac.j **takagi.masataka@kochi-tech.ac.j
More informationExtracting Optimal Paths from Roadmaps for Motion Planning
Extracting Otimal Paths from Roadmas for Motion Planning Jinsuck Kim Roger A. Pearce Nancy M. Amato Deartment of Comuter Science Texas A&M University College Station, TX 843 jinsuckk,ra231,amato @cs.tamu.edu
More informationFace Recognition Using Legendre Moments
Face Recognition Using Legendre Moments Dr.S.Annadurai 1 A.Saradha Professor & Head of CSE & IT Research scholar in CSE Government College of Technology, Government College of Technology, Coimbatore, Tamilnadu,
More informationRobust Motion Estimation for Video Sequences Based on Phase-Only Correlation
Robust Motion Estimation for Video Sequences Based on Phase-Only Correlation Loy Hui Chien and Takafumi Aoki Graduate School of Information Sciences Tohoku University Aoba-yama 5, Sendai, 98-8579, Jaan
More informationEfficient Processing of Top-k Dominating Queries on Multi-Dimensional Data
Efficient Processing of To-k Dominating Queries on Multi-Dimensional Data Man Lung Yiu Deartment of Comuter Science Aalborg University DK-922 Aalborg, Denmark mly@cs.aau.dk Nikos Mamoulis Deartment of
More informationIEEE Coyright Notice Personal use of this material is ermitted. However, ermission to rerint/reublish this material for advertising or romotional uroses or for creating new collective works for resale
More informationGEOMETRIC CONSTRAINT SOLVING IN < 2 AND < 3. Department of Computer Sciences, Purdue University. and PAMELA J. VERMEER
GEOMETRIC CONSTRAINT SOLVING IN < AND < 3 CHRISTOPH M. HOFFMANN Deartment of Comuter Sciences, Purdue University West Lafayette, Indiana 47907-1398, USA and PAMELA J. VERMEER Deartment of Comuter Sciences,
More information2-D Fir Filter Design And Its Applications In Removing Impulse Noise In Digital Image
-D Fir Filter Design And Its Alications In Removing Imulse Noise In Digital Image Nguyen Thi Huyen Linh 1, Luong Ngoc Minh, Tran Dinh Dung 3 1 Faculty of Electronic and Electrical Engineering, Hung Yen
More informationEE678 Application Presentation Content Based Image Retrieval Using Wavelets
EE678 Alication Presentation Content Based Image Retrieval Using Wavelets Grou Members: Megha Pandey megha@ee. iitb.ac.in 02d07006 Gaurav Boob gb@ee.iitb.ac.in 02d07008 Abstract: We focus here on an effective
More informationTOPP Probing of Network Links with Large Independent Latencies
TOPP Probing of Network Links with Large Indeendent Latencies M. Hosseinour, M. J. Tunnicliffe Faculty of Comuting, Information ystems and Mathematics, Kingston University, Kingston-on-Thames, urrey, KT1
More informationWavelet Based Statistical Adapted Local Binary Patterns for Recognizing Avatar Faces
Wavelet Based Statistical Adated Local Binary atterns for Recognizing Avatar Faces Abdallah A. Mohamed 1, 2 and Roman V. Yamolskiy 1 1 Comuter Engineering and Comuter Science, University of Louisville,
More informationFeature Selection and Pose Estimation From Known Planar Objects Using Monocular Vision
Feature Selection and Pose Estimation From Known Planar Objects Using Monocular ision Shengdong Xu and Ming Liu 2 ETH Zurich, Switzerland, Email: Samuel.xu988@gmail.com 2 The Hong Kong University of Science
More informationPerception of Shape from Shading
1 Percetion of Shae from Shading Continuous image brightness variation due to shae variations is called shading Our ercetion of shae deends on shading Circular region on left is erceived as a flat disk
More informationPREDICTING LINKS IN LARGE COAUTHORSHIP NETWORKS
PREDICTING LINKS IN LARGE COAUTHORSHIP NETWORKS Kevin Miller, Vivian Lin, and Rui Zhang Grou ID: 5 1. INTRODUCTION The roblem we are trying to solve is redicting future links or recovering missing links
More informationEfficient Parallel Hierarchical Clustering
Efficient Parallel Hierarchical Clustering Manoranjan Dash 1,SimonaPetrutiu, and Peter Scheuermann 1 Deartment of Information Systems, School of Comuter Engineering, Nanyang Technological University, Singaore
More informationSensitivity Analysis for an Optimal Routing Policy in an Ad Hoc Wireless Network
1 Sensitivity Analysis for an Otimal Routing Policy in an Ad Hoc Wireless Network Tara Javidi and Demosthenis Teneketzis Deartment of Electrical Engineering and Comuter Science University of Michigan Ann
More informationCOT5405: GEOMETRIC ALGORITHMS
COT5405: GEOMETRIC ALGORITHMS Objects: Points in, Segments, Lines, Circles, Triangles Polygons, Polyhedra R n Alications Vision, Grahics, Visualizations, Databases, Data mining, Networks, GIS Scientific
More informationA Model-Adaptable MOSFET Parameter Extraction System
A Model-Adatable MOSFET Parameter Extraction System Masaki Kondo Hidetoshi Onodera Keikichi Tamaru Deartment of Electronics Faculty of Engineering, Kyoto University Kyoto 66-1, JAPAN Tel: +81-7-73-313
More informationOMNI: An Efficient Overlay Multicast. Infrastructure for Real-time Applications
OMNI: An Efficient Overlay Multicast Infrastructure for Real-time Alications Suman Banerjee, Christoher Kommareddy, Koushik Kar, Bobby Bhattacharjee, Samir Khuller Abstract We consider an overlay architecture
More informationGrouping of Patches in Progressive Radiosity
Grouing of Patches in Progressive Radiosity Arjan J.F. Kok * Abstract The radiosity method can be imroved by (adatively) grouing small neighboring atches into grous. Comutations normally done for searate
More informationCross products. p 2 p. p p1 p2. p 1. Line segments The convex combination of two distinct points p1 ( x1, such that for some real number with 0 1,
CHAPTER 33 Comutational Geometry Is the branch of comuter science that studies algorithms for solving geometric roblems. Has alications in many fields, including comuter grahics robotics, VLSI design comuter
More informationA Study of Protocols for Low-Latency Video Transport over the Internet
A Study of Protocols for Low-Latency Video Transort over the Internet Ciro A. Noronha, Ph.D. Cobalt Digital Santa Clara, CA ciro.noronha@cobaltdigital.com Juliana W. Noronha University of California, Davis
More informationGraph Cut Matching In Computer Vision
Grah Cut Matching In Comuter Vision Toby Collins (s0455374@sms.ed.ac.uk) February 2004 Introduction Many of the roblems that arise in early vision can be naturally exressed in terms of energy minimization.
More informationFolded Structures Satisfying Multiple Conditions
Journal of Information Processing Vol.5 No.4 1 10 (Oct. 017) [DOI: 1197/isjji.5.1] Regular Paer Folded Structures Satisfying Multile Conditions Erik D. Demaine 1,a) Jason S. Ku 1,b) Received: November
More informationFast Algorithm to Estimate Dense Disparity Fields
Fast Algorithm to Estimate Dense Disarity Fields M Kardouchi a, E Hervet a University of Moncton, Comuter Science Det, Moncton, NB, Canada {kardoum,hervete}@umonctonca This aer describes a method to comute
More informationFast Shape-based Road Sign Detection for a Driver Assistance System
Fast Shae-based Road Sign Detection for a Driver Assistance System Gareth Loy Comuter Vision and Active Percetion Laboratory Royal Institute of Technology (KTH) Stockholm, Sweden Email: gareth@nada.kth.se
More informationStructure from Motion
04/4/ Structure from Motion Comuter Vision CS 543 / ECE 549 University of Illinois Derek Hoiem Many slides adated from Lana Lazebnik, Silvio Saverese, Steve Seitz his class: structure from motion Reca
More informationVisualization, Estimation and User-Modeling for Interactive Browsing of Image Libraries
Visualization, Estimation and User-Modeling for Interactive Browsing of Image Libraries Qi Tian, Baback Moghaddam 2 and Thomas S. Huang Beckman Institute, University of Illinois, Urbana-Chamaign, IL 680,
More informationMULTI-CAMERA SURVEILLANCE WITH VISUAL TAGGING AND GENERIC CAMERA PLACEMENT. Jian Zhao and Sen-ching S. Cheung
MULTI-CAMERA SURVEILLANCE WITH VISUAL TAGGING AND GENERIC CAMERA PLACEMENT Jian Zhao and Sen-ching S. Cheung University of Kentucky Center for Visualization and Virtual Environment 1 Quality Street, Suite
More informationConvex Hulls. Helen Cameron. Helen Cameron Convex Hulls 1/101
Convex Hulls Helen Cameron Helen Cameron Convex Hulls 1/101 What Is a Convex Hull? Starting Point: Points in 2D y x Helen Cameron Convex Hulls 3/101 Convex Hull: Informally Imagine that the x, y-lane is
More informationA Morphological LiDAR Points Cloud Filtering Method based on GPGPU
A Morhological LiDAR Points Cloud Filtering Method based on GPGPU Shuo Li 1, Hui Wang 1, Qiuhe Ma 1 and Xuan Zha 2 1 Zhengzhou Institute of Surveying & Maing, No.66, Longhai Middle Road, Zhengzhou, China
More informationMulti-robot SLAM with Unknown Initial Correspondence: The Robot Rendezvous Case
Multi-robot SLAM with Unknown Initial Corresondence: The Robot Rendezvous Case Xun S. Zhou and Stergios I. Roumeliotis Deartment of Comuter Science & Engineering, University of Minnesota, Minneaolis, MN
More informationLeak Detection Modeling and Simulation for Oil Pipeline with Artificial Intelligence Method
ITB J. Eng. Sci. Vol. 39 B, No. 1, 007, 1-19 1 Leak Detection Modeling and Simulation for Oil Pieline with Artificial Intelligence Method Pudjo Sukarno 1, Kuntjoro Adji Sidarto, Amoranto Trisnobudi 3,
More informationPatterned Wafer Segmentation
atterned Wafer Segmentation ierrick Bourgeat ab, Fabrice Meriaudeau b, Kenneth W. Tobin a, atrick Gorria b a Oak Ridge National Laboratory,.O.Box 2008, Oak Ridge, TN 37831-6011, USA b Le2i Laboratory Univ.of
More informationUse of Multivariate Statistical Analysis in the Modelling of Chromatographic Processes
Use of Multivariate Statistical Analysis in the Modelling of Chromatograhic Processes Simon Edwards-Parton 1, Nigel itchener-hooker 1, Nina hornhill 2, Daniel Bracewell 1, John Lidell 3 Abstract his aer
More informationMulticast in Wormhole-Switched Torus Networks using Edge-Disjoint Spanning Trees 1
Multicast in Wormhole-Switched Torus Networks using Edge-Disjoint Sanning Trees 1 Honge Wang y and Douglas M. Blough z y Myricom Inc., 325 N. Santa Anita Ave., Arcadia, CA 916, z School of Electrical and
More information10. Parallel Methods for Data Sorting
10. Parallel Methods for Data Sorting 10. Parallel Methods for Data Sorting... 1 10.1. Parallelizing Princiles... 10.. Scaling Parallel Comutations... 10.3. Bubble Sort...3 10.3.1. Sequential Algorithm...3
More informationarxiv: v1 [cs.mm] 18 Jan 2016
Lossless Intra Coding in with 3-ta Filters Saeed R. Alvar a, Fatih Kamisli a a Deartment of Electrical and Electronics Engineering, Middle East Technical University, Turkey arxiv:1601.04473v1 [cs.mm] 18
More informationOptimal Multiple Sprite Generation based on Physical Camera Parameter Estimation
Otimal Multile Srite Generation based on Physical Camera Parameter Estimation Matthias Kunter* a, Andreas Krutz a, Mrinal Mandal b, Thomas Sikora a a Commun. Systems Grou, Technische Universität Berlin,
More informationLecture 3: Geometric Algorithms(Convex sets, Divide & Conquer Algo.)
Advanced Algorithms Fall 2015 Lecture 3: Geometric Algorithms(Convex sets, Divide & Conuer Algo.) Faculty: K.R. Chowdhary : Professor of CS Disclaimer: These notes have not been subjected to the usual
More informationUsing Permuted States and Validated Simulation to Analyze Conflict Rates in Optimistic Replication
Using Permuted States and Validated Simulation to Analyze Conflict Rates in Otimistic Relication An-I A. Wang Comuter Science Deartment Florida State University Geoff H. Kuenning Comuter Science Deartment
More informationShuigeng Zhou. May 18, 2016 School of Computer Science Fudan University
Query Processing Shuigeng Zhou May 18, 2016 School of Comuter Science Fudan University Overview Outline Measures of Query Cost Selection Oeration Sorting Join Oeration Other Oerations Evaluation of Exressions
More informationSPITFIRE: Scalable Parallel Algorithms for Test Set Partitioned Fault Simulation
To aear in IEEE VLSI Test Symosium, 1997 SITFIRE: Scalable arallel Algorithms for Test Set artitioned Fault Simulation Dili Krishnaswamy y Elizabeth M. Rudnick y Janak H. atel y rithviraj Banerjee z y
More informationSpace-efficient Region Filling in Raster Graphics
"The Visual Comuter: An International Journal of Comuter Grahics" (submitted July 13, 1992; revised December 7, 1992; acceted in Aril 16, 1993) Sace-efficient Region Filling in Raster Grahics Dominik Henrich
More informationEfficient Algorithms for Computing Conservative Portal Visibility Information
EUROGRAPHICS 2000 / M. Gross and F.R.A. Hogood (Guest Editors) Volum9 (2000), Number 3 Efficient Algorithms for Comuting Conservative Portal Visibility Information W. F. H. Jiménez, C. Eserança and A.
More informationEarthenware Reconstruction Based on the Shape Similarity among Potsherds
Original Paer Forma, 16, 77 90, 2001 Earthenware Reconstruction Based on the Shae Similarity among Potsherds Masayoshi KANOH 1, Shohei KATO 2 and Hidenori ITOH 1 1 Nagoya Institute of Technology, Gokiso-cho,
More informationVehicle Logo Recognition Using Modest AdaBoost and Radial Tchebichef Moments
Proceedings of 0 4th International Conference on Machine Learning and Comuting IPCSIT vol. 5 (0) (0) IACSIT Press, Singaore Vehicle Logo Recognition Using Modest AdaBoost and Radial Tchebichef Moments
More informationLecture 8: Orthogonal Range Searching
CPS234 Comutational Geometry Setember 22nd, 2005 Lecture 8: Orthogonal Range Searching Lecturer: Pankaj K. Agarwal Scribe: Mason F. Matthews 8.1 Range Searching The general roblem of range searching is
More informationSimultaneous Tracking of Multiple Objects Using Fast Level Set-Like Algorithm
Simultaneous Tracking of Multile Objects Using Fast Level Set-Like Algorithm Martin Maška, Pavel Matula, and Michal Kozubek Centre for Biomedical Image Analysis, Faculty of Informatics Masaryk University,
More informationChapter 8: Adaptive Networks
Chater : Adative Networks Introduction (.1) Architecture (.2) Backroagation for Feedforward Networks (.3) Jyh-Shing Roger Jang et al., Neuro-Fuzzy and Soft Comuting: A Comutational Aroach to Learning and
More informationGlobal Illumination with Photon Map Compensation
Institut für Comutergrahik und Algorithmen Technische Universität Wien Karlslatz 13/186/2 A-1040 Wien AUSTRIA Tel: +43 (1) 58801-18688 Fax: +43 (1) 58801-18698 Institute of Comuter Grahics and Algorithms
More informationRemember: The equation of projection. Imaging Geometry 1. Basic Geometric Coordinate Transforms. C306 Martin Jagersand
Imaging Geometr 1. Basic Geometric Coordinate Transorms emember: The equation o rojection Cartesian coordinates: (,, z) ( z, z ) C36 Martin Jagersand How do we develo a consistent mathematical ramework
More informationDEFECT DETECTION AND RESTORATION OF CULTURAL HERITAGE IMAGES
Volume 5 Number 4 011 DEFECT DETECTION AND RESTORATION OF CULTURAL HERITAGE IMAGES Mihaela CISLARIU Mihaela GORDAN Aurel VLAICU Camelia FLOREA Silvia CIUNGU SUTEU Technical University of Cluj-Naoca Cluj-Naoca
More informationEquality-Based Translation Validator for LLVM
Equality-Based Translation Validator for LLVM Michael Ste, Ross Tate, and Sorin Lerner University of California, San Diego {mste,rtate,lerner@cs.ucsd.edu Abstract. We udated our Peggy tool, reviously resented
More informationA simulated Linear Mixture Model to Improve Classification Accuracy of Satellite. Data Utilizing Degradation of Atmospheric Effect
A simulated Linear Mixture Model to Imrove Classification Accuracy of Satellite Data Utilizing Degradation of Atmosheric Effect W.M Elmahboub Mathematics Deartment, School of Science, Hamton University
More informationA DEA-bases Approach for Multi-objective Design of Attribute Acceptance Sampling Plans
Available online at htt://ijdea.srbiau.ac.ir Int. J. Data Enveloment Analysis (ISSN 2345-458X) Vol.5, No.2, Year 2017 Article ID IJDEA-00422, 12 ages Research Article International Journal of Data Enveloment
More informationAn Indexing Framework for Structured P2P Systems
An Indexing Framework for Structured P2P Systems Adina Crainiceanu Prakash Linga Ashwin Machanavajjhala Johannes Gehrke Carl Lagoze Jayavel Shanmugasundaram Deartment of Comuter Science, Cornell University
More informationBuilding Polygonal Maps from Laser Range Data
ECAI Int. Cognitive Robotics Worksho, Valencia, Sain, August 2004 Building Polygonal Mas from Laser Range Data Longin Jan Latecki and Rolf Lakaemer and Xinyu Sun and Diedrich Wolter Abstract. This aer
More informationRandomized algorithms: Two examples and Yao s Minimax Principle
Randomized algorithms: Two examles and Yao s Minimax Princile Maximum Satisfiability Consider the roblem Maximum Satisfiability (MAX-SAT). Bring your knowledge u-to-date on the Satisfiability roblem. Maximum
More informationAUTOMATIC ROAD VECTOR EXTRACTION FOR MOBILE MAPPING SYSTEMS
AUTOMATIC ROAD VECTOR EXTRACTION FOR MOBILE MAPPING SYSTEMS WANG Cheng a, T. Hassan b, N. El-Sheimy b, M. Lavigne b a School of Electronic Science and Engineering, National University of Defence Technology,
More informationA STRUCTURED-LIGHT APPROACH FOR THE RECONSTRUCTION OF COMPLEX OBJECTS
A STRUCTURED-LIGHT APPROACH FOR THE RECONSTRUCTION OF COMPLEX OBJECTS Ilias KALISPERAKIS, Lazaros GRAMMATIKOPOULOS, Elli PETSA, George KARRAS* Department of Surveying, Technological Educational Institute
More informationAn empirical analysis of loopy belief propagation in three topologies: grids, small-world networks and random graphs
An emirical analysis of looy belief roagation in three toologies: grids, small-world networks and random grahs R. Santana, A. Mendiburu and J. A. Lozano Intelligent Systems Grou Deartment of Comuter Science
More informationThis document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.
This document is downloaded from DR-NTU, Nanyang Technological University Library, Singaore. Title Automatic Robot Taing: Auto-Path Planning and Maniulation Author(s) Citation Yuan, Qilong; Lembono, Teguh
More informationIMS Network Deployment Cost Optimization Based on Flow-Based Traffic Model
IMS Network Deloyment Cost Otimization Based on Flow-Based Traffic Model Jie Xiao, Changcheng Huang and James Yan Deartment of Systems and Comuter Engineering, Carleton University, Ottawa, Canada {jiexiao,
More informationDetection of Abandoned Objects in Crowded Environments
Detection of Abandoned Objects in Crowded Environments Medha Bhargava, Chia-Chih Chen, M. S. Ryoo, and J. K. Aggarwal Comuter and Vision Research Center Deartment of Electrical and Comuter Engineering
More informationFace Recognition Based on Wavelet Transform and Adaptive Local Binary Pattern
Face Recognition Based on Wavelet Transform and Adative Local Binary Pattern Abdallah Mohamed 1,2, and Roman Yamolskiy 1 1 Comuter Engineering and Comuter Science, University of Louisville, Louisville,
More informationAFRL-RW-EG-TR Integrated Multi-Aperture Sensor and Navigation Fusion
STINFO COPY AFRL-RW-EG-TR-2010-013 Integrated Multi-Aerture Sensor and Navigation Fusion Andrey Soloviev Jimmy Touma Timothy Klausutis Mikel Miller Adam Rutkowski Kyle Fontaine AFRL/RWGI 101 W Eglin Blvd
More information