NDLI: Downsampling graphs using spectral theory

Content Provider	IEEE Xplore Digital Library
Author	Narang, S.K. Ortega, A.
Copyright Year	2011
Description	Author affiliation: Ming Hsieh Department of Electrical Engineering, University of Southern California, USA (Narang, S.K.; Ortega, A.)
Abstract	In this paper we present methods for downsampling datasets defined on graphs (i.e., graph-signals) by extending downsampling results for traditional N-dimensional signals. In particular, we study the spectral properties of k-regular bipartite graphs (K-RBG) and prove that downsampling in these graphs is governed by a Nyquist-like criteria. The results are useful for designing critically sampled filter-banks in various data-domains where the underlying relations between data locations can be represented by undirected graphs. In order to illustrate our results we represent images as a set of k-RBG graphs and apply our downsampling results to them. The results show that common 2-D lattice downsampling methods can be seen special cases of (k-RBG) based downsampling. Further we demonstrate new downsampling schemes for images with non-rectangular connectivity.
Starting Page	4208
Ending Page	4211
File Size	230165
Page Count	4
File Format	PDF
ISBN	9781457705380
ISSN	15206149
e-ISBN	9781457705397
e-ISBN	9781457705373
DOI	10.1109/ICASSP.2011.5947281
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-05-22
Publisher Place	Czech Republic
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Eigenvalues and eigenfunctions Approximation methods Laplace equations Pixel Diamond-like carbon Bipartite graph Transforms subsampling Nyquist theorem bipartite graphs
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Multi-dimensional separable critically sampled wavelet filterbanks on arbitrary graphs

Chebyshev polynomial approximation for distributed signal processing

Towards a sampling theorem for signals on arbitrary graphs

Wavelet frames on graphs defined by fMRI functional connectivity

A fast spectral cluster algorithm based on bipartite graph

Uncertainty principles for signals defined on graphs: Bounds and characterizations

Coarsening graph signal with spectral invariance

Downsampling of Signals on Graphs Via Maximum Spanning Trees

Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time

Downsampling graphs using spectral theory

Similar Documents

Multi-dimensional separable critically sampled wavelet filterbanks on arbitrary graphs

Chebyshev polynomial approximation for distributed signal processing

Towards a sampling theorem for signals on arbitrary graphs

Wavelet frames on graphs defined by fMRI functional connectivity

A fast spectral cluster algorithm based on bipartite graph

Uncertainty principles for signals defined on graphs: Bounds and characterizations

Coarsening graph signal with spectral invariance

Downsampling of Signals on Graphs Via Maximum Spanning Trees

Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time

Downsampling graphs using spectral theory