跳到正文
← 返回论文列表与筛选
阅读说明

本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。

DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。

引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。

关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。

分类依据与纠错

AI 根据所提供的论文材料归类:摘要研究模式识别的计算筛选与层级检验,未提供经济网络、因果推断或其他所列细分领域的证据。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

正在核对对应版本的资源…

关注这篇论文的作者
Gilles Blanchard
Donald Geman

用于模式识别的层级检验设计

研究问题
面对大量候选模式且背景情形占主导时,如何通过逐步检验筛除候选,将昂贵计算集中于模糊区域并降低总成本?
方法与思路
作者将候选集合组织为嵌套分区,研究按既往结果选择下一检验的序贯策略,同时优化检验成本与剩余候选的后处理成本。
材料陈述的贡献
摘要称在一定假设下,良好策略从广范围低功效检验逐步转向具体目标的高功效检验,成本与功效之比发挥关键作用。
阅读关注点
应核对零第一类错误的检验设定、功效和成本的定义,以及保证检验顺序规律的假设与杂乱背景中矩形检测的实现。
阅读边界
仅据版本未注明的OpenAlex摘要,无法核实优化条件和算法表现;特殊检验设定下的设计规律不能直接推广至一般多重检验。

原文摘要

We explore the theoretical foundations of a “twenty questions” approach to pattern recognition. The object of the analysis is the computational process itself rather than probability distributions (Bayesian inference) or decision boundaries (statistical learning). Our formulation is motivated by applications to scene interpretation in which there are a great many possible explanations for the data, one (“background”) is statistically dominant, and it is imperative to restrict intensive computation to genuinely ambiguous regions. The focus here is then on pattern filtering: Given a large set $\mathcal {Y}$ of possible patterns or explanations, narrow down the true one Y to a small (random) subset $\widehat{Y}\subset\mathcal{Y}$ of “detected” patterns to be subjected to further, more intense, processing. To this end, we consider a family of hypothesis tests for Y∈A versus the nonspecific alternatives Y∈Ac. Each test has null type I error and the candidate sets $A\subset\mathcal{Y}$ are arranged in a hierarchy of nested partitions. These tests are then characterized by scope (|A|), power (or type II error) and algorithmic cost. We consider sequential testing strategies in which decisions are made iteratively, based on past outcomes, about which test to perform next and when to stop testing. The set Ŷ is then taken to be the set of patterns that have not been ruled out by the tests performed. The total cost of a strategy is the sum of the “testing cost” and the “postprocessing cost” (proportional to |Ŷ|) and the corresponding optimization problem is analyzed. As might be expected, under mild assumptions good designs for sequential testing strategies exhibit a steady progression from broad scope coupled with low power to high power coupled with dedication to specific explanations. In the assumptions ensuring this property a key role is played by the ratio cost/power. These ideas are illustrated in the context of detecting rectangles amidst clutter.

笔记与分组
相关领域论文