25 Pages

liebowitz

Course: CS 486, Fall 2009
School: Nevada
Rating:
 
 
 
 
 

Word Count: 1725

Document Preview

of Review the paper "Creating Architectural Models from Images" Authors:David Liebowitz, Antonio Criminisi and Andrew Zisserman (EUROGRAPHICS '99 ) Amol Ambardekar For the course in Advanced Computer Vision Under the guidance of Dr. Mircea Nicolescu The problem and the strategy It is not always possible to make measurements of a scene to allow reconstruction This is the case in some...

Register Now

Unformatted Document Excerpt

Coursehero >> Nevada >> Nevada >> CS 486

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
of Review the paper "Creating Architectural Models from Images" Authors:David Liebowitz, Antonio Criminisi and Andrew Zisserman (EUROGRAPHICS '99 ) Amol Ambardekar For the course in Advanced Computer Vision Under the guidance of Dr. Mircea Nicolescu The problem and the strategy It is not always possible to make measurements of a scene to allow reconstruction This is the case in some of the buildings where buildings are destroyed or only archive images are available Authors have developed the methods to create 3D graphical models of scenes from a limited number of images These methods use geometric relationships that are common in architectural scenes such as parallelism and orthogonality By using circular points of a plane, simple linear algorithms are given to do the task Methods discussed in the paper Metric rectification of individual planes Computation of relative perpendicular distances from partially rectified planes Camera calibration Piecewise reconstruction of the planar object from a single view Metric rectification of 3D reconstructions from two views Plane Rectification and Homography Plane rectification is equivalent to obtaining an image of the world plane where camera's image plane and world plane is parallel A map between a world plane and a perspective image is a "Homography" H Points on image plane, x, are mapped to the points on the world plane x', as x' = Hx Plane Rectification Images from : http://www.robots.ox.ac.uk/~dl/planar.html Metric rectification of a plane I A homography is used for a plane rectification and can be decomposed into two transformations: H = MN M is the metric part of the homography and N is the nonmetric part There are two ways to rectify a plane: The metric information is retained for both rectification methods The second method (used in the paper) does not determine the metric component M Determine H using four planar points from the scene for which we know their world coordinates and their corresponding positions in the image Determine N by projecting the circular points into the image or equivalently using Stratified metric rectification Metric Rectification of a plane II N is the nonmetric part and is represented as follows: Plane rectification is thus reduced to a four parameter problem since we require only N to metric rectify an image N can be further decomposed in two matrices N = AP, where N is determined using stratified metric rectification method Metric Rectification of a plane III Stratified metric rectification has two parts Projective to Affine Affine to Metric P is determined in the first part by identifying the vanishing line l = (l1, l2, 1) l u Metric Rectification of a plane IV A is determined in the second part Rectangles or two orthogonal directions provide a pair of vanishing points in orthogonal directions This constraint is only enough to restore angles To determine length ratios for nonparallel lines, we need to determine A11= = 1/ We need one more constraint for the same, which can be obtained by Finding a ratio of lengths in the orthogonal directions of the plane Determining natural camera parameters for which the principal point is known approximately Results of metric rectification Figure 2: The affine rectified image. Notice that parallelism is restored, but angles and ratios of lengths are still incorrect Figure 1: Original image Figure 3: An incorrectly scaled image due to the aspect ratio ambiguity Figure 4: The correctly scaled image, from the known length ratio of the sides of a window Measuring distances of points from planes I Given: The vanishing line of a reference plane The vanishing point for directions orthogonal to the plane A reference distance orthogonal to the plane The paper gives an algorithm to calculate the orthogonal distance of any point from the reference plane Measuring distances of points from planes II We are trying to find out D d(a,b) is the distance between point a and point b D = Dr d(v, b)d(t, b) - d(r, b)d(t, b) d(v, b)d(r, b) - d(r, b)d(t, b) v t b r D u Measuring distances of points from planes III The technique is used to reconstruct 3D model from an old painting "La Flagellazione di Cristo" by Piero della Francesca (1416 1492). The people are represented by flat silhouettes since it is not possible to recover volume from one image. Original Image View of the model with the roof removed to show the relative positions of people and columns in the scene Camera calibration Camera calibration means determining internal parameters of the camera The camera calibration matrix K is generally represented as An image point x is related to a point in the camera's coordinate system xc as x = Kxc The simplified or natural camera calibration matrix is The image of the absolute conic The image of the absolute conic is a conic defined as where, K is camera calibration matrix and is 3x3 symmetric matrix with five degrees of freedom A point x lying on the conic satisfies The calibration matrix K may be computed from by Cholesky decomposition The imaged circular points of any plane lie on thus each rectified plane provides two points on and so provides two of the five constraints necessary to determine determines orthogonality of rays back projected from image points. A pair of vanishing points u and v arising orthogonal from directions in the world satisfy Camera calibration from orthogonal vanishing points A typical real world application such as an image of a building provides three orthogonal directions, and thus three constraints on Therefore there are insufficient constraints to solve for the full five parameter model But, they are enough to determine the three parameter natural camera model The extra camera constraints of zero skew and unit aspect ratio provide additional constraints on K follows from by Cholesky decomposition Camera calibration from rectified planes If the four rectification parameters for a scene plane are computed, then the imaged circular points for that plane are known These points lie on , satisfying The real and imaginary part of I give two constraints Each rectified plane thus give two constraints With three rectified planes there are six points on and camera internal parameters are over constrained World planes used for rectification need not be orthogonal Rectification of plane with known internal parameters The vanishing point of the world plane intersects in the circular points corresponding to that plane Therefore, if K is known, any plane for which the vanishing line is known can be rectified The rectification ambiguity (aspect ratio) can be solved if the camera calibration is known The vanishing line and camera also determine the orientation of the world plane relative to the camera in the camera centered co ordinate xc as The relative orientations of two planes may be computed from their vanishing lines as Rectification of plane with partial internal parameters It is common to have aspect ratio ambiguity for plane rectification If natural camera is assumed with principal point at the image center then f (focal length) is the only parameter to be determined It can be determined using single constraint like the single orthogonal vanishing point pair Original Image Rectification where the relative scaling of vertical and horizontal directions assumes a natural camera with the principal point at the centre of the image Single view reconstruction I It is used to build 3D models which require the rectification of 2 or more planes The plane rectification technique discussed in the paper is ideal for the task of reconstructing models of buildings that have planar surfaces It is often not possible to reconstruct any planes until the camera calibration has been estimated The vanishing point method can be used to estimate natural camera parameters Single view reconstruction II Having computed the camera, the relative orientation of planes in the scene that are not orthogonal can be computed if their vanishing lines can be found Their relative positions and dimensions can be determined if the intersection of a pair of planes is visible in the image Relative size can be computed from the rectification of a distance between common points using the homographies of both planes Single view reconstruction III There are two ways to proceed with plane recification to reconstruct 3D model Left facade is considered as a reference plane and rectified the first. The right facade and ground planes define 3D planes orthogonal to...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Nevada - CS - 486
Modeling and Rendering Architecture from Photographs: A hybrid geometry- and image-based approachPaul Debevec, Camillo Taylor, Jitendra MalikPresented by Richard KelleyThe Problem Given: A set of still photographs of an existing architectural s
Nevada - CS - 486
Parts-based 3D object classificationDaniel Huber, Anuj Kapuria, etc. The RI of CMU Presented by Bing LiFor CS 686:Advanced Computer Vision Instructor: Dr. Mircea Nicolescu 10/3/2006Introduction Object recognition Object classification Advanta
Nevada - CS - 486
Performance of optical Flow TechniquesJ.L. Barron D.J. Fleet S.S. Beauchemin T.A. BurkittPresented by: Pradeep R Katta Department of Computer Science and Engineering University of Nevada, Reno Under the guidance of : Dr. Mircea Nicolescu P
Nevada - CS - 486
Motion Segmentation and Tracking Using Normalized CutsJianbo Shi Jitendra MalikProblem Biologically: Strongest cue for image segmentation is common motion Lower vertebrates: Only see moving objects Computer Vision: Motion-based segmentation is
Nevada - CS - 486
Smoothness in Layers: Motion segmentation using nonparametric mixture estimationYair Weiss, CVPR 1997, pp. 520-527, Puerto-Rico Advance Computer Vision Instructor: Prof. Mircea Nicolescu Presenter: Reza IntroductionPrevious methods:Assu
Nevada - CS - 486
Motion Feature Detection Using Steerable Flow FieldsDavid J. Fleet, Micheal J. Black, Allen D. Jepson Advance Computer Vision Instructor: Prof. Nicolescu Presenter: Reza Amayeh IntroductionProblemEstimation and Detection of occlusion b
Nevada - CS - 486
Tensor Voting and ApplicationsBased on a CVPR Tutorial by Grard Medioni and Chi-Keung TangThe Problem Develop a flexible model for extraction of salient geometric features junctions, lines, surfaces, ., subjective contours Traditional bottom-u
Nevada - CS - 486
Tensor Voting and ApplicationsBased on a CVPR Tutorial by Grard Medioni and Chi-Keung TangOverview Related Work Tensor Voting in 2-D Tensor Voting in 3-D Tensor Voting in N-D Application to Vision Problems Stereo Visual Motion 3-D Surface
Nevada - CS - 486
Wallflower: Principles and Practice of Background MaintenanceAuthors: K. Toyama, J. Krumm, B. Brumitt and B. MeyersPresented by: Alireza Tavakkoli October 2006The Problem Foreground region detection- Which pixels belong to actual foreground o
Nevada - CS - 486
Background and Foreground Modeling Using Nonparametric Kernel Density Estimation for Visual SurveillanceAhmed Elgammal, Ramani Duraiswami, David Harwood, and Larry S. DavisPresented by Richard KelleyMotivation We want to use cameras to monitor a
Nevada - CS - 486
Moving Shadow and Object Detection in Traffic ScenesIvana Mikic Pamela C. Cosman Greg T. Kogut Mohan M.TrivediPresented by: Pradeep R Katta Department of Computer Science and Engineering University of Nevada, Reno Under the guidance of : Dr. Mir
Nevada - CS - 486
Rapid Object Detection using a Boosted Cascade of Simple FeaturesPaul Viola and Michael Jones In CVPR01, pages I:511518, 2001Presented by: Chang Jia As for: Advanced Computer Vision Instructor: Dr. Mircea Nicolescu10/26/2006The ProblemMain
Nevada - CS - 486
Elliptical Head Tracking Using Intensity Gradients and Color HistogramsStan Birchfield CVPR, 1998PROBLEMZOOMTILT PANAPPLICATIONS: * video conferencing * distance learningNECESSARY TASKS: * tilt * pan * zoom in/outCHALLENGES: * out-of-pla
Nevada - CS - 486
Segmentation and Tracking of Multiple Humans in Complex Situations1Tao Zhao Ram Nevatia Fengjun LvProblemImage subtraction segmentation is not robust to: Shadows Reflections Separating groups into individuals False detectionsContributionApply
Nevada - CS - 486
Review ofRobust Online Appearance Models for Visual TrackingAmol Ambardekar For the course in Advanced Computer VisionAppearance models Appearance models are used to model the appearance of the scene. This paper proposes to use robust online
Nevada - CS - 486
Segmentation and Tracking of Interacting Human Body Parts under Occlusion and ShadowingIEEE Workshop on Motion and Video Computing, 2002. Sangho Park and J.K. AggarwalPresented by: Chang Jia As for: Advanced Computer Vision Instructor: Dr. Mir
Nevada - CS - 486
Review of W4: Real-Time Surveillance of People and Their ActivitiesAmol AmbardekarIntroduction Its major application is in outdoor surveillance It works in real-time It uses mochromatic video camera or infraredcamera It uses shape analysis
Nevada - CS - 486
Appearance-Based Place Recognition for Topological LocalizationIwan Ulrich Illah NourbakhshContribution: Robot: Where am I ? Many robot tasks require knowledge of localization Localization algorithm should be: Easily trained Accurate Flex
Nevada - CS - 486
A Visual Front-end for Simultaneous Localization and MappingLuis Goncalves, Enrico Di Bernardo, Dave Benson, Marcus Svedman, Jim Ostrowski, Niklas Karlsson, Paolo PirjanianPresented by: Pradeep R KattaDepartment of Computer Science and Engineeri
Nevada - CS - 486
Recognizing Hand Gesture Using Motion TrajectoriesMing-Hsuan Yang and Narendra AhujaOverview Goal: Extracting and classifying two-dimensional motion fields of objects across a video sequence. Major steps of algorithm: Obtaining motion pattern:
Nevada - CS - 486
Recognizing Facial Expressions in Image Sequences Using Local Parameterized Models of Image MotionBy Michael Black And Yaser YacoobPresented by Richard KelleyProblem Statement Given: A sequence of images of a face (with possibly significant head
Nevada - CS - 486
Event Detection and Analysis from Video StreamsAuthors: Gerard Medioni, Issac Cohen, Francois Bremond, Somboon Hongeng and Ramakant NevatiaPresented by: Alireza Tavakkoli December 2006Introduction Problem- Analyzing the behavior of moving obj
Nevada - CS - 486
Learning Patterns of Activity Using Real-Time TrackingChris Stauffer, Eric L. GrimsonPresented by: Chang Jia As for: Advanced Computer Vision Instructor: Dr. Mircea Nicolescu06/04/09 1Introduction: A Forest of Sensors Given autonomous vision mo
Nevada - CS - 486
Detecting Unusual Activity in VideoHua Zhong Jianbo Shi Mirko VisontaiContribution Manual detection of behaviors is costly and error prone Automatic behavior recognition is difficult Can't model all deviant behaviors Unpredictable Rare Subtl
Nevada - CS - 486
Space Time Behavior Based Correlation Eli Shechtman Michal IraniPresented By: Pradeep R Katta For : Advanced Computer Vision Advisor: Dr. Mircea Nicolescu The Problem To obtain behavioral similarity between two video frames using spa
Nevada - CS - 486
Efficient Visual Event Detection using Volumetric FeaturesYan Ke, Rahul Sukthankar, and Martial HebertPresented by Richard KelleyThe Problem Given a video, use visual information to detect events that occur in that video. Solutions to the probl
Nevada - CS - 791
CS 791E Computer VisionInstructor: Mircea Nicolescu Lecture 1Contacts Instructor: Dr. Mircea Nicolescu- E-mail: - Office: - Office Hours: mircea@cse.unr.edu SEM 232 Tuesday, Thursday: 11:00am-12:00pm Class web page:- http:/www.cse.unr.edu/~m
Nevada - CS - 791
CS 791E Computer VisionInstructor: Mircea Nicolescu Lecture 2Progress in Computer Vision First generation: Military/Early Research Few systems, each custom-built, cost $Ms Users have PhDs 1 hour per frame Second generation: Industrial/Medic
Nevada - CS - 791
<?xml version="1.0" encoding="UTF-8"?> <Error><Code>NoSuchKey</Code><Message>The specified key does not exist.</Message><Key>934ad9d6f30caefc61a781fb9c8bb4cb7ea3320f.ppt</Key><RequestId>F AE2CBAA9746FEBD</RequestId><HostId>07h5yXWuLECQGzLgk+ +9qWBV1M
Nevada - CS - 791
CS 791E Computer VisionHomework 1 (Due Thursday, September 13)1. (30 pts) Browse through the web-pages of various computer vision research groups and find one computer vision research project that is most interesting to you. Such research groups
Nevada - CS - 791
CS 791E Computer VisionInstructor: Mircea Nicolescu Lecture 4Geometric Properties of Projection Points go to points Lines go to lines Planes go to whole image Polygons go to polygons2Polyhedra Project to Polygons3Junctions Are Constra
Nevada - CS - 791
CS 791E Computer VisionInstructor: Mircea Nicolescu Lecture 5Area/Mask Processing Methods Convolution1) For each pixel in the input image, the mask is conceptually placed on top of the image with its origin lying on that pixel. 2) The values of
Nevada - CS - 791
CS 791E Computer VisionInstructor: Mircea Nicolescu Lecture 6Modeling Intensity Changes Edges can be modeled according to their intensity profiles: Step edge: the image intensity abruptly changes from one value to one side of the discontinuity
Nevada - CS - 791
<?xml version="1.0" encoding="UTF-8"?> <Error><Code>NoSuchKey</Code><Message>The specified key does not exist.</Message><Key>4404d139da7eefee5a746276a8c79b44529a7017.ppt</Key><RequestId>9 0F121345F57D00F</RequestId><HostId>kGqP9b/YDbqMMnOALKkh0o3G+fZ
Nevada - CS - 791
CS 791E Computer VisionInstructor: Mircea Nicolescu Lecture 8Edge Detection Using the 2nd Derivative The Marr-Hildreth edge detector Uses the Laplacian-of-Gaussian (LOG) To reduce the noise effect, the image is first smoothed with a lowpass fi
Nevada - CS - 791
CS 791E Computer VisionHomework 2 (Due Thursday, October 4)1. (16 pts) Convolve the subimage shown below with a 3x3 mean filter. What is the output of the convolution at the center entry of the subimage? What if you use a 3x3 median filter? 4 3
Nevada - CS - 791
CS 791E Computer VisionInstructor: Mircea Nicolescu Lecture 9Local Processing Methods Observations regarding contour extraction:- The output of edge detectors tends to have approximately constant (and large) strength along object boundaries. -
Nevada - CS - 791
CS 791E Computer VisionInstructor: Mircea Nicolescu Lecture 10The Hough Transform The Hough Transform can be used for line detection Consider the slope-intercept equation of a line: y = ax + b(a, b are constants, x is a variable, y is a funct
Nevada - CS - 791
CS 791E Computer VisionInstructor: Mircea Nicolescu Lecture 11Edge Contour Representation1) The simplest representation of a contour is using an ordered list of edge points.- - - As accurate as the location estimates for the edge points. Not ve
Nevada - CS - 791
CS 791E Computer VisionHomework 3 (Due Thursday, October 11)1. (40 pts) Consider the least-squares approach for finding the best line approximation to a set of points. Derive the least-square solution using the slope-intercept line representatio
Nevada - CS - 791
CS 791E Computer VisionInstructor: Mircea Nicolescu Lecture 12Representation Using Curve Fitting Circular arcs- Once an edge list has been approximated by line segments, subsequences of line segments can be replaced by circular arcs. - Fit circ
Nevada - CS - 791
CS 791E Computer VisionInstructor: Mircea Nicolescu Lecture 13Deformable/Active Contours (Snakes) Snakes- Goal find a contour that best approximates the perimeter of an object. - It is helpful to visualize it as a rubber band of arbitrary shap
Nevada - CS - 791
CS 791E Computer VisionInstructor: Mircea Nicolescu Lecture 14Image Segmentation Goals and Difficulties- - - The goal of segmentation is to partition an image into regions (e.g., separate objects from background) The results of segmentation are
Nevada - CS - 791
CS 791E Computer VisionInstructor: Mircea Nicolescu Lecture 15Region Detection Properties for region-based segmentation- Partition an image R into sub-regions R1, R2,., Rn - Assume P(Ri) is a logical predicate a property that pixel values of r
Nevada - CS - 791
CS 791E Computer VisionInstructor: Mircea Nicolescu Lecture 16Thresholding Otsu's method A measure of region homogeneity is variance (i.e., regions with high homogeneity will have low variance). Otsu's method selects the threshold by minimizin
Nevada - CS - 791
CS 791E Computer VisionInstructor: Mircea Nicolescu Lecture 17Region Merging Region merging using hypothesis testing- This approach considers whether or not to merge adjacent regions based on the probability that they will have the same statist
Nevada - CS - 791
Segmentation for Videos with Quasi-Stationary Backgrounds A Non-Parametric ApproachAlireza Tavakkoli Advisor: Dr. Mircea Nicolescu Department of Computer Science and EngineeringOutline Problem definition Previous work Motivations The AKD
Nevada - CS - 791
CS 791E Computer VisionInstructor: Mircea Nicolescu Lecture 192D Geometric Transformations General form of a transformation matrix Affine transformations- Involve translations, rotations, scale, and shear - Preserve parallelism of lines but no
Nevada - CS - 791
CS 791E Computer VisionHomework 4 (Due Tuesday, November 13)1. (25 pts) In the context of image segmentation, assume that the intensity values of the object and background pixels are distributed according to the following probability density fun
Nevada - CS - 791
CS 791E Computer VisionInstructor: Mircea Nicolescu Lecture 20Method 1: Direct Parameter Calibration Assume that the world reference frame is known (e.g., the origin is the middle lower corner of the calibration pattern). Review of basic equati
Nevada - CS - 791
CS 791E Computer VisionInstructor: Mircea Nicolescu Lecture 21Stereo Vision Goal- The recovery of the 3D scene structure, using two or more images of the 3D scene, each acquired from a different viewpoint in space. - The images can be obtained
Nevada - CS - 791
CS 791E Computer VisionInstructor: Mircea Nicolescu Lecture 22The Correspondence Problem Methods for establishing correspondences- There are two issues to be considered:- how to select candidate matches? - how to determine the goodness of a ma
Nevada - CS - 791
CS 791E Computer VisionInstructor: Mircea Nicolescu Lecture 23Estimating the Epipolar Geometry The essential matrix, E The previous equation can now be rewritten as:where E = RS is called the essential matrix. The equation prTEpl = 0 defines
Nevada - CS - 791
596IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE,VOL. 29,NO. 4,APRIL 2007A Bayesian Approach to Deformed Pattern Matching of Iris ImagesJason Thornton, Student Member, IEEE, Marios Savvides, Member, IEEE, and B.V.K. Vijaya
Nevada - CS - 791
Computer Vision and Image Understanding 108 (2007) 196203 www.elsevier.com/locate/cviuRobust real-time vision for a personal service robot Gerard Medioniaa,*, Alexandre R.J. Francois a, Matheen Siddiqui a, a Kwangsu Kim , Hosub Yoon bInsti
Nevada - CS - 791
Robotics and Autonomous Systems 55 (2007) 904916 www.elsevier.com/locate/robotIVVI: Intelligent vehicle based on visual informationJos Mara Armingol a, , Arturo de la Escalera a , Cristina Hilario a , Juan M. Collado a , e i e i e Juan Pablo Carra
Nevada - CS - 791
Hidden Conditional Random Fields for Gesture RecognitionSy Bor Wang Ariadna Quattoni Louis-Philippe Morency Trevor Darrell David Demirdjian{sybor, ariadna, lmorency, demirdji, trevor}@csail.mit.eduComputer Science and Artificial Intelligence Lab
Nevada - CS - 791
544IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE,VOL. 22, NO. 5,MAY 2000Short Papers_Object Tracking Using Deformable TemplatesYu Zhong, Anil K. Jain, Fellow, IEEE, and M.-P. Dubuisson-Jolly, Member, IEEEAbstractWe prop
Nevada - CS - 791
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, VOL. 3, NO. 1, MARCH 200237Detection and Classification of VehiclesSurendra Gupte, Osama Masoud, Robert F. K. Martin, and Nikolaos P. Papanikolopoulos, Member, IEEEAbstract-This paper pre
Nevada - CS - 791
CS 791E Computer VisionProgramming Assignment 3 (Due Thursday, November 29)1. (100 pts) Test and evaluate the camera calibration procedure, by using the OpenCV function cvCalibrateCamera_64d to compute the intrinsic and extrinsic camera paramete
Nevada - CS - 791
CS 791E Computer VisionProgramming Assignment 1 (Due Tuesday, September 25)1. (40 pts) Implement image smoothing using convolution with Gaussian masks. You should use 2 input images of your choice. First, implement 2D Gaussian convolution using