Chapter 3: Image Enhancement in the. Office room : 841
|
|
- Meghan Jefferson
- 6 years ago
- Views:
Transcription
1 Chapter 3: Image Enhancement in the Spatial Domain Lecturer: Jianbing Shen shenjianbing@bit.edu.cn Oice room : cn/shenjianbing
2 Principle Objective o Enhancement Process an image so that the result will be more suitable than the original image or a speciic c application. The suitableness is up to each application. A method which h is quite useul or enhancing an image ma not necessaril be the best approach or enhancing another images 2
3 2 domains Spatial Domain : image plane Techniques are based on direct manipulation o piels in an image Frequenc Domain : Techniques are based on modiing the Fourier transorm o an image There are some enhancement techniques based on various combinations o methods rom these two categories. 3
4 Good images For human visual The visual evaluation o image qualit is a highl hl subjective process. It is hard to standardize the deinition o a good image. For machine perception The evaluation task is easier. A good image is one which gives the best machine recognition results. A certain amount o trial and error usuall is required beore a particular image enhancement approach is selected. 4
5 Spatial Domain Procedures that operate directl on piels. g, = T[,] where, is the input image g, is the processed image T is an operator on deined over some neighborhood o, 5
6 Mask/Filter Neighborhood o a point, can be deined d b using a square/rectangular common, used or circular subimage area centered at, The center o the subimage is moved rom piel to piel starting at the top o the corner 6
7 Point Processing Neighborhood = 11 piel g depends on onl the value o at, T = gra level or intensit t or mapping transormation unction s = Tr Where r = gra level o, s = gra level o g, 7
8 Contrast Stretching Produce higher contrast than the original b darkening the levels below m in the original image Brightening the levels above m in the original image 8
9 Thresholding Produce a two-level binar image 9
10 Mask Processing or Filter Neighborhood is bigger than 11 piel Use a unction o the values o in a predeined neighborhood o, to determine the value o g at, The value o the mask coeicients determine the nature o the process Used in techniques Image Sharpening Image Smoothing 10
11 3 basic gra-level transormation unctions Negative nth root Log nth power Identit Inverse Log Input gra level, r Linear unction Negative and identit transormations Logarithm unction Log and inverse-log transormation Power-law unction n th power and n th root transormations 11
12 Identit unction Negative Log nth root nth power Output intensities are identical i to input intensities. Is included in the graph onl or completeness. Identit Inverse Log Input gra level, r 12
13 Image Negatives Negative nth root Log nth power Identit Inverse Log Input gra level, r An image with gra level in the range [0, L-1] where L = 2 n ; n = 1, 2 Negative transormation : s = L 1 r Reversing the intensit levels l o an image. Suitable or enhancing white or gra detail embedded in dark regions o an image, especiall when the black area dominant in size. 13
14 Log Transormations Negative nth root Log nth power Identit Inverse Log Input gra level, r s = c log 1+r c is a constant and r 0 Log curve maps a narrow range o low gra-level values in the input image into a wider range o output levels. Used to epand the values o dark piels in an image while compressing the higher-level values. 14
15 Log Transormations It compresses the dnamic range o images with ih large variations i in piel values Eample o image with dnamic range: Fourier spectrum image It can have intensit t range rom 0 to 10 6 or higher. We can t see the signiicant degree o detail as it will be lost in the displa. 15
16 Eample o Logarithm Image Fourier Spectrum with range = 0 to Result ater appl the log transormation with c = 1, range = 0 to
17 Inverse Logarithm Transormations Do opposite to the Log Transormations Used to epand the values o high piels in an image while compressing the darker-level values. 17
18 Power-Law Transormations Input gra level, r Plots o s = cr or various values o c = 1 in all cases s = cr c and are positive constants Power-law curves with ractional values o map a narrow range o dark input values into a wider range o output values, with the opposite being true or higher values o input levels. c = = 1 Identit unction 18
19 Gamma correction Monitor Gamma = 2.5 correction Monitor =1/2.5 = 0.4 Cathode ra tube CRT devices have an intensit-to-voltage response that is a power unction, with varing rom 1.8 to 2.5 The picture will become darker. Gamma correction is done b preprocessing the image beore inputting it to the monitor with s = cr 1/ 19
20 Another eample : MRI c d a b a a magnetic resonance image o an upper thoracic human spine with a racture dislocation and spinal cord impingement The picture is predominatel dark An epansion o gra levels are desirable needs < 1 b result ater power-law transormation with = 0.6, c=1 c transormation with = 0.4 best result d transormation with = 0.3 under acceptable level 20
21 Eect o decreasing ggamma When the is reduced too much, the image begins to reduce contrast to the point where the image started to have ver slight wash-out look, especiall in the background 21
22 Another eample a c b d a image has a washed-out appearance, it needs a compression o gra levels needs > 1 b result ater power-law transormation with = 3.0 suitable c transormation with = 4.0 suitable d transormation with = 5.0 high contrast, the image has areas that are too dark, some detail is lost 22
23 Piecewise-Linear Transormation Functions Advantage: The orm o piecewise unctions can be arbitraril comple Disadvantage: Their speciication requires considerabl more user input 23
24 Contrast Stretching increase the dnamic range o the gra levels in the image b a low-contrast image : result rom poor illumination, lack o dnamic range in the imaging sensor, or even wrong setting o a lens aperture o image acquisition c result o contrast stretching: r 1,s 1 = r min,0 and r 2,s 2 = r ma,l-1 d result o thresholding 24
25 Gra-level slicing Highlighting a speciic range o gra levels in an image Displa a high value o all gra levels l in the range o interest and a low value or all other gra levels a transormation highlights hl h range [A,B] o gra level and reduces all others to a constant t levell b transormation highlights range [A,B] but preserves all other levels l 25
26 Bit-plane slicing One 8-bit bte Bit-plane 7 most signiicant Bit-plane 0 least signiicant ii Highlighting the contribution made to total image appearance b speciic bits Suppose each piel is represented b 8 bits Higher-order bits contain the majorit o the visuall signiicant data Useul or analzing the relative importance plaed b each bit o the image 26
27 Eample The binar image or bit-plane 7 can be obtained b processing the input image with a thresholding gra-level transormation. Map all levels between 0 and 127 to 0 Map all levels between 129 and 255 to 255 An 8-bit ractal image 27
28 8 bit planes Bit-plane 7 Bit-plane 6 Bitplane Bit- Bit- 5 plane 4 plane 3 Bit- Bit- Bit- plane 2 plane 1 plane 0 28
29 Histogram Processing Histogram o a digital image with gra levels in the range [0,L-1] is a discrete unction Where r k : the k th gra levell hr k = n k n k : the number o piels in the image having gra level l r k hr k : histogram o a digital image with gra levels r k 29
30 Normalized Histogram dividing each o histogram at gra level r k b the total number o piels in the image, n For k = 0,1,,L-1 pr k = n k /n pr k gives an estimate o the probabilit o occurrence o gra level r k The sum o all components o a normalized histogram is equal to 1 30
31 Histogram Processing Basic or numerous spatial domain processing techniques Used eectivel or image enhancement Inormation inherent in histograms also is useul in image compression and segmentation 31
32 Eample Dark image Components o histogram are concentrated on the low side o the gra scale. Bright image Components o histogram are concentrated on the high h side o the gra scale. 32
33 Eample Low-contrast image histogram is narrow and centered toward themiddleothe gra scale High-contrast image histogram covers broad range o the gra scale and dthe distribution tib ti o piels is not too ar rom uniorm, with ver ew vertical lines being much higher than the others 33
34 Histogram Equalization As the low-contrast image s histogram is narrow and centered toward the middle o the gra scale, i we distribute the histogram to a wider range the qualit o the image will be improved. We can do it b adjusting the probabilit densit unction o the original histogram o the image so that the probabilit spread equall 34
35 Histogram transormation s k = Tr k s Tr 0 r k 1 r s = Tr Where 0 r 1 Tr satisies a. Tr is singlevalued and monotonicall increasingl in the interval 0 r 1 b. 0 Tr 1 or 0 r 1 35
36 Probabilit Densit Function The gra levels in an image ma be viewed as random variables in the interval [0,1] Probabilit Densit Function PDF is one o the undamental nt descriptors s o a random variable 36
37 Let Applied to Image p r r denote the PDF o random variable r p s s denote the PDF o random variable s I p r r and Tr are known and T - 1 s satisies condition a then p s s can be obtained using a ormula : p s s p r r dr ds 37
38 Applied to Image The PDF o the transormed variable s is determined b the gra-level PDF o the input image and b the chosen transormation unction 38
39 Transormation unction A transormation unction is a cumulative distribution unction CDF o random variable r : s r T r p w dw r 0 where w is a dumm variable o integration Note: Tr depends on p r r 39
40 Cumulative Distribution unction CDF is an integral o a probabilit unction alwas positive is the area under the unction Thus, CDF is alwas single valued and monotonicall increasing Thus, CDF satisies the condition a We can use CDF as a transormation unction 40
41 Finding p s s rom given Tr ds dr dt r dr r d p dr 0 p r p r r w dw p Substitute and ield s s p r dr r ds p r r p 1 r 1 where 0 s 1 r 41
42 p s s s As p s s is a probabilit unction, it must be zero outside the interval [0,1] in this case because its integral over all values o s must equal 1. Called p s s as a uniorm probabilit densit unction p s s is alwas a uniorm, independent o the orm o p r r 42
43 s r 0 T r p w dw r ields P s s a random variable s characterized b a uniorm probabilit unction s
44 Discrete transormation unction The probabilit o occurrence o gra level in an image is approimated b p r r k n n k where k 0, 1,..., L-1 The discrete version o transormation ti n k k n j sk T rk, pr r j where k 0, 1,..., L -1 n j0 j0 n 44
45 Histogram Equalization Thus, an output image is obtained b mapping each piel with level l r k in the input image into a corresponding piel with level s k in the output image In discrete space, it cannot be proved in general that this discrete transormation will produce the discrete equivalent o a uniorm probabilit densit unction, which would be a uniorm histogram 45
46 Eample beore ater Histogram equalization 46
47 Eample beore ater Histogram equalization The qualit is not improved much because the original image alread has a broaden gra-level scale 47
48 Eample No. o piels image Gra scale = [0,9] histogram Gra level 48
49 Gra Levelj No.o piels nj s k j n j k j0 n s 9 j n New gra 0 0 level j / / / / / / / /
50 Eample No. o piels Output image Gra scale = [0,9] Gra level Histogram equalization 50
51 Note It is clearl seen that Histogram equalization distributes ib t the gra level l to reach the maimum gra level white because the cumulative distribution unction equals 1 when 0 r L-1 I the cumulative numbers o gra levels are slightl dierent, the will be mapped to little dierent or same gra levels as we ma have to approimate the processed gra level o the output image to integer number Thus the discrete transormation unction can t guarantee the one to one mapping relationship 51
52 Result image and its histogram The output image s histogram Original image Ater applied the histogram equalization Notice that the output histogram s low end has shited right toward the lighter region o the gra scale as desired. 52
53 Note Histogram speciication is a trial-anderror process There are no rules or speciing histograms, and one must resort to analsis on a case-b-case s basis or an given enhancement task. 53
54 Note Histogram processing methods are global processing, in the sense that piels are modiied b a transormation on unction based on the gra-level content o an entire image. Sometimes, we ma need to enhance details over small areas in an image, which is called a local enhancement. 54
55 Local Enhancement a b c a Original image slightl blurred to reduce noise b global histogram equalization enhance noise & slightl increase contrast but the construction is not changed c local histogram equalization using 77 neighborhood reveals the small squares inside larger ones o the original image. deine a square or rectangular neighborhood and move the center o this area rom piel to piel. at each location, the histogram o the points in the neighborhood h is computed and either histogram equalization or histogram speciication transormation unction is obtained. another approach used to reduce computation is to utilize nonoverlapping regions, but it usuall produces an undesirable checkerboard eect. 55
56 Eplain the result in c Basicall, the original image consists o man small squares inside the larger dark ones. However, the small squares were too close in gra level to the larger ones, and their sizes were too small to inluence global histogram equalization signiicantl. So, when we use the local l enhancement technique, it reveals the small areas. Note also the iner noise teture is resulted b the local processing using relativel small neighborhoods. 56
57 Enhancement using Arithmetic/Logic Operations Arithmetic/Logic operations perorm on piel b piel basis between two or more images ecept NOT operation which perorm onl on a single image 57
58 Logic Operations Logic operation perorms on gra-level images, the piel values are processed as binar numbers light represents a binar 1, and dark represents a binar 0 NOT operation = negative transormation 58
59 Eample o AND Operation original image AND image mask Figure 3.27 result o AND operation 59
60 Eample o OR Operation original image Figure 3.27 OR image mask result o OR operation 60
61 Image Subtraction g, =, h, enhancement o the dierences between images 61
62 Image Subtraction a c b d a. original ractal image b. result o setting the our lower-order bit planes to zero reer to the bit-plane slicing the higher planes contribute signiicant detail the lower planes contribute more to ine detail image b. is nearl identical visuall to image a, with a ver slightl drop in overall contrast due to less variabilit o the gra-level values in the image. c. dierence between a. and b. nearl black d. histogram equalization o c. perorm contrast stretching transormation 62
63 Mask mode radiograph mask image an image taken ater injection o a contrast medium iodine into the bloodstream with mask subtracted out. Note: the background is dark because it doesn t change much in both images. the dierence area is bright because it has a big change h, is the mask, an X-ra image o a region o a patient s bod captured b an intensiied TV camera instead o traditional X- ra ilm located opposite an X-ra source, is an X-ra image taken ater injection a contrast medium into the patient s bloodstream images are captured at TV rates, so the doctor can see how the medium propagates through the various arteries in the area being observed the eect o subtraction in a movie showing mode.
64 Note We ma have to adjust the gra-scale o the subtracted image to be [0, 255] i 8-bit is used irst, ind the minimum gra value o the subtracted image second, ind the maimum gra value o the subtracted image set the minimum value to be zero and the maimum to be 255 while the rest are adjusted according to the interval [0, 255], b timing each value with 255/ma Subtraction is also used in segmentation o moving pictures to track the changes ater subtract the sequenced images, what is let should be the moving elements in the image, plus noise 64
65 Image Averaging g consider a nois image g, ormed b the addition o noise, to an original image, g, =, +, 65
66 Image Averaging g i noise has zero mean and be uncorrelated then it can be shown that i g, = image ormed b averaging K dierent nois images 1 K g, 1 K K i 1 g i, 66
67 Image Averaging g then 1 2 g, K K 2, 2 g,, 2, = variances o g and i K increase, it indicates that the variabilit noise o the piel at each location, decreases. 67
68 thus Image Averaging g E { g, }, E { g, } = epected value o g output ater averaging g = original image, 68
69 Image Averaging g Note: the images g i, nois images must be registered aligned in order to avoid the introduction on o blurring and other artiacts in the output image. 69
70 Eample a c e b d a original image b image corrupted b additive Gaussian noise with zero mean and a standard deviation o 64 gra levels. c. -. results o averaging K = 8, 16, 64 and 128 nois images 70
71 Spatial Filtering use ilter can also be called as mask/kernel/template or window the values in a ilter subimage are reerred to as coeicients, rather than piel. our ocus will be on masks o odd sizes, e.g. 33, 55, 71
72 Spatial Filtering Process simpl move the ilter mask rom point to point in an image. at each point,, the response o the ilter at that point is calculated using a predeined d relationship. R w z w z... R mn w i z i ii w mn z mn 72
73 Linear Filtering Linear Filtering o an image o size MN ilter mask o size mn is given b the epression the epression a b t s t s w g a t b t t s t s w g,,, where a = m-1/2 and b = n-1/2 To generate a complete iltered image this equation must 73 To generate a complete iltered image this equation must be applied or = 0, 1, 2,, M-1 and = 0, 1, 2,, N-1
74 FIGURE 3.32 The mechanics o spatial iltering. The magniied drawing shows a 3*3 mask and the image section directl under it; the image section is shown displaced out rom under the mask or ease o readabilit.
75 Moving Average in 2D , g,
76 Moving Average in 2D , g,
77 Moving Average in 2D , g,
78 Moving Average in 2D , g,
79 Moving Average in 2D , g,
80 Moving Average in 2D , g,
81 Smoothing Spatial Filters used or blurring and or noise reduction blurring is used in preprocessing steps, such as removal o small details rom an image prior to object etraction bridging o small gaps in lines or curves noise reduction can be accomplished b blurring with a linear ilter and also b a nonlinear ilter 81
82 Smoothing Linear Filters output is simpl the average o the piels contained in the neighborhood o the ilter mask. called averaging g ilters or lowpass ilters. 82
83 Smoothing Linear Filters replacing the value o ever piel in an image b the average o the gra levels in the neighborhood will reduce the sharp transitions in gra levels. sharp transitions random noise in the image edges o objects in the image thus, smoothing can reduce noises desirable and blur edges undesirable 83
84 33 Smoothing Linear Filters bo ilter weighted average the center is the most important and other piels are inversel weighted as a unction o their distance rom the center o the mask 84
85 Weighted average ilter the basic strateg behind weighting the center point the highest and then reducing the value o the coeicients c ents as a unction o increasing distance rom the origin is simpl an attempt to reduce blurring in the smoothing process. 85
86 General orm : smoothing mask g ilter o size mn m and n odd a b t s t s w b a s b t t s t s w g,,, a b t s w g,, a s b t summation o all coeicient o the mask 86 summation o all coeicient o the mask
87 Eample a c e b d a. original image piel b. -. results o smoothing with square averaging ilter masks o size n = 3, 5, 9, 15 and 35, respectivel. Note: big mask is used to eliminate small objects rom an image. the size o the mask establishes the relative size o the objects that will be blended with the background. 87
88 Eample original image result ater smoothing with 1515 averaging mask result o thresholding we can see that the result ater smoothing and thresholding, the remains are the largest and brightest objects in the image. 88
89 Order-Statistics Filters Nonlinear Filters the response is based on ordering ranking the piels contained in the image area encompassed b the ilter eample median ilter : R = median{z k k = 1,2,,n n} ma ilter : R = ma{z k k = 1,2,,n n} min ilter : R = min{z k k = 1,2,,n n} note: n nis the size o the mask 89
90 Median Filters replaces the value o a piel b the median o the gra levels l in the neighborhood h o that piel the original value o the piel is included in the computation o the median quite popular p because or certain tpes o random noise impulse noise salt and pepper noise, the provide ecellent noise-reduction capabilities, with considering less blurring than linear smoothing ilters o similar size. 90
91 Median Filters orces the points with distinct gra levels to be more like their neighbors. isolated clusters o piels that are light or dark with respect to their neighbors, and whose area is less than n 2 /2 one-hal the ilter area, are eliminated b an n n median ilter. eliminated = orced to have the value equal the median intensit o the neighbors. larger clusters are aected considerabl less 91
92 Eample : Median Filters 92
93 Sharpening Spatial Filters to highlight ine detail in an image or to enhance detail that has been blurred, either in error or as a natural eect o a particular method o image acquisition. 93
94 Blurring vs. Sharpening as we know that blurring can be done in spatial domain b piel averaging in a neighbors since averaging is analogous to integration thus, we can guess that the sharpening must be accomplished b spatial dierentiation. 94
95 Derivative operator the strength o the response o a derivative operator is proportional to the degree o discontinuit o the image at the point at which h the operator is applied. thus, image dierentiation enhances edges and other discontinuities noise deemphasizes area with slowl varing gra-level values. 95
96 First-order derivative a basic deinition o the irst-order derivative o a one-dimensional unction is the dierence 1 96
97 Second-order derivative similarl, we deine the second-order derivative o a one-dimensional unction is the dierence
98 Derivative computation In discrete domain, the gradients o an image I along and directions at an piel poisiton j,i are deined as: 1 Forward dierences 前向差分法 Gj,i = Ij,i+1 - Ij,i Gj,i = Ij+1,i- Ij,i 2 Backward dierences 后向差分法 Gj,i = Ij,i - Ij,i-1 Gj,i = Ij,i - Ij-1,i 3 Central dierences 中心差分法 Gj,i = Ij,i+1 - Ij,i-1 Gj,i = Ij+1,i - Ij-1,i 98
99 First and Second-order First and Second-order derivative o, when we consider an image unction o two variables,,, at which time we will dealing with partial derivatives along w ll deal ng w th part al der vat ves along the two spatial aes.,,, Gradient operator 2 2 2,, Laplacian operator ,, linear operator
100 Discrete Form o Laplacian p rom, 2 1, 1, 2 2, 2 1, 1, 2 ield, 2 ] , 1, [ ], 4 1, 1,
101 Result Laplacian mask 101
102 Laplacian mask implemented an etension o diagonal neighbors 102
103 Other implementation o Laplacian masks give the same result, but we have to keep in mind that when combining add / subtract a Laplacian-iltered image with another image. 103
104 Eect o Laplacian Operator as it is a derivative operator, it highlights gra-level discontinuities in an image it deemphasizes regions with slowl varing gra levels tends to produce images that have graish edge lines and other discontinuities, all superimposed on a dark, eatureless background. 104
105 Correct the eect o eatureless background easil b adding the original and Laplacian image. be careul with the Laplacian ilter used 2,, g, 2,, i the center coeicient o the Laplacian mask is negative i the center coeicient o the Laplacian mask is positive 105
106 Eample a. image o the North pole o the moon b. Laplacian-iltered image with c. Laplacian image scaled or displa purposes d. image enhanced b addition with original i image
107 Mask o Laplacian + addition to simpl the computation, we can create a mask which do both operations, Laplacian an Filter and Addition the original image. 107
108 Mask o Laplacian + addition p 1, 1, [,, g ], 4 1, 1, 1, 1, [,, g 1] 1 1, 1, [, 5 1], 1,
109 Eample 109
110 ,, g, Note, 2, = =
111 Unsharp masking s,,, sharpened image = original image blurred image to subtract a blurred version o an image produces sharpening output image. 111
112 High-boost iltering g g A,,, A hb 1 A hb,, 1,,, 1, A A s hb generalized orm o Unsharp masking A A 1
113 High-boost iltering g g 1 A i we use Laplacian ilter to create,, 1, A s hb i we use Laplacian ilter to create sharpen image s, with addition o i i l i original image 2,,, 2 2 s 113,,
114 High-boost iltering ields i the center coeicient o the Laplacian mask is negative A,,, hb A, 2, 2 i the center coeicient o the Laplacian mask is positive 114
115 High-boost Masks A 1 i A = 1, it becomes standard d d Laplacian sharpening 115
116 Eample 116
117 Gradient Operator G G irst derivatives are implemented using the magnitude o the gradient. mag 2 [ G 2 2 G ] 1 2 the magnitude becomes nonlinear commonl appro. G G 117
118 z 1 z 2 z 3 Gradient Mask z 4 z 5 z 6 z 7 z 8 z 9 simplest approimation, and z z G z z G and z z G z z G ] [ ] [ z z z z G G z z z z 118
119 z 1 z 2 z 3 Gradient Mask z 4 z 5 z 6 z 7 z 8 z 9 Roberts cross-gradient operators, and z z G z z G ] [ ] [ z z z z G G ] [ ] [ z z z z G G z z z z z z z z 119
120 Gradient Mask Sobel operators, 33 G G z 1 z 2 z 3 z 4 z 5 z 6 z 7 z 8 z 9 z 2z z z 2z z z 2z z z 2z z G G the weight value 2 is to achieve smoothing b giving more important to the center point 120
121 Note the summation o coeicients in all masks equals 0, indicating that the would give a response o 0 in an area o constant gra level. 121
122 Eample 122
123 Eample o Combining Spatial Enhancement Methods want to sharpen the original i image and bring out more skeletal l detail. problems: narrow dnamic range o gra level and high noise content makes the image diicult to enhance 123
124 Eample o Combining Spatial Enhancement Methods solve : 1. Laplacian to highlight ine detail 2. gradient to enhance prominent edges 3. gra-level transormation to increase the dnamic range o gra levels 124
125 125
126 126
Lecture Outline. Basics of Spatial Filtering Smoothing Spatial Filters. Sharpening Spatial Filters
1 Lecture Outline Basics o Spatial Filtering Smoothing Spatial Filters Averaging ilters Order-Statistics ilters Sharpening Spatial Filters Laplacian ilters High-boost ilters Gradient Masks Combining Spatial
More informationDigital Image Processing. Lecture 6 (Enhancement) Bu-Ali Sina University Computer Engineering Dep. Fall 2009
Digital Image Processing Lecture 6 (Enhancement) Bu-Ali Sina University Computer Engineering Dep. Fall 009 Outline Image Enhancement in Spatial Domain Spatial Filtering Smoothing Filters Median Filter
More informationEnhancement Using Local Histogram
Enhancement Using Local Histogram Used to enhance details over small portions o the image. Deine a square or rectangular neighborhood hose center moves rom piel to piel. Compute local histogram based on
More informationEDGES AND CONTOURS(1)
KOM31 Image Processing in Industrial Sstems Dr Muharrem Mercimek 1 EDGES AND CONTOURS1) KOM31 Image Processing in Industrial Sstems Some o the contents are adopted rom R. C. Gonzalez, R. E. Woods, Digital
More informationIntensity Transformations and Spatial Filtering: WHICH ONE LOOKS BETTER? Intensity Transformations and Spatial Filtering: WHICH ONE LOOKS BETTER?
: WHICH ONE LOOKS BETTER? 3.1 : WHICH ONE LOOKS BETTER? 3.2 1 Goal: Image enhancement seeks to improve the visual appearance of an image, or convert it to a form suited for analysis by a human or a machine.
More informationComputer Vision & Digital Image Processing
Computer Vision & Digital Image Processing Image Segmentation Dr. D. J. Jackson Lecture 6- Image segmentation Segmentation divides an image into its constituent parts or objects Level of subdivision depends
More informationImage Enhancement (Spatial Filtering 2)
Image Enhancement (Spatial Filtering ) Dr. Samir H. Abdul-Jauwad Electrical Engineering Department College o Engineering Sciences King Fahd University o Petroleum & Minerals Dhahran Saudi Arabia samara@kupm.edu.sa
More informationCAP 5415 Computer Vision Fall 2011
CAP 545 Computer Vision Fall 2 Dr. Mubarak Sa Univ. o Central Florida www.cs.uc.edu/~vision/courses/cap545/all22 Oice 247-F HEC Filtering Lecture-2 General Binary Gray Scale Color Binary Images Y Row X
More informationProbabilistic Model of Error in Fixed-Point Arithmetic Gaussian Pyramid
Probabilistic Model o Error in Fixed-Point Arithmetic Gaussian Pyramid Antoine Méler John A. Ruiz-Hernandez James L. Crowley INRIA Grenoble - Rhône-Alpes 655 avenue de l Europe 38 334 Saint Ismier Cedex
More information. This is the Basic Chain Rule. x dt y dt z dt Chain Rule in this context.
Math 18.0A Gradients, Chain Rule, Implicit Dierentiation, igher Order Derivatives These notes ocus on our things: (a) the application o gradients to ind normal vectors to curves suraces; (b) the generaliation
More informationObjectives. By the time the student is finished with this section of the workbook, he/she should be able
FUNCTIONS Quadratic Functions......8 Absolute Value Functions.....48 Translations o Functions..57 Radical Functions...61 Eponential Functions...7 Logarithmic Functions......8 Cubic Functions......91 Piece-Wise
More information3. Several Random Variables
. Several Random Variables. Two Random Variables. Conditional Probabilit--Revisited. Statistical Independence.4 Correlation between Random Variables. Densit unction o the Sum o Two Random Variables. Probabilit
More informationHistogram Processing
Histogram Processing The histogram of a digital image with gray levels in the range [0,L-] is a discrete function h ( r k ) = n k where r k n k = k th gray level = number of pixels in the image having
More informationCAP 5415 Computer Vision
CAP 545 Computer Vision Dr. Mubarak Sa Univ. o Central Florida Filtering Lecture-2 Contents Filtering/Smooting/Removing Noise Convolution/Correlation Image Derivatives Histogram Some Matlab Functions General
More informationQuadratic Functions. The graph of the function shifts right 3. The graph of the function shifts left 3.
Quadratic Functions The translation o a unction is simpl the shiting o a unction. In this section, or the most part, we will be graphing various unctions b means o shiting the parent unction. We will go
More informationMidterm Summary Fall 08. Yao Wang Polytechnic University, Brooklyn, NY 11201
Midterm Summary Fall 8 Yao Wang Polytechnic University, Brooklyn, NY 2 Components in Digital Image Processing Output are images Input Image Color Color image image processing Image Image restoration Image
More informationChapter 4 Imaging. Lecture 21. d (110) Chem 793, Fall 2011, L. Ma
Chapter 4 Imaging Lecture 21 d (110) Imaging Imaging in the TEM Diraction Contrast in TEM Image HRTEM (High Resolution Transmission Electron Microscopy) Imaging or phase contrast imaging STEM imaging a
More informationInverse of a Function
. Inverse o a Function Essential Question How can ou sketch the graph o the inverse o a unction? Graphing Functions and Their Inverses CONSTRUCTING VIABLE ARGUMENTS To be proicient in math, ou need to
More information9.1 The Square Root Function
Section 9.1 The Square Root Function 869 9.1 The Square Root Function In this section we turn our attention to the square root unction, the unction deined b the equation () =. (1) We begin the section
More informationComments on Problems. 3.1 This problem offers some practice in deriving utility functions from indifference curve specifications.
CHAPTER 3 PREFERENCES AND UTILITY These problems provide some practice in eamining utilit unctions b looking at indierence curve maps and at a ew unctional orms. The primar ocus is on illustrating the
More informationTFY4102 Exam Fall 2015
FY40 Eam Fall 05 Short answer (4 points each) ) Bernoulli's equation relating luid low and pressure is based on a) conservation o momentum b) conservation o energy c) conservation o mass along the low
More informationCHAPTER-III CONVECTION IN A POROUS MEDIUM WITH EFFECT OF MAGNETIC FIELD, VARIABLE FLUID PROPERTIES AND VARYING WALL TEMPERATURE
CHAPER-III CONVECION IN A POROUS MEDIUM WIH EFFEC OF MAGNEIC FIELD, VARIABLE FLUID PROPERIES AND VARYING WALL EMPERAURE 3.1. INRODUCION Heat transer studies in porous media ind applications in several
More informationIncreasing and Decreasing Functions and the First Derivative Test. Increasing and Decreasing Functions. Video
SECTION and Decreasing Functions and the First Derivative Test 79 Section and Decreasing Functions and the First Derivative Test Determine intervals on which a unction is increasing or decreasing Appl
More informationImage Enhancement: Methods. Digital Image Processing. No Explicit definition. Spatial Domain: Frequency Domain:
Image Enhancement: No Explicit definition Methods Spatial Domain: Linear Nonlinear Frequency Domain: Linear Nonlinear 1 Spatial Domain Process,, g x y T f x y 2 For 1 1 neighborhood: Contrast Enhancement/Stretching/Point
More information8.4 Inverse Functions
Section 8. Inverse Functions 803 8. Inverse Functions As we saw in the last section, in order to solve application problems involving eponential unctions, we will need to be able to solve eponential equations
More informationPart I: Thin Converging Lens
Laboratory 1 PHY431 Fall 011 Part I: Thin Converging Lens This eperiment is a classic eercise in geometric optics. The goal is to measure the radius o curvature and ocal length o a single converging lens
More informationINF Introduction to classifiction Anne Solberg Based on Chapter 2 ( ) in Duda and Hart: Pattern Classification
INF 4300 151014 Introduction to classifiction Anne Solberg anne@ifiuiono Based on Chapter 1-6 in Duda and Hart: Pattern Classification 151014 INF 4300 1 Introduction to classification One of the most challenging
More informationThe concept of limit
Roberto s Notes on Dierential Calculus Chapter 1: Limits and continuity Section 1 The concept o limit What you need to know already: All basic concepts about unctions. What you can learn here: What limits
More informationLeast-Squares Spectral Analysis Theory Summary
Least-Squares Spectral Analysis Theory Summary Reerence: Mtamakaya, J. D. (2012). Assessment o Atmospheric Pressure Loading on the International GNSS REPRO1 Solutions Periodic Signatures. Ph.D. dissertation,
More informationDepartment of Physics and Astronomy 2 nd Year Laboratory. L2 Light Scattering
nd ear laborator script L Light Scattering Department o Phsics and Astronom nd Year Laborator L Light Scattering Scientiic aims and objectives To determine the densit o nano-spheres o polstrene suspended
More information3.8 Combining Spatial Enhancement Methods 137
3.8 Combining Spatial Enhancement Methods 137 a b FIGURE 3.45 Optical image of contact lens (note defects on the boundary at 4 and 5 o clock). (b) Sobel gradient. (Original image courtesy of Mr. Pete Sites,
More informationLab on Taylor Polynomials. This Lab is accompanied by an Answer Sheet that you are to complete and turn in to your instructor.
Lab on Taylor Polynomials This Lab is accompanied by an Answer Sheet that you are to complete and turn in to your instructor. In this Lab we will approimate complicated unctions by simple unctions. The
More informationAdditional exercises in Stationary Stochastic Processes
Mathematical Statistics, Centre or Mathematical Sciences Lund University Additional exercises 8 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
More information18/10/2017. Image Enhancement in the Spatial Domain: Gray-level transforms. Image Enhancement in the Spatial Domain: Gray-level transforms
Gray-level transforms Gray-level transforms Generic, possibly nonlinear, pointwise operator (intensity mapping, gray-level transformation): Basic gray-level transformations: Negative: s L 1 r Generic log:
More information5.6 RATIOnAl FUnCTIOnS. Using Arrow notation. learning ObjeCTIveS
CHAPTER PolNomiAl ANd rational functions learning ObjeCTIveS In this section, ou will: Use arrow notation. Solve applied problems involving rational functions. Find the domains of rational functions. Identif
More informationRATIONAL FUNCTIONS. Finding Asymptotes..347 The Domain Finding Intercepts Graphing Rational Functions
RATIONAL FUNCTIONS Finding Asymptotes..347 The Domain....350 Finding Intercepts.....35 Graphing Rational Functions... 35 345 Objectives The ollowing is a list o objectives or this section o the workbook.
More informationAnalog Computing Technique
Analog Computing Technique by obert Paz Chapter Programming Principles and Techniques. Analog Computers and Simulation An analog computer can be used to solve various types o problems. It solves them in
More informationMathematical Preliminaries. Developed for the Members of Azera Global By: Joseph D. Fournier B.Sc.E.E., M.Sc.E.E.
Mathematical Preliminaries Developed or the Members o Azera Global B: Joseph D. Fournier B.Sc.E.E., M.Sc.E.E. Outline Chapter One, Sets: Slides: 3-27 Chapter Two, Introduction to unctions: Slides: 28-36
More informationTime-Frequency Analysis: Fourier Transforms and Wavelets
Chapter 4 Time-Frequenc Analsis: Fourier Transforms and Wavelets 4. Basics of Fourier Series 4.. Introduction Joseph Fourier (768-83) who gave his name to Fourier series, was not the first to use Fourier
More informationReview Smoothing Spatial Filters Sharpening Spatial Filters. Spatial Filtering. Dr. Praveen Sankaran. Department of ECE NIT Calicut.
Spatial Filtering Dr. Praveen Sankaran Department of ECE NIT Calicut January 7, 203 Outline 2 Linear Nonlinear 3 Spatial Domain Refers to the image plane itself. Direct manipulation of image pixels. Figure:
More informationMath 2412 Activity 1(Due by EOC Sep. 17)
Math 4 Activity (Due by EOC Sep. 7) Determine whether each relation is a unction.(indicate why or why not.) Find the domain and range o each relation.. 4,5, 6,7, 8,8. 5,6, 5,7, 6,6, 6,7 Determine whether
More informationNew Functions from Old Functions
.3 New Functions rom Old Functions In this section we start with the basic unctions we discussed in Section. and obtain new unctions b shiting, stretching, and relecting their graphs. We also show how
More information9.3 Graphing Functions by Plotting Points, The Domain and Range of Functions
9. Graphing Functions by Plotting Points, The Domain and Range o Functions Now that we have a basic idea o what unctions are and how to deal with them, we would like to start talking about the graph o
More informationy,z the subscript y, z indicating that the variables y and z are kept constant. The second partial differential with respect to x is written x 2 y,z
8 Partial dierentials I a unction depends on more than one variable, its rate o change with respect to one o the variables can be determined keeping the others ied The dierential is then a partial dierential
More informationCISE-301: Numerical Methods Topic 1:
CISE-3: Numerical Methods Topic : Introduction to Numerical Methods and Taylor Series Lectures -4: KFUPM Term 9 Section 8 CISE3_Topic KFUPM - T9 - Section 8 Lecture Introduction to Numerical Methods What
More information(One Dimension) Problem: for a function f(x), find x 0 such that f(x 0 ) = 0. f(x)
Solving Nonlinear Equations & Optimization One Dimension Problem: or a unction, ind 0 such that 0 = 0. 0 One Root: The Bisection Method This one s guaranteed to converge at least to a singularity, i not
More informationLocal enhancement. Local Enhancement. Local histogram equalized. Histogram equalized. Local Contrast Enhancement. Fig 3.23: Another example
Local enhancement Local Enhancement Median filtering Local Enhancement Sometimes Local Enhancement is Preferred. Malab: BlkProc operation for block processing. Left: original tire image. 0/07/00 Local
More informationThis is only a list of questions use a separate sheet to work out the problems. 1. (1.2 and 1.4) Use the given graph to answer each question.
Mth Calculus Practice Eam Questions NOTE: These questions should not be taken as a complete list o possible problems. The are merel intended to be eamples o the diicult level o the regular eam questions.
More informationAP Calculus AB Summer Assignment
AP Calculus AB Summer Assignment As Advanced placement students, our irst assignment or the 07-08 school ear is to come to class the ver irst da in top mathematical orm. Calculus is a world o change. While
More informationSignals & Linear Systems Analysis Chapter 2&3, Part II
Signals & Linear Systems Analysis Chapter &3, Part II Dr. Yun Q. Shi Dept o Electrical & Computer Engr. New Jersey Institute o echnology Email: shi@njit.edu et used or the course:
More informationTime Series Analysis for Quality Improvement: a Soft Computing Approach
ESANN'4 proceedings - European Smposium on Artiicial Neural Networks Bruges (Belgium), 8-3 April 4, d-side publi., ISBN -9337-4-8, pp. 19-114 ime Series Analsis or Qualit Improvement: a Sot Computing Approach
More informationINF Introduction to classifiction Anne Solberg
INF 4300 8.09.17 Introduction to classifiction Anne Solberg anne@ifi.uio.no Introduction to classification Based on handout from Pattern Recognition b Theodoridis, available after the lecture INF 4300
More informationMat 267 Engineering Calculus III Updated on 9/19/2010
Chapter 11 Partial Derivatives Section 11.1 Functions o Several Variables Deinition: A unction o two variables is a rule that assigns to each ordered pair o real numbers (, ) in a set D a unique real number
More informationBasic properties of limits
Roberto s Notes on Dierential Calculus Chapter : Limits and continuity Section Basic properties o its What you need to know already: The basic concepts, notation and terminology related to its. What you
More informationMeasurements & Error Analysis
It is better to be roughl right than precisel wrong. Alan Greenspan The Uncertaint o Measurements Some numerical statements are eact: Mar has 3 brothers, and + 4. However, all measurements have some degree
More informationPerception III: Filtering, Edges, and Point-features
Perception : Filtering, Edges, and Point-features Davide Scaramuzza Universit of Zurich Margarita Chli, Paul Furgale, Marco Hutter, Roland Siegwart 1 Toda s outline mage filtering Smoothing Edge detection
More informationComputed Tomography Notes, Part 1. The equation that governs the image intensity in projection imaging is:
Noll 3 CT Notes : Page Compute Tomograph Notes Part Challenges with Projection X-ra Sstems The equation that governs the image intensit in projection imaging is: z I I ep µ z Projection -ra sstems are
More informationSyllabus Objective: 2.9 The student will sketch the graph of a polynomial, radical, or rational function.
Precalculus Notes: Unit Polynomial Functions Syllabus Objective:.9 The student will sketch the graph o a polynomial, radical, or rational unction. Polynomial Function: a unction that can be written in
More informationChapter 8: MULTIPLE CONTINUOUS RANDOM VARIABLES
Charles Boncelet Probabilit Statistics and Random Signals" Oord Uniersit Press 06. ISBN: 978-0-9-0005-0 Chapter 8: MULTIPLE CONTINUOUS RANDOM VARIABLES Sections 8. Joint Densities and Distribution unctions
More informationCHAPTER 8 ANALYSIS OF AVERAGE SQUARED DIFFERENCE SURFACES
CAPTER 8 ANALYSS O AVERAGE SQUARED DERENCE SURACES n Chapters 5, 6, and 7, the Spectral it algorithm was used to estimate both scatterer size and total attenuation rom the backscattered waveorms by minimizing
More informationLocal Enhancement. Local enhancement
Local Enhancement Local Enhancement Median filtering (see notes/slides, 3.5.2) HW4 due next Wednesday Required Reading: Sections 3.3, 3.4, 3.5, 3.6, 3.7 Local Enhancement 1 Local enhancement Sometimes
More information8. THEOREM If the partial derivatives f x. and f y exist near (a, b) and are continuous at (a, b), then f is differentiable at (a, b).
8. THEOREM I the partial derivatives and eist near (a b) and are continuous at (a b) then is dierentiable at (a b). For a dierentiable unction o two variables z= ( ) we deine the dierentials d and d to
More informationINF Anne Solberg One of the most challenging topics in image analysis is recognizing a specific object in an image.
INF 4300 700 Introduction to classifiction Anne Solberg anne@ifiuiono Based on Chapter -6 6inDuda and Hart: attern Classification 303 INF 4300 Introduction to classification One of the most challenging
More informationTime-Frequency Analysis: Fourier Transforms and Wavelets
Chapter 4 Time-Frequenc Analsis: Fourier Transforms and Wavelets 4. Basics of Fourier Series 4.. Introduction Joseph Fourier (768-83) who gave his name to Fourier series, was not the first to use Fourier
More informationChapter 4 Image Enhancement in the Frequency Domain
Chapter 4 Image Enhancement in the Frequency Domain Yinghua He School of Computer Science and Technology Tianjin University Background Introduction to the Fourier Transform and the Frequency Domain Smoothing
More information3. Several Random Variables
. Several Random Variables. To Random Variables. Conditional Probabilit--Revisited. Statistical Independence.4 Correlation beteen Random Variables Standardied (or ero mean normalied) random variables.5
More informationNumerical Methods - Lecture 2. Numerical Methods. Lecture 2. Analysis of errors in numerical methods
Numerical Methods - Lecture 1 Numerical Methods Lecture. Analysis o errors in numerical methods Numerical Methods - Lecture Why represent numbers in loating point ormat? Eample 1. How a number 56.78 can
More informationy2 = 0. Show that u = e2xsin(2y) satisfies Laplace's equation.
Review 1 1) State the largest possible domain o deinition or the unction (, ) = 3 - ) Determine the largest set o points in the -plane on which (, ) = sin-1( - ) deines a continuous unction 3) Find the
More informationReading. 3. Image processing. Pixel movement. Image processing Y R I G Q
Reading Jain, Kasturi, Schunck, Machine Vision. McGraw-Hill, 1995. Sections 4.-4.4, 4.5(intro), 4.5.5, 4.5.6, 5.1-5.4. 3. Image processing 1 Image processing An image processing operation typically defines
More informationReview of Elementary Probability Lecture I Hamid R. Rabiee
Stochastic Processes Review o Elementar Probabilit Lecture I Hamid R. Rabiee Outline Histor/Philosoph Random Variables Densit/Distribution Functions Joint/Conditional Distributions Correlation Important
More informationShai Avidan Tel Aviv University
Image Editing in the Gradient Domain Shai Avidan Tel Aviv Universit Slide Credits (partial list) Rick Szeliski Steve Seitz Alosha Eros Yacov Hel-Or Marc Levo Bill Freeman Fredo Durand Slvain Paris Image
More information( x) f = where P and Q are polynomials.
9.8 Graphing Rational Functions Lets begin with a deinition. Deinition: Rational Function A rational unction is a unction o the orm ( ) ( ) ( ) P where P and Q are polynomials. Q An eample o a simple rational
More informationENSC327 Communications Systems 2: Fourier Representations. School of Engineering Science Simon Fraser University
ENSC37 Communications Systems : Fourier Representations School o Engineering Science Simon Fraser University Outline Chap..5: Signal Classiications Fourier Transorm Dirac Delta Function Unit Impulse Fourier
More informationIntroduction to Computer Vision. 2D Linear Systems
Introduction to Computer Vision D Linear Systems Review: Linear Systems We define a system as a unit that converts an input function into an output function Independent variable System operator or Transfer
More information( 1) ( 2) ( 1) nan integer, since the potential is no longer simple harmonic.
. Anharmonic Oscillators Michael Fowler Landau (para 8) considers a simple harmonic oscillator with added small potential energy terms mα + mβ. We ll simpliy slightly by dropping the term, to give an equation
More information6.4 graphs OF logarithmic FUnCTIOnS
SECTION 6. graphs of logarithmic functions 9 9 learning ObjeCTIveS In this section, ou will: Identif the domain of a logarithmic function. Graph logarithmic functions. 6. graphs OF logarithmic FUnCTIOnS
More informationComputer Vision & Digital Image Processing
Computer Vision & Digital Image Processing Image Restoration and Reconstruction I Dr. D. J. Jackson Lecture 11-1 Image restoration Restoration is an objective process that attempts to recover an image
More informationCHAPTER 1: INTRODUCTION. 1.1 Inverse Theory: What It Is and What It Does
Geosciences 567: CHAPTER (RR/GZ) CHAPTER : INTRODUCTION Inverse Theory: What It Is and What It Does Inverse theory, at least as I choose to deine it, is the ine art o estimating model parameters rom data
More informationAnnouncements. Tracking. Comptuer Vision I. The Motion Field. = ω. Pure Translation. Motion Field Equation. Rigid Motion: General Case
Announcements Tracking Computer Vision I CSE5A Lecture 17 HW 3 due toda HW 4 will be on web site tomorrow: Face recognition using 3 techniques Toda: Tracking Reading: Sections 17.1-17.3 The Motion Field
More informationTLT-5200/5206 COMMUNICATION THEORY, Exercise 3, Fall TLT-5200/5206 COMMUNICATION THEORY, Exercise 3, Fall Problem 1.
TLT-5/56 COMMUNICATION THEORY, Exercise 3, Fall Problem. The "random walk" was modelled as a random sequence [ n] where W[i] are binary i.i.d. random variables with P[W[i] = s] = p (orward step with probability
More informationMODULE 6 LECTURE NOTES 1 REVIEW OF PROBABILITY THEORY. Most water resources decision problems face the risk of uncertainty mainly because of the
MODULE 6 LECTURE NOTES REVIEW OF PROBABILITY THEORY INTRODUCTION Most water resources decision problems ace the risk o uncertainty mainly because o the randomness o the variables that inluence the perormance
More information11.4 Polar Coordinates
11. Polar Coordinates 917 11. Polar Coordinates In Section 1.1, we introduced the Cartesian coordinates of a point in the plane as a means of assigning ordered pairs of numbers to points in the plane.
More informationToday. Introduction to optimization Definition and motivation 1-dimensional methods. Multi-dimensional methods. General strategies, value-only methods
Optimization Last time Root inding: deinition, motivation Algorithms: Bisection, alse position, secant, Newton-Raphson Convergence & tradeos Eample applications o Newton s method Root inding in > 1 dimension
More informationTangent Line Approximations
60_009.qd //0 :8 PM Page SECTION.9 Dierentials Section.9 EXPLORATION Tangent Line Approimation Use a graphing utilit to graph. In the same viewing window, graph the tangent line to the graph o at the point,.
More informationMesa College Math SAMPLES
Mesa College Math 6 - SAMPLES Directions: NO CALCULATOR. Write neatly, show your work and steps. Label your work so it s easy to ollow. Answers without appropriate work will receive NO credit. For inal
More informationMath Review and Lessons in Calculus
Math Review and Lessons in Calculus Agenda Rules o Eponents Functions Inverses Limits Calculus Rules o Eponents 0 Zero Eponent Rule a * b ab Product Rule * 3 5 a / b a-b Quotient Rule 5 / 3 -a / a Negative
More informationarxiv: v1 [cs.it] 12 Mar 2014
COMPRESSIVE SIGNAL PROCESSING WITH CIRCULANT SENSING MATRICES Diego Valsesia Enrico Magli Politecnico di Torino (Italy) Dipartimento di Elettronica e Telecomunicazioni arxiv:403.2835v [cs.it] 2 Mar 204
More informationPolynomial and Rational Functions
Polnomial and Rational Functions Figure -mm film, once the standard for capturing photographic images, has been made largel obsolete b digital photograph. (credit film : modification of ork b Horia Varlan;
More information10.2 The Unit Circle: Cosine and Sine
0. The Unit Circle: Cosine and Sine 77 0. The Unit Circle: Cosine and Sine In Section 0.., we introduced circular motion and derived a formula which describes the linear velocit of an object moving on
More informationIn many diverse fields physical data is collected or analysed as Fourier components.
1. Fourier Methods In many diverse ields physical data is collected or analysed as Fourier components. In this section we briely discuss the mathematics o Fourier series and Fourier transorms. 1. Fourier
More informationPolynomial and Rational Functions
Polnomial and Rational Functions Figure -mm film, once the standard for capturing photographic images, has been made largel obsolete b digital photograph. (credit film : modification of work b Horia Varlan;
More informationCEE598 - Visual Sensing for Civil Infrastructure Eng. & Mgmt.
CEE598 - Visual Sensing for Civil nfrastructure Eng. & Mgmt. Session 9- mage Detectors, Part Mani Golparvar-Fard Department of Civil and Environmental Engineering 3129D, Newmark Civil Engineering Lab e-mail:
More informationUNCORRECTED SAMPLE PAGES. 3Quadratics. Chapter 3. Objectives
Chapter 3 3Quadratics Objectives To recognise and sketch the graphs of quadratic polnomials. To find the ke features of the graph of a quadratic polnomial: ais intercepts, turning point and ais of smmetr.
More informationz-axis SUBMITTED BY: Ms. Harjeet Kaur Associate Professor Department of Mathematics PGGCG 11, Chandigarh y-axis x-axis
z-ais - - SUBMITTED BY: - -ais - - - - - - -ais Ms. Harjeet Kaur Associate Proessor Department o Mathematics PGGCG Chandigarh CONTENTS: Function o two variables: Deinition Domain Geometrical illustration
More informationA Comparative Study of Non-separable Wavelet and Tensor-product. Wavelet; Image Compression
Copyright c 007 Tech Science Press CMES, vol., no., pp.91-96, 007 A Comparative Study o Non-separable Wavelet and Tensor-product Wavelet in Image Compression Jun Zhang 1 Abstract: The most commonly used
More informationEE 330 Class Seating
4 5 6 EE 0 Class Seating 4 5 6 7 8 Zechariah Daniel Liuchang Andrew Brian Dieng Aimee Julien Di Pettit Borgerding Li Mun Crist Liu Salt Tria Erik Nick Bijan Wing Yi Pangzhou Travis Wentai Hisham Lee Robbins
More informationComputer Vision I. Announcements
Announcements Motion II No class Wednesda (Happ Thanksgiving) HW4 will be due Frida 1/8 Comment on Non-maximal supression CSE5A Lecture 15 Shi-Tomasi Corner Detector Filter image with a Gaussian. Compute
More informationThe Deutsch-Jozsa Problem: De-quantization and entanglement
The Deutsch-Jozsa Problem: De-quantization and entanglement Alastair A. Abbott Department o Computer Science University o Auckland, New Zealand May 31, 009 Abstract The Deustch-Jozsa problem is one o the
More information6.869 Advances in Computer Vision. Prof. Bill Freeman March 1, 2005
6.869 Advances in Computer Vision Prof. Bill Freeman March 1 2005 1 2 Local Features Matching points across images important for: object identification instance recognition object class recognition pose
More informationDifferentiation. introduction to limits
9 9A Introduction to limits 9B Limits o discontinuous, rational and brid unctions 9C Dierentiation using i rst principles 9D Finding derivatives b rule 9E Antidierentiation 9F Deriving te original unction
More information