( ) Geometric Operations and Morphing. Geometric Transformation. Forward v.s. Inverse Mapping. I (x,y ) Image Processing - Lesson 4 IDC-CG 1

Similar documents
CIVL 8/ D Boundary Value Problems - Rectangular Elements 1/7

This Week. Computer Graphics. Introduction. Introduction. Graphics Maths by Example. Graphics Maths by Example

Chapter 16. 1) is a particular point on the graph of the function. 1. y, where x y 1

SOLVED EXAMPLES. be the foci of an ellipse with eccentricity e. For any point P on the ellipse, prove that. tan

CONIC SECTIONS. MODULE-IV Co-ordinate Geometry OBJECTIVES. Conic Sections

Operations depend on pixel s Coordinates. Context free. Independent of pixel values. I(x,y) I (x,y )

Lecture 4. Conic section

COMP108 Algorithmic Foundations

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals

Lecture contents. Bloch theorem k-vector Brillouin zone Almost free-electron model Bands Effective mass Holes. NNSE 508 EM Lecture #9

Instructions for Section 1

CBSE 2015 FOREIGN EXAMINATION

Elliptical motion, gravity, etc

MASTER CLASS PROGRAM UNIT 4 SPECIALIST MATHEMATICS SEMESTER TWO 2014 WEEK 11 WRITTEN EXAMINATION 1 SOLUTIONS

Polygons POLYGONS.

Ch 1.2: Solutions of Some Differential Equations

PH427/PH527: Periodic systems Spring Overview of the PH427 website (syllabus, assignments etc.) 2. Coupled oscillations.

Chem 104A, Fall 2016, Midterm 1 Key

Fundamental Algorithms for System Modeling, Analysis, and Optimization

MATHEMATICS FOR MANAGEMENT BBMP1103

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013

Lecture 11 Waves in Periodic Potentials Today: Questions you should be able to address after today s lecture:

Construction 11: Book I, Proposition 42

UNIT # 08 (PART - I)

Last time: introduced our first computational model the DFA.

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review

Miscellaneous open problems in the Regular Boundary Collocation approach

WORKSHOP 6 BRIDGE TRUSS

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x)

, between the vertical lines x a and x b. Given a demand curve, having price as a function of quantity, p f (x) at height k is the curve f ( x,

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2

TOPIC 5: INTEGRATION

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata

temperature T speed v time t density ρ scalars may be constant or may be variable yes distributive a(b+c) = ab+ac

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

Similarity Search. The Binary Branch Distance. Nikolaus Augsten.

I. The Connection between Spectroscopy and Quantum Mechanics

1 Introduction to Modulo 7 Arithmetic

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

Mathematics. Mathematics 3. hsn.uk.net. Higher HSN23000

ME 522 PRINCIPLES OF ROBOTICS. FIRST MIDTERM EXAMINATION April 19, M. Kemal Özgören

COHORT MBA. Exponential function. MATH review (part2) by Lucian Mitroiu. The LOG and EXP functions. Properties: e e. lim.

Multi-Section Coupled Line Couplers

Weighted graphs -- reminder. Data Structures LECTURE 15. Shortest paths algorithms. Example: weighted graph. Two basic properties of shortest paths

Continuous Random Variables: Basics

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

Section 3: Antiderivatives of Formulas

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

Introduction to Multicopter Design and Control

The Theory of Small Reflections

MASSACHUSETTS INSTITUTE OF TECHNOLOGY HAYSTACK OBSERVATORY WESTFORD, MASSACHUSETTS

2008 AP Calculus BC Multiple Choice Exam

= x. I (x,y ) Example: Translation. Operations depend on pixel s Coordinates. Context free. Independent of pixel values. I(x,y) Forward mapping:

The Z transform techniques

However, many atoms can combine to form particular molecules, e.g. Chlorine (Cl) and Sodium (Na) atoms form NaCl molecules.

HIGHER ORDER DIFFERENTIAL EQUATIONS

EEO 401 Digital Signal Processing Prof. Mark Fowler

INF5820/INF9820 LANGUAGE TECHNOLOGICAL APPLICATIONS. Jan Tore Lønning, Lecture 4, 14 Sep

Limits Indeterminate Forms and L Hospital s Rule

Page 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S.

Theoretical Study on the While Drilling Electromagnetic Signal Transmission of Horizontal Well

Case Study VI Answers PHA 5127 Fall 2006

10. The Discrete-Time Fourier Transform (DTFT)

12. Traffic engineering

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

Garnir Polynomial and their Properties

Weighted Matching and Linear Programming

KOHN LUTTINGER SUPERCONDUCTIVITY IN GRAPHENE

2-D ARMA MODEL PARAMETER ESTIMATION BASED ON THE EQUIVALENT 2-D AR MODEL APPROACH

Minimum Spanning Trees

The Course covers: Lexical Analysis Syntax Analysis Semantic Analysis Runtime environments Code Generation Code Optimization. CS 540 Spring 2013 GMU 2

Walk Like a Mathematician Learning Task:

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

Chapter 6 Polarization and Crystal Optics

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

Uses of transformations. 3D transformations. Review of vectors. Vectors in 3D. Points vs. vectors. Homogeneous coordinates S S [ H [ S \ H \ S ] H ]

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

Finite Automata. d: Q S Q. Finite automaton is M=(Q, S, d, q 0, F) Ex: an FA that accepts all odd-length strings of zeros: q 0 q 1. q i. q k.

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

Designing A Concrete Arch Bridge

Decimals DECIMALS.

Sliding mode control of photoelectric tracking platform based on the inverse system method

Floating Point Number System -(1.3)

Floating Point Number System -(1.3)

CS 461, Lecture 17. Today s Outline. Example Run

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

Overview. Usages of Fault Simulators. Problem and Motivation. Alternatives and Their Limitations. VLSI Design Verification and Testing

CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality:

CMSC 828D: Fundamentals of Computer Vision Homework 4

Self-Adjointness and Its Relationship to Quantum Mechanics. Ronald I. Frank 2016

Oppgavesett kap. 6 (1 av..)

ROTATION IN 3D WORLD RIGID BODY MOTION

DIFFERENTIAL EQUATION

Basic Polyhedral theory

Lecture: Experimental Solid State Physics Today s Outline

Transcription:

Img Procssing - Lsson 4 Gomtric Oprtions nd Morphing Gomtric Trnsformtion Oprtions dpnd on Pil s Coordints. Contt fr. Indpndnt of pil vlus. f f (, ) (, ) ( f (, ), f ( ) ) I(, ) I', (,) (, ) I(,) I (, ) 2 Empl: Trnsltion f f (, ) 3 (, ) ( 3, ) I (, ) I ' Forwrd v.s. Invrs Mpping Forwrd mpping: Sourc f f (, ) (, ) Trgt Forwrd Mpping Two prolms with forwrd mpping: Hols nd ovrlps. (,) I(,) I (, ) (, ) Solution: Invrs mpping: f, Sourc f ( ) (, ) Trgt Invrs Mpping 3 4 IDC-CG

Empl: scling long Forwrd mpping: 2 Sourc Trgt Intrpoltions Wht hppns whn mpping function clcults frctionl pil ddrss? (,) (,) Invrs mpping: / 2 Intrpoltion: gnrts nw pil nlzing th surrounding pils. Sourc Trgt 5 6 Nrst Nighor Intrpoltion Th ssign vlu is tkn from th pil closst to th gnrtd ddrss. Advntg: Fst. Disdvntg: Jggd rsults. Discontinus rsults. Originl Img I (, ) I( round{ f (, )}, round{ f (, )}) Nrst N. Intrpoltion 7 8 IDC-CG 2

Originl Img Bilinr Intrpoltion Nrst N. Intrpoltion Th ssignd vlu is n intrmdit vlu twn th four nrst pils. 9 v v w Linr Intrpoltion v Bilinr Intrpoltion Th ssign vlu is wightd sum of th four nrst pils. Ech wight is proportionl to th distnc from ch isting pil. w w w v v v v Isolting v in th ov qution: w w NW V N NE whr w dfin ( α ) w v αv v α w w S SW SE S SW N NW V S 2 SE ( ) NE ( ) N IDC-CG 3

Nrst N. Intrpoltion Nrst N. Intrpoltion Bilinr Intrpoltion 3 4 ilinr Intrpoltion Tp of 2DTrnsformtions Trnsltion Scling Rottion Shr Affin Projctiv 5 6 IDC-CG 4

Trnsltion Scl Scl (,): (,) (,) Trnslt (,): (,) (,) Scl (2,3) Trnslt(2,4) Scl (2,3) 7 8 How cn w scl n ojct without moving its origin (lowr lft cornr)? Rflction Trnslt(-,-) Scl(-,) Trnslt(,) Scl(2,3) Scl(,-) 9 2 IDC-CG 5

Rottion Rott(): cos() sin() - sin() cos() How cn w rott n ojct without moving its origin (lowr lft cornr)? Trnslt(-,-) Rott(9) Trnslt(,) Rott(9) Rott(9) 2 22 Shr Shr (,): (,) (,) Shr(,) Shr(,2) Composition of Trnsformtions Rigid trnsformtion: Trnsltion Rottion (distnc prsrving). Similrit trnsformtion: Trnsltion Rottion uniform Scl (ngl prsrving). Affin trnsformtion: Trnsltion Rottion Scl Shr (prlllism prsrving). Projctiv trnsformtion Will lortd ltr (cross-rtio prsrving) All ov trnsformtions r groups whr Rigid Similrit Affin Projctiv. 23 24 IDC-CG 6

IDC-CG 7 25 Rigid Affin Similrit 26 Mtri Nottion Lt s trt th loction (,) s 3 vctor in homognous spc: t t t W Y W X W Y W X W Y X 27 Scl Scl(,): (,) (,) If or r ngtiv, w gt rflction. Invrs: S - (,)S(/,/) 28 Shr, Rottion Shr(,): (,) (,) Rott(): (,) (cossin, -sin cos) Invrs: R - ()R T ()R(-) cos sin sin cos cos sin sin cos

IDC-CG 8 29 Trnsltion Trnsltion(,): Invrs: 3 Affin Rprsnts gnrl linr trnsformtion in 2D Euclidn spc. Invrs ffin: Altrntivl: f d c f d c ' ' f d c 3 Projctiv Rprsnts gnrl linr trnsformtion in 2D homognous spc. Prsrvs lins. Prsrvs cross-rtio d 3 d 24 /d 4 d 23 Dos not prsrv prlllism. Cn simult prspctiv projction of plnr scn. h g f d c ; h g f d c h g 32 Trnsformtion Estimtion Lt: f (,,, 2, 3 ) ; f (,,, 2, 3 ) If th mppings r linr in { i } { i } th prmtrs cn stimtd using linr rgrssion.

Empl: Affin Trnsformtion c d f Altrntiv rprsnttion c d f Givn k points (P,P 2,..P k ) in 2D tht hv n trnsformd to (P',P' 2,..,P' k ) th ffin trnsformtion: How mn points uniqul dfin th trnsformtion? How cn w find th trnsformtion? Wht cn don if points coordints r in inccurt? H ˆ ˆ min T T ( H H ) H H 33 34 Img Trnsformtion using Mtl T [ ; c d]; % trnsformtion mtri [r,c] siz(img) Img Wrping nd Morphing Img rctifiction. % crt rr of dstintion, coordints [X,Y]mshgrid(:c,:r); % clcult sourc coordints sourccoor inv(t) * [X(:) Y(:) ] ; % clcult nrst nighor intrpoltion Xs round(sourccoor(,:)); Ys round(sourccoor(2,:)); indfind(xs< Xs>r); Xs(ind); Ys(ind); indfind(ys< Ys>c); Xs(ind); Ys(ind); % clcult nw img nwimg img((xs-).*rys); nwimg(ind); nwimg(ind); nwimg rshp(nwimg,r,c); K frm nimtion. Img Snthsis Fcil prssion. Viwing positions Img Mtmorphosis. Dmo 35 36 IDC-CG 9

Cross-Dissolv (Pil Oprtion) Sourc Img Dstintion Img From: http://www.cs.utk.du/~hungj/cs594f/imgmorph.ppt Dmo 37 38 Ftur Bsd Morphing Morph on shp into nothr shp. Comins pil oprtions nd gomtricl oprtions. Ftur Slction Morph 39 4 IDC-CG

Ftur morphing Algorithm: Dfin st of corrsponding fturs in ch img. Dfin n intrmdit configurtion for ch tim stp linrl intrpolting fturs. Wrp sourc img towrds intrmdit img. Wrp dstintion img towrds intrmdit img. Cross-disssolv th two imgs tking th wightd vrg t ch pil. Originl Sourc Img Wrpd Sourc Img sourc tim Cross-dissolv Cross-dissolv of th Originl imgs Cross-dissolv of th Wrpd Imgs dstintion Intrmdit imgs 4 Originl Dst. Img 42 Wrpd Dst Img wrp Ftur sd Wrping Q Cross-dissolv P Cross-dissolv wrp P 43 44 IDC-CG

Q Q P P P P 45 46 Q Q P P P P 47 48 IDC-CG 2

Q On Lin wrping P Q β R α u v P Sourc Img β R α u v P Dst Img α is th rltiv position long th lin. P 49 α gos from to s R movs from P to. β is th ctul prpndiculr distnc to th lin. Th position of R is mppd into (α,β): R ( α β ) whr R' P' α Q' P' uˆ' βvˆ ' Invrs mpping: R( α, β ) P α Q P uˆ βvˆ u is unit vctor prlll to Q-P v is th unit vctor in th dirction prpndiculr to Q-P 5 Clculting u, v : Multipl Lin Wrping With Multipl lin wrping th point is influncd ch lin. Clcult unit vctors u, v : ( Q P ) û û Q P vˆ û û Clcult α, β : u v α β β ( R P ) û Q P ( P ) vˆ R 5 R α P Q R β R 2 P Q 2 β 2 P 2 Th influnc of ch lin is: p Qi P i W i β i Th vlu p [,] dictts th influnc of th lin lngth. Th vlu is smll numr voiding division zro. Th vlu dtrmins how th rltiv wight diminish s th β incrss WkRk Th finl mpping is: k R Wk 52 Q R β β 2 u 2 P P 2 k Q 2 IDC-CG 3

Msh Wrping Empl imgs from: http://www.cc.gtch.du/clsss/ay2/cs445_spring/projcts/svn/ For mor dtils s: Thddus Bir / Ftur-Bsd Img Mtmorphosis Siggrph '92 http://www.hmmrhd.com/thd/morph.html 53 From: http://www.cs.utk.du/~hungj/cs594f/imgmorph.ppt Dmo 54 IDC-CG 4