Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Let us illustrate the above algorithm using a concrete example. As shown in Fig. 13.4.2 (left), assuming that the maximum value in matrix X is r23, we assign the ground-truth bounding box B3 to the anchor box A2. Then, we discard all the elements in row 2 and column 3 of the matrix, find the largest r71 in the remaining elements (shaded area), and assign the ground-truth bounding box B1 to the anchor box A7. Next, as shown in Fig. 13.4.2 (middle), discard all the elements in row 7 and column 1 of the matrix, find the largest r54 in the remaining elements (shaded area), and assign the ground-truth bounding box B4 to the anchor box A5. Finally, as shown in Fig. 13.4.2 (right), discard all the elements in row 5 and column 4 of the matrix, find the largest x92 in the remaining elements (shaded area), and assign the ground-truth bounding box B2 to the anchor box Ag. After that, we only need to traverse through the remaining anchor boxes A1, A3, A4, A6, As and determine whether to assign them ground-truth bounding boxes according to the threshold. Ground-truth bounding box indices 1 2 3 4 1 2 3 4 1 2 3 4 1 2 X23 X23 X23 Anchor box indices X54 X54 6. 8 X92 Fig. 13.4.2: Assigning ground-truth bounding boxes to anchor boxes.

Let us illustrate the above algorithm using a concrete example. As shown in Fig. 13.4.2 (left), assuming that the maximum value in matrix X is r23, we assign the ground-truth bounding box B3 to the anchor box A2. Then, we discard all the elements in row 2 and column 3 of the matrix, find the largest r71 in the remaining elements (shaded area), and assign the ground-truth bounding box B1 to the anchor box A7. Next, as shown in Fig. 13.4.2 (middle), discard all the elements in row 7 and column 1 of the matrix, find the largest r54 in the remaining elements (shaded area), and assign the ground-truth bounding box B4 to the anchor box A5. Finally, as shown in Fig. 13.4.2 (right), discard all the elements in row 5 and column 4 of the matrix, find the largest x92 in the remaining elements (shaded area), and assign the ground-truth bounding box B2 to the anchor box Ag. After that, we only need to traverse through the remaining anchor boxes A1, A3, A4, A6, As and determine whether to assign them ground-truth bounding boxes according to the threshold. Ground-truth bounding box indices 1 2 3 4 1 2 3 4 1 2 3 4 1 2 X23 X23 X23 Anchor box indices X54 X54 6. 8 X92 Fig. 13.4.2: Assigning ground-truth bounding boxes to anchor boxes.

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
Ill upvote the code
Let us illustrate the above algorithm using a concrete example. As shown in Fig. 13.4.2 (left), assuming that the maximum value in matrix X is r23, we assign the ground-truth bounding box B3 to the anchor box A2. Then, we discard all the elements in row 2 and column 3 of the matrix, find the largest r7ı in the remaining elements (shaded area), and assign the ground-truth bounding box Bị to the anchor box A7. Next, as shown in Fig. 13.4.2 (middle), discard all the elements in row 7 and column 1 of the matrix, find the largest r54 in the remaining elements (shaded area), and assign the ground-truth bounding box B4 to the anchor box A5. Finally, as shown in Fig. 13.4.2 (right), discard all the elements in row 5 and column 4 of the matrix, find the largest 92 in the remaining elements (shaded area), and assign the ground-truth bounding box B2 to the anchor box Ag. After that, we only need to traverse through the remaining anchor boxes A1, A3, A4, A6, As and determine whether to assign them ground-truth bounding boxes according to the threshold. Ground-truth bounding box indices 1 2 3 4 2 3 4 1 3 4 1 2 X23 X23 3 Anchor 4. box indices X54 X54 7 9. X92 Fig. 13.4.2: Assigning ground-truth bounding boxes to anchor boxes.
Transcribed Image Text:Let us illustrate the above algorithm using a concrete example. As shown in Fig. 13.4.2 (left), assuming that the maximum value in matrix X is r23, we assign the ground-truth bounding box B3 to the anchor box A2. Then, we discard all the elements in row 2 and column 3 of the matrix, find the largest r7ı in the remaining elements (shaded area), and assign the ground-truth bounding box Bị to the anchor box A7. Next, as shown in Fig. 13.4.2 (middle), discard all the elements in row 7 and column 1 of the matrix, find the largest r54 in the remaining elements (shaded area), and assign the ground-truth bounding box B4 to the anchor box A5. Finally, as shown in Fig. 13.4.2 (right), discard all the elements in row 5 and column 4 of the matrix, find the largest 92 in the remaining elements (shaded area), and assign the ground-truth bounding box B2 to the anchor box Ag. After that, we only need to traverse through the remaining anchor boxes A1, A3, A4, A6, As and determine whether to assign them ground-truth bounding boxes according to the threshold. Ground-truth bounding box indices 1 2 3 4 2 3 4 1 3 4 1 2 X23 X23 3 Anchor 4. box indices X54 X54 7 9. X92 Fig. 13.4.2: Assigning ground-truth bounding boxes to anchor boxes.
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS