On the Estimation of a Convex Set From Noisy Data on Its Support Function
由含噪支持函数数据估计凸集AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要研究成像与视觉中的凸集重建,未涉及所列经济学或金融计量细分领域。
由含噪支持函数数据估计凸集AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
In problems of medical imaging and robotic vision, measurements of a convex set are sometimes obtained via the set's support function. The standard way in which the convex set is recovered from such data is to suppose that it is polygonal, model the errors as Normal random variables, and apply constrained maximum likelihood methods. Typically, the number of sides assumed of the polygon is equal to or a little less than the number of data points. However, from a statistical viewpoint, the number of sides should really be interpreted as a smoothing parameter and chosen to optimize some measure of performance. Additionally, if the true set is not a polygon, then a polygonal estimate can be aesthetically unsatisfactory. In this article we suggest periodic smoothing methods for estimating the convex set.