Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.

Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.

Like this presentation? Why not share!

No Downloads

Total views

1,087

On SlideShare

0

From Embeds

0

Number of Embeds

1

Shares

0

Downloads

37

Comments

0

Likes

1

No embeds

No notes for slide

- 1. ₤ Image ╬ A representation of the external form of a person or thing in sculpture, painting, etc.₤ Image Processing ╬ The analysis and manipulation of a digitized image, esp. in order to improve its quality. ╬ Study of any algorithm Image Input Output
- 2. ₤ The rate at which image intensity values are changing in the image₤ Its domain over which values of F(u) range. u Freq. of component of Transform₤ Steps: ╬ Transform the image to its frequency representation ╬ Perform image processing ╬ Compute inverse transform.
- 3. ₤ Decompose an image into its sine & cosine components.₤ Sinusoidal variations in brightness across the image.₤ Each point represents a particular frequency contained in the spatial domain image. Spatial Domain Freq. Domain (Input) (Output)₤ Applications ╬ Image analysis, ╬ Image filtering, ╬ Image reconstruction ╬ Image compression.
- 4. ₤ Functions that are NOT periodic BUT with finite area under the curve can be expressed as the integral of sines and/or cosines multiplied by a weight function₤ The Fourier transform for f(x) exists iff ╬ f(x) is piecewise continuous on every finite interval ╬ f(x) is absolutely integrable
- 5. ₤ Fourier Series is the origin.₤ The DFT is the sampled Fourier Transform₤ 2-D DFT of N*N matrix :₤ Complexity of 1-D DFT is N2.₤ Sufficiently accurate
- 6. ₤ Multiply the input image by (-1)x+y to center the transform₤ Compute the DFT F(u,v) of the resulting image₤ Multiply F(u,v) by a filter G(u,v)₤ Computer the inverse DFT transform h*(x,y)₤ Obtain the real part h(x,y) of 4₤ Multiply the result by (-1)x+y
- 7. ₤ Sinusoidal pattern Single Fourier term that encodes ╬ The spatial frequency, ╬ The magnitude (positive or negative), ╬ The phase.
- 8. ₤ The spatial frequency, ╬ Frequency across space₤ The magnitude (positive or negative), ╬ Corresponds to its contrast ╬ A negative magnitude represents a contrast-reversal, i.e. the bright become dark, and vice-versa₤ The phase. ╬ How the wave is shifted relative to the origin
- 9. PlausibilityOriginal Magnitude Phase
- 10. Magnitude Phase
- 11. Brightness Fourier Inverse Image Transform Transformed

No public clipboards found for this slide

×
### Save the most important slides with Clipping

Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.

Be the first to comment