quiz bu lëkkale ak tegtal · Diggante Niveau

Quiz topp mbir yu bari

Jàngaleel ni pexe toppe-ci-gis di boolee gis-gis mbir ci kaadar yi boole ci yoriinu dàntite ak occlusion.

Yooni njiit yu jëm ciTopp mbir yu bari
Laaj 1 de 8

Lan mooy mébetu topp mbir yu bari?

Xoolaatal laaj bu nekk8 laaj

Sooy def quiz bi, tontu yi ak leeral yi dañuy feeñ.

  1. Lan mooy mébetu topp mbir yu bari?
    • Topp mbir yu bari ci biir kaadar yi boole ci am dàntite bu méngoo ci bu nekk
    • Ngir xaaj benn nataal
    • Ngir kompresse wideo
    • Ngir defar kadre yu bees
  2. Luy paradigm 'topp-ci-gis'?
    • Topp te amul benn detektër
    • Gis mbir yi ci kaadar bu nekk, ba noppi lëkkale gis-gis yooyu ci kaadar yi
    • Jëfandikool ay siñaal audio kese
    • Topp ci rëdd boyet yi ak loxo
  3. Ban cër la filtre Kalman di def ci toppukaay yu melni SORT?
    • Dafay kompresse nataal yi
    • Dafay gis mbir yu bees ci noonu
    • Dafay wax fi mbir mu nekk buñu topp di toxu ci kanam
    • Dafay yokk melo ci kaadar yi
  4. Lu DeepSORT yokk ci kaw SORT?
    • Dayo nataal bu gëna mag
    • Topp audio
    • Sous-titre otomatik
    • ab melokaan buñu jàng ngir xàmmeewaat mbir yi ginaaw occlusion
  5. Luy 'commutateur dàntite' ci topp mbir yu bari?
    • Su toppukaay bi weccoo ID ñaari mbir, lu bari luñuy jàkkarloo
    • Soppi dayo wideo bi
    • Fatt kamera bi
    • Soppi tur wideo bi
  6. Naka la ByteTrack amee ci topp bu jaar yoon?
    • Ni ñuy baña bàyyi xel ci gis-gis yépp
    • Ni ñuy boole gis-gis yu wóorul dara ci barabu sànni leen
    • Soo dindi detektër bi
    • Soo jëfandikoo benn kaadar kese
  7. What does HOTA aim to balance in multi-object tracking evaluation?
    • Image resolution and model size
    • Training speed and GPU memory
    • Detection accuracy and association accuracy
    • Object color and camera frame rate
  8. How does SORT assign detections to predicted tracks?
    • It uses a language model to name each object
    • It matches only by color histograms
    • It trains a new detector for each frame
    • It solves a frame-level assignment problem using IoU-based costs and the Hungarian algorithm