Learning-Based Local Visual Representation and Indexing, reviews the state-of-the-art in visual content representation and indexing, introduces cutting-edge techniques in learning based visual representation, and discusses emerging topics in visual local representation, and introduces the most recent advances in content-based visual search techniques.

Content-based 3-D object retrieval has attracted extensive attention recently and has applications in a variety of fields, such as, computer-aided design, tele-medicine,mobile multimedia, virtual reality, and entertainment. The development of efficient and effective content-based 3-D object retrieval techniques has enabled the use of fast 3-D reconstruction and model design. Recent technical progress, such as the development of camera technologies, has made it possible to capture the views of 3-D objects. As a result, view-based 3-D object retrieval has become an essential but challenging research topic. View-based 3-D Object Retrieval introduces and discusses the fundamental challenges in view-based 3-D object retrieval, proposes a collection of selected state-of-the-art methods for accomplishing this task developed by the authors, and summarizes recent achievements in view-based 3-D object retrieval. Part I presents an Introduction to View-based 3-D Object Retrieval, Part II discusses View Extraction, Selection, and Representation, Part III provides a deep dive into View-Based 3-D Object Comparison, and Part IV looks at future research and developments including Big Data application and geographical location-based applications.

This SpringerBrief discusses the applications of spare representation in wireless communications, with a particular focus on the most recent developed compressive sensing (CS) enabled approaches. With the help of sparsity property, sub-Nyquist sampling can be achieved in wideband cognitive radio networks by adopting compressive sensing, which is illustrated in this brief, and it starts with a comprehensive overview of compressive sensing principles. Subsequently, the authors present a complete framework for data-driven compressive spectrum sensing in cognitive radio networks, which guarantees robustness, low-complexity, and security. Particularly, robust compressive spectrum sensing, low-complexity compressive spectrum sensing, and secure compressive sensing based malicious user detection are proposed to address the various issues in wideband cognitive radio networks. Correspondingly, the real-world signals and data collected by experiments carried out during TV white space pilot trial enables data-driven compressive spectrum sensing. The collected data are analysed and used to verify our designs and provide significant insights on the potential of applying compressive sensing to wideband spectrum sensing. This SpringerBrief provides readers a clear picture on how to exploit the compressive sensing to process wireless signals in wideband cognitive radio networks. Students, professors, researchers, scientists, practitioners, and engineers working in the fields of compressive sensing in wireless communications will find this SpringerBrief very useful as a short reference or study guide book. Industry managers, and government research agency employees also working in the fields of compressive sensing in wireless communications will find this SpringerBrief useful as well.

This brief presents a comprehensive review of the network architecture and communication technologies of the smart grid communication network (SGCN). It then studies the strengths, weaknesses and applications of two promising wireless mesh routing protocols that could be used to implement the SGCN. Packet transmission reliability, latency and robustness of these two protocols are evaluated and compared by simulations in various practical SGCN scenarios. Finally, technical challenges and open research opportunities of the SGCN are addressed. Wireless Communications Networks for Smart Grid provides communication network architects and engineers with valuable proven suggestions to successfully implement the SGCN. Advanced-level students studying computer science or electrical engineering will also find the content helpful.

This open access book discusses the theory and methods of hypergraph computation. Many underlying relationships among data can be represented using graphs, for example in the areas including computer vision, molecular chemistry, molecular biology, etc. In the last decade, methods like graph-based learning and neural network methods have been developed to process such data, they are particularly suitable for handling relational learning tasks. In many real-world problems, however, relationships among the objects of our interest are more complex than pair-wise. Naively squeezing the complex relationships into pairwise ones will inevitably lead to loss of information which can be expected valuable for learning tasks.  Hypergraph, as a generation of graph, has shown superior performance on modelling complex correlations compared with graph. Recent years have witnessed a great popularity of researches on hypergraph-related AI methods, which have been used in computer vision, social media analysis, etc. We summarize these attempts as a new computing paradigm, called hypergraph computation, which is to formulate the high-order correlations underneath the data using hypergraph, and then conduct semantic computing on the hypergraph for different applications. The content of this book consists of hypergraph computation paradigms, hypergraph modelling, hypergraph structure evolution, hypergraph neural networks, and applications of hypergraph computation in different fields. We further summarize recent achievements and future directions on hypergraph computation in this book.

This open access book discusses the theory and methods of hypergraph computation. Many underlying relationships among data can be represented using graphs, for example in the areas including computer vision, molecular chemistry, molecular biology, etc. In the last decade, methods like graph-based learning and neural network methods have been developed to process such data, they are particularly suitable for handling relational learning tasks. In many real-world problems, however, relationships among the objects of our interest are more complex than pair-wise. Naively squeezing the complex relationships into pairwise ones will inevitably lead to loss of information which can be expected valuable for learning tasks.  Hypergraph, as a generation of graph, has shown superior performance on modelling complex correlations compared with graph. Recent years have witnessed a great popularity of researches on hypergraph-related AI methods, which have been used in computer vision, social media analysis, etc. We summarize these attempts as a new computing paradigm, called hypergraph computation, which is to formulate the high-order correlations underneath the data using hypergraph, and then conduct semantic computing on the hypergraph for different applications. The content of this book consists of hypergraph computation paradigms, hypergraph modelling, hypergraph structure evolution, hypergraph neural networks, and applications of hypergraph computation in different fields. We further summarize recent achievements and future directions on hypergraph computation in this book.