...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Optical Engineering >Metrics of spectral image complexity with application to large area search
【24h】

Metrics of spectral image complexity with application to large area search

机译：Metrics of spectral image complexity with application to large area search

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相关主题

摘要

Spectral image complexity is an ill-defined term that has been addressed previously in terms of dimensionality, multivariate normality, and other approaches. Here, we apply the concept of the linear mixture model to the question of spectral image complexity at spatially local scales. Essentially, the "complexity" of an image region is related to the volume of a convex set enclosing the data in the spectral space. The volume is estimated as a function of increasing dimensionality (through the use of a set of endmembers describing the data cloud) using the Gram Matrix approach. It is hypothesized that more complex regions of the image are composed of multiple, diverse materials and will thus occupy a larger volume in the hyperspace. The ultimate application here is large area image search without a priori information regarding the target signature. Instead, image cues will be provided based on local, relative estimates of the image complexity. The technique used to estimate the spectral image complexity is described and results are shown for representative image chips and a large area flightline of reflective hyperspectral imagery. The extension to the problem of large area search will then be described and results are shown for a 4-band multi-spectral image.

著录项

获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号