Jump to content

Talk:Block-matching algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 73.217.103.80 (talk) at 00:26, 8 January 2024 (Algorithm section lacks citations and Three Step Search makes no sense). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconComputer graphics C‑class Low‑importance
WikiProject iconThis article is within the scope of WikiProject Computer graphics, a collaborative effort to improve the coverage of computer graphics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
CThis article has been rated as C-class on Wikipedia's content assessment scale.
LowThis article has been rated as Low-importance on the project's importance scale.
WikiProject iconComputing Stub‑class
WikiProject iconThis article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
StubThis article has been rated as Stub-class on Wikipedia's content assessment scale.
???This article has not yet received a rating on the project's importance scale.
Note icon
This article has been automatically rated by a bot or other tool as Stub-class because it uses a stub template. Please ensure the assessment is correct before removing the |auto= parameter.

Algorithms

First, this section has essentially no citations, which I'm going to flag after updating the talk page. 73.217.103.80 (talk) 00:26, 8 January 2024 (UTC)[reply]

The given algorithm makes no sense. It does not express what p is meant to do as a parameter. At the second step it states, "Search 8 locations +/- S pixels around location (0,0) and the location (0,0)", which is redundant to the point that I believe it was supposed to express something different (and therefore lacking crucial information). Even ignoring the probably erroneous redundancy, it doesn't express how the 8 locations are resolved (each could be be chosen along a circle, as a diamond, as a large square, etc). The rest of it makes reasonable sense, but those few issues are clearly pretty critical. 73.217.103.80 (talk) 00:26, 8 January 2024 (UTC)[reply]