Skip to content

Commit a5cd2a0

Browse files
authored
Update proj1.html
1 parent e08605f commit a5cd2a0

File tree

1 file changed

+3
-3
lines changed

1 file changed

+3
-3
lines changed

project-1/proj1.html

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -28,7 +28,7 @@ <h2 id="s2-title" class="title">NCC & Naive alignment</h2>
2828
<br>
2929
[#image]
3030
<br>
31-
Therefore, if we only want to compare the blue and green plates, we can add a second displacement (0, -H/3) to limit the comparison area to the center plate. Likewise, when comparing the red and green plates, we can have the second displacement be (0, H/3).
31+
Therefore, if we only want to compare the blue and green plates, we can add a second displacement (0, -H/3) to limit the comparison area to the center plate. Likewise, when comparing the red and green plates, we can have the second displacement be (0, H/3). Once the best displacements for the blue & red plates are computed, we can use the formula above to compute the final composite of the 3 plates.
3232
</p>
3333
</section>
3434

@@ -42,9 +42,9 @@ <h2 id="s2-title" class="title">Naive search</h2>
4242
<!-- Text BEFORE the comparison images -->
4343
<p class="lead" contenteditable="false"
4444
data-placeholder="Describe what you’re comparing (this text appears before both images)">
45-
In the previous section, we have seen that while naive search works on small images, it becomes computationally inefficient on larger ones. Is there a way to extend what works on smaller images so that it will still work on larger ones?
45+
In the previous section, we saw that while naive search works well on small images, it becomes computationally inefficient on larger ones. Is there a way to extend what works on smaller images so that it will still work on larger ones?
4646
<br><br>
47-
The answer is yes.
47+
The answer is yes. Instead of searching for
4848
</p>
4949
</section>
5050

0 commit comments

Comments
 (0)