| Presentation | 2023-08-08 Lossy Compression of Adjacency Matrices by Graph Filter Banks Kenta Yanagiya, Junya Hara, Hiroshi Higashi, Yuichi Tanaka, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In this paper, we propose a compression framework for adjacency matrices of weighted graphs by graph filter banks. Adjacency matrices are a widely-used mathematical expression of graphs, i.e., networks, and are used in various applications in signal processing, machine learning, and data mining. Since they may be large for big data analysis, their efficient compression is crucial. In this paper, we propose a lossy compression of weighted adjacency matrices. In our method, the binary adjacent information and edge weights of the graph are compressed losslessly and lossily, respectively. This preserves the topological information of the graph． For the edge weight compression, we convert a given graph into a line graph where its nodes correspond to the edges of the original graph, and the original edge weights are regarded as a graph signal on the line graph. We then transform the edge weights on the line graph with a graph filter bank for sparse representation. Experiments on synthetic data validate the effectiveness of the proposed method by comparing it with existing lossy matrix compression methods. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Graph signal processing / Graph fliter banks / Line graph / Matrix compression |
| Paper # | SIP2023-57 |
| Date of Issue | 2023-07-31 (SIP) |
| Conference Information | |
| Committee | SIP |
|---|---|
| Conference Date | 2023/8/7(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Osaka Univ. (Suita) Convention Center |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | Signal processing, etc. |
| Chair | Takayuki Nakachi(Ryukyu Univ.) |
| Vice Chair | Koichi Ichige(Yokohama National Univ.) / Kiyoshi Nishikawa(okyo Metropolitan Univ.) |
| Secretary | Koichi Ichige(Chiba Univ.) / Kiyoshi Nishikawa(Kogakuin Univ.) |
| Assistant | Taichi Yoshida(UEC) / Sayaka Shiota(Tokyo Metropolitan Univ.) |
| Paper Information | |
| Registration To | Technical Committee on Signal Processing |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Lossy Compression of Adjacency Matrices by Graph Filter Banks |
| Sub Title (in English) | |
| Keyword(1) | Graph signal processing |
| Keyword(2) | Graph fliter banks |
| Keyword(3) | Line graph |
| Keyword(4) | Matrix compression |
| 1st Author's Name | Kenta Yanagiya |
| 1st Author's Affiliation | Osaka University(Osaka Univ.) |
| 2nd Author's Name | Junya Hara |
| 2nd Author's Affiliation | Osaka University(Osaka Univ.) |
| 3rd Author's Name | Hiroshi Higashi |
| 3rd Author's Affiliation | Osaka University(Osaka Univ.) |
| 4th Author's Name | Yuichi Tanaka |
| 4th Author's Affiliation | Osaka University(Osaka Univ.) |
| Date | 2023-08-08 |
| Paper # | SIP2023-57 |
| Volume (vol) | vol.123 |
| Number (no) | SIP-152 |
| Page | pp.pp.49-54(SIP), |
| #Pages | 6 |
| Date of Issue | 2023-07-31 (SIP) |