{"version":2,"relationshipURLBase":"https://codingai-lec03.pages.dev/course/blocks/proposal-coverage.html","relationshipResolution":"Resolve relative relationship URLs against relationshipURLBase; complete records and absolute URLs are in blocks.","title":"候选区域先追求覆盖，再由检测头作判断","url":"https://codingai-lec03.pages.dev/course/blocks/proposal-coverage.html","markdown":"https://codingai-lec03.pages.dev/course/blocks/proposal-coverage.md","pages":[{"id":"reading-opening","title":"候选区域先追求覆盖，再由检测头作判断","unit":"多个区域怎样复用同一份视觉计算？","unitId":"region-computation-reuse","chapter":"II","number":1}],"aliases":[{"oldId":"b-843437bc6dd0233309b0235d","targetId":"b-843437bc6dd0233309b0235d","page":"reading-opening","operation":"move","beforeSHA256":"71e964dbbec0f6dc17b20023f8de0e7320aff3cbfa25836d1bc4ceaf71bd4aee","afterSHA256":"71e964dbbec0f6dc17b20023f8de0e7320aff3cbfa25836d1bc4ceaf71bd4aee","reason":"Same source body in authored semantic page"},{"oldId":"b-b8eda251b4bded5bf50be7bc","targetId":"b-b8eda251b4bded5bf50be7bc","page":"reading-opening","operation":"move","beforeSHA256":"8ea77c16f575be2cbf88ff721c1deb12dd3ec3c12f54b75fcd564654270b2751","afterSHA256":"8ea77c16f575be2cbf88ff721c1deb12dd3ec3c12f54b75fcd564654270b2751","reason":"Same source body in authored semantic page"},{"oldId":"b-4ee39fbd46c4fab8a9053ef6","targetId":"b-4ee39fbd46c4fab8a9053ef6","page":"reading-opening","operation":"move","beforeSHA256":"b55eb8eebd98e289b96d27f919e1aec62217749a4d5191d494b68c51795f1e3b","afterSHA256":"b55eb8eebd98e289b96d27f919e1aec62217749a4d5191d494b68c51795f1e3b","reason":"Same source body in authored semantic page"},{"oldId":"b-c6b56602b52c956910008063","targetId":"b-c6b56602b52c956910008063","page":"reading-opening","operation":"move","beforeSHA256":"0a3df1349ae7101429d31f6c8c39cd584276870bab9c4dc369e8ad94087c794b","afterSHA256":"0a3df1349ae7101429d31f6c8c39cd584276870bab9c4dc369e8ad94087c794b","reason":"Same source body in authored semantic page"},{"oldId":"b-946024b43b5921bbe183dffb","targetId":"b-946024b43b5921bbe183dffb","page":"reading-opening","operation":"move","beforeSHA256":"301693b7d1874296ba2d63739c81e9c0a115b0edcd530b68155a04e8499cc32a","afterSHA256":"301693b7d1874296ba2d63739c81e9c0a115b0edcd530b68155a04e8499cc32a","reason":"Same source body in authored semantic page"},{"oldId":"b-8f3b764cce1db74af7223c0a","targetId":"b-8f3b764cce1db74af7223c0a","page":"reading-opening","operation":"move","beforeSHA256":"7cccefd2f1423965cf908491c70f412986a5ffd5e7e2bdce8a72648938971d84","afterSHA256":"7cccefd2f1423965cf908491c70f412986a5ffd5e7e2bdce8a72648938971d84","reason":"Same source body in authored semantic page"},{"oldId":"b-5d91bdaa1fe49fe3455629c0","targetId":"b-5d91bdaa1fe49fe3455629c0","page":"reading-opening","operation":"rewrite","beforeSHA256":"d02eea67073f06b61664c351394d39c1a2cd93f413df898b7d16265ac17cf350","afterSHA256":"105a81ec35aad242676d70cd014a02abe58f2efd853797d002094f998a2738f9","reason":"Same source identity with figure semantics or reading context enriched"},{"oldId":"b-fd1c2e81efff1feaf32e4a72","targetId":"b-fd1c2e81efff1feaf32e4a72","page":"reading-opening","operation":"move","beforeSHA256":"2b9ccef7e1220e2250cceff1abd8bdd736b42f8da5a223f26b029f44b962e807","afterSHA256":"2b9ccef7e1220e2250cceff1abd8bdd736b42f8da5a223f26b029f44b962e807","reason":"Same source body in authored semantic page"}],"blocks":[{"id":"b-843437bc6dd0233309b0235d","type":"h1","scope":"proposal-coverage","url":"https://codingai-lec03.pages.dev/course/blocks/proposal-coverage.html#b-843437bc6dd0233309b0235d","content":"# 候选区域先追求覆盖，再由检测头作判断","sha256":"71e964dbbec0f6dc17b20023f8de0e7320aff3cbfa25836d1bc4ceaf71bd4aee","chapter":{"id":"II","title":"区域、像素与实例"},"unit":{"id":"region-computation-reuse","title":"多个区域怎样复用同一份视觉计算？"},"page":{"id":"reading-opening","title":"候选区域先追求覆盖，再由检测头作判断","number":1},"sectionTitle":"候选区域先追求覆盖，再由检测头作判断","currentQuestion":"候选区域先追求覆盖，再由检测头作判断","sourceSlides":[],"knowledgeBlock":null,"formulas":[],"previousBlock":null,"nextBlock":"b-b8eda251b4bded5bf50be7bc","prerequisites":[{"id":"b-b8eda251b4bded5bf50be7bc","url":"#b-b8eda251b4bded5bf50be7bc","role":"problem-context"}],"relatedBlocks":[{"id":"b-5d91bdaa1fe49fe3455629c0","url":"#b-5d91bdaa1fe49fe3455629c0","relation":"figure-and-explanation"}]},{"id":"b-b8eda251b4bded5bf50be7bc","type":"p","scope":"proposal-coverage","url":"https://codingai-lec03.pages.dev/course/blocks/proposal-coverage.html#b-b8eda251b4bded5bf50be7bc","content":"候选集合应覆盖对象，但其中可以有局部、背景与多对象框。先看漏掉对象是候选完全没有覆盖，还是后级没有选中；两种失败需要不同改动。训练分配与评价匹配的规则留在下方算例，不把 proposal 当已识别对象。","sha256":"8ea77c16f575be2cbf88ff721c1deb12dd3ec3c12f54b75fcd564654270b2751","chapter":{"id":"II","title":"区域、像素与实例"},"unit":{"id":"region-computation-reuse","title":"多个区域怎样复用同一份视觉计算？"},"page":{"id":"reading-opening","title":"候选区域先追求覆盖，再由检测头作判断","number":1},"sectionTitle":"候选区域先追求覆盖，再由检测头作判断","currentQuestion":"候选区域先追求覆盖，再由检测头作判断","sourceSlides":[],"knowledgeBlock":null,"formulas":[],"previousBlock":"b-843437bc6dd0233309b0235d","nextBlock":"b-4ee39fbd46c4fab8a9053ef6","prerequisites":[{"id":"b-843437bc6dd0233309b0235d","url":"#b-843437bc6dd0233309b0235d","role":"section-title"}],"relatedBlocks":[{"id":"b-5d91bdaa1fe49fe3455629c0","url":"#b-5d91bdaa1fe49fe3455629c0","relation":"figure-and-explanation"}]},{"id":"b-4ee39fbd46c4fab8a9053ef6","type":"p","scope":"proposal-coverage","url":"https://codingai-lec03.pages.dev/course/blocks/proposal-coverage.html#b-4ee39fbd46c4fab8a9053ef6","content":"proposal 的含义是“值得进一步检查的区域”。它可以覆盖完整杯子，也可以只有半只杯子、包含桌面，或把两只杯子一起框住。候选阶段尚未交付最终的类别、数量与精确边界。","sha256":"b55eb8eebd98e289b96d27f919e1aec62217749a4d5191d494b68c51795f1e3b","chapter":{"id":"II","title":"区域、像素与实例"},"unit":{"id":"region-computation-reuse","title":"多个区域怎样复用同一份视觉计算？"},"page":{"id":"reading-opening","title":"候选区域先追求覆盖，再由检测头作判断","number":1},"sectionTitle":"候选区域先追求覆盖，再由检测头作判断","currentQuestion":"候选区域先追求覆盖，再由检测头作判断","sourceSlides":[],"knowledgeBlock":null,"formulas":[],"previousBlock":"b-b8eda251b4bded5bf50be7bc","nextBlock":"b-c6b56602b52c956910008063","prerequisites":[{"id":"b-843437bc6dd0233309b0235d","url":"#b-843437bc6dd0233309b0235d","role":"section-title"},{"id":"b-b8eda251b4bded5bf50be7bc","url":"#b-b8eda251b4bded5bf50be7bc","role":"problem-context"}],"relatedBlocks":[{"id":"b-5d91bdaa1fe49fe3455629c0","url":"#b-5d91bdaa1fe49fe3455629c0","relation":"figure-and-explanation"}]},{"id":"b-c6b56602b52c956910008063","type":"p","scope":"proposal-coverage","url":"https://codingai-lec03.pages.dev/course/blocks/proposal-coverage.html#b-c6b56602b52c956910008063","content":"设某张图有两只杯子。若候选集合里完全没有接近右杯的框，后面的区域分类再强，也很难在当前流程中找回它。因此可以先看 proposal recall：在某个 IoU 门槛下，有多少真值对象至少被一个候选覆盖。候选很多可能提高这个召回，却增加计算与重复；后续分类和框回归再筛去背景、校正近似位置。","sha256":"0a3df1349ae7101429d31f6c8c39cd584276870bab9c4dc369e8ad94087c794b","chapter":{"id":"II","title":"区域、像素与实例"},"unit":{"id":"region-computation-reuse","title":"多个区域怎样复用同一份视觉计算？"},"page":{"id":"reading-opening","title":"候选区域先追求覆盖，再由检测头作判断","number":1},"sectionTitle":"候选区域先追求覆盖，再由检测头作判断","currentQuestion":"候选区域先追求覆盖，再由检测头作判断","sourceSlides":[],"knowledgeBlock":null,"formulas":[],"previousBlock":"b-4ee39fbd46c4fab8a9053ef6","nextBlock":"b-946024b43b5921bbe183dffb","prerequisites":[{"id":"b-843437bc6dd0233309b0235d","url":"#b-843437bc6dd0233309b0235d","role":"section-title"},{"id":"b-b8eda251b4bded5bf50be7bc","url":"#b-b8eda251b4bded5bf50be7bc","role":"problem-context"}],"relatedBlocks":[{"id":"b-5d91bdaa1fe49fe3455629c0","url":"#b-5d91bdaa1fe49fe3455629c0","relation":"figure-and-explanation"}]},{"id":"b-946024b43b5921bbe183dffb","type":"p","scope":"proposal-coverage","url":"https://codingai-lec03.pages.dev/course/blocks/proposal-coverage.html#b-946024b43b5921bbe183dffb","content":"训练时，“这是不是前景”和“它应该往哪移动”也分开。一个背景区域有分类目标，却没有应当回归到某只杯子的唯一位置目标。具体的正负阈值、强制匹配和忽略区间随方法而异；不要把课堂上一组示例阈值视为所有检测器的定义。","sha256":"301693b7d1874296ba2d63739c81e9c0a115b0edcd530b68155a04e8499cc32a","chapter":{"id":"II","title":"区域、像素与实例"},"unit":{"id":"region-computation-reuse","title":"多个区域怎样复用同一份视觉计算？"},"page":{"id":"reading-opening","title":"候选区域先追求覆盖，再由检测头作判断","number":1},"sectionTitle":"候选区域先追求覆盖，再由检测头作判断","currentQuestion":"候选区域先追求覆盖，再由检测头作判断","sourceSlides":[],"knowledgeBlock":null,"formulas":[],"previousBlock":"b-c6b56602b52c956910008063","nextBlock":"b-8f3b764cce1db74af7223c0a","prerequisites":[{"id":"b-843437bc6dd0233309b0235d","url":"#b-843437bc6dd0233309b0235d","role":"section-title"},{"id":"b-b8eda251b4bded5bf50be7bc","url":"#b-b8eda251b4bded5bf50be7bc","role":"problem-context"}],"relatedBlocks":[{"id":"b-5d91bdaa1fe49fe3455629c0","url":"#b-5d91bdaa1fe49fe3455629c0","relation":"figure-and-explanation"}]},{"id":"b-8f3b764cce1db74af7223c0a","type":"p","scope":"proposal-coverage","url":"https://codingai-lec03.pages.dev/course/blocks/proposal-coverage.html#b-8f3b764cce1db74af7223c0a","content":"可以先在图上指出一只完全漏掉的杯子，再问该改候选覆盖还是区域分类。这个定位比笼统地说“网络不够强”更能指导实验。","sha256":"7cccefd2f1423965cf908491c70f412986a5ffd5e7e2bdce8a72648938971d84","chapter":{"id":"II","title":"区域、像素与实例"},"unit":{"id":"region-computation-reuse","title":"多个区域怎样复用同一份视觉计算？"},"page":{"id":"reading-opening","title":"候选区域先追求覆盖，再由检测头作判断","number":1},"sectionTitle":"候选区域先追求覆盖，再由检测头作判断","currentQuestion":"候选区域先追求覆盖，再由检测头作判断","sourceSlides":[],"knowledgeBlock":null,"formulas":[],"previousBlock":"b-946024b43b5921bbe183dffb","nextBlock":"b-5d91bdaa1fe49fe3455629c0","prerequisites":[{"id":"b-843437bc6dd0233309b0235d","url":"#b-843437bc6dd0233309b0235d","role":"section-title"},{"id":"b-b8eda251b4bded5bf50be7bc","url":"#b-b8eda251b4bded5bf50be7bc","role":"problem-context"}],"relatedBlocks":[{"id":"b-5d91bdaa1fe49fe3455629c0","url":"#b-5d91bdaa1fe49fe3455629c0","relation":"figure-and-explanation"}]},{"id":"b-5d91bdaa1fe49fe3455629c0","type":"figure","scope":"proposal-coverage","url":"https://codingai-lec03.pages.dev/course/blocks/proposal-coverage.html#b-5d91bdaa1fe49fe3455629c0","content":"图内标签与数值：Lecture 03 课堂图解 P28；候选 = 值得进一步检查的区域；完整目标；希望被覆盖；半只杯子 / 背景；仍需筛选；两个对象共同框；仍需拆分与修正\n\n完整对象、局部对象、背景、双对象区域各承担不同候选错误。 查看对应图解状态\n\n- 候选 = 值得进一步检查的区域\n- 完整目标\n- 希望被覆盖\n- 半只杯子 / 背景\n- 仍需筛选\n- 两个对象共同框\n- 仍需拆分与修正完整对象、局部对象、背景、双对象区域各承担不同候选错误。 [查看对应图解状态](/#/l3-r2-p28/0)[查看完整图解](/#/l3-r2-p28/0)","sha256":"105a81ec35aad242676d70cd014a02abe58f2efd853797d002094f998a2738f9","chapter":{"id":"II","title":"区域、像素与实例"},"unit":{"id":"region-computation-reuse","title":"多个区域怎样复用同一份视觉计算？"},"page":{"id":"reading-opening","title":"候选区域先追求覆盖，再由检测头作判断","number":1},"sectionTitle":"候选区域先追求覆盖，再由检测头作判断","currentQuestion":"候选区域先追求覆盖，再由检测头作判断","sourceSlides":[],"knowledgeBlock":null,"formulas":[],"figure":{"caption":"完整对象、局部对象、背景、双对象区域各承担不同候选错误。 查看对应图解状态","labels":["候选 = 值得进一步检查的区域","完整目标","希望被覆盖","半只杯子 / 背景","仍需筛选","两个对象共同框","仍需拆分与修正"],"description":"完整对象、局部对象、背景、双对象区域各承担不同候选错误。 查看对应图解状态候选 = 值得进一步检查的区域完整目标希望被覆盖半只杯子 / 背景仍需筛选两个对象共同框仍需拆分与修正","evidenceIdentity":"完整对象、局部对象、背景、双对象区域各承担不同候选错误。 查看对应图解状态","images":[{"src":"/assets/display/8ced939a1fd55047fbf73ea5.webp","alt":""}]},"previousBlock":"b-8f3b764cce1db74af7223c0a","nextBlock":"b-fd1c2e81efff1feaf32e4a72","prerequisites":[{"id":"b-843437bc6dd0233309b0235d","url":"#b-843437bc6dd0233309b0235d","role":"section-title"},{"id":"b-b8eda251b4bded5bf50be7bc","url":"#b-b8eda251b4bded5bf50be7bc","role":"problem-context"}],"relatedBlocks":[]},{"id":"b-fd1c2e81efff1feaf32e4a72","type":"h2","scope":"proposal-coverage","url":"https://codingai-lec03.pages.dev/course/blocks/proposal-coverage.html#b-fd1c2e81efff1feaf32e4a72","content":"## 继续阅读与实验","sha256":"2b9ccef7e1220e2250cceff1abd8bdd736b42f8da5a223f26b029f44b962e807","chapter":{"id":"II","title":"区域、像素与实例"},"unit":{"id":"region-computation-reuse","title":"多个区域怎样复用同一份视觉计算？"},"page":{"id":"reading-opening","title":"候选区域先追求覆盖，再由检测头作判断","number":1},"sectionTitle":"候选区域先追求覆盖，再由检测头作判断","currentQuestion":"候选区域先追求覆盖，再由检测头作判断","sourceSlides":[],"knowledgeBlock":null,"formulas":[],"previousBlock":"b-5d91bdaa1fe49fe3455629c0","nextBlock":null,"prerequisites":[{"id":"b-843437bc6dd0233309b0235d","url":"#b-843437bc6dd0233309b0235d","role":"section-title"},{"id":"b-b8eda251b4bded5bf50be7bc","url":"#b-b8eda251b4bded5bf50be7bc","role":"problem-context"}],"relatedBlocks":[{"id":"b-5d91bdaa1fe49fe3455629c0","url":"#b-5d91bdaa1fe49fe3455629c0","relation":"figure-and-explanation"}]}]}