Ananda S Chowdhury – författare

Graph Based Multimedia Analysis applies concepts from graph theory to the problems of analyzing overabundant video data. Video data can be quite diverse: exocentric (captured by a standard camera) or egocentric (captured by a wearable device like Google Glass); of various durations (ranging from a few seconds to several hours); and could be from a single source or multiple sources. Efficient extraction of important information from such a large class of diverse video data can be overwhelming. The book, with its rich repertoire of theoretically elegant solutions, from graph theory in conjunction with deep learning, constrained optimization, and game theory, empowers the audience to achieve tasks like obtaining concise yet useful summaries and precisely recognizing single as well as multiple actions in a computationally efficient manner. The book provides a unique treatise on topics like egocentric video analysis and scalable video processing.

Addresses a number of challenging state-of-the-art problems in multimedia analysis like summarization, co-summarization, and action recognitionHandles a wide class of video with different genres, durations, and numbersApplies a class of theoretically rich algorithms from the discipline of graph theory, in conjunction with deep learning, constrained optimization and game theoryIncludes thorough complexity analyses of the proposed solutions, and an appendix containing implementable source codes

This unique text/reference discusses in depth the two integral components of reconstructive surgery; fracture detection, and reconstruction from broken bone fragments. In addition to supporting its application-oriented viewpoint with detailed coverage of theoretical issues, the work incorporates useful algorithms and relevant concepts from both graph theory and statistics. Topics and features: presents practical solutions for virtual craniofacial reconstruction and computer-aided fracture detection; discusses issues of image registration, object reconstruction, combinatorial pattern matching, and detection of salient points and regions in an image; investigates the concepts of maximum-weight graph matching, maximum-cardinality minimum-weight matching for a bipartite graph, determination of minimum cut in a flow network, and construction of automorphs of a cycle graph; examines the techniques of Markov random fields, hierarchical Bayesian restoration, Gibbs sampling, and Bayesian inference.