https://3demmethods.i2pc.es/index.php?action=history&feed=atom&title=2024Anuk_Auction2024Anuk Auction - Revision history2026-06-13T12:13:47ZRevision history for this page on the wikiMediaWiki 1.44.2https://3demmethods.i2pc.es/index.php?title=2024Anuk_Auction&diff=4801&oldid=prevWikiSysop: Created page with "== Citation == S. Anuk, T. Bendory, and A. Painsky, “Image detection using combinatorial auction,” IEEE Open J. Signal Processing, 2024. == Abstract == This paper studies the optimal solution of the classical problem of detecting the location of multiple image occurrences in a two-dimensional, noisy measurement. Assuming the image occurrences do not overlap, we formulate this task as a constrained maximum likelihood optimization problem.We show that the maximum li..."2024-11-08T10:11:06Z<p>Created page with "== Citation == S. Anuk, T. Bendory, and A. Painsky, “Image detection using combinatorial auction,” IEEE Open J. Signal Processing, 2024. == Abstract == This paper studies the optimal solution of the classical problem of detecting the location of multiple image occurrences in a two-dimensional, noisy measurement. Assuming the image occurrences do not overlap, we formulate this task as a constrained maximum likelihood optimization problem.We show that the maximum li..."</p>
<p><b>New page</b></p><div>== Citation ==<br />
<br />
S. Anuk, T. Bendory, and A. Painsky, “Image detection using combinatorial auction,” IEEE Open J. Signal Processing, 2024.<br />
<br />
== Abstract ==<br />
<br />
This paper studies the optimal solution of the classical problem of detecting the location of multiple image<br />
occurrences in a two-dimensional, noisy measurement. Assuming the image occurrences do not overlap, we formulate<br />
this task as a constrained maximum likelihood optimization problem.We show that the maximum likelihood estimator is<br />
equivalent to an instance of the winner determination problem from the field of combinatorial auction and that the solution<br />
can be obtained by searching over a binary tree. We then design a pruning mechanism that significantly accelerates the<br />
runtime of the search. We demonstrate on simulations and electron microscopy data sets that the proposed algorithm<br />
provides accurate detection in challenging regimes of high noise levels and densely packed image occurrences.<br />
<br />
== Keywords ==<br />
<br />
== Links ==<br />
<br />
https://ieeexplore.ieee.org/abstract/document/10637697/<br />
<br />
== Related software ==<br />
<br />
== Related methods ==<br />
<br />
== Comments ==</div>WikiSysop