Motivated by single-particle cryo-electron microscopy, we study the sample complexity of the multi-target detection (MTD) problem, in which an unknown signal appears multiple times at unknown locations within a long, noisy observation. We propose a patching scheme that reduces MTD to a non-i.i.d. multi-reference alignment (MRA) model. In the one-dimensional setting, the latent group elements form a Markov chain, and we show that the convergence rate of any estimator matches that of the corresponding i.i.d. MRA model, up to a logarithmic factor in the number of patches. Moreover, for estimators based on empirical averaging, such as the method of moments, the convergence rates are identical in both settings. We further establish an analogous result in two dimensions, where the latent structure arises from an exponentially mixing random field generated by a hard-core placement model. As a consequence, if the signal in the corresponding i.i.d. MRA model is determined by moments up to order $n_{\min}$, then in the low-SNR regime the number of patches required to estimate the signal in the MTD model scales as $σ^{2n_{\min}}$, where $σ^2$ denotes the noise variance.

翻译：受单粒子冷冻电镜的启发，我们研究了多目标检测问题的样本复杂度，其中未知信号在长噪声观测中多次出现于未知位置。我们提出了一种分块方案，将多目标检测问题简化为非独立同分布的多参考对齐模型。在一维情形下，潜在群元素构成马尔可夫链，我们证明任意估计量的收敛速率与相应独立同分布多参考对齐模型的收敛速率最多相差一个关于分块数量的对数因子。此外，对于基于经验平均的估计量（如矩估计法），两种设定下的收敛速率完全相同。我们在二维情形下进一步建立了类似结果，其中潜在结构由硬核放置模型生成的指数混合随机场产生。作为推论，若相应独立同分布多参考对齐模型中的信号由最高$n_{\min}$阶矩确定，则在低信噪比下，估计多目标检测模型信号所需的分块数量按$σ^{2n_{\min}}$标度，其中$σ^2$表示噪声方差。