程序代写代做代考 algorithm 18-793 Image and Video Processing

18-793 Image and Video Processing
Submission instructions.
Fall 2020
􏰁 Submissions are due on Thursday 11/12 at 10.00pm ET
􏰁 Please upload scans of your solution in GradeScope (via Canvas)
Homework 9
Instructions
􏰁 Please solve all non-MATLAB problems using only paper and pen, without resorting to
a computer.
􏰁 Please show all necessary steps to get the final answer. However, there is no need to be overly elaborate. Crisp and complete answers.
􏰁 For all MATLAB problems, include all code written to generate solutions.
􏰁 Please post all questions on the discussion board on the Piazza course website.
􏰁 If you feel some information is missing, you are welcome to make reasonable assumptions and proceed. Sometimes the omissions are intentional. Needless to say, only reasonable assumptions will be accepted.
1. (Sub-differentials) Let x ∈ RN and let f(x) = ∥x∥2. (Part a) Is f(x) differentiable? Justify.
(Part b) Derive the sub-differential of f(x).
(Part c) Derive the solution to the optimization problem
minβ∥x∥2 + 1∥y−x∥2. x2
Hint: If you wait till Tuesday, Aswin will solve it in class.
2. (Orthogonality in OMP) Consider the OMP algorithm that we derived in class, and also given below as pseudo-code
function x = OMP(y, A, K, tol) Ω←φ
r←y
k←0
while (k < K) AND (∥r∥/∥y∥ ≥ tol) k←k+1 j ← arg maxi |⟨r, aj ⟩| Ω ← Ω ∪ {j} xΩ ←argminα∥y−AΩα∥2, r ← y − Ax xΩc ←0 2 3. Homework 9 Show that, at the end of each iteration, the residue r is orthogonal to the columns of A in the index set Ω. Implications: A column once selected wont be selected again since the residue will be orthogonal to it. This problem uses OMP to solve the inpainting problem. (Part a) Implement OMP. Your code must have the following structure. Note that in this implementation you are passing along an actual matrix A and not an operator. function x = OMP(y, A, K, tol) %% %% your code goes here %% end You can use the pseudocode in problem 2 as a guide. Deliverable: Your code. (Part b) Test your OMP code with the following script. clear all close all N = 1024; M = 256; K = 50; A = randn(M,N)/sqrt(M); x0 = zeros(N, 1); Supp = randperm(N, K); x0(Supp) = randn(K, 1); y = A*x0; xhat = OMP(y, A, K, 0); stem(x0, ’kx’); hold on stem(xhat, ’ro’); Deliverable: The plots. You can expect the black and red plot to match very closely. Homework 9 3 (Part c) In hw9.mat you have the classic inpainting problem again. As is the case in inpainting problem, the unknown image x is related to the measurement y as follows: y = x.*m;Youcanfindyandminthematfile. We are now going to use OMP to solve this. Let xp be a 16×16 patch of the image x. Let mp and yp be patches at the same location for y and m, respectively. We will vectorize all three of them to create 256-dimensional vectors. Now the input-output relationship can be written as yp = diag(mp)xp You also have a matrix D of size 256 × 512 such that the 512-dimensional vector sp defined as xp = Dsp is K-sparse, where K is typically a small number, say smaller than 16. With this, you can get the following equation yp = diag(mp)Dsp, ∥sp∥0 ≤ K. By iterating over patches of the image y, and using OMP on each of them, reconstruct the image x. Deliverables. (a) Code, (b) Recovered image. Remark. We have obviously left out a lot of details, including what specific value of K to use, and whether or not to overlap the patches in the image. Stopping criteria is also something you can consider. Basically, fill in these details as needed.