algorithm - Solve assignment problem without cost matrix?

Question

I need to solve an assignment problem between the pixels of two images. That means, I want to find the pixel from the left image that matches best to a given pixel in the right image. But not on a per pixel basis, but considering the overall cost of all assignments.

Usually, you build a cost matrix for that and then lower on a row and column basis until you get at least one zero in each column and row. Those zeros are optimal assignments then. However, the cost matrix for a 1920 * 1080 pixel image would be roughly 4TB in memory, which I can't handle.

Is there an alternative that uses less space to solve the assignment problem?

Answer 1

匈牙利算法对成本矩阵所做的修改是从整行/列中添加/减去常量。您可以只存储行/列增量（即势），而不是存储整个矩阵，并且在检索矩阵元素时，将适当的每个元素添加到基本成本（根据需要重新计算）。但是，我希望运行时间仍然令人望而却步。