The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Perfect Reconstruction Two-Channel Wavelet Filter Banks for Graph Structured Data
Open accessAbstract
In this work, we propose the construction of two-channel wavelet filter banks for analyzing functions defined on the vertices of any arbitrary finite weighted undirected graph. These graph based functions are referred to as graph-signals as we build a framework in which many concepts from the classical signal processing domain, such as Fourier decomposition, signal filtering and downsampling can be extended to graph domain. Especially, we observe a spectral folding phenomenon in bipartite graphs which occurs during downsampling of these graphs and produces aliasing in graph signals. This property of bipartite graphs, allows us to design critically sampled two-channel filter banks, and we propose quadrature mirror filters (referred to as graph-QMF) for bipartite graph which cancel aliasing and lead to perfect reconstruction. For arbitrary graphs we present a bipartite subgraph decomposition which produces an edge-disjoint collection of bipartite subgraphs. Graph-QMFs are then constructed on each bipartite subgraph leading to “multi-dimensional” separable wavelet filter banks on graphs. Our proposed filter banks are critically sampled and we state necessary and sufficient conditions for orthogonality, aliasing cancellation and perfect reconstruction. The filter banks are realized by Chebychev polynomial approximations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Community structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502
A tutorial on spectral clustering
von Luxburg, U. (2007) · Statistics and Computing · doi:10.1007/s11222-007-9033-z · Cited by 10,349
A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms
Scharstein, D., & Szeliski, R. (2002) · International Journal of Computer Vision · doi:10.1023/a:1014573219977 · Cited by 6,740
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Vetterli, M., & Kovačević, J. (1995) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 2,898
Wavelets on graphs via spectral graph theory
Hammond, D. K., Vandergheynst, P., & Gribonval, R. (2011) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2010.04.005 · Cited by 2,171
A taxonomy and evaluation of dense two-frame stereo correspondence algorithms
Scharstein, D., Szeliski, R., & Zabih, R. (2002) · Proceedings IEEE Workshop on Stereo and Multi-Baseline Vision (SMBV 2001) · doi:10.1109/smbv.2001.988771 · Cited by 1,084
A filter family designed for use in quadrature mirror filter banks
Johnston, J. (2005) · ICASSP '80. IEEE International Conference on Acoustics, Speech, and Signal Processing · doi:10.1109/icassp.1980.1171025 · Cited by 671
Coifman, R. R., & Maggioni, M. (2006) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2006.04.004 · Cited by 491
Graph wavelets for spatial traffic analysis
Crovella, M., & Kolaczyk, E. (2004) · IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428) · doi:10.1109/infcom.2003.1209207 · Cited by 201
Cited by
Shuman, D. I., Narang, S. K., Frossard, P., Ortega, A., & Vandergheynst, P. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2235192 · Cited by 4,421
Self-citationDiscrete Signal Processing on Graphs
Sandryhaila, A., & Moura, J. M. F. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2238935 · Cited by 1,531
Discrete Signal Processing on Graphs: Frequency Analysis
Sandryhaila, A., & Moura, J. M. F. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2321121 · Cited by 879
Sandryhaila, A., & Moura, J. M. F. (2014) · IEEE Signal Processing Magazine · doi:10.1109/msp.2014.2329213 · Cited by 779
Discrete Signal Processing on Graphs: Sampling Theory
Chen, S., Varma, R., Sandryhaila, A., & Kovacevic, J. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2469645 · Cited by 666
Metadata
- Authors
- Narang, S. K., & Ortega, A.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2012-06
- Volume
- 60
- Issue
- 6
- Pages
- 2786-2799
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2004559848
- Cited by
- 387
- References
- 18
- FWCI
- 47.22
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Perfect Reconstruction Two-Channel Wavelet Filter Banks for Graph Structured Data. https://app.cochat.ai/papers/10.1109/tsp.2012.2188718
- The paper
- Narang, S. K., & Ortega, A. (2012). Perfect Reconstruction Two-Channel Wavelet Filter Banks for Graph Structured Data. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2012.2188718
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.