Anyone please Question (a) Explain how each of the following…

Question Answered step-by-step Anyone please Question (a) Explain how each of the following… Anyone pleaseQuestion(a) Explain how each of the following equations or expressions can be used for detecting and estimating visual motion in a spatiotemporal image sequence I(x, y, t). Include in your answer the name used to describe each of these general classes of motion extraction models: (i) ? ?I(x, y, t) ?t = ~v · ?~ I(x, y, t) [2 marks] (ii) ? ? ?t ?2G?(x, y) ? I(x, y, t) [2 marks] (iii) argmax(vx,vy) Z x Z y Z t I(x, y, t) · I(x ? vx?, y ? vy?, t ? ? ) dx dy dt [2 marks] (iv) F(?x, ?y, ?t) = e ?i(?xvx? + ?yvy? + ?t?)F(?x, ?y, ?t) where F(?x, ?y, ?t) = Z x Z y Z t I(x, y, t) e ?i(?xx+?yy+?tt) dx dy dt [2 marks] (B) Color vision is not related to wavelength measurement as it changes with illumination. Explain why it is difficult to assign the surface’s unique spectral reflection characteristics. Describes the steps of  the Retinex algorithm designed to  solve this problem and associates these steps with neurobiology whenever possible. [7 points] (c) Provides an overview of the shape classification algorithm and the construction of shape grammar , including active contours, codon chains, and indexes. Explains how to use the codon constraint to define a wide range of equivalence classes in form grammars. Immutable to irrelevant conversions such as “cashew” objects. [5 points] The goal is to find a series of movements that bring the puzzle into the  shown state. On the right side, each time you move, one square is pushed into the empty space.  Evil Robot is updating its visual system. He has one camera  N × n matrix I of pixel values. The visual system is arranged as follows.  Image transcription text(X AND Y) OR (NOT X) [3 marks X Y X AND Y NOT X (X AND Y) OR (NOT X) 0 0 0 0… Show more Input I is reduced to  m × m matrix H (I). The elements of Hi and j are Hello, j (I) = ? Xn k = 1 Xn l = 1 w (I, j) k, l Ik, l + b (I, j) !! Where ? is a suitable function,  w (I, j) k, l, b (I, j) are the weights and biases of. Element (i, j). The single output o (H) is calculated as o (H) = ? xm k = 1 xm l = 1 wk, lHk, l + b !! .. (A) If the Evil Robot has a training example (I) 0 , Y0 ) And use error E (w). Here w A vector of all available weights and biases that derives the algorithm for the calculation ?E ?w As an example. [12 points] (B) System changes work as follows: O H m m Me n n The  I to H mapping is replaced by  n 0 × n 0 Convolution core. that is A single set of parameters vk, l, and c used to calculate each element of H as follows: Weighted sum of patches for element I Hello, j (I) = ? nX0 k = 1 nX0 l = 1 vk, lIi + k-1, j + l-1 + cProvide a detailed description of how the algorithm derived in Part (a) must beupdated to take account of this modification. [8 marks]3 (TURN OVER)CST1.2018.6.43 Complexity Theory(a) Give a precise definition of each of the complexity classes NP and co-NP.[4 marks](b) Give an example each of(i) an NP-complete language; and(ii) a co-NP-complete language,in each case giving a precise statement of the decision problem involved.[4 marks](c) If A and B are the two languages identified in Part (b), give an example ofa language that is polynomial-time reducible to both A and B. Justify youranswer. [4 marks](d) Consider the following statement:There is a polynomial p such that every valid Boolean formula oflength n has a proof of length at most p(n). Moreover, there is apolynomial-time algorithm that can check the correctness of the proofs.This statement is not known to be true or false. Explain what would be theconsequences of this statement being true or false for the relationship betweenNP and co-NP, giving full justification for your answer. [8 marks]Consider the following two decision problems. • Given a directed graph G and two vertices a, we reach a decision problem. Whether there is a path  from G’s b, G’s a to b.  • Given an undirected graph G and two vertices, a decision problem is reached. Whether there is a path for G’s a and b, and G’s a to b. Reach is known to be NLcomplete (log space is being reduced), That U Reach is  in  complexity class L. (A) Based on the above information, provide each of the following statements: Is it  true, false, or unknown? In any case, please tell me your reason Please answer and state if the truth of the statement is unknown Implications that may follow from whether it is true or false. (I) Reach ? LUReach, that is, H. Reach can be reduced in log space U Rach. (Ii) U range ? L range. (Iii) U Reach is at P. (Iv) If Reach is in L, then P = NP. [3 points each] (B) Nondeterministic Turing machine M is assumed to be symmetric, if any. The two configurations of M, c1 and c2, are c2 ? Mc1 in the case of  c1 ? M c2. Write SL All language classes accepted by  symmetric Turing machines Use an O (log n) workspace to enter length n. Review the machine configuration graph  and use the following facts. U Reach is L and explains why it follows SL ? L. [8 points]psap.  Engineering & Technology Computer Science COMPUTER S 402 Share QuestionEmailCopy link Comments (0)