Image Completion with Large or Edge-Missing Areas
نویسندگان
چکیده
منابع مشابه
Distortion Optimization based Image Completion from a Large Displacement View
We present a new image completion method based on an additional large displacement view (LDV) of the same scene for faithfully repairing large missing regions on the target image in an automatic way. A coarse-to-fine distortion correction algorithm is proposed to minimize the perspective distortion in the corresponding parts for the common scene regions on the LDV image. First, under the assump...
متن کاملContourlet-Based Edge Extraction for Image Registration
Image registration is a crucial step in most image processing tasks for which the final result is achieved from a combination of various resources. In general, the majority of registration methods consist of the following four steps: feature extraction, feature matching, transform modeling, and finally image resampling. As the accuracy of a registration process is highly dependent to the fe...
متن کاملTraffic Missing Data Completion With Spatial-temporal Correlations
1 The missing data problem remains as a difficulty in transportation information system, which seriously 2 restricted the application of intelligent transportation system, e,g. traffic control and traffic flow prediction. 3 To solve this problem, numerous imputation methods had been proposed in the last decade. However, few 4 existing studies had fully used the spatial correlation for traffic d...
متن کاملLow-Rank Matrix Completion with Adversarial Missing Entries
We give an algorithm for completing an order-m symmetric low-rank tensor from its multilinear entries in time roughly proportional to the number of tensor entries. We apply our tensor completion algorithm to the problem of learning mixtures of product distributions over the hypercube, obtaining new algorithmic results. If the centers of the product distribution are linearly independent, then we...
متن کاملHigh-Rank Matrix Completion and Subspace Clustering with Missing Data
This paper considers the problem of completing a matrix with many missing entries under the assumption that the columns of the matrix belong to a union of multiple low-rank subspaces. This generalizes the standard low-rank matrix completion problem to situations in which the matrix rank can be quite high or even full rank. Since the columns belong to a union of subspaces, this problem may also ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2019
ISSN: 1999-4893
DOI: 10.3390/a13010014