A collection of technical interview questions for computer vision engineering positions.
1) Given stride S and kernel sizes for each layer of a (1-dimensional) CNN, create a function to compute the receptive field of a particular node in the network. This is just finding how many input nodes actually connect through to a neuron in a CNN. [src]
2) Implement connected components on an image/matrix. [src]
3) Implement a sparse matrix class in C++. [src]
4) Create a function to compute an integral image, and create another function to get area sums from the integral image.[src]
5) How would you remove outliers when trying to estimate a flat plane from noisy samples? [src]
7) How does image registration work? Sparse vs. dense optical flow and so on. [src]
8) Describe how convolution works. What about if your inputs are grayscale vs RGB imagery? What determines the shape of the next layer? [src]
9) Talk me through how you would create a 3D model of an object from imagery and depth sensor measurements taken at all angles around the object. [src]
10) Implement SQRT(const double & x) without using any special functions, just fundamental arithmetic. [src]
11) Reverse a bitstring. [src]
12) Implement non maximal suppression as efficiently as you can. [src]
13) Reverse a linked list in place. [src]
14) What's the trade-off between bias and variance? [src]
If our model is too simple and has very few parameters then it may have high bias and low variance. On the other hand if our model has large number of parameters then it’s going to have high variance and low bias. So we need to find the right/good balance without overfitting and underfitting the data. [src]
15) What is gradient descent? [src]
16) Explain over- and under-fitting and how to combat them? [src]
17) How do you combat the curse of dimensionality? [src]
- Manual Feature Selection
- Principal Component Analysis (PCA)
- Multidimensional Scaling
- Locally linear embedding
[src]
18) What is regularization, why do we use it, and give some examples of common methods? [src]
A technique that discourages learning a more complex or flexible model, so as to avoid the risk of overfitting. Examples
- Ridge (L2 norm)
- Lasso (L1 norm)
The obvious disadvantage of ridge regression, is model interpretability. It will shrink the coefficients for least important predictors, very close to zero. But it will never make them exactly zero. In other words, the final model will include all predictors. However, in the case of the lasso, the L1 penalty has the effect of forcing some of the coefficient estimates to be exactly equal to zero when the tuning parameter λ is sufficiently large. Therefore, the lasso method also performs variable selection and is said to yield sparse models. [src]
19) Explain Principal Component Analysis (PCA)? [src]
20) Why is ReLU better and more often used than Sigmoid in Neural Networks? [src]
Imagine a network with random initialized weights ( or normalised ) and almost 50% of the network yields 0 activation because of the characteristic of ReLu ( output 0 for negative values of x ). This means a fewer neurons are firing ( sparse activation ) and the network is lighter. [src]
Contributions are most welcomed.
- Fork the repository.
- Commit your questions or answers.
- Open pull request.
