Row and column loss image filling method based on low-rank matrix reconstruction and sparse representation

A sparse representation, low-rank matrix technology, applied in the field of computer vision, which can solve problems such as insufficient prior conditions and missing matrix rows.

Inactive Publication Date: 2017-09-05
TIANJIN UNIV
View PDF5 Cites 28 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, due to the lack of prior conditions, the problem of mis

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Row and column loss image filling method based on low-rank matrix reconstruction and sparse representation
  • Row and column loss image filling method based on low-rank matrix reconstruction and sparse representation
  • Row and column loss image filling method based on low-rank matrix reconstruction and sparse representation

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0061] The method for filling missing rows and columns of images based on low-rank matrix reconstruction and sparse representation of the present invention will be described in detail below in conjunction with the embodiments and drawings.

[0062] The present invention combines low-rank matrix reconstruction with sparse representation, introduces a dictionary learning model on the basis of traditional low-rank matrix reconstruction models, and adopts joint low-rank and separable two-dimensional sparse priori constraints on missing images, Therefore, the problem that existing algorithms cannot realize image filling with missing rows and columns is solved. The specific method includes the following steps:

[0063] 1) Considering the low-rank characteristics of the natural image itself, a low-rank prior is introduced based on the low-rank matrix reconstruction theory to constrain the latent image; at the same time, considering that each column of a row-missing image can be spars...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention belongs to the field of computer vision, and aims at achieving the accurate filling of a pixel row and column loss image. The technical scheme employed in the invention is that a row and column loss image filling method based on low-rank matrix reconstruction and sparse representation comprises the steps: introducing low-rank priori to carry out the constraining of a potential image based on the low-rank matrix reconstruction theory; introducing a separable two-dimensional sparse priori based on the sparse representation theory with the consideration to a condition that the sparse representation of each column of a row loss image can be achieved through a column dictionary and the sparse representation of each row of a column loss image can be achieved through a row dictionary; specifically describing a filling problem of an image with the row and column loss into a solving problem of a constraint optimization equation based on the above combined low-rank and separable two-dimensional sparse priori, thereby achieving the filling of the row and column loss image. The method is mainly used for a computer vision processing occasion.

Description

technical field [0001] The invention belongs to the field of computer vision. In particular, it concerns row and column missing image filling methods based on low-rank matrix reconstruction and sparse representation. Background technique [0002] The problem of recovering an unknown complete matrix from a part of the known pixels of the matrix has attracted great attention in recent years. Such problems are frequently encountered in many application domains of computer vision and machine learning, such as image inpainting, recommender systems, and background modeling. [0003] There have been many research results on methods to solve the image filling problem. Due to the ill-conditioned nature of the matrix filling problem, current matrix filling methods generally consider the latent matrix to be low-rank or approximately low-rank, and then fill in the missing pixel values ​​through low-rank matrix reconstruction. Such as singular value threshold method (SVT), augmented L...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06T5/00G06K9/46
CPCG06T5/005G06V10/40G06V10/513
Inventor 杨敬钰杨蕉如李坤
Owner TIANJIN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap