Baidu 2017 Computer Vision Pen Question---continued

Multi-search, continue to summarize, the scope of the test is not so-called not wide ...
- Store an image with a size of 1024*1024,512 gray level, need () bit a

A. 8M
B. 32M
C. 16M
D. 64M
First 1024∗1024=220,512=29 1024*1024=2^{20}, 512=2^9, then store such a picture requires 1024∗1024∗9 1024*1024*9 bit =9mbit, approximately 8Mbit Pyramid decomposition Fusion method belongs to () Fusion method C
A. Decision-level
B. Cannot judge
C. Data-level
D. Feature level

The image fusion hierarchy is divided into four levels from low to High: signal level, data level, feature level, decision level

Signal-level fusion, which mixes the output of the unprocessed sensor in the signal domain, resulting in a fused signal.

Data-level fusion is also called pixel-level fusion, including spatial domain algorithm and transform domain algorithm, there are many fusion rule methods in spatial domain algorithm, such as logic filter method, Gray weighted average method, contrast modulation method, Pyramid decomposition Fusion method in transform domain, wavelet transform method.

In the feature-level fusion, the characteristics of different images are guaranteed, and the feature information is extracted from the source image, which is the information of target or area of interest in the source image, such as edge, character, building or vehicle, and then the characteristic information is analyzed, processed and integrated so as to get the fusion image feature.

Decision-level Image fusion is a cognitive-based approach, which is not only the highest-level image fusion method, but also the top level of abstraction.

There are two lists below list1=[2,3,6,8], list2=[5,6,10] The result of executing list (LIST1+LIST2) is: C
A [2,3,5,6,6,8,10]
B compilation Error
C [2,3,6,8,5,6,10]
D [2,3,5,6,8,10]

Directly is the list merge, the elements directly merge a 131 elements of the order table, insert a new element and keep the original order, the average to move () elements, delete an element average need to move () element D
A. 67,66
B. 65,64
C. 9,8
D. 65.5, 65

For a sequential table consisting of n elements, the average number of moves to insert a new element can be calculated as follows:
When inserting at the first end of the need to move n elements, when inserted at the end of the need to move 0 elements, so the average number of moves is ((n)/2)
When deleting the first-end elements need to move the number is (n-1), when the end of the deletion of elements need to move the number is 0, so the average number of moves (n-1)/2 The following program requires the user to enter the binary number 0/1 and display it, please find the error in the program () B bit=input ("Enter A binary digit:") if bit=0 or 1:print "Your input is:", bit
Else

Print "Your input is invalid"

A. 1
B. 2
C. 3
D. 4

Alas... People who have not learned python have been scared to pee at the sight of Python, and ran with Python for a bit==0 or 1.

a hash line is k= (27,18,66,57,36,79,94,41), the hash function is H (k) =k mode 13, and the element that conflicts with 27 has a () C
A. 1
B. 4
C. 3
D. 2
H (27) =1
H (18) =5
H (66) =1
H (57) =5
H (36) =10
H (79) =1
H (94) =3
H (41) =2

The following programs run as a result () C

#include <stdio.h>
 void f (int *p)
 {p[0]=* (p+2);}
 Main () {
 int a[10]={1,2,3,4,5,6,7,8,9,0};
 for (i=3;i>=0;i--) f (a+i);
 for (i=0;i<10;i++) printf ("%d", A[i]);
 printf ("\ n");
 }

A. 4 4 4 4 5 6 7 8 9 0
B. 5 5 5 5 5 6 7 8 9 0
C. 5 6 5 6 5 6 7 8 9 0
D. 3 3 3 4 5 6 7 8 9 0

Patience can be counted, but there is no time ... The back of the problem is too bad to do the following procedure

Write code here