Question

In: Computer Science

Write on one page an efficient way to implement a transformation on image or on getting...

Write on one page an efficient way to implement a transformation on image or on getting its histogram (not pixel by pixel cause this is not efficient)

Solutions

Expert Solution

Hey there ,

Fourier transform is one of the most efficient way used for image processing. In Fourier transform, the intensity of the image is transformed into frequency variation and then to the frequency domain. It is used for slow varying intensity images such as the background of a passport size photo can be represented as low-frequency components and the edges can be represented as high-frequency components. Low-frequency components can be removed using filters of FT domain. When an image is filtered in the FT domain, it contains only the edges of the image. And if we do inverse FT domain to spatial domain then also an image contains only edges. Fourier transform is the simplest technique in which edges of the image can be fined.

Two Dimensional Fourier Transform

Matrix Notation

Properties of Fourier transformation or why Fourier Transformation is used

  • Symmetric Unitary
  • Periodic Extension
  • Sampled Fourier
  • Fast
  • Conjugate Symmetry
  • Circular Convolution

Example:

Thank you so much , it was a very intersting question and i really enjoyed answer it :D

If you futher doubts or questions do let me know.

venereology answered 4 months ago
Next > < Previous

Related Solutions

Write a C program to implement a queue (FIFO) of characters in a one-way, circular, linked...
Write a C program to implement a queue (FIFO) of characters in a one-way, circular, linked list. One way means that each node has only one pointer, Q, (not both a rear and a front pointer), so the program must use pointers-to-pointers. Include functions to insert(), remove(), for use in main() where the user is prompted "Enter "i" to insert a new element, "r" to remove an element, "q" to quit:"
Describe the most time-efficient way to implement the operations listed below. Assume no duplicate values and...
Describe the most time-efficient way to implement the operations listed below. Assume no duplicate values and that you can implement the operation as a member function of the class – with access to the underlying data structure. Then, give the tightest possible upper bound for the worst case running time for each operation in terms of N. Merging two binary min-heaps (both implemented using an array) each containing N elements into a single binary min heap. Explanation:
Suggest one way in which your Efficient frontiers could be made more efficient. What is the...
Suggest one way in which your Efficient frontiers could be made more efficient. What is the limitation of this suggestion?
How does the image of the "economy" as the "household" affect the way one may think...
How does the image of the "economy" as the "household" affect the way one may think about today's economics? What connotations does the word "household" have that the word "economy" does not have?
Write a one page article on Autism.
Write a one page article on Autism.
Read through "The Huffman Code" on page 415 of the book. Write a program to implement...
Read through "The Huffman Code" on page 415 of the book. Write a program to implement Huffman coding and decoding. It should do the following: Accept a text message, possibly of more than one line. Create a Huffman tree for this message. Create a code table. Encode the message into binary. Decode the message from binary back to text. in JAVA
Read through "The Huffman Code" on page 415 of the book. Write a program to implement...
Read through "The Huffman Code" on page 415 of the book. Write a program to implement Huffman coding and decoding. It should do the following: Accept a text message, possibly of more than one line. Create a Huffman tree for this message. Create a code table. Encode the message into binary. Decode the message from binary back to text.
Read through "The Huffman Code" on page 415 of the book. Write a program to implement...
Read through "The Huffman Code" on page 415 of the book. Write a program to implement Huffman coding and decoding. It should do the following: Accept a text message, possibly of more than one line. Create a Huffman tree for this message. Create a code table. Encode the message into binary. Decode the message from binary back to text. in java please
Write one page how was the class Medsurge?
Write one page how was the class Medsurge?
Matlab question: 1. Implement image filtering in frequency domain on the "testtpattern512.tif" image. You will design...
Matlab question: 1. Implement image filtering in frequency domain on the "testtpattern512.tif" image. You will design the filter, and filter the image in the frequency domain, then use inverse DFT to display the filtered image in the spatial domain. Assume zero padding for filtering process. a- Design a rectangular ideal low pass filter with a cutoff frequency of (Uo, Vo), filtering the image so that the vertical lines are blurred together, horizontal lines are basically intact and the letters are...
ADVERTISEMENT
Subjects
ADVERTISEMENT
Latest Questions
ADVERTISEMENT