This book provides a view of low-rank and sparse computing, especially approximation, recovery, representation, scaling, coding, embedding and learning among unconstrained visual data. The book includes chapters covering multiple emerging topics in this new field. It links multiple popular research fields in Human-Centered Computing, Social Media, Image Classification, Pattern Recognition, Computer Vision, Big Data, and Human-Computer Interaction. Contains an overview of the low-rank and sparse modeling techniques for visual analysis by examining both theoretical analysis and real-world applications.

Low-Rank Models in Visual Analysis: Theories, Algorithms, and Applications presents the state-of-the-art on low-rank models and their application to visual analysis. It provides insight into the ideas behind the models and their algorithms, giving details of their formulation and deduction. The main applications included are video denoising, background modeling, image alignment and rectification, motion segmentation, image segmentation and image saliency detection. Readers will learn which Low-rank models are highly useful in practice (both linear and nonlinear models), how to solve low-rank models efficiently, and how to apply low-rank models to real problems. - Presents a self-contained, up-to-date introduction that covers underlying theory, algorithms and the state-of-the-art in current applications - Provides a full and clear explanation of the theory behind the models - Includes detailed proofs in the appendices

Nowadays, many real-world problems must deal with collections of high-dimensional data. High dimensional data usually have intrinsic low-dimensional representations, which are suited for subsequent analysis or processing. Therefore, finding low-dimensional representations is an essential step in many machine learning and data mining tasks. Low-rank and sparse modeling are emerging mathematical tools dealing with uncertainties of real-world data. Leveraging on the underlying structure of data, low-rank and sparse modeling approaches have achieved impressive performance in many data analysis tasks. Since the general rank minimization problem is computationally NP-hard, the convex relaxation of original problem is often solved. One popular heuristic method is to use the nuclear norm to approximate the rank of a matrix. Despite the success of nuclear norm minimization in capturing the low intrinsic-dimensionality of data, the nuclear norm minimizes not only the rank, but also the variance of matrix and may not be a good approximation to the rank function in practical problems. To mitigate above issue, this thesis proposes several nonconvex functions to approximate the rank function. However, It is often difficult to solve nonconvex problem. In this thesis, an optimization framework for nonconvex problem is further developed. The effectiveness of this approach is examined on several important applications, including matrix completion, robust principle component analysis, clustering, and recommender systems. Another issue associated with current clustering methods is that they work in two separate steps including similarity matrix computation and subsequent spectral clustering. The learned similarity matrix may not be optimal for subsequent clustering. Therefore, a unified algorithm framework is developed in this thesis. To capture the nonlinear relations among data points, we formulate this method in kernel space. Furthermore, the obtained continuous spectral solutions could severely deviate from the true discrete cluster labels, a discrete transformation is further incorporated in our model. Finally, our framework can simultaneously learn similarity matrix, kernel, and discrete cluster labels. The performance of the proposed algorithms is established through extensive experiments. This framework can be easily extended to semi-supervised classification.

This book is a comprehensive exposition of the theory, algorithms, and applications of structured low-rank approximation. Local optimization methods and effective suboptimal convex relaxations for Toeplitz, Hankel, and Sylvester structured problems are presented. A major part of the text is devoted to application of the theory with a range of applications from systems and control theory to psychometrics being described. Special knowledge of the application fields is not required. The second edition of /Low-Rank Approximation/ is a thoroughly edited and extensively rewritten revision. It contains new chapters and sections that introduce the topics of: • variable projection for structured low-rank approximation;• missing data estimation;• data-driven filtering and control;• stochastic model representation and identification;• identification of polynomial time-invariant systems; and• blind identification with deterministic input model. The book is complemented by a software implementation of the methods presented, which makes the theory directly applicable in practice. In particular, all numerical examples in the book are included in demonstration files and can be reproduced by the reader. This gives hands-on experience with the theory and methods detailed. In addition, exercises and MATLAB^® /Octave examples will assist the reader quickly to assimilate the theory on a chapter-by-chapter basis. “Each chapter is completed with a new section of exercises to which complete solutions are provided.” Low-Rank Approximation (second edition) is a broad survey of the Low-Rank Approximation theory and applications of its field which will be of direct interest to researchers in system identification, control and systems theory, numerical linear algebra and optimization. The supplementary problems and solutions render it suitable for use in teaching graduate courses in those subjects as well.

This unique text/reference presents a comprehensive review of the state of the art in sparse representations, modeling and learning. The book examines both the theoretical foundations and details of algorithm implementation, highlighting the practical application of compressed sensing research in visual recognition and computer vision. Topics and features: describes sparse recovery approaches, robust and efficient sparse representation, and large-scale visual recognition; covers feature representation and learning, sparsity induced similarity, and sparse representation and learning-based classifiers; discusses low-rank matrix approximation, graphical models in compressed sensing, collaborative representation-based classification, and high-dimensional nonlinear learning; includes appendices outlining additional computer programming resources, and explaining the essential mathematics required to understand the book.

This thesis primarily focuses on how to carry out intelligent sensing and understand the high-dimensional and low-quality visual information. After exploring the inherent structures of the visual data, it proposes a number of computational models covering an extensive range of mathematical topics, including compressive sensing, graph theory, probabilistic learning and information theory. These computational models are also applied to address a number of real-world problems including biometric recognition, stereo signal reconstruction, natural scene parsing, and SAR image processing.

Principal components analysis (PCA) is a well-known technique for approximating a tabular data set by a low rank matrix. This dissertation extends the idea of PCA to handle arbitrary data sets consisting of numerical, Boolean, categorical, ordinal, and other data types. This framework encompasses many well known techniques in data analysis, such as nonnegative matrix factorization, matrix completion, sparse and robust PCA, k-means, k-SVD, and maximum margin matrix factorization. The method handles heterogeneous data sets, and leads to coherent schemes for compressing, denoising, and imputing missing entries across all data types simultaneously. It also admits a number of interesting interpretations of the low rank factors, which allow clustering of examples or of features. We propose several parallel algorithms for fitting generalized low rank models, and describe implementations and numerical results.

This two-volume set of LNCS 12736-12737 constitutes the refereed proceedings of the 7th International Conference on Artificial Intelligence and Security, ICAIS 2021, which was held in Dublin, Ireland, in July 2021. The conference was formerly called “International Conference on Cloud Computing and Security” with the acronym ICCCS. The total of 93 full papers and 29 short papers presented in this two-volume proceedings was carefully reviewed and selected from 1013 submissions. Overall, a total of 224 full and 81 short papers were accepted for ICAIS 2021; the other accepted papers are presented in CCIS 1422-1424. The papers were organized in topical sections as follows: Part I: Artificial intelligence; and big data Part II: Big data; cloud computing and security; encryption and cybersecurity; information hiding; IoT security; and multimedia forensics

The book presents the proceedings of the 10th International Conference on Frontiers of Intelligent Computing: Theory and Applications (FICTA 2022), held at NIT Mizoram, Aizawl, Mizoram, India during 18 – 19 June 2022. Researchers, scientists, engineers, and practitioners exchange new ideas and experiences in the domain of intelligent computing theories with prospective applications in various engineering disciplines in the book. These proceedings are divided into two volumes. It covers broad areas of information and decision sciences, with papers exploring both the theoretical and practical aspects of data-intensive computing, data mining, evolutionary computation, knowledge management and networks, sensor networks, signal processing, wireless networks, protocols and architectures. This volume is a valuable resource for postgraduate students in various engineering disciplines.