SimPatch: A Nearest Neighbor Similarity Match between Image Patches
- URL: http://arxiv.org/abs/2008.03085v1
- Date: Fri, 7 Aug 2020 10:51:10 GMT
- Title: SimPatch: A Nearest Neighbor Similarity Match between Image Patches
- Authors: Aritra Banerjee
- Abstract summary: We try to use large patches instead of relatively small patches so that each patch contains more information.
We use different feature extraction mechanisms to extract the features of each individual image patches which forms a feature matrix.
The nearest patches are calculated using two different nearest neighbor algorithms in this paper for a query patch for a given image.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Measuring the similarity between patches in images is a fundamental building
block in various tasks. Naturally, the patch-size has a major impact on the
matching quality, and on the consequent application performance. We try to use
large patches instead of relatively small patches so that each patch contains
more information. We use different feature extraction mechanisms to extract the
features of each individual image patches which forms a feature matrix and find
out the nearest neighbor patches in the image. The nearest patches are
calculated using two different nearest neighbor algorithms in this paper for a
query patch for a given image and the results have been demonstrated in this
paper.
Related papers
- Learning to Embed Time Series Patches Independently [5.752266579415516]
Masked time series modeling has recently gained much attention as a self-supervised representation learning strategy for time series.
We argue that capturing such patch might not be an optimal strategy for time series representation learning.
We propose to use 1) the simple patch reconstruction task, which autoencode each patch without looking at other patches, and 2) the simple patch-wise reconstruction that embeds each patch independently.
arXiv Detail & Related papers (2023-12-27T06:23:29Z) - Target before Shooting: Accurate Anomaly Detection and Localization
under One Millisecond via Cascade Patch Retrieval [49.45246833329707]
We re-examine the "matching" nature of Anomaly Detection (AD)
We propose a new AD framework that simultaneously enjoys new records of AD accuracy and dramatically high running speed.
arXiv Detail & Related papers (2023-08-13T11:49:05Z) - PATS: Patch Area Transportation with Subdivision for Local Feature
Matching [78.67559513308787]
Local feature matching aims at establishing sparse correspondences between a pair of images.
We propose Patch Area Transportation with Subdivision (PATS) to tackle this issue.
PATS improves both matching accuracy and coverage, and shows superior performance in downstream tasks.
arXiv Detail & Related papers (2023-03-14T08:28:36Z) - Learned Distributed Image Compression with Multi-Scale Patch Matching in
Feature Domai [62.88240343479615]
We propose Multi-Scale Feature Domain Patch Matching (MSFDPM) to fully utilize side information at the decoder of the distributed image compression model.
MSFDPM consists of a side information feature extractor, a multi-scale feature domain patch matching module, and a multi-scale feature fusion network.
Our patch matching in a multi-scale feature domain further improves compression rate by about 20% compared with the patch matching method at image domain.
arXiv Detail & Related papers (2022-09-06T14:06:46Z) - HIPA: Hierarchical Patch Transformer for Single Image Super Resolution [62.7081074931892]
This paper presents HIPA, a novel Transformer architecture that progressively recovers the high resolution image using a hierarchical patch partition.
We build a cascaded model that processes an input image in multiple stages, where we start with tokens with small patch sizes and gradually merge to the full resolution.
Such a hierarchical patch mechanism not only explicitly enables feature aggregation at multiple resolutions but also adaptively learns patch-aware features for different image regions.
arXiv Detail & Related papers (2022-03-19T05:09:34Z) - Patch-Based Stochastic Attention for Image Editing [4.8201607588546]
We propose an efficient attention layer based on the algorithm PatchMatch, which is used for determining approximate nearest neighbors.
We demonstrate the usefulness of PSAL on several image editing tasks, such as image inpainting, guided image colorization, and single-image super-resolution.
arXiv Detail & Related papers (2022-02-07T13:42:00Z) - DPT: Deformable Patch-based Transformer for Visual Recognition [57.548916081146814]
We propose a new Deformable Patch (DePatch) module which learns to adaptively split the images into patches with different positions and scales in a data-driven way.
The DePatch module can work as a plug-and-play module, which can easily be incorporated into different transformers to achieve an end-to-end training.
arXiv Detail & Related papers (2021-07-30T07:33:17Z) - Texture Memory-Augmented Deep Patch-Based Image Inpainting [121.41395272974611]
We propose a new deep inpainting framework where texture generation is guided by a texture memory of patch samples extracted from unmasked regions.
The framework has a novel design that allows texture memory retrieval to be trained end-to-end with the deep inpainting network.
The proposed method shows superior performance both qualitatively and quantitatively on three challenging image benchmarks.
arXiv Detail & Related papers (2020-09-28T12:09:08Z) - A Survey on Patch-based Synthesis: GPU Implementation and Optimization [0.0]
This thesis surveys the research in patch-based synthesis and algorithms for finding correspondences between small local regions of images.
One of the algorithms we have studied is PatchMatch, can find similar regions or "patches" of an image one to two orders of magnitude faster than previous techniques.
In computer graphics, we have explored removing unwanted objects from images, seamlessly moving objects in images, changing image aspect ratios, and video summarization.
arXiv Detail & Related papers (2020-05-11T19:25:28Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.