Multi-Information Based GCPs Selection Method

Slides:



Advertisements
Similar presentations
Applications of one-class classification
Advertisements

Object Recognition from Local Scale-Invariant Features David G. Lowe Presented by Ashley L. Kapron.
3D Model Matching with Viewpoint-Invariant Patches(VIP) Reporter :鄒嘉恆 Date : 10/06/2009.
Random Forest Predrag Radenković 3237/10
Summary of Friday A homography transforms one 3d plane to another 3d plane, under perspective projections. Those planes can be camera imaging planes or.
Human Identity Recognition in Aerial Images Omar Oreifej Ramin Mehran Mubarak Shah CVPR 2010, June Computer Vision Lab of UCF.
Automatic Histogram Threshold Using Fuzzy Measures 呂惠琪.
Object Recognition using Invariant Local Features Applications l Mobile robots, driver assistance l Cell phone location or object recognition l Panoramas,
IIIT Hyderabad Pose Invariant Palmprint Recognition Chhaya Methani and Anoop Namboodiri Centre for Visual Information Technology IIIT, Hyderabad, INDIA.
Multiple People Detection and Tracking with Occlusion Presenter: Feifei Huo Supervisor: Dr. Emile A. Hendriks Dr. A. H. J. Stijn Oomes Information and.
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
Object Recognition with Invariant Features n Definition: Identify objects or scenes and determine their pose and model parameters n Applications l Industrial.
Image Quilting for Texture Synthesis and Transfer Alexei A. Efros1,2 William T. Freeman2.
Object Recognition with Invariant Features n Definition: Identify objects or scenes and determine their pose and model parameters n Applications l Industrial.
Color a* b* Brightness L* Texture Original Image Features Feature combination E D 22 Boundary Processing Textons A B C A B C 22 Region Processing.
Object Class Recognition Using Discriminative Local Features Gyuri Dorko and Cordelia Schmid.
Fitting a Model to Data Reading: 15.1,
Scale Invariant Feature Transform (SIFT)
CS664 Lecture #19: Layers, RANSAC, panoramas, epipolar geometry Some material taken from:  David Lowe, UBC  Jiri Matas, CMP Prague
Automatic Image Alignment (feature-based) : Computational Photography Alexei Efros, CMU, Fall 2006 with a lot of slides stolen from Steve Seitz and.
Robust estimation Problem: we want to determine the displacement (u,v) between pairs of images. We are given 100 points with a correlation score computed.
כמה מהתעשייה? מבנה הקורס השתנה Computer vision.
Overview Introduction to local features
1 Interest Operators Harris Corner Detector: the first and most basic interest operator Kadir Entropy Detector and its use in object recognition SIFT interest.
Object Tracking/Recognition using Invariant Local Features Applications l Mobile robots, driver assistance l Cell phone location or object recognition.
A Local Adaptive Approach for Dense Stereo Matching in Architectural Scene Reconstruction C. Stentoumis 1, L. Grammatikopoulos 2, I. Kalisperakis 2, E.
MESA LAB Multi-view image stitching Guimei Zhang MESA LAB MESA (Mechatronics, Embedded Systems and Automation) LAB School of Engineering, University of.
Texture. Texture is an innate property of all surfaces (clouds, trees, bricks, hair etc…). It refers to visual patterns of homogeneity and does not result.
A Statistical Approach to Speed Up Ranking/Re-Ranking Hong-Ming Chen Advisor: Professor Shih-Fu Chang.
A 3D Model Alignment and Retrieval System Ding-Yun Chen and Ming Ouhyoung.
Image Classification 영상분류
Museum and Institute of Zoology PAS Warsaw Magdalena Żytomska Berlin, 6th September 2007.
Evaluation of interest points and descriptors. Introduction Quantitative evaluation of interest point detectors –points / regions at the same relative.
A Statistical Method for 3D Object Detection Applied to Face and Cars CVPR 2000 Henry Schneiderman and Takeo Kanade Robotics Institute, Carnegie Mellon.
Wenqi Zhu 3D Reconstruction From Multiple Views Based on Scale-Invariant Feature Transform.
18 th August 2006 International Conference on Pattern Recognition 2006 Epipolar Geometry from Two Correspondences Michal Perďoch, Jiří Matas, Ondřej Chum.
1 Similarity-based matching for face authentication Christophe Rosenberger Luc Brun ICPR 2008.
P ROBING THE L OCAL -F EATURE S PACE OF I NTEREST P OINTS Wei-Ting Lee, Hwann-Tzong Chen Department of Computer Science National Tsing Hua University,
Levels of Image Data Representation 4.2. Traditional Image Data Structures 4.3. Hierarchical Data Structures Chapter 4 – Data structures for.
Jack Pinches INFO410 & INFO350 S INFORMATION SCIENCE Computer Vision I.
BOT / GEOG / GEOL 4111 / Field data collection Visiting and characterizing representative sites Used for classification (training data), information.
Image Registration Advanced DIP Project
Scale Invariant Feature Transform (SIFT)
Robust Estimation Course web page: vision.cis.udel.edu/~cv April 23, 2003  Lecture 25.
Morphological Image Processing
CSCI 631 – Foundations of Computer Vision March 15, 2016 Ashwini Imran Image Stitching.
Invariant Local Features Image content is transformed into local feature coordinates that are invariant to translation, rotation, scale, and other imaging.
SIFT.
CSCI 631 – Foundations of Computer Vision March 15, 2016 Ashwini Imran Image Stitching Link: singhashwini.mesinghashwini.me.
Clustering (1) Clustering Similarity measure Hierarchical clustering
CMSC5711 Image processing and computer vision
Signal and Image Processing Lab
Automatically Collect Ground Control Points from Online Aerial Maps
Learning Mid-Level Features For Recognition
A Brief Introduction of RANSAC
A New Approach to Track Multiple Vehicles With the Combination of Robust Detection and Two Classifiers Weidong Min , Mengdan Fan, Xiaoguang Guo, and Qing.
Image Processing for Physical Data
CAP 5415 Computer Vision Fall 2012 Dr. Mubarak Shah Lecture-5
Shape matching and object recognition using shape contexts
CSE 455 – Guest Lectures 3 lectures Contact Interest points 1
Brief Review of Recognition + Context
SIFT.
Midterm Exam Closed book, notes, computer Similar to test 1 in format:
Antonio Plaza University of Extremadura. Caceres, Spain
ECE734 Project-Scale Invariant Feature Transform Algorithm
Midterm Exam Closed book, notes, computer Similar to test 1 in format:
Jie Chen, Shiguang Shan, Shengye Yan, Xilin Chen, Wen Gao
Presented by Xu Miao April 20, 2005
--- Range Image Registration
Outline Texture modeling - continued Markov Random Field models
Presentation transcript:

Multi-Information Based GCPs Selection Method Yanfeng Gu, Zhimin Cao, Ye Zhang Harbin Institute of Technology, China

Outline Background Bucket sampling The proposed methods Experiments and results 5/7/2019 guyf77@gmail.com Harbin Institute of Technology

Background GCPs(Ground Control Points) A location on the surface of the Earth (e.g., a road intersection, centre of special building, road corner, building corner) that can be identified on the imagery and located accurately on a map road intersection centre of special shape road corner building corner 5/7/2019 guyf77@gmail.com Harbin Institute of Technology

Background The methods for extraction and matching of GCPs SIFT MSER Scale Invariant Feature Transform, an algorithm in computer vision to detect and describe local features in images MSER Maximally Stable Extremal Region, to find correspondences between image elements from two images with different viewpoints RANSAC RANdom SAmple Consensus, an iterative method to estimate parameters of a mathematical model from a set of observed data which contains outliers 5/7/2019 guyf77@gmail.com Harbin Institute of Technology

Background What problems of GCPs should be considered Number of GCPs In terms of some specific applications, there are definite requirements for number of GCPs. (e.g. 39 for 3rd RFM) Spatial Distribution of GCPs The goal is to make the distribution of GCPs evenly for most of applications 5/7/2019 guyf77@gmail.com Harbin Institute of Technology

Bucket Method/Sampling The ‘bucket’ is just a type of data structure which is open hashing with chaining Step 1: the test region is divided into buckets. Each bucket may contain a number of GCPs.

Bucket Method Step 2: the GCPs with minimum and maximum coordinates are chosen as the first two GCPs to be finally selected, the others will be assigned to corresponding buckets. 5/7/2019 guyf77@gmail.com Harbin Institute of Technology

Bucket Method Step 3: the rest GCPs are selected from buckets which contain more than one GCP 5/7/2019 guyf77@gmail.com Harbin Institute of Technology

Bucket Method Advantage Disadvantage Bucket method is able to get certain number of GCPs with evenly distribution to some extent Disadvantage Some useful information do not be considered Height Spatial region information 5/7/2019 guyf77@gmail.com Harbin Institute of Technology

The proposed methods 3D Bucket Multi-information based GCPs Selection Bucket-based sampling Use of height Multi-information based GCPs Selection Use of spatial correlation in local region 5/7/2019 guyf77@gmail.com Harbin Institute of Technology

Multi-information GCPs Selection Input candidate GCPs Calculate the corresponding gray correlation of each points in local Classify the GCPs with the histogram of the correlation coefficients Clustering subsets by k-means Select GCPs from these clustered subsets Output 5/7/2019 guyf77@gmail.com Harbin Institute of Technology

Multi-information GCPs Selection Input candidate GCPs Calculate the corresponding gray correlation of each points in local Classify the GCPs with the histogram of the correlation coefficients Clustering subsets by k-means Select GCPs from these clustered subsets Output 5/7/2019 guyf77@gmail.com Harbin Institute of Technology

Multi-information GCPs Selection Input candidate GCPs Calculate the corresponding gray correlation of each points in local Classify the GCPs with the histogram of the correlation coefficients Clustering subsets by k-means Select GCPs from these clustered subsets Output 5/7/2019 guyf77@gmail.com Harbin Institute of Technology

Experimental Results Tested data : Avenches (downloaded from http://www.isprs.org/data/avenches/default.aspx) Image Size: 1800*1800 pixels Image resolution: 7.5cm/pixel Note: the corresponding rigorous model is available for evaluation 450 pairs of GCPs extracted: SIFT+MSER+RANSAC 5/7/2019 guyf77@gmail.com Harbin Institute of Technology

Table 1. The Comparison of Relative Errors of horizontal coordinates Experimental Results Table 1. The Comparison of Relative Errors of horizontal coordinates 40 45 50 55 60 65 75 direct 0.0049 0.0022 5.55e-4 5.67e-4 3.62e-4 3.58e-4 4.70e-4 bucket 7.50e-4 6.07e-4 5.24e-4 4.75e-4 3.54e-4 2.90e-4 2.78e-4 3Dbucket 6.84e-4 4.05e-4 3.86e-4 2.97e-4 2.61e-4 2.40e-4 Multi-info 4.49e-4 3.44e-4 2.52e-4 2.14e-4 2.58e-4 2.22e-4 2.11e-4 5/7/2019 guyf77@gmail.com Harbin Institute of Technology

Table 2. The comparison of Relative Errors of vertical coordinates Experimental Results Table 2. The comparison of Relative Errors of vertical coordinates 40 45 50 55 60 65 75 direct 0.0168 0.0115 0.0076 0.0085 0.0047 0.0038 0.0070 bucket 0.0052 0.0042 0.0040 0.0037 0.0035 0.0034 0.0033 3Dbucket 0.0064 0.0053 0.0041 0.0036 Multi-info 0.0049 0.0044 0.0032 5/7/2019 guyf77@gmail.com Harbin Institute of Technology

Than you for your attention! 5/7/2019 guyf77@gmail.com Harbin Institute of Technology