Sparse Kronecker product decomposition: a general framework of signal region detection in image regression
稀疏 Kronecker 积分解:图像回归信号区域检测的一般框架AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要聚焦图像回归与信号区域检测,未提供所列经济学细分方向的直接证据。
稀疏 Kronecker 积分解:图像回归信号区域检测的一般框架AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Abstract This paper aims to present the first Frequentist framework on signal region detection in high-resolution and high-order image regression problems. Image data and scalar-on-image regression are intensively studied in recent years. However, most existing studies on such topics focussed on outcome prediction, while the research on region detection is rather limited, even though the latter is often more important. In this paper, we develop a general framework named Sparse Kronecker Product Decomposition (SKPD) to tackle this issue. The SKPD framework is general in the sense that it works for both matrices and tensors represented image data. Our framework includes one-term, multi-term, and nonlinear SKPDs. We propose nonconvex optimization problems for one-term and multi-term SKPDs and develop path-following algorithms for the nonconvex optimization. Under a Restricted Isometric Property, the computed solutions of the path-following algorithm are guaranteed to converge to the truth with a particularly chosen initialization even though the optimization is nonconvex. Moreover, the region detection consistency could also be guaranteed. The nonlinear SKPD is highly connected to shallow convolutional neural networks (CNN), particularly to CNN with one convolutional layer and one fully-connected layer. Effectiveness of SKPD is validated by real brain imaging data in the UK Biobank database.