[go: up one dir, main page]

Yang et al., 2016 - Google Patents

An iterative algorithm for third-order tensor multi-rank minimization

Yang et al., 2016

Document ID
6690779610006701092
Author
Yang L
Huang Z
Hu S
Han J
Publication year
Publication venue
Computational optimization and applications

External Links

Snippet

Recent work by Kilmer et al.(A third-order generalization of the matrix SVD as a product of third-order tensors, Department of Computer Science, Tufts University, Medford, MA,; Linear Algebra Appl 435 (3): 641–658,; SIAM J Matrix Anal Appl 34 (1): 148–172,), and Braman …
Continue reading at link.springer.com (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
    • G06F17/141—Discrete Fourier transforms
    • G06F17/142—Fast Fourier transforms, e.g. using a Cooley-Tukey type algorithm
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/16—Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
    • G06F17/12—Simultaneous equations, e.g. systems of linear equations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30312—Storage and indexing structures; Management thereof
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30386—Retrieval requests
    • G06F17/30389—Query formulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
    • G06K9/62—Methods or arrangements for recognition using electronic means
    • G06K9/6217—Design or setup of recognition systems and techniques; Extraction of features in feature space; Clustering techniques; Blind source separation
    • G06K9/6232—Extracting features by transforming the feature space, e.g. multidimensional scaling; Mappings, e.g. subspace methods
    • G06K9/6247—Extracting features by transforming the feature space, e.g. multidimensional scaling; Mappings, e.g. subspace methods based on an approximation criterion, e.g. principal component analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T11/00—2D [Two Dimensional] image generation
    • G06T11/003—Reconstruction from projections, e.g. tomography
    • G06T11/006—Inverse problem, transformation from projection-space into object-space, e.g. transform methods, back-projection, algebraic methods
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T2211/00—Image generation
    • G06T2211/40—Computed tomography
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring

Similar Documents

Publication Publication Date Title
Ma et al. Randomized Kaczmarz for tensor linear systems
Dao et al. Monarch: Expressive structured matrices for efficient and accurate training
Kilmer et al. Factorization strategies for third-order tensors
Lee et al. Fundamental tensor operations for large-scale data analysis using tensor network formats
Xu Alternating proximal gradient method for sparse nonnegative Tucker decomposition
Yang et al. An iterative algorithm for third-order tensor multi-rank minimization
Ravishankar et al. Sparsifying transform learning with efficient optimal updates and convergence guarantees
Yuan et al. On tensor completion via nuclear norm minimization
Reichel et al. Tensor Arnoldi–Tikhonov and GMRES-type methods for ill-posed problems with a t-product structure
CN113034414B (en) Image reconstruction method, system, device and storage medium
Bodmann et al. Frame potentials and the geometry of frames
Che et al. An efficient algorithm for computing the approximate t-URV and its applications
Dokmanić et al. Beyond Moore-Penrose Part I: generalized inverses that minimize matrix norms
Khoromskij et al. Efficient computation of highly oscillatory integrals by using QTT tensor approximation
Li et al. The nonconvex tensor robust principal component analysis approximation model via the weighted ℓ p-norm regularization
Gao et al. Tensor robust principal component analysis via tensor fibered rank and minimization
Wang et al. A fixed point iterative method for third-order tensor linear complementarity problems
Huo et al. Minimization for Signal and Image Recovery
Mehra et al. An adaptive spectral graph wavelet method for PDEs on networks
Gazzola et al. A new framework for multi-parameter regularization
Behera et al. Weighted Moore–Penrose inverses of arbitrary-order tensors
Zhang et al. Strongly convex programming for exact matrix completion and robust principal component analysis
Cai et al. Restoration Guarantee of Image Inpainting via Low Rank Patch Matrix Completion
Chen et al. A tensor singular values and its symmetric embedding eigenvalues
Zheng et al. Block diagonalization of block circulant quaternion matrices and the fast calculation for t-product of quaternion tensors