A Survey on Patch-based Synthesis: GPU Implementation and Optimization

• URL: http://arxiv.org/abs/2005.06278v1
• Date: Mon, 11 May 2020 19:25:28 GMT
• Title: A Survey on Patch-based Synthesis: GPU Implementation and Optimization
• Authors: Hadi Abdi Khojasteh
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This thesis surveys the research in patch-based synthesis and algorithms for finding correspondences between small local regions of images. We additionally explore a large kind of applications of this new fast randomized matching technique. One of the algorithms we have studied in particular is PatchMatch, can find similar regions or "patches" of an image one to two orders of magnitude faster than previous techniques. The algorithmic program is driven by applying mathematical properties of nearest neighbors in natural images. It is observed that neighboring correspondences tend to be similar or "coherent" and use this observation in algorithm in order to quickly converge to an approximate solution. The algorithm is the most general form can find k-nearest neighbor matching, using patches that translate, rotate, or scale, using arbitrary descriptors, and between two or more images. Speed-ups are obtained over various techniques in an exceeding range of those areas. We have explored many applications of PatchMatch matching algorithm. In computer graphics, we have explored removing unwanted objects from images, seamlessly moving objects in images, changing image aspect ratios, and video summarization. In computer vision we have explored denoising images, object detection, detecting image forgeries, and detecting symmetries. We conclude by discussing the restrictions of our algorithmic program, GPU implementation and areas for future analysis.

Related papers

• EDCSSM: Edge Detection with Convolutional State Space Model [3.649463841174485]
  Edge detection in images is the foundation of many complex tasks in computer graphics. Due to the feature loss caused by multi-layer convolution and pooling architectures, learning-based edge detection models often produce thick edges. This paper presents an edge detection algorithm which effectively addresses the aforementioned issues.
  arXiv  Detail & Related papers  (2024-09-03T05:13:25Z)
• Image Copy-Move Forgery Detection and Localization Scheme: How to Avoid Missed Detection and False Alarm [10.135979083516174]
  Image copy-move is an operation that replaces one part of the image with another part of the same image, which can be used for illegal purposes. Recent studies have shown that keypoint-based algorithms achieved excellent and robust localization performance. However, when the input image is low-resolution, most existing keypoint-based algorithms are difficult to generate sufficient keypoints.
  arXiv  Detail & Related papers  (2024-06-05T13:50:29Z)
• A Hierarchical Descriptor Framework for On-the-Fly Anatomical Location Matching between Longitudinal Studies [0.07499722271664144]
  We propose a method to match anatomical locations between pairs of medical images in longitudinal comparisons. The matching is made possible by computing a descriptor of the query point in a source image. A hierarchical search operation finds the corresponding point with the most similar descriptor in the target image.
  arXiv  Detail & Related papers  (2023-08-11T18:01:27Z)
• Learning the Positions in CountSketch [49.57951567374372]
  We consider sketching algorithms which first compress data by multiplication with a random sketch matrix, and then apply the sketch to quickly solve an optimization problem. In this work, we propose the first learning-based algorithms that also optimize the locations of the non-zero entries.
  arXiv  Detail & Related papers  (2023-06-11T07:28:35Z)
• Fast Key Points Detection and Matching for Tree-Structured Images [4.929206987094714]
  This paper offers a new authentication algorithm based on image matching of nano-resolution visual identifiers with tree-shaped patterns. The proposed algorithm is applicable to a variety of tree-structured image matching, but our focus is on dendrites, recently-developed visual identifiers.
  arXiv  Detail & Related papers  (2022-11-07T00:22:56Z)
• A Novel Falling-Ball Algorithm for Image Segmentation [0.14337588659482517]
  Region-based Falling-Ball algorithm is presented, which is a region-based segmentation algorithm. The proposed algorithm detects the catchment basins by assuming that a ball falling from hilly terrains will stop in a catchment basin.
  arXiv  Detail & Related papers  (2021-05-06T12:41:10Z)
• Scale Normalized Image Pyramids with AutoFocus for Object Detection [75.71320993452372]
  A scale normalized image pyramid (SNIP) is generated that, like human vision, only attends to objects within a fixed size range at different scales. We propose an efficient spatial sub-sampling scheme which only operates on fixed-size sub-regions likely to contain objects. The resulting algorithm is referred to as AutoFocus and results in a 2.5-5 times speed-up during inference when used with SNIP.
  arXiv  Detail & Related papers  (2021-02-10T18:57:53Z)
• Depth image denoising using nuclear norm and learning graph model [107.51199787840066]
  Group-based image restoration methods are more effective in gathering the similarity among patches. For each patch, we find and group the most similar patches within a searching window. The proposed method is superior to other current state-of-the-art denoising methods in both subjective and objective criterion.
  arXiv  Detail & Related papers  (2020-08-09T15:12:16Z)
• Learning to Accelerate Heuristic Searching for Large-Scale Maximum Weighted b-Matching Problems in Online Advertising [51.97494906131859]
  Bipartite b-matching is fundamental in algorithm design, and has been widely applied into economic markets, labor markets, etc. Existing exact and approximate algorithms usually fail in such settings due to either requiring intolerable running time or too much computation resource. We propose textttNeuSearcher which leverages the knowledge learned from previously instances to solve new problem instances.
  arXiv  Detail & Related papers  (2020-05-09T02:48:23Z)
• GeoDA: a geometric framework for black-box adversarial attacks [79.52980486689287]
  We propose a framework to generate adversarial examples in one of the most challenging black-box settings. Our framework is based on the observation that the decision boundary of deep networks usually has a small mean curvature in the vicinity of data samples.
  arXiv  Detail & Related papers  (2020-03-13T20:03:01Z)
• Image Matching across Wide Baselines: From Paper to Practice [80.9424750998559]
  We introduce a comprehensive benchmark for local features and robust estimation algorithms. Our pipeline's modular structure allows easy integration, configuration, and combination of different methods. We show that with proper settings, classical solutions may still outperform the perceived state of the art.
  arXiv  Detail & Related papers  (2020-03-03T15:20:57Z)

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.