東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Vertex-frequency analysis of graph s...

Stankovic, Ljubisa.

Linked to FindBook

Google Book

Amazon

博客來

Vertex-frequency analysis of graph signals

Record Type:	Electronic resources : Monograph/item
Title/Author:	Vertex-frequency analysis of graph signals/ edited by Ljubisa Stankovic, Ervin Sejdic.
other author:	Stankovic, Ljubisa.
Published:	Cham :Springer International Publishing : : 2019.,
Description:	xv, 507 p. :ill., digital ;24 cm.
[NT 15003449]:	Introduction to Graph Signal Processing -- Oversampled Graph Laplacian Matrix for Graph Filter Banks -- Toward an Uncertainty Principle for Weighted Graphs -- Graph Theoretic Uncertainty and Feasibility -- Signal-Adapted Tight Frames on Graphs -- Local Spectral Analysis of the Cerebral Cortex: New Gyrification Indices -- Intrinsic Geometric Information Transfer Learning on Multiple Graph-Structured Datasets.
Contained By:	Springer eBooks
Subject:	Vertex detectors. -
Online resource:	https://doi.org/10.1007/978-3-030-03574-7
ISBN:	9783030035747

Vertex-frequency analysis of graph signals
Vertex-frequency analysis of graph signals[electronic resource] /edited by Ljubisa Stankovic, Ervin Sejdic. - Cham :Springer International Publishing :2019. - xv, 507 p. :ill., digital ;24 cm. - Signals and communication technology,1860-4862. - Signals and communication technology..

Introduction to Graph Signal Processing -- Oversampled Graph Laplacian Matrix for Graph Filter Banks -- Toward an Uncertainty Principle for Weighted Graphs -- Graph Theoretic Uncertainty and Feasibility -- Signal-Adapted Tight Frames on Graphs -- Local Spectral Analysis of the Cerebral Cortex: New Gyrification Indices -- Intrinsic Geometric Information Transfer Learning on Multiple Graph-Structured Datasets.

This book introduces new methods to analyze vertex-varying graph signals. In many real-world scenarios, the data sensing domain is not a regular grid, but a more complex network that consists of sensing points (vertices) and edges (relating the sensing points) Furthermore, sensing geometry or signal properties define the relation among sensed signal points. Even for the data sensed in the well-defined time or space domain, the introduction of new relationships among the sensing points may produce new insights in the analysis and result in more advanced data processing techniques. The data domain, in these cases and discussed in this book, is defined by a graph. Graphs exploit the fundamental relations among the data points. Processing of signals whose sensing domains are defined by graphs resulted in graph data processing as an emerging field in signal processing. Although signal processing techniques for the analysis of time-varying signals are well established, the corresponding graph signal processing equivalent approaches are still in their infancy. This book presents novel approaches to analyze vertex-varying graph signals. The vertex-frequency analysis methods use the Laplacian or adjacency matrix to establish connections between vertex and spectral (frequency) domain in order to analyze local signal behavior where edge connections are used for graph signal localization. The book applies combined concepts from time-frequency and wavelet analyses of classical signal processing to the analysis of graph signals. Covering analytical tools for vertex-varying applications, this book is of interest to researchers and practitioners in engineering, science, neuroscience, genome processing, just to name a few. It is also a valuable resource for postgraduate students and researchers looking to expand their knowledge of the vertex-frequency analysis theory and its applications. The book consists of 15 chapters contributed by 41 leading researches in the field.

ISBN: 9783030035747

Standard No.: 10.1007/978-3-030-03574-7doiSubjects--Topical Terms:

3381587
Vertex detectors.

LC Class. No.: QC787.V45 / V478 2019

Dewey Class. No.: 621.4830153

Vertex-frequency analysis of graph signals
LDR:03468nmm a2200349 a 4500 001 2177933
003 DE-He213
005 20190612172105.0
006 m d
007 cr nn 008maaau
008 191122s2019 gw s 0 eng d
020 $a 9783030035747 $q (electronic bk.)
020 $a 9783030035730 $q (paper)
024 7 $a 10.1007/978-3-030-03574-7 $2 doi
035 $a 978-3-030-03574-7
040 $a GP $c GP
041 0 $a eng
050 4 $a QC787.V45 $b V478 2019
072 7 $a TTBM $2 bicssc
072 7 $a TEC008000 $2 bisacsh
072 7 $a TTBM $2 thema
072 7 $a UYS $2 thema
082 0 4 $a 621.4830153 $2 23
090 $a QC787.V45 $b V567 2019
245 0 0 $a Vertex-frequency analysis of graph signals $h [electronic resource] / $c edited by Ljubisa Stankovic, Ervin Sejdic.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a xv, 507 p. : $b ill., digital ; $c 24 cm.
490 1 $a Signals and communication technology, $x 1860-4862
505 0 $a Introduction to Graph Signal Processing -- Oversampled Graph Laplacian Matrix for Graph Filter Banks -- Toward an Uncertainty Principle for Weighted Graphs -- Graph Theoretic Uncertainty and Feasibility -- Signal-Adapted Tight Frames on Graphs -- Local Spectral Analysis of the Cerebral Cortex: New Gyrification Indices -- Intrinsic Geometric Information Transfer Learning on Multiple Graph-Structured Datasets.
520 $a This book introduces new methods to analyze vertex-varying graph signals. In many real-world scenarios, the data sensing domain is not a regular grid, but a more complex network that consists of sensing points (vertices) and edges (relating the sensing points) Furthermore, sensing geometry or signal properties define the relation among sensed signal points. Even for the data sensed in the well-defined time or space domain, the introduction of new relationships among the sensing points may produce new insights in the analysis and result in more advanced data processing techniques. The data domain, in these cases and discussed in this book, is defined by a graph. Graphs exploit the fundamental relations among the data points. Processing of signals whose sensing domains are defined by graphs resulted in graph data processing as an emerging field in signal processing. Although signal processing techniques for the analysis of time-varying signals are well established, the corresponding graph signal processing equivalent approaches are still in their infancy. This book presents novel approaches to analyze vertex-varying graph signals. The vertex-frequency analysis methods use the Laplacian or adjacency matrix to establish connections between vertex and spectral (frequency) domain in order to analyze local signal behavior where edge connections are used for graph signal localization. The book applies combined concepts from time-frequency and wavelet analyses of classical signal processing to the analysis of graph signals. Covering analytical tools for vertex-varying applications, this book is of interest to researchers and practitioners in engineering, science, neuroscience, genome processing, just to name a few. It is also a valuable resource for postgraduate students and researchers looking to expand their knowledge of the vertex-frequency analysis theory and its applications. The book consists of 15 chapters contributed by 41 leading researches in the field.
650 0 $a Vertex detectors. $3 3381587
650 0 $a Graph theory. $3 523815
650 0 $a Graph theory $x Data processing. $3 655277
650 0 $a Information measurement. $3 899245
650 1 4 $a Signal, Image and Speech Processing. $3 891073
650 2 4 $a Graph Theory. $3 1567033
650 2 4 $a Applications of Graph Theory and Complex Networks. $3 3134760
650 2 4 $a Neurosciences. $3 588700
700 1 $a Stankovic, Ljubisa. $3 3381586
700 1 $a Sejdic, Ervin. $3 1620558
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Signals and communication technology. $3 1565543
856 4 0 $u https://doi.org/10.1007/978-3-030-03574-7
950 $a Engineering (Springer-11647)