The concise and informative representation of hyperspectral imagery is achieved via the introduced diffusion geometric coordinates derived from nonlinear dimension reduction maps - diffusion maps. The huge-volume high...The concise and informative representation of hyperspectral imagery is achieved via the introduced diffusion geometric coordinates derived from nonlinear dimension reduction maps - diffusion maps. The huge-volume high- dimensional spectral measurements are organized by the affinity graph where each node in this graph only connects to its local neighbors and each edge in this graph represents local similarity information. By normalizing the affinity graph appropriately, the diffusion operator of the underlying hyperspectral imagery is well-defined, which means that the Markov random walk can be simulated on the hyperspectral imagery. Therefore, the diffusion geometric coordinates, derived from the eigenfunctions and the associated eigenvalues of the diffusion operator, can capture the intrinsic geometric information of the hyperspectral imagery well, which gives more enhanced representation results than traditional linear methods, such as principal component analysis based methods. For large-scale full scene hyperspectral imagery, by exploiting the backbone approach, the computation complexity and the memory requirements are acceptable. Experiments also show that selecting suitable symmetrization normalization techniques while forming the diffusion operator is important to hyperspectral imagery representation.展开更多
基金The National Key Technologies R & D Program during the 11th Five-Year Plan Period (No.2006BAB15B01)
文摘The concise and informative representation of hyperspectral imagery is achieved via the introduced diffusion geometric coordinates derived from nonlinear dimension reduction maps - diffusion maps. The huge-volume high- dimensional spectral measurements are organized by the affinity graph where each node in this graph only connects to its local neighbors and each edge in this graph represents local similarity information. By normalizing the affinity graph appropriately, the diffusion operator of the underlying hyperspectral imagery is well-defined, which means that the Markov random walk can be simulated on the hyperspectral imagery. Therefore, the diffusion geometric coordinates, derived from the eigenfunctions and the associated eigenvalues of the diffusion operator, can capture the intrinsic geometric information of the hyperspectral imagery well, which gives more enhanced representation results than traditional linear methods, such as principal component analysis based methods. For large-scale full scene hyperspectral imagery, by exploiting the backbone approach, the computation complexity and the memory requirements are acceptable. Experiments also show that selecting suitable symmetrization normalization techniques while forming the diffusion operator is important to hyperspectral imagery representation.
