Perfect reconstruction two-channel wavelet filter banks for graph structured data

IEEE Transactions on Signal Processing

Volumn 60, Issue 6, 2012, Pages 2786-2799

  Narang, Sunil K ^a   Ortega, Antonio ^a  

^a University of Southern California ^*  (United States)

Author keywords

Bipartite subgraph decompositions; Network theory (graphs); Sampling in graphs; Wavelet filterbanks on graphs

Indexed keywords

ALIASING; ARBITRARY GRAPHS; BIPARTITE GRAPHS; BIPARTITE SUBGRAPHS; DOWNSAMPLING; FOURIER DECOMPOSITION; GRAPH STRUCTURED DATA; GRAPH-BASED; ORTHOGONALITY; PERFECT RECONSTRUCTION; SIGNAL FILTERING; SUBGRAPHS; SUFFICIENT CONDITIONS; TWO-CHANNEL; TWO-CHANNEL FILTER BANKS; WAVELET FILTERBANKS; WEIGHTED UNDIRECTED GRAPH;

GRAPH THEORY; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION; WAVELET DECOMPOSITION;

FILTER BANKS;

EID: 84861117945     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2012.2188718     Document Type: Article

References (22)

1. M.Weber and S. Kube, "Robust Perron cluster analysis for various applications in computational life science," CompLife, pp. 57-66, 2005.
2. M. Crovella and E. Kolaczyk, "Graph wavelets for spatial traffic analysis," Proc. INFOCOM, vol. 3, pp. 1848-1857, Mar. 2003.
3. M. Girvan and M. E. Newman, "Community structure in social and biological networks," Proc. Natl. Acad. Sci. USA, vol. 99, no. 12, pp. 7821-7826, Jun. 2002.
4. G. Shen and A. Ortega, "Optimized distributed 2D transforms for irregularly sampled sensor network grids using wavelet lifting," Proc. Int. Conf. Acoust., Speech, Signal Process (ICASSP), pp. 2513-2516, Apr. 2008.
5. W. Wang and K. Ramchandran, "Random multiresolution representations for arbitrary sensor network graphs," Proc. Int. Conf. Acoust., Speech, Signal Process. (ICASSP), vol. 4, p. IV,May 2006.
6. M. Vetterli and J. Kovacevic, Wavelets and Subband Coding. Englewood Cliffs, NJ: Prentice-Hall, 1995.
7. R. Coifman and M. Maggioni, "Diffusion wavelets," Appl. Comput. Harmon. Anal., vol. 21, pp. 53-94, 2006.
8. D. K. Hammond, P. Vandergheynst, and R. Gribonval, "Wavelets on graphs via spectral graph theory," Appl. Comput. Harmon. Anal., vol. 30, no. 2, pp. 129-150, Mar. 2011.
9. R. Wagner, R. Baraniuk, S. Du, D. B. Johnson, and A. Cohen, "An architecture for distributed wavelet analysis and processing in sensor networks," in Proc. Inf. Process. Sensor Netw. (IPSN), Apr. 2006, pp. 243-250.
10. M. Jansen, G. P. Nason, and B.W. Silverman, "Multiscale methods for data on graphs and irregular multidimensional situations," J. Roy. Stat. Soc., vol. 71, no. 1, pp. 97-125, 2009.
11. G. Shen and A. Ortega, "Transform-based distributed data gathering," IEEE Trans. Signal Process., vol. 58, no. 7, pp. 3802-3815, Jul. 2010.
12. S. K. Narang and A. Ortega, "Lifting based wavelet transforms on graphs," in Proc. Asia-Pacific Signal Inf. Process. Assoc. (APSIPA ASC), Sapporo, Japan, Oct. 2009, pp. 441-444.
13. S. K. Narang and A. Ortega, "Downsampling graphs using spectral theory," Proc. Int. Conf. Acoust., Speech, Signal Process. (ICASSP), May 2011.
14. Fan and R. K. Chung, Spectral Graph Theory (CBMS Regional Conf. Series in Math., No. 92). Providence, RI: Amer. Math. Soc., 1997.
15. U. Luxburg, "A tutorial on spectral clustering," Stat. Comput., vol. 17, no. 4, pp. 395-416, 2007.
16. E. B.Davies,G.M. L.Gladwell, J. Leydold, and P. F. Stadler, "Discrete nodal domain theorems," Linear Algebra Appl., vol. 336, no. 1-3, pp. 51-60, 2001.
17. S. K. Narang and A. Ortega, "Local two-channel critically-sampled filter-banks on graphs," Proc. Inf. Conf. Image Process. (ICIP), pp. 333-336, Sep. 2010.
18. F. Harary, D. Hsu, and Z.Miller, "The biparticity of a graph," J. Graph Theory, vol. 1, no. 2, pp. 131-133, 1977.
19. W. Klotz, "Graph coloring algorithms," Mathematik-Bericht, vol. 5, pp. 1-9, 2002.
20. G. Shen, W. S. Kim, S. K. Narang, A. Ortega, J. Lee, and H. C. Wey, "Edge-adaptive transforms for efficient depth map coding," in Proc. Picture Coding Symp. (PCS), Dec. 2010.
21. E. Martínez-Enríquez, F. Dílaz de María, and A. Ortega, "Video encoder based on lifting transforms on graphs," in Proc. ICIP, 2011, pp. 3509-3512.
22. D. Scharstein and R. Szeliski, "A taxonomy and evaluation of dense two-frame stereo correspondence algorithms," Int. J. Comput. Vis., vol. 47, pp. 7-42, Apr. 2002.