We propose a new point of view in the study Fourier analysis on graphs, taking advantage localization domain. For signal f vertices weighted graph G with Laplacian matrix L, standard relies functions g(L)f for some filters g IL, smallest interval containing spectrum sp(L)⊂IL. show that carefully chosen partitions IL=⊔1≤k≤KIk (Ik⊂IL), there are many advantages understanding collection (g(LIk)f)1...