Visual data tensor completion method based on smooth constraint and matrix decomposition
A matrix decomposition and smoothing constraint technology, applied in the field of visual data tensor completion, can solve the problems of long running time, high computational complexity, and low completion accuracy, and achieve the effect of improving efficiency and good data completion effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0063] The present invention will be described in further detail below in conjunction with the accompanying drawings.
[0064] The present invention provides a visual data tensor completion method based on smooth constraints and matrix decomposition, such as figure 1 As shown, it specifically includes the following steps:
[0065] Step 1: Obtain the missing overall data, determine the known data location set Ω, and construct the corresponding visual data tensor model.
[0066] First obtain the values of all pixels in the incomplete visual data, divide the pixels whose pixel value is not zero into known pixels, divide the pixels whose pixel value is zero into unknown pixels, and take the positions of all known pixels Form a set Ω, and construct the visual data into a corresponding tensor model. For example, a color image can be separated according to the three-channel RGB color, and constructed as a tensor formed by stacking three image size matrices; video data can be divi...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com