Loading patent…
OwnerVictor Alexeevich STEPIN, Roman Igorevich CHERNYAK +1inventors
InventorsVictor Alexeevich STEPIN, Roman Igorevich CHERNYAK, Ruslan Faritovich MULLAKHMETOV
Estimating the term…
The present disclosure relates to the iterative fast-search of more than one identified best blocks, corresponding to best patches within a search area, by early termination of the subblock iteration through comparison of a similarity measure to a similarity threshold. In particular, the positions of K-best matched-blocks, divided into multiple subblocks, are found for a reference block within an image search area. By performing subblock-based iterative calculations of the similarity measure between a block at a current position and the reference block within a search area, the iteration progresses as long as the similarity measure value remains larger than a threshold value, and the positions of the K-best patches are recorded in a storage medium, whereas the subblock iteration terminates when the similarity measure value is lower than the threshold value.
An apparatus for filtering a reference block based on K best-matching blocks within a search area of an image, K being an integer larger than one, the apparatus comprising a processing circuitry configured to:
A method for filtering a reference block based on K best-matching blocks within a search area of an image, K being an integer larger than one, the method comprising the steps of:
A computer-readable medium storing a program including instructions which, when executed on a processor performs the steps of:
Dependencies are inferred from the claim text.