
Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Homework problems on two topics: fourier descriptors and normalized cuts. The first topic covers the discrete fourier transform (dft) of a 2d shape represented by complex numbers, and the effects of translations, scalings, rotations, and changes in starting points on the dft coefficients. The second topic deals with the normalized cuts algorithm, starting from its definition and leading to the final criterion function. Students are asked to derive expressions for the dft coefficients of transformed signals and suggest methods for shape matching invariance, as well as to solve the minimization problem using the rayleigh quotient.
Typology: Assignments
1 / 1
This page cannot be seen from the preview
Don't miss anything!

1
Let a 2D shape be represented by N points on its outer contour. The co-ordinates of these points will be considered as complex numbers
x 0 + jy 0 x 1 + jy 1 . . xN − 1 + jyN − 1
where j =
− 1. Considering U to be a periodic signal, its discrete fourier transform (DFT) can be written as
F (k) =
n=
U (n)exp(−j
2 π N
nk) (2)
where U (n) = xn + jyn, for k = 0... N − 1. Consider the situation when the points in the contour undergo
Question 1: Starting from the definition of Normalized cuts in Shi and Malik’s paper, work your way towards the final criterion function given in equation (5) of the paper
minxN cut(x) = miny
yT^ (D − W )y yT^ Dy
(Derivation for the part before the definitions of α(x), β(x), γ will be made available on the course site). (5 marks) Question 2: Solve the above minimization problem using the Rayleigh quotient result. (5 marks)