AnyLearn
All interview prep
AI and machine learningMid-levelComputer Vision Engineer

Computer Vision Engineer Interview Prep: Questions and a Mock Test

Computer vision interviews reward people who have shipped something, because the difference between a model that scores well on a benchmark and a model that works on a customer's camera is almost entirely made of things benchmarks do not measure: lighting, labels, class imbalance, latency, and the long tail of inputs nobody anticipated. This page covers the technical rounds and the applied ones, and ends with a graded mock across six areas.

The loop

How the process is structured

The interview loop: each round, how long it runs, and what it tests
RoundLengthWhat it tests
1.Deep learning fundamentals[2]Not publishedConvolutions, receptive fields, residual connections, normalisation and its train-versus-inference behaviour, loss functions, and the mechanics of optimisation. Depth is expected on whatever appears on your CV.
2.Vision task depth[1]Not publishedDetection and segmentation architectures, anchors and non-maximum suppression, and the distinctions between semantic, instance and panoptic segmentation. Expect to be asked to choose an approach from a stated constraint rather than to name the newest model.
3.Applied problem and evaluation[1]Not publishedAn end-to-end scenario: dataset construction, labelling policy, class imbalance, augmentation, and how you would measure success. Metric precision matters here, including that interpolating the precision-recall curve gives an "overly-optimistic measure of classifier performance".
4.Deployment and operations[3]Not publishedLatency budgets, quantisation, edge constraints, and monitoring a model whose labels never arrive. The MLOps maturity framing is the usual scaffold, where automated data and model validation is what makes retraining safe.

Bracketed markers point to the dated sources at the end of this article. Loops change; check the retrieval dates before relying on a round count.

Why convolutions, and what each part is for

Expect to be asked why a convolutional architecture suits images rather than a fully connected network, and the answer should be about structure rather than about performance.

Three properties do the work. Local connectivity, because a pixel's meaning depends mostly on its neighbours, so each unit looks at a small region rather than the whole image. Parameter sharing, because a feature such as an edge is worth detecting anywhere, so the same filter slides across the image; this is what makes the parameter count independent of image size. And translation equivariance, because shifting the input shifts the feature map correspondingly, so the network does not need to learn the same object separately at every position.

The practical vocabulary follows. A receptive field is the region of the input that influences one output unit, and it grows with depth, with larger kernels, and with stride and pooling. Stacking two three-by-three convolutions gives the same receptive field as one five-by-five with fewer parameters and an extra non-linearity, which is the reasoning behind small-kernel architectures. Dilated convolutions expand the receptive field without adding parameters or reducing resolution, which is why they appear in segmentation.

Residual connections are worth being able to justify: adding the input to the output gives gradients a path that skips the block, which is what made very deep networks trainable. Batch normalisation stabilises training by normalising activations, and the detail interviewers probe is that it behaves differently at training and inference time, using batch statistics during training and running estimates afterwards.

Detection and segmentation, and the tasks people conflate

Being precise about the task is the first thing assessed, because the metrics and the failure modes differ.

Classification assigns a label to a whole image. Object detection localises instances with boxes and labels. Semantic segmentation labels every pixel with a class but does not separate touching instances of it. Instance segmentation separates them. Panoptic segmentation combines instance-level things with amorphous stuff such as sky and road.

The design distinction most often asked about is one-stage versus two-stage detection. Two-stage approaches propose candidate regions and then classify and refine them, which historically gave better accuracy at higher latency. One-stage approaches predict boxes and classes directly in a single pass and are faster, with the accuracy gap having narrowed substantially. Transformer-based detectors remove hand-designed components such as anchor boxes and non-maximum suppression by treating detection as set prediction.

Non-maximum suppression is a favourite question because it is a post-processing step with real consequences. A detector emits many overlapping boxes for one object, and suppression keeps the highest-scoring box and removes others overlapping it above a threshold. The tradeoff to name: a low threshold removes duplicates aggressively and also removes genuine detections of objects that genuinely overlap, such as people in a crowd. That is a tuning decision driven by the deployment, not a constant.

Intersection over union is the underlying measure, the area of overlap divided by the area of union of two boxes, ranging from zero to one.

Evaluation, where models look better than they are

Metric questions separate candidates quickly, because the standard reporting hides specific failures.

Start from the definitions. scikit-learn states them exactly: precision is "the ability of the classifier not to label as positive a sample that is negative", computed as true positives over true positives plus false positives; recall is "the ability of the classifier to find all the positive samples", true positives over true positives plus false negatives.

Average precision summarises the precision-recall curve, defined as the sum over thresholds of the change in recall multiplied by the precision at that threshold. One detail is worth carrying into an interview: the documentation warns that linear interpolation of points on the precision-recall curve "provides an overly-optimistic measure of classifier performance", which is what the trapezoidal rule does when computing area under that curve. So average precision computed by interpolation and average precision computed without it are not the same number, and comparing across implementations that differ on this is comparing incomparable figures.

For detection, mean average precision aggregates average precision across classes, and modern benchmarks average across several intersection over union thresholds rather than a single loose one, which rewards precise localisation rather than merely finding the object somewhere.

The judgement half is that a single aggregate hides everything. A detector can improve overall while getting worse on small objects, on a particular camera, at night, or on the rarest and most important class. Per-slice evaluation is what catches that, and proposing it unprompted is a strong signal. Accuracy on an imbalanced problem is close to meaningless, since predicting the majority class scores well while finding nothing.

Data, which is usually the actual problem

In applied vision work the dataset is more often the bottleneck than the architecture, and interviewers with production experience ask about it directly.

Label quality comes first. Bounding box conventions vary, tight versus loose, whether occluded parts are included, how truncated objects at the frame edge are handled, and inconsistency between annotators produces a ceiling on measurable accuracy that no model can exceed. Measuring inter-annotator agreement, and writing a labelling guide before annotation rather than after, are the answers that indicate experience.

Class imbalance is second, and vision datasets are almost always imbalanced. The available responses each have a cost: oversampling rare classes risks overfitting to the few examples, undersampling discards data, class-weighted loss is simple and can destabilise training, and focal loss reduces the contribution of easy examples so training focuses on hard ones.

Augmentation is third, and the question interviewers use is which augmentations are valid for the task. Horizontal flips are fine for most natural images and wrong for text or for anything where handedness matters. Rotation is fine for aerial or medical imagery and can be wrong for street scenes. Colour jitter helps when lighting varies in deployment and hurts when colour is the discriminating feature. The principle to state: augmentation should express variation you expect at inference, not arbitrary distortion.

Google's Rules of Machine Learning applies here too, particularly the advice to "keep the first model simple and get the infrastructure right", because "the first model provides the biggest boost to your product, so it doesn't need to be fancy".

Getting it to run, and keeping it working

Deployment rounds ask about the constraints that decide architecture choices in practice.

The latency budget usually determines the model more than accuracy does. A model that takes 200 milliseconds cannot serve a 30 frames per second video stream on one device, and knowing the levers is expected: a smaller backbone, reduced input resolution, quantisation to lower precision, pruning, and batching where the workload allows it. Quantisation is the one most often discussed, and the useful distinction is between post-training quantisation, which is quick and can lose accuracy, and quantisation-aware training, which costs a training run and usually recovers most of it.

Edge deployment adds constraints that cloud deployment does not: fixed memory, no ability to scale out, thermal throttling under sustained load, and a model that must be updated over a network you do not control.

Monitoring is where vision systems fail quietly. Labels rarely arrive in production, so the practical signals are the input distribution, image statistics such as brightness and blur, and the prediction distribution, including how often the model abstains or returns low confidence. A camera that is knocked out of position, a lens that fouls, or a seasonal lighting change will degrade a model without any code changing. Google Cloud's MLOps framing is the right reference for the automation around this, where level 1 requires automated data and model validation rather than only a retraining schedule.

One closing point interviewers like: a confidence threshold is a product decision. Where you set it determines whether the system annoys people with false alarms or misses what it was installed to catch.

Open-ended

What they actually ask

  1. 1.Design a system to detect defects on a production line. The defect rate is 0.3 percent.

    What a strong answer covers

    The imbalance is the whole problem and should be addressed immediately: accuracy is meaningless here, so the metric must be precision and recall on the defect class, with the operating point chosen from the relative cost of a missed defect against a false alarm that stops the line. Strong answers cover data collection under the real lighting and camera geometry rather than in a lab, a labelling guide agreed with the people who currently do the inspection, and the fact that defects are rare so collecting enough examples takes time and may need deliberate seeding. They discuss handling imbalance through focal loss or sampling, propose anomaly detection as an alternative when defect types are open-ended, and specify per-defect-type evaluation since the aggregate will be dominated by whichever type is most common.

  2. 2.Your detector achieves 0.85 mAP on the test set but performs poorly when deployed. Where do you look?

    What a strong answer covers

    The first hypothesis should be distribution shift between the test set and deployment: different cameras, lenses, resolutions, mounting angles, lighting, weather or time of day. Then data leakage in the split, particularly frames from the same video appearing in both training and test, which makes the test set nearly a copy of training. Then label conventions differing between the benchmark and what deployment actually requires. Then per-slice analysis, since a strong aggregate can hide poor performance on small objects, one class, or one site. Strong answers also check the preprocessing path end to end, because a mismatch in resize, normalisation or colour channel order between training and inference produces exactly this symptom and is extremely common.

  3. 3.You have 500 labelled images and need better performance. What do you do?

    What a strong answer covers

    Expected first move is transfer learning from a model pretrained on a large dataset, fine-tuning rather than training from scratch, since 500 images is far too few for the latter. Then augmentation chosen to reflect the variation expected at inference rather than arbitrary distortion. Then getting more data cheaply: active learning to label the examples the model is least certain about, semi-supervised approaches using unlabelled images you already have, and synthetic data where the domain permits it. Strong answers also question the framing, since checking label quality on the existing 500 often yields more than any modelling change, and suggest that a simpler task definition, fewer classes or coarser localisation, may meet the actual requirement with the data available.

  4. 4.How would you choose between a one-stage and a two-stage detector?

    What a strong answer covers

    The strong answer derives it from constraints rather than from preference. Latency budget and hardware come first, since a real-time requirement on modest hardware effectively decides it. Then accuracy requirements by object size, because small-object performance is often where the difference shows. Then operational factors: how much tuning the team can sustain, what is well supported in the deployment runtime, and whether the export path to the target device works at all, which quietly eliminates more architectures than accuracy does. Strong candidates note that the historical accuracy gap has narrowed considerably, that transformer-based detectors remove anchors and non-maximum suppression at a different cost profile, and that the right answer is usually to benchmark two candidates on your own data rather than to argue from published numbers.

  5. 5.How would you monitor a vision model in production when no labels arrive?

    What a strong answer covers

    Since accuracy is not computable, the answer is built from proxies. Input-side: image statistics such as brightness, contrast, blur and saturation compared against a training reference, which catches a fouled lens, a moved camera or a seasonal lighting change. Output-side: the distribution of predicted classes and confidences, and the rate of low-confidence or empty predictions, which shifts before anyone notices a problem. Strong answers add a small human-labelled sample reviewed on a schedule, and any downstream proxy outcome available, such as how often an operator overrides the system. They are explicit that a distribution alert is a prompt to investigate rather than proof of degradation, and they mention keeping sample images so a shift can actually be diagnosed rather than only detected.

  6. 6.The model must run at 30 frames per second on an embedded device. How do you approach it?

    What a strong answer covers

    Measure first on the actual target hardware, since throughput on a development GPU predicts almost nothing about an embedded accelerator. Then work the levers in order of cost: reduce input resolution, which is often the single largest win and directly trades against small-object accuracy; choose a backbone designed for the constraint; quantise, distinguishing post-training quantisation from quantisation-aware training and their different accuracy costs; and prune. Strong candidates check what the target runtime actually supports, because an unsupported operator forces a fallback that destroys the latency budget, and they account for the full pipeline including decode, preprocessing and post-processing, since non-maximum suppression on a large number of candidate boxes can dominate inference time. They also raise thermal throttling under sustained load.

Worked examples

Three sample questions, answered

These three show the level the mock is pitched at, with the answer and the reasoning in the open. The graded paper keeps its answer key server-side.

1.What does intersection over union measure between two bounding boxes?
Detection and segmentation
  • The ratio of their centre distances to their diagonal lengths
  • The area of their overlap divided by the area of their union
  • The proportion of the predicted box contained in the ground truth box
  • The difference in their areas as a fraction of the larger box

Why: IoU is overlap area divided by union area, ranging from 0 for no overlap to 1 for a perfect match. It is the basis for deciding whether a detection counts as a true positive, and for the overlap test in non-maximum suppression. Dividing by the predicted box alone would reward a box that is merely contained in the ground truth.

2.Why is accuracy a poor metric for a defect detector where 0.3 percent of items are defective?
Evaluation metrics
  • Because accuracy cannot be computed on imbalanced data
  • Because accuracy requires a calibrated confidence score
  • Because accuracy is only defined for binary problems
  • Because always predicting 'no defect' scores 99.7 percent while catching nothing

Why: Accuracy is dominated by the majority class and hides complete failure on the class that matters. Precision and recall on the defect class, and the precision-recall curve, remain sensitive to it. The operating point should then be chosen from the relative cost of a missed defect against a false alarm.

3.Batch normalisation behaves differently at inference than during training. How?
Training and regularisation
  • It uses running estimates of mean and variance rather than the current batch's statistics
  • It is disabled entirely at inference
  • It normalises across channels rather than across the batch
  • It applies a fixed scale of one and shift of zero

Why: During training the layer normalises using statistics of the current batch and updates running estimates. At inference it uses those running estimates so that a prediction does not depend on which other samples happen to be in the batch. Forgetting to switch the model to evaluation mode is a classic bug producing predictions that change with batch composition.

The mock

An 18-question knowledge check

This is a knowledge check, not a simulation. The real loop happens on a whiteboard, in an editor, and in conversation. What this paper does measure is the underlying knowledge those rounds draw on: each question is tagged with a topic, grading happens per topic, and a weak topic points you at the course that fixes it.

Your paper0 / 18 answered
  1. 1.Which property of convolutions makes the parameter count independent of input image size?
    Convolutional architectures
  2. 2.Why are two stacked three-by-three convolutions often preferred to one five-by-five?
    Convolutional architectures
  3. 3.What problem do residual connections primarily address?
    Convolutional architectures
  4. 4.Which augmentation is inappropriate for a model reading text in images?
    Training and regularisation
  5. 5.Training loss falls steadily while validation loss rises after epoch 20. What is happening, and what is the simplest response?
    Training and regularisation
  6. 6.What does focal loss change relative to standard cross-entropy?
    Training and regularisation
  7. 7.What does non-maximum suppression do, and what is the cost of setting its threshold too low?
    Detection and segmentation
  8. 8.What distinguishes instance segmentation from semantic segmentation?
    Detection and segmentation
  9. 9.What is the main tradeoff historically distinguishing one-stage from two-stage detectors?
    Detection and segmentation
  10. 10.How is precision defined?
    Evaluation metrics
  11. 11.Why can average precision computed by trapezoidal interpolation of the precision-recall curve be misleading?
    Evaluation metrics
  12. 12.A detector's overall mAP improves after retraining, but users report it got worse. What should you check first?
    Evaluation metrics
  13. 13.Frames from the same video appear in both the training and test splits. What is the consequence?
    Datasets, labels and augmentation
  14. 14.Two annotators disagree systematically on how tightly to draw boxes. Why does this matter?
    Datasets, labels and augmentation
  15. 15.Which is the strongest first move when you have only a few hundred labelled images?
    Datasets, labels and augmentation
  16. 16.What is the practical difference between post-training quantisation and quantisation-aware training?
    Deployment and inference cost
  17. 17.Inference is far slower on the target device than benchmarks suggested, and profiling shows time outside the network itself. What is a likely cause?
    Deployment and inference cost
  18. 18.Why is the confidence threshold of a deployed detector a product decision rather than a purely technical one?
    Deployment and inference cost
18 questions left to answer.
Apparatus

Sources

Hiring loops change. Every claim above carries a retrieval date so you can judge how current it is.

  1. [1]scikit-learn, Metrics and scoring: precision, recall and average precision · retrieved 2026-08-13
  2. [2]Google, Rules of Machine Learning: Best Practices for ML Engineering · retrieved 2026-08-13
  3. [3]Google Cloud, MLOps: Continuous delivery and automation pipelines in machine learning · retrieved 2026-08-13
  4. [4]scikit-learn, Cross-validation: evaluating estimator performance · retrieved 2026-08-13
Keep preparing

Refresh your memory

Free learning paths covering the ground this loop tests, whatever your score. Each one ends with a shareable certificate.