IMAGE SAMPLING AND IMAGE QUANTIZATION
|
|
- Ernest McCarthy
- 6 years ago
- Views:
Transcription
1 Digial image processing IMAGE SAMPLING AND IMAGE QUANTIZATION. Inrodcion. Sampling in he wo-dimensional space Basics on image sampling The concep of spaial freqencies Images of limied bandwidh Two-dimensional sampling Image reconsrcion from is samples The Nqis rae. The alias effec and specral replicas sperposiion The sampling heorem in he wo-dimensional case Non-recanglar sampling grids and inerlaced sampling The opimal sampling Pracical limiaions in sampling and reconsrcion 3. Image qanizaion 4. The opimal qanizer The niform qanizer 5. Visal qanizaion Conras qanizaion Psedo-random noise qanizaion Halfone image generaion Color image qanizaion
2 Digial image processing. Inrodcion f f s mn Sampling Qanizaion Comper Digiizaion Comper mn D/A conversion Displa Analog displa Fig Image sampling and qanizaion / Analog image displa
3 Digial image processing. Sampling in he wo-dimensional space Basics on image sampling f
4 Digial image processing The concep of spaial freqencies - Gre scale images can be seen as a -D generalizaion of ime-varing signals boh in he analog and in he digial case; he following eqivalence applies: -D signal ime varing -D signal gre scale image Time coordinae Insananeos vale: f A -D signal ha doesn var in ime is consan = has A.C. componen and onl a D.C. componen The freqenc conen of a -D signal is proporional o he speed of variaion of is insananeos vale in ime: ν ma ~ madf/d Discree -D signal: described b is samples => a vecor: =[ N-] N samples; he posiion of he sample = he discree ime momen The specrm of he ime varing signal = he real par of he Forier ransform of he signal Fω; ω=πν. Space coordinaes Brighness level poin-wise: f A perfecl niform image i has he same brighness in all spaial locaions; he D.C. componen = he brighness in an poin The freqenc conen of an image -D signal is proporional o he speed of variaion of is insananeos vale in space: ν ma ~ madf/d; ν ma ~ madf/d => ν ma ν ma = spaial freqencies Discree image -D signal: described b is samples b in -D => a mari: U[M N] U={mn} m= M-; n= N-. The specrm of he image = real par of he Forier ransform of he image = -D generalizaion of -D Forier ransform Fω ω ω =πν ; ω =πν
5 Digial image processing Images of limied bandwidh Limied bandwidh image = -D signal wih finie specral sppor: Fν ν = he Forier ransform of he image: F j j f e e dd f Fν ν e j dd. F ν ν ν ν -ν ν ν ν -ν The Forier ransform of he limied specrm image -ν The specral sppor region The specrm of a limied bandwidh image and is specral sppor
6 Two-dimensional sampling m n s n m n m f g f f Digial image processing The common sampling grid = he niforml spaced recanglar grid: m n n m g Image sampling = read from he original spaiall coninos brighness fncion f onl in he blac dos posiions onl where he grid allows:. Z m n oherwise n m f f s
7 Qesion: How o choose he vales Δ Δ o achieve: -he represenaion of he digial image b he min. nmber of samples -a ideall no loss of informaion? I. e.: for a perfecl niform image onl sample is enogh o compleel represen he image => sampling can be done wih ver large seps; on he opposie if he brighness varies ver sharpl => ver man samples needed The sampling inervals Δ Δ needed o have no loss of informaion depend on he spaial freqenc conen of he image. Sampling condiions for no informaion loss derived b eamining he specrm of he image b performing he Forier analsis: The sampling grid fncion g Δ Δ is periodical wih period Δ Δ => can be epressed b is Forier series epansion: Two-dimensional sampling. Forier ransform : dd e e g f dd e e f F g f f j j j j S S s Digial image processing l j j l l j j dd e e g l a e e l a g. where :
8 Since: Therefore he Forier ransform of f S is: The specrm of he sampled image = he collecion of an infinie nmber of scaled specral replicas of he specrm of he original image cenered a mliples of spaial freqencies /Δ / Δ. Two-dimensional sampling 3. l S l l j j S l j j l S j j l j j l S l F F dd e e f F dd e e f F dd e e e e f F Digial image processing. ; [; [; for l l a oherwise if g
9 Digial image processing Original image Original image specrm 3D Original image specrm D -D recanglar sampling grid Sampled image specrm 3D Sampled image specrm D
10 Digial image processing Image reconsrcion from is samples s s - 3 / / s s H s s oherwise ~ F H Fs F s - s ~ s f h fs Fig.4 The sampled image specrm ~ f fs m n Le s assme ha he filering region R is recanglar a he middle disance beween wo specral replicas: s s and sin s sin s H s s h s s oherwise ~ sin s m sin s n f f s m n h m n f s m n m n m n s m s n m nh m n
11 Digial image processing ~ f f s m n m nsinc msinc n where sinca s s sin a a Since he sinc fncion has infinie een => i is impossible o implemen in pracice he ideal LPF i is impossible o reconsrc in pracice an image from is samples wiho error if we sample i a he Nqis raes. Pracical solion: sample he image a higher spaial freqencies + implemen a real LPF as close o he ideal as possible. -D sinc fncion -D sinc fncion
12 Digial image processing The Nqis rae. The aliasing. The fold-over freqencies s s The Moire effec Fig. 5 Aliasing fold-over freqencies Noe: Aliasing ma also appear in he reconsrcion process de o he imperfecions of he filer! How o avoid aliasing if canno increase he sampling freqencies? B a LPF on he image applied prior o sampling! Jagged bondaries
13 Digial image processing Non-recanglar sampling grids. Inerlaced sampling grids -/ / ν / -/ Fν ν = / ν n - 3 m n - - m a Image specrm b Recanglar grid G c Inerlaced grid G - d The specrm sing G e The specrm sing G Inerlaced sampling Opimal sampling = Karhnen-Loeve epansion: f a m n m n m n
14 Digial image processing Image reconsrcion from is samples in he real case The qesion is: wha o fill in he inerpolaed new dos? Several inerpolaion mehods are available; ideall sinc fncion in he spaial domain; in pracice simpler inerpolaion mehods i.e. approimaions of LPFs.
15 Digial image processing Image inerpolaion filers: The -D inerpolaion fncion Graphical represenaion p The -D inerpolaion fncion p a =pp Freqenc response p a p a Recanglar zero-order filer p -/ / / rec p p sinc sinc 4 Trianglar firs order filer p - / ri p p p p sinc sinc 4 n-order filer n= qadraic n=3 cbic spline p n p p n convol@ii pn pn sinc sinc n 4 Gassian p g ep ep ep Sinc sinc sinc sinc rec rec
16 Digial image processing Image inerpolaion eamples:. Recanglar zero-order filer or neares neighbor filer or bo filer: / -/ / Original Sampled Reconsrced
17 Digial image processing Image inerpolaion eamples:. Trianglar firs-order filer or bilinear filer or en filer: / - Original Sampled Reconsrced
18 Digial image processing Image inerpolaion eamples: 3. Cbic inerpolaion filer or bicbic filer begins o beer approimae he sinc fncion: Original Sampled Reconsrced
19 Digial image processing Pracical limiaions in image sampling and reconsrcion Inp image Scanning ssem aperre p s -- g Real scanner model Ideal sampler g s Analog displa p a -- g ~ Fig. 7 The bloc diagram of a real sampler & reconsrcion displa ssem P a Inerpolaion filer or displa ssem specrm - s / s / Sampled image specrm Reconsrced image specrm Inp image specrm Specral losses - - s / s / Inerpolaion error Fig. 8 The real effec of he inerpolaion
20 Digial image processing 3. Image qanizaion 3.. Overview Qanizer r L Qanizer s op r + L+ r Qanizaion error r Fig. 9 The qanizer s ransfer fncion
21 Reconsrcion levels Digial image processing 3.. The niform qanizer The qanizer s design: Denoe he inp brighness range: Le B he nmber of bis of he qanizer => L= B reconsrcion levels The epressions of he decision levels: l min ; L Ma E.g. B= => L=4 Uniform qanizer ransfer fncion lmin ; L L Ma consan q L L Ma l q q q min L L The epressions of he reconsrcion levels: r4=4 r3=6 r=96 r=3 r q r = =64 3=8 4=9 5=56 Decision levels Compaion of he qanizaion error: for a given image of size M N piels U non-qanized and U qanized => we esimae he MSE: MN M N m n m n ' m n L r hlin U d
22 Reconsrcion levels Digial image processing Eamples of niform qanizaion and he resling errors: B= => L= Uniform qanizer ransfer fncion Non-qanized image Qanized image r=9 r=64 = =8 3=56 Decision levels Qanizaion error; MSE= The hisogram of he non-qanized image
23 Reconsrcion levels Digial image processing Eamples of niform qanizaion and he resling errors: B= => L=4 Non-qanized image Uniform qanizer ransfer fncion Qanized image r4=4 r3=6 r=96 r=3 = =64 3=8 4=9 5=56 Decision levels Qanizaion error; MSE= The hisogram of he non-qanized image
24 Reconsrcion levels Digial image processing Eamples of niform qanizaion and he resling errors: B=3 => L=8; false conors presen r8=4 Uniform qanizer ransfer fncion Non-qanized image Qanized image r7=8 r6=76 r5=44 r4= r3=8 r=48 r=6 = =3 3=64 4=96 5=8 6=6 7=9 8=4 9=56 Decision levels 9 Qanizaion error; MSE= The hisogram of he non-qanized image
25 3.. The opimal MSE qanizer he Llod-Ma qanizer L d h ' ] ' E[ e L i i i i d h r L d h r r h r r r r E d h d h r p p j j j j j j Digial image processing 3 / 3 / ] [ ] [ d h d h A L z
26 Digial image processing L L [ h ] / 3 d 3 p j j+ L+ h ep Gassian or h ep variance - mean Laplacian
27 Nivelele de reconsrcie Digial image processing Eamples of opimal qanizaion and he qanizaion error: B= => L= Fncia de ransfer a canizorli opimal Non-qanized image Qanized image r=53 r=4 = =89 3=56 Nivelele de decizie The non-qanized image hisogram The qanizaion error; MSE= The evolion of MSE in he opimizaion saring from he niform qanizer
28 Nivelele de reconsrcie Digial image processing Eamples of opimal qanizaion and he qanizaion error: B= => L=4 Fncia de ransfer a canizorli opimal Non-qanized image Qanized image r4=8 r3=56 r=5 r= = =68 3=36 4=69 5=56 Nivelele de decizie 9 8 The qanizaion error; MSE=9.6 The evolion of MSE in he opimizaion saring from he niform qanizer The non-qanized image hisogram
29 Nivelele de reconsrcie Digial image processing Eamples of opimal qanizaion and he qanizaion error: B=3 => L=8 Non-qanized image Qanized image Fncia de ransfer a canizorli opimal r8=4 r7=8 r6=65 r5=47 r4=5 r3= r=54 r=4 = =34 3=78 4=3 5=36 6=567=73 8=3 9=56 Nivelele de decizie The non-qanized image hisogram The qanizaion error; MSE=5 The evolion of MSE in he opimizaion saring from he niform qanizer
30 Digial image processing 3.3. The niform qanizer = he opimal qanizer for he niform gre level disribion: L h L oherwise r q L L consan q q q r q q/ q/ d q B herefore SNR log B 6 B db
31 Digial image processing 3.4. Visal qanizaion mehods In general if B<6 niform qanizaion or B<5 opimal qanizaion => he "conoring" effec i.e. false conors appears in he qanized image. The false conors conoring = grops of neighbor piels qanized o he same vale <=> regions of consan gra levels; he bondaries of hese regions are he false conors. The false conors do no conribe significanl o he MSE b are ver disrbing for he hman ee => i is imporan o redce he visibili of he qanizaion error no onl he MSQE. Solions: visal qanizaion schemes o hold qanizaion error below he level of visibili. Two main schemes: a conras qanizaion; b psedo-random noise qanizaion Uniform qanizaion B=4 Opimal qanizaion B=4 Uniform qanizaion B=6
32 Digial image processing 3.4. Visal qanizaion mehods a. Conras qanizaion The visal percepion of he lminance is non-linear b he visal percepion of conras is linear niform qanizaion of he conras is beer han niform qanizaion of he brighness conras = raio beween he lighes and he dares brighness in he spaial region js noiceable changes in conras: % => 5 qanizaion levels needed 6 bis needed wih a niform qanizer or 4-5 bis needed wih an opimal qanizer Brighness f brighnessconras c MMSE qanizer c f - conras - brighness c ln ; p. or c ; p. ; / / ln
33 Reconsrcion levels Digial image processing Eamples of conras qanizaion: For c= /3 : 5 The ransfer fncion of he conras qanizer = = 3= = =55 Decision levels
34 5 5 5 Reconsrcion levels Digial image processing Eamples of conras qanizaion: For he log ransform: The ransfer fncion of he conras qanizer = = =.733 4=7.68 5=55 Decision levels
35 Digial image processing b. Psedorandom noise qanizaion diher mn vmn K bis v mn + qanizer + + mn - mn Uniforml disribed psedorandom noise [-AA] Large diher amplide Uniform qanizaion B=4 Prior o diher sbracion Small diher amplide
36 Digial image processing a b c d Fig. 3 a. 3 bis qanizer =>visible false conors; b. 8 bis image wih psedo-random noise added in he range [-66]; c. he image from Figre b qanized wih a 3 bis qanizer d. he resl of sbracing he psedo-random noise from he image in Figre c
37 Digial image processing Halfone images generaion H Lminance mna vmn mna Thresholding v Psedorandom mari Fig.4 Digial generaion of halfone images Demo: hp://marschlze.ne/halfone/inde.hml H A v mn Halfone displa Fig.5 Halfone marices
38 Digial image processing Fig.3.6
39 Digial image processing Color images qanizaion R N T T R N Qanizer G N Color space ransformaion T T Qanizer Color space inverse ransformaion G N B N T 3 Qanizer T 3 B N Fig.7 Color images qanizaion
Reconstruct scene geometry from two or more calibrated images. scene point. image plane. Reconstruct scene geometry from two or more calibrated images
Sereo and Moion The Sereo Problem Reconsrc scene geomer from wo or more calibraed images scene poin focal poin image plane Sereo The Sereo Problem Reconsrc scene geomer from wo or more calibraed images
More informationTargil 8 : Image warping. Forward warping. Motion Transformations and Image Warping (cont.) Automatic Image Alignment: Lucas Kanade (cont.
Hebrew Uniersi mage Processing - 006 Hebrew Uniersi mage Processing - 006 Moion Transformaions and mage Warping - conine Targil 8 : Moion Transformaions and mage Warping con. Aomaic mage Alignmen: Lcas
More informationImage warping Li Zhang CS559
Wha is an image Image arping Li Zhang S559 We can hink of an image as a funcion, f: R 2 R: f(, ) gives he inensi a posiion (, ) defined over a recangle, ih a finie range: f: [a,b][c,d] [,] f Slides solen
More informationM y. Image Warping. Targil 7 : Image Warping. Image Warping. 2D Geometric Transformations. image filtering: change range of image g(x) = T(f(x))
Hebrew Universi Image Processing - 6 Image Warping Hebrew Universi Image Processing - 6 argil 7 : Image Warping D Geomeric ransormaions hp://www.jere-marin.com Man slides rom Seve Seiz and Aleei Eros Image
More information4.1 3D GEOMETRIC TRANSFORMATIONS
MODULE IV MCA - 3 COMPUTER GRAPHICS ADMN 29- Dep. of Compuer Science And Applicaions, SJCET, Palai 94 4. 3D GEOMETRIC TRANSFORMATIONS Mehods for geomeric ransformaions and objec modeling in hree dimensions
More informationImage warping/morphing
Image arping/morphing Image arping Digial Visual Effecs Yung-Yu Chuang ih slides b Richard Szeliski, Seve Seiz, Tom Funkhouser and leei Efros Image formaion Sampling and quanizaion B Wha is an image We
More informationPoint Cloud Representation of 3D Shape for Laser- Plasma Scanning 3D Display
Poin Cloud Represenaion of 3D Shape for Laser- Plasma Scanning 3D Displa Hiroo Ishikawa and Hideo Saio Keio Universi E-mail {hiroo, saio}@ozawa.ics.keio.ac.jp Absrac- In his paper, a mehod of represening
More informationNEWTON S SECOND LAW OF MOTION
Course and Secion Dae Names NEWTON S SECOND LAW OF MOTION The acceleraion of an objec is defined as he rae of change of elociy. If he elociy changes by an amoun in a ime, hen he aerage acceleraion during
More informationSam knows that his MP3 player has 40% of its battery life left and that the battery charges by an additional 12 percentage points every 15 minutes.
8.F Baery Charging Task Sam wans o ake his MP3 player and his video game player on a car rip. An hour before hey plan o leave, he realized ha he forgo o charge he baeries las nigh. A ha poin, he plugged
More informationMATH Differential Equations September 15, 2008 Project 1, Fall 2008 Due: September 24, 2008
MATH 5 - Differenial Equaions Sepember 15, 8 Projec 1, Fall 8 Due: Sepember 4, 8 Lab 1.3 - Logisics Populaion Models wih Harvesing For his projec we consider lab 1.3 of Differenial Equaions pages 146 o
More informationImage segmentation. Motivation. Objective. Definitions. A classification of segmentation techniques. Assumptions for thresholding
Moivaion Image segmenaion Which pixels belong o he same objec in an image/video sequence? (spaial segmenaion) Which frames belong o he same video sho? (emporal segmenaion) Which frames belong o he same
More informationCENG 477 Introduction to Computer Graphics. Modeling Transformations
CENG 477 Inroducion o Compuer Graphics Modeling Transformaions Modeling Transformaions Model coordinaes o World coordinaes: Model coordinaes: All shapes wih heir local coordinaes and sies. world World
More informationInteractive Graphical Systems HT2005
Ineracive Graphical Ssems HT25 Lesson 2 : Graphics Primer Sefan Seipel Sefan Seipel, Deparmen of Informaion Technolog, Uppsala Universi Ke issues of his lecure Represenaions of 3D models Repeiion of basic
More informationEECS 487: Interactive Computer Graphics
EECS 487: Ineracive Compuer Graphics Lecure 7: B-splines curves Raional Bézier and NURBS Cubic Splines A represenaion of cubic spline consiss of: four conrol poins (why four?) hese are compleely user specified
More informationFIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS
FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS Mohammed A. Aseeri and M. I. Sobhy Deparmen of Elecronics, The Universiy of Ken a Canerbury Canerbury, Ken, CT2
More informationAn Improved Square-Root Nyquist Shaping Filter
An Improved Square-Roo Nyquis Shaping Filer fred harris San Diego Sae Universiy fred.harris@sdsu.edu Sridhar Seshagiri San Diego Sae Universiy Seshigar.@engineering.sdsu.edu Chris Dick Xilinx Corp. chris.dick@xilinx.com
More informationGauss-Jordan Algorithm
Gauss-Jordan Algorihm The Gauss-Jordan algorihm is a sep by sep procedure for solving a sysem of linear equaions which may conain any number of variables and any number of equaions. The algorihm is carried
More information4. Minimax and planning problems
CS/ECE/ISyE 524 Inroducion o Opimizaion Spring 2017 18 4. Minima and planning problems ˆ Opimizing piecewise linear funcions ˆ Minima problems ˆ Eample: Chebyshev cener ˆ Muli-period planning problems
More informationChapter Six Chapter Six
Chaper Si Chaper Si 0 CHAPTER SIX ConcepTess and Answers and Commens for Secion.. Which of he following graphs (a) (d) could represen an aniderivaive of he funcion shown in Figure.? Figure. (a) (b) (c)
More informationImage Content Representation
Image Conen Represenaion Represenaion for curves and shapes regions relaionships beween regions E.G.M. Perakis Image Represenaion & Recogniion 1 Reliable Represenaion Uniqueness: mus uniquely specify an
More informationQuantitative macro models feature an infinite number of periods A more realistic (?) view of time
INFINIE-HORIZON CONSUMPION-SAVINGS MODEL SEPEMBER, Inroducion BASICS Quaniaive macro models feaure an infinie number of periods A more realisic (?) view of ime Infinie number of periods A meaphor for many
More informationImplementing Ray Casting in Tetrahedral Meshes with Programmable Graphics Hardware (Technical Report)
Implemening Ray Casing in Terahedral Meshes wih Programmable Graphics Hardware (Technical Repor) Marin Kraus, Thomas Erl March 28, 2002 1 Inroducion Alhough cell-projecion, e.g., [3, 2], and resampling,
More informationGeometry Transformation
Geomer Transformaion Januar 26 Prof. Gar Wang Dep. of Mechanical and Manufacuring Engineering Universi of Manioba Wh geomer ransformaion? Beer undersanding of he design Communicaion wih cusomers Generaing
More informationDefinition and examples of time series
Definiion and examples of ime series A ime series is a sequence of daa poins being recorded a specific imes. Formally, le,,p be a probabiliy space, and T an index se. A real valued sochasic process is
More informationShortest Path Algorithms. Lecture I: Shortest Path Algorithms. Example. Graphs and Matrices. Setting: Dr Kieran T. Herley.
Shores Pah Algorihms Background Seing: Lecure I: Shores Pah Algorihms Dr Kieran T. Herle Deparmen of Compuer Science Universi College Cork Ocober 201 direced graph, real edge weighs Le he lengh of a pah
More informationEngineering Mathematics 2018
Engineering Mahemaics 08 SUBJET NAME : Mahemaics II SUBJET ODE : MA65 MATERIAL NAME : Par A quesions REGULATION : R03 UPDATED ON : November 06 TEXTBOOK FOR REFERENE To buy he book visi : Sri Hariganesh
More informationA Matching Algorithm for Content-Based Image Retrieval
A Maching Algorihm for Conen-Based Image Rerieval Sue J. Cho Deparmen of Compuer Science Seoul Naional Universiy Seoul, Korea Absrac Conen-based image rerieval sysem rerieves an image from a daabase using
More informationMOTION DETECTORS GRAPH MATCHING LAB PRE-LAB QUESTIONS
NME: TE: LOK: MOTION ETETORS GRPH MTHING L PRE-L QUESTIONS 1. Read he insrucions, and answer he following quesions. Make sure you resae he quesion so I don hae o read he quesion o undersand he answer..
More informationImage Enhancement in the Frequency Domain Periodicity and the need for Padding:
Prepared B: Dr. Hasan Demirel PhD Image Enhancement in the Freqenc Domain Periodicit and the need for Padding: Periodicit propert of the DFT: The discrete Forier Transform and the inverse Forier transforms
More informationAlgorithm for image reconstruction in multi-slice helical CT
Algorihm for image reconsrucion in muli-slice helical CT Kasuyuki Taguchi a) and Hiroshi Aradae Medical Engineering Laboraory, Toshiba Corporaion, 1385 Shimoishigami, Oawara, Tochigi 324-855, Japan Received
More informationSpline Curves. Color Interpolation. Normal Interpolation. Last Time? Today. glshademodel (GL_SMOOTH); Adjacency Data Structures. Mesh Simplification
Las Time? Adjacency Daa Srucures Spline Curves Geomeric & opologic informaion Dynamic allocaion Efficiency of access Mesh Simplificaion edge collapse/verex spli geomorphs progressive ransmission view-dependen
More informationA Principled Approach to. MILP Modeling. Columbia University, August Carnegie Mellon University. Workshop on MIP. John Hooker.
Slide A Principled Approach o MILP Modeling John Hooer Carnegie Mellon Universiy Worshop on MIP Columbia Universiy, Augus 008 Proposal MILP modeling is an ar, bu i need no be unprincipled. Slide Proposal
More informationIn fmri a Dual Echo Time EPI Pulse Sequence Can Induce Sources of Error in Dynamic Magnetic Field Maps
In fmri a Dual Echo Time EPI Pulse Sequence Can Induce Sources of Error in Dynamic Magneic Field Maps A. D. Hahn 1, A. S. Nencka 1 and D. B. Rowe 2,1 1 Medical College of Wisconsin, Milwaukee, WI, Unied
More informationAML710 CAD LECTURE 11 SPACE CURVES. Space Curves Intrinsic properties Synthetic curves
AML7 CAD LECTURE Space Curves Inrinsic properies Synheic curves A curve which may pass hrough any region of hreedimensional space, as conrased o a plane curve which mus lie on a single plane. Space curves
More informationOn the Spacetime Geometry of Galilean Cameras
On he Spaceime Geomery of Galilean Cameras Yaser Sheikh Roboics Insie Carnegie Mellon Uniersiy yaser@cs.cm.ed Alexei Griai Comper Vision Laboraory Uniersiy of Cenral Florida agrisay@cs.cf.ed Mbarak Shah
More informationNon-uniform Subdivision for B-splines of Arbitrary Degree
Non-niform Sbdivision for B-slines of Arbirary Degree S. Schaefer, R. Goldman We resen an efficien algorihm for sbdividing non-niform B-slines of arbirary degree in a manner similar o he Lane-Riesenfeld
More informationOptimal Crane Scheduling
Opimal Crane Scheduling Samid Hoda, John Hooker Laife Genc Kaya, Ben Peerson Carnegie Mellon Universiy Iiro Harjunkoski ABB Corporae Research EWO - 13 November 2007 1/16 Problem Track-mouned cranes move
More informationComputational Geometry in Wireless Networks - Routing. Presented by Heather M. Michaud
Compaional Geomery in Wireless Neworks - Roing Presened by Heaher M. Michad 1 Ad Hoc Wireless Neworks No fixed pre-exising infrasrcre Nodes can be saic or mobile Assme nodes don move dring roing or opology
More information1 œ DRUM SET KEY. 8 Odd Meter Clave Conor Guilfoyle. Cowbell (neck) Cymbal. Hi-hat. Floor tom (shell) Clave block. Cowbell (mouth) Hi tom.
DRUM SET KEY Hi-ha Cmbal Clave block Cowbell (mouh) 0 Cowbell (neck) Floor om (shell) Hi om Mid om Snare Floor om Snare cross sick or clave block Bass drum Hi-ha wih foo 8 Odd Meer Clave Conor Guilfole
More informationSTEREO PLANE MATCHING TECHNIQUE
STEREO PLANE MATCHING TECHNIQUE Commission III KEY WORDS: Sereo Maching, Surface Modeling, Projecive Transformaion, Homography ABSTRACT: This paper presens a new ype of sereo maching algorihm called Sereo
More informationProjective geometry- 2D
Projecive geomer- D Acknowledgemens Marc Pollefes: for allowing e use of is ecellen slides on is opic p://www.cs.unc.edu/~marc/mvg/ Ricard Harle and Andrew Zisserman, "Muliple View Geomer in Compuer Vision"
More informationWiley Plus. Assignment 1 is online:
Wile Plus Assignmen 1 is online: 6 problems from chapers and 3 1D and D Kinemaics Due Monda Ocober 5 Before 11 pm! Chaper II: Kinemaics In One Dimension Displacemen Speed and Veloci Acceleraion Equaions
More informationIntegro-differential splines and quadratic formulae
Inegro-differenial splines and quadraic formulae I.G. BUROVA, O. V. RODNIKOVA S. Peersburg Sae Universiy 7/9 Universiesaya nab., S.Persburg, 9934 Russia i.g.burova@spbu.ru, burovaig@mail.ru Absrac: This
More informationA METHOD OF MODELING DEFORMATION OF AN OBJECT EMPLOYING SURROUNDING VIDEO CAMERAS
A METHOD OF MODELING DEFORMATION OF AN OBJECT EMLOYING SURROUNDING IDEO CAMERAS Joo Kooi TAN, Seiji ISHIKAWA Deparmen of Mechanical and Conrol Engineering Kushu Insiue of Technolog, Japan ehelan@is.cnl.kuech.ac.jp,
More informationCurves & Surfaces. Last Time? Today. Readings for Today (pick one) Limitations of Polygonal Meshes. Today. Adjacency Data Structures
Las Time? Adjacency Daa Srucures Geomeric & opologic informaion Dynamic allocaion Efficiency of access Curves & Surfaces Mesh Simplificaion edge collapse/verex spli geomorphs progressive ransmission view-dependen
More informationMarker-less Motion Capture
Marker-less Min Capre Seminar n Cmpainal Phgraph and Videgraph WS 9/ Aliaksandr alaika 3... raking Peple wih wiss and Epnenial Maps997 B Chrisph Bregler and Jiendra Malik. Deailed Hman Shape and Pse frm
More information(Structural Time Series Models for Describing Trend in All India Sunflower Yield Using SAS
(Srucural Time Series Models for Describing Trend in All India Sunflower Yield Using SAS Himadri Ghosh, Prajneshu and Savia Wadhwa I.A.S.R.I., Library Avenue, New Delhi-110 01 him_adri@iasri.res.in, prajnesh@iasri.res.in,
More informationNet Ne w t ork y La e y r Net Ne w t ork y La e y r Initial motivation: Net Ne w t ork y La e y r Net Ne w t ork y La e y r Net Ne w t ork
None lef! 0.0.04 IP6 Iniial moiaion: -bi address space soon o be compleel allocaed. Vin Cerf 67 ddiional moiaion: header forma helps speed processing/forarding header changes o faciliae QoS IP6 gram forma:
More informationA Prototype of Autonomous Intelligent Surveillance Cameras
Universi of Wollongong Research Online Facul of Informaics - Papers (Archive) Facul of Engineering and Informaion Sciences 2006 A Proope of Auonomous Inelligen Surveillance Cameras Wanqing Li Universi
More informationPART 1 REFERENCE INFORMATION CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONITOR
. ~ PART 1 c 0 \,).,,.,, REFERENCE NFORMATON CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONTOR n CONTROL DATA 6400 Compuer Sysems, sysem funcions are normally handled by he Monior locaed in a Peripheral
More informationSchedule. Curves & Surfaces. Questions? Last Time: Today. Limitations of Polygonal Meshes. Acceleration Data Structures.
Schedule Curves & Surfaces Sunday Ocober 5 h, * 3-5 PM *, Room TBA: Review Session for Quiz 1 Exra Office Hours on Monday (NE43 Graphics Lab) Tuesday Ocober 7 h : Quiz 1: In class 1 hand-wrien 8.5x11 shee
More informationIt is easier to visualize plotting the curves of cos x and e x separately: > plot({cos(x),exp(x)},x = -5*Pi..Pi,y = );
Mah 467 Homework Se : some soluions > wih(deools): wih(plos): Warning, he name changecoords has been redefined Problem :..7 Find he fixed poins, deermine heir sabiliy, for x( ) = cos x e x > plo(cos(x)
More informationMotion along a Line. Describing Motion along a Line
Moion along a Line Describing Moion: Displacemen Velociy Acceleraion Uniformly Acceleraed Moion Free Fall Describing Moion along a Line Wha is he posiion, elociy, and acceleraion of he blue do a each insan
More informationReinforcement Learning by Policy Improvement. Making Use of Experiences of The Other Tasks. Hajime Kimura and Shigenobu Kobayashi
Reinforcemen Learning by Policy Improvemen Making Use of Experiences of The Oher Tasks Hajime Kimura and Shigenobu Kobayashi Tokyo Insiue of Technology, JAPAN genfe.dis.iech.ac.jp, kobayasidis.iech.ac.jp
More informationarxiv: v1 [cs.cv] 18 Apr 2017
Ligh Field Blind Moion Deblurring Praul P. Srinivasan 1, Ren Ng 1, Ravi Ramamoorhi 2 1 Universiy of California, Berkeley 2 Universiy of California, San Diego 1 {praul,ren}@eecs.berkeley.edu, 2 ravir@cs.ucsd.edu
More informationCS422 Computer Networks
CS422 Compuer Neworks Lecure 2 Physical Layer Dr. Xiaobo Zhou Deparmen of Compuer Science CS422 PhysicalLayer.1 Quesions of Ineress How long will i ake o ransmi a message? How many bis are in he message
More informationSTRING DESCRIPTIONS OF DATA FOR DISPLAY*
SLAC-PUB-383 January 1968 STRING DESCRIPTIONS OF DATA FOR DISPLAY* J. E. George and W. F. Miller Compuer Science Deparmen and Sanford Linear Acceleraor Cener Sanford Universiy Sanford, California Absrac
More informationMobile Robots Mapping
Mobile Robos Mapping 1 Roboics is Easy conrol behavior percepion modelling domain model environmen model informaion exracion raw daa planning ask cogniion reasoning pah planning navigaion pah execuion
More informationDynamic Route Planning and Obstacle Avoidance Model for Unmanned Aerial Vehicles
Volume 116 No. 24 2017, 315-329 ISSN: 1311-8080 (prined version); ISSN: 1314-3395 (on-line version) url: hp://www.ijpam.eu ijpam.eu Dynamic Roue Planning and Obsacle Avoidance Model for Unmanned Aerial
More informationAudio Engineering Society. Convention Paper. Presented at the 119th Convention 2005 October 7 10 New York, New York USA
Audio Engineering Sociey Convenion Paper Presened a he 119h Convenion 2005 Ocober 7 10 New Yor, New Yor USA This convenion paper has been reproduced from he auhor's advance manuscrip, wihou ediing, correcions,
More informationPrinciples of MRI EE225E / BIO265. Lecture 10. Instructor: Miki Lustig UC Berkeley, EECS. M. Lustig, EECS UC Berkeley
Principles of MRI Lecure 0 EE225E / BIO265 Insrucor: Miki Lusig UC Berkeley, EECS Bloch Eq. For Recepion No B() : 2 4 Ṁ x Ṁ y Ṁ z 3 5 = 2 6 4 T 2 ~ G ~r 0 ~G ~r T 2 0 0 0 T 3 2 7 5 4 M x M y M z 3 5 +
More informationVideo Content Description Using Fuzzy Spatio-Temporal Relations
Proceedings of he 4s Hawaii Inernaional Conference on Sysem Sciences - 008 Video Conen Descripion Using Fuzzy Spaio-Temporal Relaions rchana M. Rajurkar *, R.C. Joshi and Sananu Chaudhary 3 Dep of Compuer
More informationVideo streaming over Vajda Tamás
Video sreaming over 802.11 Vajda Tamás Video No all bis are creaed equal Group of Picures (GoP) Video Sequence Slice Macroblock Picure (Frame) Inra (I) frames, Prediced (P) Frames or Bidirecional (B) Frames.
More informationDEFINITION OF THE LAPLACE TRANSFORM
74 CHAPER 7 HE LAPLACE RANSFORM 7 DEFINIION OF HE LAPLACE RANSFORM REVIEW MAERIAL Improper inegral wih infinie limi of inegraio Inegraion y par and parial fracion decompoiion INRODUCION In elemenary calculu
More informationCAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL
CAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL Klečka Jan Docoral Degree Programme (1), FEEC BUT E-mail: xkleck01@sud.feec.vubr.cz Supervised by: Horák Karel E-mail: horak@feec.vubr.cz
More informationVisual Perception as Bayesian Inference. David J Fleet. University of Toronto
Visual Percepion as Bayesian Inference David J Flee Universiy of Torono Basic rules of probabiliy sum rule (for muually exclusive a ): produc rule (condiioning): independence (def n ): Bayes rule: marginalizaion:
More informationFLOW VISUALIZATION USING MOVING TEXTURES * Nelson Max Lawrence Livermore National Laboratory Livermore, California
FLOW VISUALIZATION USING MOVING TEXTURES * Nelson Max Lawrence Livermore Naional Laboraor Livermore, California Barr Becker Lawrence Livermore Naional Laboraor Livermore, California SUMMARY We presen a
More informationHyelim Oh. School of Computing, National University of Singapore, 13 Computing Drive, Singapore SINGAPORE
RESEARCH ARTICLE FREE VERSUS FOR-A-FEE: THE IMPACT OF A PAYWALL ON THE PATTERN AND EFFECTIVENESS OF WORD-OF-MOUTH VIA SOCIAL MEDIA Hyelim Oh School of Compuing, Naional Universiy of Singapore, 13 Compuing
More informationA Face Detection Method Based on Skin Color Model
A Face Deecion Mehod Based on Skin Color Model Dazhi Zhang Boying Wu Jiebao Sun Qinglei Liao Deparmen of Mahemaics Harbin Insiue of Technology Harbin China 150000 Zhang_dz@163.com mahwby@hi.edu.cn sunjiebao@om.com
More informationCOSC 3213: Computer Networks I Chapter 6 Handout # 7
COSC 3213: Compuer Neworks I Chaper 6 Handou # 7 Insrucor: Dr. Marvin Mandelbaum Deparmen of Compuer Science York Universiy F05 Secion A Medium Access Conrol (MAC) Topics: 1. Muliple Access Communicaions:
More informationA Review on Block Matching Motion Estimation and Automata Theory based Approaches for Fractal Coding
Regular Issue A Review on Block Maching Moion Esimaion and Auomaa Theory based Approaches for Fracal Coding Shailesh D Kamble 1, Nileshsingh V Thakur 2, and Preei R Bajaj 3 1 Compuer Science & Engineering,
More informationMoving Object Detection Using MRF Model and Entropy based Adaptive Thresholding
Moving Objec Deecion Using MRF Model and Enropy based Adapive Thresholding Badri Narayan Subudhi, Pradipa Kumar Nanda and Ashish Ghosh Machine Inelligence Uni, Indian Saisical Insiue, Kolkaa, 700108, India,
More informationA High-Performance Area-Efficient Multifunction Interpolator
A High-Performance Area-Efficien Mulifuncion Inerpolaor ARITH Suar Oberman Michael Siu Ouline Wha i a GPU? Targe applicaion and floaing poin Shader microarchiecure High-order funcion Aribue inerpolaion
More informationFish-Eye Camera Video Processing and Trajectory Estimation Using 3D Human Models
Fish-Ee Camera Video rocessing and Trajecor Esimaion Using 3D Hman Models Konsanina Koari, Kosas Delibasis, Vassilis lagianakos, Ilias Maglogiannis To cie his version: Konsanina Koari, Kosas Delibasis,
More informationImage Registration in Medical Imaging
2/2/202 Image Regisraion in Medical Imaging BI260 VALERIE CARDENAS NICOLSON, PH.D ACKNOWLEDGEMENTS: COLIN STUDHOLME, PH.D. Medical Imaging Analysis Developing mahemaical algorihms o erac and relae informaion
More informationCoded Caching with Multiple File Requests
Coded Caching wih Muliple File Requess Yi-Peng Wei Sennur Ulukus Deparmen of Elecrical and Compuer Engineering Universiy of Maryland College Park, MD 20742 ypwei@umd.edu ulukus@umd.edu Absrac We sudy a
More informationA MRF formulation for coded structured light
A MRF formulaion for coded srucured ligh Jean-Philippe Tardif Sébasien Roy Déparemen d informaique e recherche opéraionnelle Universié de Monréal, Canada {ardifj, roys}@iro.umonreal.ca Absrac Mulimedia
More informationToday. Curves & Surfaces. Can We Disguise the Facets? Limitations of Polygonal Meshes. Better, but not always good enough
Today Curves & Surfaces Moivaion Limiaions of Polygonal Models Some Modeling Tools & Definiions Curves Surfaces / Paches Subdivision Surfaces Limiaions of Polygonal Meshes Can We Disguise he Faces? Planar
More informationLearning in Games via Opponent Strategy Estimation and Policy Search
Learning in Games via Opponen Sraegy Esimaion and Policy Search Yavar Naddaf Deparmen of Compuer Science Universiy of Briish Columbia Vancouver, BC yavar@naddaf.name Nando de Freias (Supervisor) Deparmen
More informationJoint Feature Learning With Robust Local Ternary Pattern for Face Recognition
Join Feaure Learning Wih Robus Local Ternary Paern for Face Recogniion Yuvaraju.M 1, Shalini.S 1 Assisan Professor, Deparmen of Elecrical and Elecronics Engineering, Anna Universiy Regional Campus, Coimbaore,
More informationLast Time: Curves & Surfaces. Today. Questions? Limitations of Polygonal Meshes. Can We Disguise the Facets?
Las Time: Curves & Surfaces Expeced value and variance Mone-Carlo in graphics Imporance sampling Sraified sampling Pah Tracing Irradiance Cache Phoon Mapping Quesions? Today Moivaion Limiaions of Polygonal
More informationMORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES
MORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES B. MARCOTEGUI and F. MEYER Ecole des Mines de Paris, Cenre de Morphologie Mahémaique, 35, rue Sain-Honoré, F 77305 Fonainebleau Cedex, France Absrac. In image
More informationAn Adaptive Spatial Depth Filter for 3D Rendering IP
JOURNAL OF SEMICONDUCTOR TECHNOLOGY AND SCIENCE, VOL.3, NO. 4, DECEMBER, 23 175 An Adapive Spaial Deph Filer for 3D Rendering IP Chang-Hyo Yu and Lee-Sup Kim Absrac In his paper, we presen a new mehod
More informationHierarchical Stochastic Motion Blur Rasterization
Hierarchical Sochasic Moion Blur Raserizaion Jacob Munkberg Perik Clarberg Jon Hasselgren Rober Toh Masamichi Sugihara Tomas Akenine-Möller, Inel Corporaion Lund Universiy Absrac We presen a hierarchical
More informationReal Time Integral-Based Structural Health Monitoring
Real Time Inegral-Based Srucural Healh Monioring The nd Inernaional Conference on Sensing Technology ICST 7 J. G. Chase, I. Singh-Leve, C. E. Hann, X. Chen Deparmen of Mechanical Engineering, Universiy
More informationImproved TLD Algorithm for Face Tracking
Absrac Improved TLD Algorihm for Face Tracking Huimin Li a, Chaojing Yu b and Jing Chen c Chongqing Universiy of Poss and Telecommunicaions, Chongqing 400065, China a li.huimin666@163.com, b 15023299065@163.com,
More informationRao-Blackwellized Particle Filtering for Probing-Based 6-DOF Localization in Robotic Assembly
MITSUBISHI ELECTRIC RESEARCH LABORATORIES hp://www.merl.com Rao-Blackwellized Paricle Filering for Probing-Based 6-DOF Localizaion in Roboic Assembly Yuichi Taguchi, Tim Marks, Haruhisa Okuda TR1-8 June
More informationASYMMETRICAL CONTROL OF UTILITY STATIC VAR COMPENSATOR FOR GRID VOLTAGE BALANCING
ASYMMETRICAL CONTROL OF TILITY STATIC VAR COMPENSATOR FOR GRID VOLTAGE BALANCING A. S. Mäkinen, GE Grid Solions, Vehmaisenka 5, 3373 Tampere, Finland, anssi.makinen@ge.com J. Aho, GE Grid Solions, Vehmaisenka
More informationCS 152 Computer Architecture and Engineering. Lecture 7 - Memory Hierarchy-II
CS 152 Compuer Archiecure and Engineering Lecure 7 - Memory Hierarchy-II Krse Asanovic Elecrical Engineering and Compuer Sciences Universiy of California a Berkeley hp://www.eecs.berkeley.edu/~krse hp://ins.eecs.berkeley.edu/~cs152
More informationVideo-Based Face Recognition Using Probabilistic Appearance Manifolds
Video-Based Face Recogniion Using Probabilisic Appearance Manifolds Kuang-Chih Lee Jeffrey Ho Ming-Hsuan Yang David Kriegman klee10@uiuc.edu jho@cs.ucsd.edu myang@honda-ri.com kriegman@cs.ucsd.edu Compuer
More information! errors caused by signal attenuation, noise.!! receiver detects presence of errors:!
Daa Link Layer! The Daa Link layer can be furher subdivided ino:!.! Logical Link Conrol (LLC): error and flow conrol!.! Media Access Conrol (MAC): framing and media access! differen link proocols may provide
More informationRobust Segmentation and Tracking of Colored Objects in Video
IEEE TRANSACTIONS ON CSVT, VOL. 4, NO. 6, 2004 Robus Segmenaion and Tracking of Colored Objecs in Video Theo Gevers, member, IEEE Absrac Segmening and racking of objecs in video is of grea imporance for
More informationLandmarks: A New Model for Similarity-Based Pattern Querying in Time Series Databases
Lmarks: A New Model for Similariy-Based Paern Querying in Time Series Daabases Chang-Shing Perng Haixun Wang Sylvia R. Zhang D. So Parker perng@cs.ucla.edu hxwang@cs.ucla.edu Sylvia Zhang@cle.com so@cs.ucla.edu
More informationA Progressive-ILP Based Routing Algorithm for Cross-Referencing Biochips
16.3 A Progressive-ILP Based Rouing Algorihm for Cross-Referencing Biochips Ping-Hung Yuh 1, Sachin Sapanekar 2, Chia-Lin Yang 1, Yao-Wen Chang 3 1 Deparmen of Compuer Science and Informaion Engineering,
More informationDetection of salient objects with focused attention based on spatial and temporal coherence
ricle Informaion Processing Technology pril 2011 Vol.56 No.10: 1055 1062 doi: 10.1007/s11434-010-4387-1 SPECIL TOPICS: Deecion of salien objecs wih focused aenion based on spaial and emporal coherence
More informationLAMP: 3D Layered, Adaptive-resolution and Multiperspective Panorama - a New Scene Representation
Submission o Special Issue of CVIU on Model-based and Image-based 3D Scene Represenaion for Ineracive Visualizaion LAMP: 3D Layered, Adapive-resoluion and Muliperspecive Panorama - a New Scene Represenaion
More informationChapter 3 MEDIA ACCESS CONTROL
Chaper 3 MEDIA ACCESS CONTROL Overview Moivaion SDMA, FDMA, TDMA Aloha Adapive Aloha Backoff proocols Reservaion schemes Polling Disribued Compuing Group Mobile Compuing Summer 2003 Disribued Compuing
More informationCS 428: Fall Introduction to. Geometric Transformations (continued) Andrew Nealen, Rutgers, /20/2010 1
CS 428: Fall 2 Inroducion o Compuer Graphic Geomeric Tranformaion (coninued) Andrew Nealen, Ruger, 2 9/2/2 Tranlaion Tranlaion are affine ranformaion The linear par i he ideni mari The 44 mari for he ranlaion
More informationScattering at an Interface: Normal Incidence
Course Insrucor Dr. Raymond C. Rumpf Office: A 337 Phone: (915) 747 6958 Mail: rcrumpf@uep.edu 4347 Applied lecromagneics Topic 3f Scaering a an Inerface: Normal Incidence Scaering These Normal noes Incidence
More informationProbabilistic Detection and Tracking of Motion Discontinuities
Probabilisic Deecion and Tracking of Moion Disconinuiies Michael J. Black David J. Flee Xerox Palo Alo Research Cener 3333 Coyoe Hill Road Palo Alo, CA 94304 fblack,fleeg@parc.xerox.com hp://www.parc.xerox.com/fblack,fleeg/
More information