17 citations · 19 across the 18 of their papers we have counts for
6 papers · 1 filter
Multiscale Graph Construction Using Non-local Cluster Features
Reina Kaneko, Hayate Kojima, Kenta Yanagiya +3
This paper presents a multiscale graph construction method using both graph and signal features. Multiscale graph is a hierarchical representation of the graph, where a node at eac…
Time-Varying Graph Signal Estimation among Multiple Sub-Networks
Tsutahiro Fukuhara, Junya Hara, Hiroshi Higashi +1
This paper presents an estimation method for time-varying graph signals among multiple sub-networks. In many sensor networks, signals observed are associated with nodes (i.e., sens…
Efficient Learning of Balanced Signed Graphs via Iterative Linear Programming
Haruki Yokota, Hiroshi Higashi, Yuichi Tanaka +1
Signed graphs are equipped with both positive and negative edge weights, encoding pairwise correlations as well as anti-correlations in data. A balanced signed graph has no cycles…
PHISWID: Physics-Inspired Underwater Image Dataset Synthesized from RGB-D Images
Reina Kaneko, Takumi Ueda, Hiroshi Higashi +1
This paper introduces the physics-inspired synthesized underwater image dataset (PHISWID), a dataset tailored for enhancing underwater image processing through physics-inspired ima…
Lossy Compression of Adjacency Matrices by Graph Filter Banks
Kenta Yanagiya, Junya Hara, Hiroshi Higashi +2
This paper proposes a compression framework for adjacency matrices of weighted graphs based on graph filter banks. Adjacency matrices are widely used mathematical representations o…
Optimizing in NN Graphs with Graph Learning Perspective
Asuka Tamaru, Junya Hara, Hiroshi Higashi +2
In this paper, we propose a method, based on graph signal processing, to optimize the choice of in -nearest neighbor graphs (NNGs). NN is one of the most popular appro…