Dynamic behavior analysis via structured rank minimization

DOI10.1007/S11263-016-0985-3MaRDI QIDQ2193906zbMATH OpenOpenAlexWikidataFDO

Authors Christos Georgakis, Yannis Panagakis, Maja Pantic

Publication date 21 August 2020

Published in International Journal of Computer Vision (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s11263-016-0985-3

zbMATH Keywords

dynamic behavior analysisHankel matrixlinear time-invariant systemslow-ranksparsitystructured rank minimization

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Machine vision and scene understanding (68T45)

Recommendations

• Video behaviour mining using a dynamic topic model
• Learning behavioural context
• Complex activity recognition via attribute dynamics
• Multi-feature hierarchical topic models for human behavior recognition
• Dynamic textures

Cites work

• Active subspace: toward scalable low-rank learning
• An alternating direction algorithm for matrix completion with nonnegative factors
• Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Global convergence of splitting methods for nonconvex composite optimization
• Hankel matrix rank minimization with applications to system identification and realization
• scientific article; zbMATH DE number 3914081 (Why is no real title available?)
• scientific article; zbMATH DE number 1090982 (Why is no real title available?)
• Low rank approximation of a Hankel matrix by structured total least norm
• Nearly unbiased variable selection under minimax concave penalty
• On the Convergence of Alternating Direction Lagrangian Methods for Nonconvex Structured Optimization Problems
• Optimal computational and statistical rates of convergence for sparse nonconvex learning problems
• Parallel Algorithms for Constrained Tensor Factorization via Alternating Direction Method of Multipliers
• Robust principal component analysis?
• Semidefinite Programming
• Sparse Approximate Solutions to Linear Systems
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent

Describes a project that uses

Uses Software

• LMaFit
• BADMM

This page was built for publication: Dynamic behavior analysis via structured rank minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2193906)