> TEXTURE MODELING BY GAUSSIAN FIELDS

Size: px
Start display at page:

Download "> TEXTURE MODELING BY GAUSSIAN FIELDS"

Transcription

1 Outils pour le traitement d image Synthèse de texture (013 [ ] 015) Super-résolution de lignes ( ) Analyse de textures par TO monogène (016) Super-résolution de sinusoïdes par TO monogène (016) Thèse de Kévin Polisano (LJK) Marianne Clausel, Valérie Perrier (LJK) Laurent Condat (Gipsa-Lab) > TEXTURE MODELING BY GAUSSIAN FIELDS WITH PRESCRIBED LOCAL ORIENTATION ANR ASTRES - ENS Lyon, le 19 novembre 015

2 The basic component : Fractional Brownian Field (FBF) Harmonizable representation B H e ix 1 (x) = R k k H+1 d W c ( ) [Samorodnitsky,Taqqu,1997] roughness indicator complex Brownian measure H=0. H=0.7 Polisano et al. - Texture modeling by Gaussian field with prescribed local orientation

3 Elementary field (Bonami-Estrade 003, B H 0, (x) = Biermé-Moisan- Richard 015) (e ix 1) 1 [, ](arg 0 ) R k k H+1 d c W ( ) Texture orientation x 0 ~V x0 0 =0 = Polisano et al. - Texture modeling by Gaussian field with prescribed local orientation 3

4 Elementary field B H 0, (x) = (e ix 1) 1 [, ](arg 0 ) R k k H+1 d c W ( ) Texture orientation x 0 ~V x0 0 = 3 = 0.7 Polisano et al. - Texture modeling by Gaussian field with prescribed local orientation 4

5 B H 0, (x) = Elementary field (e ix 1) 1 [, ](arg 0 ) R k k H+1 d c W ( ) Texture orientation x 0 ~V x0 0 = 3 = 0.6 Polisano et al. - Texture modeling by Gaussian field with prescribed local orientation 5

6 B H 0, (x) = Elementary field (e ix 1) 1 [, ](arg 0 ) R k k H+1 d c W ( ) Texture orientation x 0 ~V x0 0 = 3 = 0.5 Polisano et al. - Texture modeling by Gaussian field with prescribed local orientation 6

7 B H 0, (x) = Elementary field (e ix 1) 1 [, ](arg 0 ) R k k H+1 d c W ( ) Texture orientation x 0 ~V x0 0 = 3 = 0.4 Polisano et al. - Texture modeling by Gaussian field with prescribed local orientation 7

8 B H 0, (x) = Elementary field (e ix 1) 1 [, ](arg 0 ) R k k H+1 d c W ( ) Texture orientation x 0 ~V x0 0 = 3 = 0.3 Polisano et al. - Texture modeling by Gaussian field with prescribed local orientation 8

9 B H 0, (x) = Elementary field (e ix 1) 1 [, ](arg 0 ) R k k H+1 d c W ( ) Texture orientation x 0 ~V x0 0 = 3 = 0. Polisano et al. - Texture modeling by Gaussian field with prescribed local orientation 9

10 B H 0, (x) = Elementary field (e ix 1) 1 [, ](arg 0 ) R k k H+1 d c W ( ) Texture orientation x 0 ~V x0 0 = 3 = 0.1 Polisano et al. - Texture modeling by Gaussian field with prescribed local orientation 10

11 B H 0, (x) = Elementary field (e ix 1) 1 [, ](arg 0 ) R k k H+1 d c W ( ) Texture orientation x 0 ~V x0 0 = 3 = 0.05 Polisano et al. - Texture modeling by Gaussian field with prescribed local orientation 11

12 Locally Anisotropic Fractional Brownian Field (LAFBF) Definition: Our new Gaussian model LAFBF is a local version of the elementary field B H 0, (x) = (e ix 1) 1 [, ](arg 0 (x)) R k k H+1 dw c ( ) [Polisano et al.,014] Texture orientation x 0 ~V x0 f 1/ (x 0, ) = c 0, (x 0, arg ) k k H+1 The orientation may varies spatially. 0 is now a differentiable function on R Polisano et al. - Texture modeling by Gaussian field with prescribed local orientation 1

13 Locally Anisotropic Fractional Brownian Field (LAFBF) Definition: Our new Gaussian model LAFBF is a local version of the elementary field B H 0, (x) = (e ix 1) 1 [, ](arg 0 (x)) R k k H+1 dw c ( ) [Polisano et al.,014] Texture orientation x 0 ~V x0 (a) (b) Polisano et al. - Texture modeling by Gaussian field with prescribed local orientation 13

14 Tangent field B H 0, (x) = (e ix 1) 1 [, ](arg 0 (x)) R k k H+1 d c W ( ) Tangent field. For a random field X locally asymptotically self-similar of order H, X (x 0 + h) X (x 0 ) H L!!0 Y x0 Y x0 : tangent field of X at point x 0 R [Benassi,1997] [Falconer,00] Taylor s expansion Deterministic case Tangent field Stochastic case Polisano et al. - Texture modeling by Gaussian field with prescribed local orientation 14

15 Tangent field B H 0, (x) = (e ix 1) 1 [, ](arg 0 (x)) R k k H+1 d c W ( ) Theorem. The LAFBF B H 0, admits for tangent field Y x0 : Y x0 (x) = Y x0 (e ix 1) 1 [, ](arg 0 (x 0 )) R k k H+1 d c W ( ) elementary field with global orientation 0 (x 0 ) constant B H 0, (x 0 ) Y x0 (x = x 0 ) Polisano et al. - Texture modeling by Gaussian field with prescribed local orientation 15

16 Elementary field : simulation by turning bands Y x0 [n] (x) = (H) 1 nx i=1 p ic 0, (x 0, i )B H i (x u( i )) x 0 Different bands (1D FBM) are implied in the sum x 0 ~V x0 ~V x0 0 = 3 0 = The grayscale repartition completely changes between two close angles = 0.1 Polisano et al. - Texture modeling by Gaussian field with prescribed local orientation 16

17 LAFBF simulation by tangent fields [T.B] B H 0, (x 0 ) Y x0 (x = x 0 ) Vector field : 0 (x) = + x Orientation curves : 1 ln cos x + y 0 (y (x)=tan (x) ) The texture is properly oriented We observe bands artifacts The grayscale repartition completely changes between two close angles 0 = 67 0 = 55 Polisano et al. - Texture modeling by Gaussian field with prescribed local orientation 17

18 Elementary field : simulation by Cholesky Variance and covariance of an elementary field. v H, 1, (x) = H 1 (H)C H, 1, (arg x)kxk H Cov (Y H, 1, (x), Y H, 1, (y)) = v H, 1, (x)+v H, 1, (y) v H, 1, (x y) Cholesky method. = LL T N (0, 1) Y L [Drawback : very time and memory consuming] The grayscale repartition is now the quite the same for two close angles use the same random vector for the computation of all tangent field Y 0 = 3 = = Polisano et al. - Texture modeling by Gaussian field with prescribed local orientation 18

19 Elementary field simulation Comparison Turning bands VS. Cholesky method The grayscale repartition completely changes between two close angles The grayscale repartition is now the quite the same for two close angles 0 = 3 = = Polisano et al. - Texture modeling by Gaussian field with prescribed local orientation 19

20 Elementary field simulation Comparison Turning bands VS. Cholesky method The «transversal» variance varies The «transversal» variance doesn t vary enough 0 = 3 = 0.1 Polisano et al. - Texture modeling by Gaussian field with prescribed local orientation 0

21 LAFBF simulation by tangent fields [Chol] B H 0, (x 0 ) Y x0 (x = x 0 ) Vector field : 0 (x) = + x Orientation curves : Bands artifacts disappear The grayscales don t fit the orientation as we expected ln 1 cos x + y 0 The grayscale repartition is now the quite the same for two close angles 0 = 67 0 = 55 Polisano et al. - Texture modeling by Gaussian field with prescribed local orientation 1

22 Why the grayscale curves are like that? Orientation curve Parallel lines of elementary fields rotated C 0 (x) = + x Polisano et al. - Texture modeling by Gaussian field with prescribed local orientation

23 Why the grayscale curves are like that? C Polisano et al. - Texture modeling by Gaussian field with prescribed local orientation 3

24 Equations of the grayscale curves? B H 0, (x 0 ) Y x0 (x = x 0 ) Vector field : 0 (x) = + x Orientation curves : ln 1 cos x + y 0 Theoritical grayscale curves : C cos x + x tan(x) We observe the green curve look likes better but does not fit exactly the grayscale variations either Polisano et al. - Texture modeling by Gaussian field with prescribed local orientation 4

25 Why does it not fit exactly? C=0.8 C=0 The green lines is varying faster than the gray lines! Polisano et al. - Texture modeling by Gaussian field with prescribed local orientation 5

26 LAFBF simulation by tangent fields [Chol] B H 0, (x 0 ) Y x0 (x = x 0 ) Vector field : We observe the accurate orientations but they seem to appear for high frequencies 0 (x) = + y Orientation curves : arcsin(sin(y 0 )e x ) Definition of orientation in high frequencies? Wavelet decomposition? Tangent field formulation is well adapted to the simulation of this oriented model? Polisano et al. - Texture modeling by Gaussian field with prescribed local orientation 6

27 LAFBF simulation by tangent fields [Chol] B H 0, (x 0 ) Y x0 (x = x 0 ) Vector field : We observe the accurate orientations but they seem to appear for high frequencies 0 (x) = + y Orientation curves : arcsin(sin(y 0 )e x ) Orientation contenue dans les hautes fréquences (le champ tangent est HF) Définir l orientation locale comme orientation du champ tangent Definition of orientation in high frequencies? Wavelet decomposition? Tangent field formulation is well adapted to the simulation of this oriented model? Polisano et al. - Texture modeling by Gaussian field with prescribed local orientation 7

28 Local orientations estimation Monogenic Wavelet Histogram of orientations + Von Mises distribution Working on empirical covariance? Olhede S., Detection directionality in random fields using the monogenic signal, preprint 013. Richard F., Tests of isotropy for rough textures of trended images, preprint 014. Polisano et al. - Texture modeling by Gaussian field with prescribed local orientation 8

Artifacts and Textured Region Detection

Artifacts and Textured Region Detection Artifacts and Textured Region Detection 1 Vishal Bangard ECE 738 - Spring 2003 I. INTRODUCTION A lot of transformations, when applied to images, lead to the development of various artifacts in them. In

More information

FMA901F: Machine Learning Lecture 3: Linear Models for Regression. Cristian Sminchisescu

FMA901F: Machine Learning Lecture 3: Linear Models for Regression. Cristian Sminchisescu FMA901F: Machine Learning Lecture 3: Linear Models for Regression Cristian Sminchisescu Machine Learning: Frequentist vs. Bayesian In the frequentist setting, we seek a fixed parameter (vector), with value(s)

More information

Convolution mixture of FBF and modulated FBF and application to HRTEM images

Convolution mixture of FBF and modulated FBF and application to HRTEM images Convolution mixture of FBF and modulated FBF and application to HRTEM images Zhangyun Tan, Olivier Alata, Maxime Moreaud, Abdourrahmane Atto To cite this version: Zhangyun Tan, Olivier Alata, Maxime Moreaud,

More information

Stochastic Simulation: Algorithms and Analysis

Stochastic Simulation: Algorithms and Analysis Soren Asmussen Peter W. Glynn Stochastic Simulation: Algorithms and Analysis et Springer Contents Preface Notation v xii I What This Book Is About 1 1 An Illustrative Example: The Single-Server Queue 1

More information

Differentiability and Tangent Planes October 2013

Differentiability and Tangent Planes October 2013 Differentiability and Tangent Planes 14.4 04 October 2013 Differentiability in one variable. Recall for a function of one variable, f is differentiable at a f (a + h) f (a) lim exists and = f (a) h 0 h

More information

Spatial Interpolation & Geostatistics

Spatial Interpolation & Geostatistics (Z i Z j ) 2 / 2 Spatial Interpolation & Geostatistics Lag Lag Mean Distance between pairs of points 1 Tobler s Law All places are related, but nearby places are related more than distant places Corollary:

More information

Spatial Interpolation - Geostatistics 4/3/2018

Spatial Interpolation - Geostatistics 4/3/2018 Spatial Interpolation - Geostatistics 4/3/201 (Z i Z j ) 2 / 2 Spatial Interpolation & Geostatistics Lag Distance between pairs of points Lag Mean Tobler s Law All places are related, but nearby places

More information

Schools of thoughts on texture

Schools of thoughts on texture Cameras Images Images Edges Talked about images being continuous (if you blur them, then you can compute derivatives and such). Two paths: Edges something useful Or Images something besides edges. Images

More information

Robot Mapping. Least Squares Approach to SLAM. Cyrill Stachniss

Robot Mapping. Least Squares Approach to SLAM. Cyrill Stachniss Robot Mapping Least Squares Approach to SLAM Cyrill Stachniss 1 Three Main SLAM Paradigms Kalman filter Particle filter Graphbased least squares approach to SLAM 2 Least Squares in General Approach for

More information

Graphbased. Kalman filter. Particle filter. Three Main SLAM Paradigms. Robot Mapping. Least Squares Approach to SLAM. Least Squares in General

Graphbased. Kalman filter. Particle filter. Three Main SLAM Paradigms. Robot Mapping. Least Squares Approach to SLAM. Least Squares in General Robot Mapping Three Main SLAM Paradigms Least Squares Approach to SLAM Kalman filter Particle filter Graphbased Cyrill Stachniss least squares approach to SLAM 1 2 Least Squares in General! Approach for

More information

CHAPTER 3 SURFACE ROUGHNESS

CHAPTER 3 SURFACE ROUGHNESS 38 CHAPTER 3 SURFACE ROUGHNESS 3.1 SURFACE ROUGHNESS AND ITS IMPORTANCE The evaluation of surface roughness of machined parts using a direct contact method has limited flexibility in handling the different

More information

Missing Data Analysis for the Employee Dataset

Missing Data Analysis for the Employee Dataset Missing Data Analysis for the Employee Dataset 67% of the observations have missing values! Modeling Setup Random Variables: Y i =(Y i1,...,y ip ) 0 =(Y i,obs, Y i,miss ) 0 R i =(R i1,...,r ip ) 0 ( 1

More information

Analysis in Integer and Fractional Dimensions

Analysis in Integer and Fractional Dimensions Analysis in Integer and Fractional Dimensions Ron Blei University of Connecticut ^ i UNIVERSITY PRE^S Contents Preface Acknowledgements I A Prologue: Mostly Historical 1 1. From the Linear to the Bilinear

More information

Image Processing and Analysis

Image Processing and Analysis Image Processing and Analysis 3 stages: Image Restoration - correcting errors and distortion. Warping and correcting systematic distortion related to viewing geometry Correcting "drop outs", striping and

More information

Precalculus: Graphs of Tangent, Cotangent, Secant, and Cosecant Practice Problems. Questions

Precalculus: Graphs of Tangent, Cotangent, Secant, and Cosecant Practice Problems. Questions Questions 1. Describe the graph of the function in terms of basic trigonometric functions. Locate the vertical asymptotes and sketch two periods of the function. y = 3 tan(x/2) 2. Solve the equation csc

More information

Texture Segmentation Using Multichannel Gabor Filtering

Texture Segmentation Using Multichannel Gabor Filtering IOSR Journal of Electronics and Communication Engineering (IOSRJECE) ISSN : 2278-2834 Volume 2, Issue 6 (Sep-Oct 2012), PP 22-26 Texture Segmentation Using Multichannel Gabor Filtering M. Sivalingamaiah

More information

Course Evaluations. h"p:// 4 Random Individuals will win an ATI Radeon tm HD2900XT

Course Evaluations. hp://  4 Random Individuals will win an ATI Radeon tm HD2900XT Course Evaluations h"p://www.siggraph.org/courses_evalua4on 4 Random Individuals will win an ATI Radeon tm HD2900XT A Gentle Introduction to Bilateral Filtering and its Applications From Gaussian blur

More information

A Wavelet-Based Method for Simulation of Seismic Wave Propagation

A Wavelet-Based Method for Simulation of Seismic Wave Propagation AGU Fall Meeting, A Wavelet-Based Method for Simulation of Seismic Wave Propagation Tae-Kyung Hong & B.L.N. Kennett Research School of Earth Sciences The Australian National University Abstract Seismic

More information

4 Visualization and. Approximation

4 Visualization and. Approximation 4 Visualization and Approximation b A slope field for the differential equation y tan(x + y) tan(x) tan(y). It is not always possible to write down an explicit formula for the solution to a differential

More information

Schedule for Rest of Semester

Schedule for Rest of Semester Schedule for Rest of Semester Date Lecture Topic 11/20 24 Texture 11/27 25 Review of Statistics & Linear Algebra, Eigenvectors 11/29 26 Eigenvector expansions, Pattern Recognition 12/4 27 Cameras & calibration

More information

Texture. Announcements. 2) Synthesis. Issues: 1) Discrimination/Analysis

Texture. Announcements. 2) Synthesis. Issues: 1) Discrimination/Analysis Announcements For future problems sets: email matlab code by 11am, due date (same as deadline to hand in hardcopy). Today s reading: Chapter 9, except 9.4. Texture Edge detectors find differences in overall

More information

Feature Selection for Image Retrieval and Object Recognition

Feature Selection for Image Retrieval and Object Recognition Feature Selection for Image Retrieval and Object Recognition Nuno Vasconcelos et al. Statistical Visual Computing Lab ECE, UCSD Presented by Dashan Gao Scalable Discriminant Feature Selection for Image

More information

Computer Vision I. Announcements. Fourier Tansform. Efficient Implementation. Edge and Corner Detection. CSE252A Lecture 13.

Computer Vision I. Announcements. Fourier Tansform. Efficient Implementation. Edge and Corner Detection. CSE252A Lecture 13. Announcements Edge and Corner Detection HW3 assigned CSE252A Lecture 13 Efficient Implementation Both, the Box filter and the Gaussian filter are separable: First convolve each row of input image I with

More information

1 Review of Functions Symmetry of Functions; Even and Odd Combinations of Functions... 42

1 Review of Functions Symmetry of Functions; Even and Odd Combinations of Functions... 42 Contents 0.1 Basic Facts...................................... 8 0.2 Factoring Formulas.................................. 9 1 Review of Functions 15 1.1 Functions.......................................

More information

CHAPTER 4 SEGMENTATION

CHAPTER 4 SEGMENTATION 69 CHAPTER 4 SEGMENTATION 4.1 INTRODUCTION One of the most efficient methods for breast cancer early detection is mammography. A new method for detection and classification of micro calcifications is presented.

More information

C3 Numerical methods

C3 Numerical methods Verulam School C3 Numerical methods 138 min 108 marks 1. (a) The diagram shows the curve y =. The region R, shaded in the diagram, is bounded by the curve and by the lines x = 1, x = 5 and y = 0. The region

More information

Calculus II (Math 122) Final Exam, 11 December 2013

Calculus II (Math 122) Final Exam, 11 December 2013 Name ID number Sections B Calculus II (Math 122) Final Exam, 11 December 2013 This is a closed book exam. Notes and calculators are not allowed. A table of trigonometric identities is attached. To receive

More information

Pre-Calculus Guided Notes: Chapter 10 Conics. A circle is

Pre-Calculus Guided Notes: Chapter 10 Conics. A circle is Name: Pre-Calculus Guided Notes: Chapter 10 Conics Section Circles A circle is _ Example 1 Write an equation for the circle with center (3, ) and radius 5. To do this, we ll need the x1 y y1 distance formula:

More information

Scaled representations

Scaled representations Scaled representations Big bars (resp. spots, hands, etc.) and little bars are both interesting Stripes and hairs, say Inefficient to detect big bars with big filters And there is superfluous detail in

More information

Image Enhancement Techniques for Fingerprint Identification

Image Enhancement Techniques for Fingerprint Identification March 2013 1 Image Enhancement Techniques for Fingerprint Identification Pankaj Deshmukh, Siraj Pathan, Riyaz Pathan Abstract The aim of this paper is to propose a new method in fingerprint enhancement

More information

Tuesday 22 January 2008 Afternoon Time: 1 hour 30 minutes

Tuesday 22 January 2008 Afternoon Time: 1 hour 30 minutes Paper Reference(s) 6666/0 Edexcel GCE Core Mathematics C4 Advanced Level Tuesday 22 January 2008 Afternoon Time: hour 30 minutes Materials required for examination Mathematical Formulae (Green) Items included

More information

Texture Segmentation Using Gabor Filters

Texture Segmentation Using Gabor Filters TEXTURE SEGMENTATION USING GABOR FILTERS 1 Texture Segmentation Using Gabor Filters Khaled Hammouda Prof. Ed Jernigan University of Waterloo, Ontario, Canada Abstract Texture segmentation is the process

More information

Natural image modeling using complex wavelets

Natural image modeling using complex wavelets Natural image modeling using complex wavelets André Jalobeanu Bayesian Learning group, NASA Ames - Moffett Field, CA Laure Blanc-Féraud, Josiane Zerubia Ariana, CNRS / INRIA / UNSA - Sophia Antipolis,

More information

(Part - 1) P. Sam Johnson. April 14, Numerical Solution of. Ordinary Differential Equations. (Part - 1) Sam Johnson. NIT Karnataka.

(Part - 1) P. Sam Johnson. April 14, Numerical Solution of. Ordinary Differential Equations. (Part - 1) Sam Johnson. NIT Karnataka. P. April 14, 2015 1/51 Overview We discuss the following important methods of solving ordinary differential equations of first / second order. Picard s method of successive approximations (Method of successive

More information

Optimal Denoising of Natural Images and their Multiscale Geometry and Density

Optimal Denoising of Natural Images and their Multiscale Geometry and Density Optimal Denoising of Natural Images and their Multiscale Geometry and Density Department of Computer Science and Applied Mathematics Weizmann Institute of Science, Israel. Joint work with Anat Levin (WIS),

More information

Curve fitting. Lab. Formulation. Truncation Error Round-off. Measurement. Good data. Not as good data. Least squares polynomials.

Curve fitting. Lab. Formulation. Truncation Error Round-off. Measurement. Good data. Not as good data. Least squares polynomials. Formulating models We can use information from data to formulate mathematical models These models rely on assumptions about the data or data not collected Different assumptions will lead to different models.

More information

Investigation of Directional Filter on Kube-Pentland s 3D Surface Reflectance Model using Photometric Stereo

Investigation of Directional Filter on Kube-Pentland s 3D Surface Reflectance Model using Photometric Stereo Investigation of Directional Filter on Kube-Pentland s 3D Surface Reflectance Model using Photometric Stereo Jiahua Wu Silsoe Research Institute Wrest Park, Silsoe Beds, MK45 4HS United Kingdom jerry.wu@bbsrc.ac.uk

More information

Texture Segmentation by using Haar Wavelets and K-means Algorithm

Texture Segmentation by using Haar Wavelets and K-means Algorithm Texture Segmentation by using Haar Wavelets and K-means Algorithm P. Ashok Babu Associate Professor, Narsimha Reddy Engineering College, Hyderabad, A.P., INDIA, ashokbabup2@gmail.com Dr. K. V. S. V. R.

More information

Feature Extraction and Image Processing, 2 nd Edition. Contents. Preface

Feature Extraction and Image Processing, 2 nd Edition. Contents. Preface , 2 nd Edition Preface ix 1 Introduction 1 1.1 Overview 1 1.2 Human and Computer Vision 1 1.3 The Human Vision System 3 1.3.1 The Eye 4 1.3.2 The Neural System 7 1.3.3 Processing 7 1.4 Computer Vision

More information

Locating Salient Object Features

Locating Salient Object Features Locating Salient Object Features K.N.Walker, T.F.Cootes and C.J.Taylor Dept. Medical Biophysics, Manchester University, UK knw@sv1.smb.man.ac.uk Abstract We present a method for locating salient object

More information

Machine Learning and Data Mining. Clustering (1): Basics. Kalev Kask

Machine Learning and Data Mining. Clustering (1): Basics. Kalev Kask Machine Learning and Data Mining Clustering (1): Basics Kalev Kask Unsupervised learning Supervised learning Predict target value ( y ) given features ( x ) Unsupervised learning Understand patterns of

More information

K-Means and Gaussian Mixture Models

K-Means and Gaussian Mixture Models K-Means and Gaussian Mixture Models David Rosenberg New York University June 15, 2015 David Rosenberg (New York University) DS-GA 1003 June 15, 2015 1 / 43 K-Means Clustering Example: Old Faithful Geyser

More information

f(x) lim does not exist.

f(x) lim does not exist. Indeterminate Forms and L Hopital s Rule When we computed its of quotients, i.e. its of the form f() a g(), we came across several different things that could happen: f(). a g() = f(a) g(a) when g(). a

More information

The Efficient Extension of Globally Consistent Scan Matching to 6 DoF

The Efficient Extension of Globally Consistent Scan Matching to 6 DoF The Efficient Extension of Globally Consistent Scan Matching to 6 DoF Dorit Borrmann, Jan Elseberg, Kai Lingemann, Andreas Nüchter, Joachim Hertzberg 1 / 20 Outline 1 Introduction 2 Algorithm 3 Performance

More information

Computer Graphics. P08 Texture Synthesis. Aleksandra Pizurica Ghent University

Computer Graphics. P08 Texture Synthesis. Aleksandra Pizurica Ghent University Computer Graphics P08 Texture Synthesis Aleksandra Pizurica Ghent University Telecommunications and Information Processing Image Processing and Interpretation Group Applications of texture synthesis Computer

More information

Today s class. Roots of equation Finish up incremental search Open methods. Numerical Methods, Fall 2011 Lecture 5. Prof. Jinbo Bi CSE, UConn

Today s class. Roots of equation Finish up incremental search Open methods. Numerical Methods, Fall 2011 Lecture 5. Prof. Jinbo Bi CSE, UConn Today s class Roots of equation Finish up incremental search Open methods 1 False Position Method Although the interval [a,b] where the root becomes iteratively closer with the false position method, unlike

More information

Modeling Crime Scene Fingerprint. Helen Hu, Adam D Helker, Christina Liu, Yingxiu Guo, Hong Fan Wang, and Hanlu Zhang

Modeling Crime Scene Fingerprint. Helen Hu, Adam D Helker, Christina Liu, Yingxiu Guo, Hong Fan Wang, and Hanlu Zhang Modeling Crime Scene Fingerprint Helen Hu, Adam D Helker, Christina Liu, Yingxiu Guo, Hong Fan Wang, and Hanlu Zhang Outline Background in fingerprint Question 1 Question 2 Current knowledge and approach

More information

Semester Final Report

Semester Final Report CSUMS SemesterFinalReport InLaTex AnnKimball 5/20/2009 ThisreportisageneralsummaryoftheaccumulationofknowledgethatIhavegatheredthroughoutthis semester. I was able to get a birds eye view of many different

More information

NAME: Section # SSN: X X X X

NAME: Section # SSN: X X X X Math 155 FINAL EXAM A May 5, 2003 NAME: Section # SSN: X X X X Question Grade 1 5 (out of 25) 6 10 (out of 25) 11 (out of 20) 12 (out of 20) 13 (out of 10) 14 (out of 10) 15 (out of 16) 16 (out of 24)

More information

CPSC 425: Computer Vision

CPSC 425: Computer Vision CPSC 425: Computer Vision Image Credit: https://docs.adaptive-vision.com/4.7/studio/machine_vision_guide/templatematching.html Lecture 9: Template Matching (cont.) and Scaled Representations ( unless otherwise

More information

This paper describes an analytical approach to the parametric analysis of target/decoy

This paper describes an analytical approach to the parametric analysis of target/decoy Parametric analysis of target/decoy performance1 John P. Kerekes Lincoln Laboratory, Massachusetts Institute of Technology 244 Wood Street Lexington, Massachusetts 02173 ABSTRACT As infrared sensing technology

More information

SOME PROPERTIES OF TRIGONOMETRIC FUNCTIONS. 5! x7 7! + = 6! + = 4! x6

SOME PROPERTIES OF TRIGONOMETRIC FUNCTIONS. 5! x7 7! + = 6! + = 4! x6 SOME PROPERTIES OF TRIGONOMETRIC FUNCTIONS PO-LAM YUNG We defined earlier the sine cosine by the following series: sin x = x x3 3! + x5 5! x7 7! + = k=0 cos x = 1 x! + x4 4! x6 6! + = k=0 ( 1) k x k+1

More information

Analysis and Synthesis of Texture

Analysis and Synthesis of Texture Analysis and Synthesis of Texture CMPE 264: Image Analysis and Computer Vision Spring 02, Hai Tao 31/5/02 Extracting image structure by filter banks Q Represent image textures using the responses of a

More information

ECEn 621 Computer Arithmetic Project #3. CORDIC History

ECEn 621 Computer Arithmetic Project #3. CORDIC History ECEn 621 Computer Arithmetic Project #3 CORDIC Algorithms Slide #1 CORDIC History Coordinate Rotation Digital Computer Invented in late 1950 s Based on the observation that: if you rotate a unit-length

More information

13 Distribution Ray Tracing

13 Distribution Ray Tracing 13 In (hereafter abbreviated as DRT ), our goal is to render a scene as accurately as possible. Whereas Basic Ray Tracing computed a very crude approximation to radiance at a point, in DRT we will attempt

More information

Enduring Understandings: Some basic math skills are required to be reviewed in preparation for the course.

Enduring Understandings: Some basic math skills are required to be reviewed in preparation for the course. Curriculum Map for Functions, Statistics and Trigonometry September 5 Days Targeted NJ Core Curriculum Content Standards: N-Q.1, N-Q.2, N-Q.3, A-CED.1, A-REI.1, A-REI.3 Enduring Understandings: Some basic

More information

f for Directional Derivatives and Gradient The gradient vector is calculated using partial derivatives of the function f(x,y).

f for Directional Derivatives and Gradient The gradient vector is calculated using partial derivatives of the function f(x,y). Directional Derivatives and Gradient The gradient vector is calculated using partial derivatives of the function f(x,y). For a function f(x,y), the gradient vector, denoted as f (pronounced grad f ) is

More information

1.1 - Functions, Domain, and Range

1.1 - Functions, Domain, and Range 1.1 - Functions, Domain, and Range Lesson Outline Section 1: Difference between relations and functions Section 2: Use the vertical line test to check if it is a relation or a function Section 3: Domain

More information

Feature extraction. Bi-Histogram Binarization Entropy. What is texture Texture primitives. Filter banks 2D Fourier Transform Wavlet maxima points

Feature extraction. Bi-Histogram Binarization Entropy. What is texture Texture primitives. Filter banks 2D Fourier Transform Wavlet maxima points Feature extraction Bi-Histogram Binarization Entropy What is texture Texture primitives Filter banks 2D Fourier Transform Wavlet maxima points Edge detection Image gradient Mask operators Feature space

More information

Resampling Methods for Dependent Data

Resampling Methods for Dependent Data S.N. Lahiri Resampling Methods for Dependent Data With 25 Illustrations Springer Contents 1 Scope of Resampling Methods for Dependent Data 1 1.1 The Bootstrap Principle 1 1.2 Examples 7 1.3 Concluding

More information

Automatic analysis of tomographic 3D picture of cores from well drilling

Automatic analysis of tomographic 3D picture of cores from well drilling Automatic analysis of tomographic 3D picture of cores from well drilling As part of Projects of Signal and Image Processing N. Bourennane, T. Colboc, L. Ragot, Y. Regard, D. Tourais ENSEIRB-MATMECA, National

More information

EE795: Computer Vision and Intelligent Systems

EE795: Computer Vision and Intelligent Systems EE795: Computer Vision and Intelligent Systems Spring 2012 TTh 17:30-18:45 WRI C225 Lecture 04 130131 http://www.ee.unlv.edu/~b1morris/ecg795/ 2 Outline Review Histogram Equalization Image Filtering Linear

More information

Pile load test results as a basis for reliability calculation with an open polygon response surface

Pile load test results as a basis for reliability calculation with an open polygon response surface Proceedings of the XVI ECSMGE Geotechnical Engineering for Infrastructure and Development ISBN 978-0-7277-6067-8 The authors and ICE Publishing: All rights reserved, 2015 doi:10.1680/ecsmge.60678 Pile

More information

Principles of Robot Motion

Principles of Robot Motion Principles of Robot Motion Theory, Algorithms, and Implementation Howie Choset, Kevin Lynch, Seth Hutchinson, George Kantor, Wolfram Burgard, Lydia Kavraki, and Sebastian Thrun A Bradford Book The MIT

More information

Calculus I Review Handout 1.3 Introduction to Calculus - Limits. by Kevin M. Chevalier

Calculus I Review Handout 1.3 Introduction to Calculus - Limits. by Kevin M. Chevalier Calculus I Review Handout 1.3 Introduction to Calculus - Limits by Kevin M. Chevalier We are now going to dive into Calculus I as we take a look at the it process. While precalculus covered more static

More information

Math Lab 6: Powerful Fun with Power Series Representations of Functions Due noon Thu. Jan. 11 in class *note new due time, location for winter quarter

Math Lab 6: Powerful Fun with Power Series Representations of Functions Due noon Thu. Jan. 11 in class *note new due time, location for winter quarter Matter & Motion Winter 2017 18 Name: Math Lab 6: Powerful Fun with Power Series Representations of Functions Due noon Thu. Jan. 11 in class *note new due time, location for winter quarter Goals: 1. Practice

More information

IMAGE ANALYSIS, CLASSIFICATION, and CHANGE DETECTION in REMOTE SENSING

IMAGE ANALYSIS, CLASSIFICATION, and CHANGE DETECTION in REMOTE SENSING SECOND EDITION IMAGE ANALYSIS, CLASSIFICATION, and CHANGE DETECTION in REMOTE SENSING ith Algorithms for ENVI/IDL Morton J. Canty с*' Q\ CRC Press Taylor &. Francis Group Boca Raton London New York CRC

More information

Note Set 4: Finite Mixture Models and the EM Algorithm

Note Set 4: Finite Mixture Models and the EM Algorithm Note Set 4: Finite Mixture Models and the EM Algorithm Padhraic Smyth, Department of Computer Science University of California, Irvine Finite Mixture Models A finite mixture model with K components, for

More information

Increasing/Decreasing Behavior

Increasing/Decreasing Behavior Derivatives and the Shapes of Graphs In this section, we will specifically discuss the information that f (x) and f (x) give us about the graph of f(x); it turns out understanding the first and second

More information

EFFECTIVE NUMERICAL ANALYSIS METHOD APPLIED TO THE ROLL-TO-ROLL SYSTEM HAVING A WINDING WORKPIECE

EFFECTIVE NUMERICAL ANALYSIS METHOD APPLIED TO THE ROLL-TO-ROLL SYSTEM HAVING A WINDING WORKPIECE EFFECTIVE NUMERICAL ANALYSIS METHOD APPLIED TO THE ROLL-TO-ROLL SYSTEM HAVING A WINDING WORKPIECE Sungham Hong 1, Juhwan Choi 1, Sungsoo Rhim 2 and Jin Hwan Choi 2 1 FunctionBay, Inc., Seongnam-si, Korea

More information

Active Appearance Models

Active Appearance Models Active Appearance Models Edwards, Taylor, and Cootes Presented by Bryan Russell Overview Overview of Appearance Models Combined Appearance Models Active Appearance Model Search Results Constrained Active

More information

Calculators ARE NOT Permitted On This Portion Of The Exam 28 Questions - 55 Minutes

Calculators ARE NOT Permitted On This Portion Of The Exam 28 Questions - 55 Minutes 1 of 11 1) Give f(g(1)), given that Calculators ARE NOT Permitted On This Portion Of The Exam 28 Questions - 55 Minutes 2) Find the slope of the tangent line to the graph of f at x = 4, given that 3) Determine

More information

302 CHAPTER 3. FUNCTIONS OF SEVERAL VARIABLES. 4. Function of several variables, their domain. 6. Limit of a function of several variables

302 CHAPTER 3. FUNCTIONS OF SEVERAL VARIABLES. 4. Function of several variables, their domain. 6. Limit of a function of several variables 302 CHAPTER 3. FUNCTIONS OF SEVERAL VARIABLES 3.8 Chapter Review 3.8.1 Concepts to Know You should have an understanding of, and be able to explain the concepts listed below. 1. Boundary and interior points

More information

February 23 Math 2335 sec 51 Spring 2016

February 23 Math 2335 sec 51 Spring 2016 February 23 Math 2335 sec 51 Spring 2016 Section 4.1: Polynomial Interpolation Interpolation is the process of finding a curve or evaluating a function whose curve passes through a known set of points.

More information

Texture. Outline. Image representations: spatial and frequency Fourier transform Frequency filtering Oriented pyramids Texture representation

Texture. Outline. Image representations: spatial and frequency Fourier transform Frequency filtering Oriented pyramids Texture representation Texture Outline Image representations: spatial and frequency Fourier transform Frequency filtering Oriented pyramids Texture representation 1 Image Representation The standard basis for images is the set

More information

Lecture #5. Point transformations (cont.) Histogram transformations. Intro to neighborhoods and spatial filtering

Lecture #5. Point transformations (cont.) Histogram transformations. Intro to neighborhoods and spatial filtering Lecture #5 Point transformations (cont.) Histogram transformations Equalization Specification Local vs. global operations Intro to neighborhoods and spatial filtering Brightness & Contrast 2002 R. C. Gonzalez

More information

m=[a,b,c,d] T together with the a posteriori covariance

m=[a,b,c,d] T together with the a posteriori covariance zimuthal VO analysis: stabilizing the model parameters Chris Davison*, ndrew Ratcliffe, Sergio Grion (CGGVeritas), Rodney Johnston, Carlos Duque, Musa Maharramov (BP). solved using linear least squares

More information

Math 205 Test 3 Grading Guidelines Problem 1 Part a: 1 point for figuring out r, 2 points for setting up the equation P = ln 2 P and 1 point for the initial condition. Part b: All or nothing. This is really

More information

Introduction to Image Super-resolution. Presenter: Kevin Su

Introduction to Image Super-resolution. Presenter: Kevin Su Introduction to Image Super-resolution Presenter: Kevin Su References 1. S.C. Park, M.K. Park, and M.G. KANG, Super-Resolution Image Reconstruction: A Technical Overview, IEEE Signal Processing Magazine,

More information

CLASSIFICATION AND CHANGE DETECTION

CLASSIFICATION AND CHANGE DETECTION IMAGE ANALYSIS, CLASSIFICATION AND CHANGE DETECTION IN REMOTE SENSING With Algorithms for ENVI/IDL and Python THIRD EDITION Morton J. Canty CRC Press Taylor & Francis Group Boca Raton London NewYork CRC

More information

MODEL SELECTION AND REGULARIZATION PARAMETER CHOICE

MODEL SELECTION AND REGULARIZATION PARAMETER CHOICE MODEL SELECTION AND REGULARIZATION PARAMETER CHOICE REGULARIZATION METHODS FOR HIGH DIMENSIONAL LEARNING Francesca Odone and Lorenzo Rosasco odone@disi.unige.it - lrosasco@mit.edu June 3, 2013 ABOUT THIS

More information

Wavelet Applications. Texture analysis&synthesis. Gloria Menegaz 1

Wavelet Applications. Texture analysis&synthesis. Gloria Menegaz 1 Wavelet Applications Texture analysis&synthesis Gloria Menegaz 1 Wavelet based IP Compression and Coding The good approximation properties of wavelets allow to represent reasonably smooth signals with

More information

Integration. Volume Estimation

Integration. Volume Estimation Monte Carlo Integration Lab Objective: Many important integrals cannot be evaluated symbolically because the integrand has no antiderivative. Traditional numerical integration techniques like Newton-Cotes

More information

Unit Maps: Grade 8 Math

Unit Maps: Grade 8 Math Real Number Relationships 8.3 Number and operations. The student represents and use real numbers in a variety of forms. Representation of Real Numbers 8.3A extend previous knowledge of sets and subsets

More information

Characterization of the anisotropy in color textures

Characterization of the anisotropy in color textures Characterization of the anisotropy in color textures B. Jacquin A. Smolarz ISTIT Laboratory FRE CNRS 2732 BP 2060 F10010 TROYES CEDEX, FRANCE benjamin.jacquin@utt.fr Abstract Our approach deals with a

More information

Matching. Compare region of image to region of image. Today, simplest kind of matching. Intensities similar.

Matching. Compare region of image to region of image. Today, simplest kind of matching. Intensities similar. Matching Compare region of image to region of image. We talked about this for stereo. Important for motion. Epipolar constraint unknown. But motion small. Recognition Find object in image. Recognize object.

More information

Equation to LaTeX. Abhinav Rastogi, Sevy Harris. I. Introduction. Segmentation.

Equation to LaTeX. Abhinav Rastogi, Sevy Harris. I. Introduction. Segmentation. Equation to LaTeX Abhinav Rastogi, Sevy Harris {arastogi,sharris5}@stanford.edu I. Introduction Copying equations from a pdf file to a LaTeX document can be time consuming because there is no easy way

More information

The Death of the Aerial Image

The Death of the Aerial Image Tutor50.doc: Version 5/9/05 T h e L i t h o g r a p h y E x p e r t (August 005) The Death of the Aerial Image Chris A. Mack, KLA-Tencor, FINLE Division, Austin, Texas The aerial image is, quite literally,

More information

CHAPTER 4 TEXTURE FEATURE EXTRACTION

CHAPTER 4 TEXTURE FEATURE EXTRACTION 83 CHAPTER 4 TEXTURE FEATURE EXTRACTION This chapter deals with various feature extraction technique based on spatial, transform, edge and boundary, color, shape and texture features. A brief introduction

More information

Computer Vision I. Announcement. Corners. Edges. Numerical Derivatives f(x) Edge and Corner Detection. CSE252A Lecture 11

Computer Vision I. Announcement. Corners. Edges. Numerical Derivatives f(x) Edge and Corner Detection. CSE252A Lecture 11 Announcement Edge and Corner Detection Slides are posted HW due Friday CSE5A Lecture 11 Edges Corners Edge is Where Change Occurs: 1-D Change is measured by derivative in 1D Numerical Derivatives f(x)

More information

EN1610 Image Understanding Lab # 3: Edges

EN1610 Image Understanding Lab # 3: Edges EN1610 Image Understanding Lab # 3: Edges The goal of this fourth lab is to ˆ Understanding what are edges, and different ways to detect them ˆ Understand different types of edge detectors - intensity,

More information

Ce qui est important dans l'enseignement des mathématiques. Marian Small novembre 2017

Ce qui est important dans l'enseignement des mathématiques. Marian Small novembre 2017 Ce qui est important dans l'enseignement des mathématiques Marian Small novembre 2017 Playing with math Uae your linking cubes. Show that the mean of 4, 7 and 7 is 6. Playing with math Uae your linking

More information

Themes in the Texas CCRS - Mathematics

Themes in the Texas CCRS - Mathematics 1. Compare real numbers. a. Classify numbers as natural, whole, integers, rational, irrational, real, imaginary, &/or complex. b. Use and apply the relative magnitude of real numbers by using inequality

More information

Tutorial on Image Compression

Tutorial on Image Compression Tutorial on Image Compression Richard Baraniuk Rice University dsp.rice.edu Agenda Image compression problem Transform coding (lossy) Approximation linear, nonlinear DCT-based compression JPEG Wavelet-based

More information

arxiv: v1 [cs.cv] 19 May 2017

arxiv: v1 [cs.cv] 19 May 2017 Affine-Gradient Based Local Binary Pattern Descriptor for Texture Classification You Hao 1,2, Shirui Li 1,2, Hanlin Mo 1,2, and Hua Li 1,2 arxiv:1705.06871v1 [cs.cv] 19 May 2017 1 Key Laboratory of Intelligent

More information

Image Analysis, Classification and Change Detection in Remote Sensing

Image Analysis, Classification and Change Detection in Remote Sensing Image Analysis, Classification and Change Detection in Remote Sensing WITH ALGORITHMS FOR ENVI/IDL Morton J. Canty Taylor &. Francis Taylor & Francis Group Boca Raton London New York CRC is an imprint

More information

3.7. Vertex and tangent

3.7. Vertex and tangent 3.7. Vertex and tangent Example 1. At the right we have drawn the graph of the cubic polynomial f(x) = x 2 (3 x). Notice how the structure of the graph matches the form of the algebraic expression. The

More information

Directionally Selective Fractional Wavelet Transform Using a 2-D Non-Separable Unbalanced Lifting Structure

Directionally Selective Fractional Wavelet Transform Using a 2-D Non-Separable Unbalanced Lifting Structure Directionally Selective Fractional Wavelet Transform Using a -D Non-Separable Unbalanced Lifting Structure Furkan Keskin and A. Enis Çetin Department of Electrical and Electronics Engineering, Bilkent

More information

Honors Precalculus: Solving equations and inequalities graphically and algebraically. Page 1

Honors Precalculus: Solving equations and inequalities graphically and algebraically. Page 1 Solving equations and inequalities graphically and algebraically 1. Plot points on the Cartesian coordinate plane. P.1 2. Represent data graphically using scatter plots, bar graphs, & line graphs. P.1

More information

Designing Cylinders with Constant Negative Curvature

Designing Cylinders with Constant Negative Curvature Designing Cylinders with Constant Negative Curvature Ulrich Pinkall Abstract. We describe algorithms that can be used to interactively construct ( design ) surfaces with constant negative curvature, in

More information