Low-rank tensor completion method based on three-dimensional total variation and Tucker decomposition

A fully variable, three-dimensional technology, applied in the field of digital image processing, can solve problems such as losing high-dimensional data space structure, and achieve efficient solution results

Pending Publication Date: 2021-12-31
XIAN UNIV OF TECH
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] In the existing LRTV research, two-dimensional TV is usually used to constrain the tensor expansion matrix. However, a large number of studies have shown that directly expanding high-dimensional data into a two-dimensional matrix will inevitably lose the high-dimensional data. Spatial structure

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
  • Low-rank tensor completion method based on three-dimensional total variation and Tucker decomposition
  • Low-rank tensor completion method based on three-dimensional total variation and Tucker decomposition
  • Low-rank tensor completion method based on three-dimensional total variation and Tucker decomposition

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0057] The present invention will be described in further detail below in conjunction with specific embodiments and accompanying drawings.

[0058] A low-rank tensor completion method based on 3DTV and Tucker decomposition, including the following steps:

[0059] Step 1, use MATLAB software to read in the damaged video file with high loss rate, and process it into a three-dimensional tensor tensor The size is X×Y×M;

[0060] Step 2, the kernel tensor in the target functional of tensor completion and factor matrix by tensor Decomposed, so it is not conducive to the solution of the target functional, need to introduce three auxiliary variables, namely the matrix and tensors and tensor At this time, the target functional is transformed into formula (3),

[0061]

[0062] In formula (3), the adjustment parameter λ 1 and lambda 2 , balancing the weights between 3DTV and low-rank constraints, where λ 1 >0,λ 2 >0,D w is the weighted three-dimensional differenc...

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

A low-rank tensor completion method based on three-dimensional total variation and Tucker decomposition comprises the following steps: reading a damaged video into MATLAB software, converting the damaged video into a three-dimensional tensor with the tensor size of X * Y * Z, optimizing a solved objective functional by using an augmented Lagrange formula, decomposing a mixed objective functional into a plurality of optimization sub-problems, introducing three auxiliary variables, dividing the three auxiliary variables into three independent parts, introducing a three-dimensional weighted difference operator into three-dimensional total variation constraint, retaining a multi-factor structure of the three-dimensional tensor, and describing a segmented smooth structure of a three-dimensional space domain of the tensor data; continuously iteratively updating the introduced three auxiliary variables and the tensor y needing to be repaired, and determined that the tensor completion is completed when the maximum number of iterations is reached or the relative error of the tensor y complemented for two consecutive times is smaller than a given parameter value epsilon. According to the method, multi-channel data can be effectively processed, the low-rank performance of the tensor is described, the proposed convex functional is efficiently solved, and the restoration of the high-loss-rate damaged video is completed.

Description

technical field [0001] The invention belongs to the technical field of digital image processing, and in particular relates to a low-rank tensor completion method based on three-dimensional full variation and Tucker decomposition, aiming at damaged videos. Background technique [0002] With the rapid development of data acquisition technology, a large number of multi-dimensional visual data are emerging, such as frequently used color images, videos, hyperspectral (HS) or multispectral (MS) images, magnetic resonance imaging (MRI) data, and electronic business data. In fact, these multi-dimensional visual data obtained from the application scene can be regarded as a tensor, and each channel, view or band is collectively called a component. For example, a color image (grayscale video sequence) can be viewed as a three-dimensional (3D) tensor due to its height, width, and color (temporal) channels. Among them, the scale and quantity of video data sets are increasing day by day,...

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/00G06T5/50
CPCG06T5/50G06T2207/10016G06T5/00Y02T10/40
Inventor 杨秀红薛怡许鹏肖照林金海燕
Owner XIAN UNIV OF TECH
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