Please wait a minute...


Remote Sensing Technology and Application  2018, Vol. 33 Issue (2): 252-258    DOI: 10.11873/j.issn.1004-0323.2018.2.0252
A Kind of Vegetation Cover Fraction Retrieval Algorithm based on  Spectral Normalization Frame
Duan Jinliang,Wang Jie,Zhang Ting
(College of Land and Resources,China West Normal University,Nanchong 637009,China)
Download:  PDF (10289KB) 
Export:  BibTeX | EndNote (RIS)      
Abstract  Vegetation cover fraction is an important control factor in the process of simulating surface vegetation transpiration,soil water evaporation and vegetation photosynthesis.Based on the TM image data of two different types of vegetation cover,a collaborative sparse regression algorithm based on the spectra normalization framework is proposed to retrieve the vegetation cover fraction,which solves the problems such as the error of the endmember variability and the efficient of the algorithm arisen from many spectral mixture analysis algorithms used to retrieving vegetation cover fraction.And also by contrast to the dimidiate pixel algorithm,the accuracy of the algorithm is indicated.The experimental results show that the normalization of the image and endmenbers can effectively reduce their heterogeneity and improve the retrieval precision and the algorithm has higher accuracy than the dimidiate pixel algorithm.
Key words:  Spectrum normalization      Vegetation cover fraction      TM and ALI image      The dimidiate pixel algorithm      Collaborative sparse regression algorithm      Endmember variability
Received:  18 April 2017      Published:  15 May 2018
Fund: 段金亮(1994-),男,四川达州人,学士,主要从事遥感数字图像处理研究。。
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
Articles by authors
Duan Jinliang
Wang Jie
Zhang Ting

Cite this article: 

Duan Jinliang,Wang Jie,Zhang Ting. A Kind of Vegetation Cover Fraction Retrieval Algorithm based on  Spectral Normalization Frame. Remote Sensing Technology and Application, 2018, 33(2): 252-258.

URL:     OR

No Suggested Reading articles found!