A subpixel mapping algorithm combining pixel-level and subpixel-level spatial dependences with binary integer programming
Ge Yong
2014
关键词Mapping Algorithms Branch and bound method Conformal mapping Image reconstruction Integer programming Optimization Pixels
英文摘要A new subpixel mapping (SPM) algorithm combining pixel-level and subpixel-level spatial dependences is proposed in this letter. The pixel-level dependence is measured by the spatial attraction model (SAM) with either surrounding or quadrant neighbourhood, while the subpixel-level dependence is characterized by either the mean filter or the exponential weighting function. Both pixel-level and subpixel-level dependences are then fused as the weighted dependence in the constructed objective function. The branch-and-bound algorithm is employed to solve the optimization problem, and thus, obtain the optimal spatial distribution of subpixel classes. An artificial image and a set of real remote sensing images were tested for validation of the proposed method. The results demonstrated that the proposed method can achieve results with greater accuracy than two traditional SPM methods and the mixed SAM method. Meanwhile, the proposed method needs less computation time than the mixed SAM, and hence it provides a new solution to subpixel land cover mapping.
出处Remote Sensing Letters
5期:10页:902-911
收录类别EI
语种英语
内容类型EI期刊论文
源URL[http://ir.igsnrr.ac.cn/handle/311030/31142]  
专题地理科学与资源研究所_历年回溯文献
推荐引用方式
GB/T 7714
Ge Yong. A subpixel mapping algorithm combining pixel-level and subpixel-level spatial dependences with binary integer programming. 2014.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace