首页> 外文期刊>International journal of image and data fusion >Hierarchical data representation structures for interactive image information mining
【24h】

Hierarchical data representation structures for interactive image information mining

机译:交互式图像信息挖掘的分层数据表示结构

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

In this article an interactive image information mining protocol is presented aiming at a computationally efficient pattern interpretation. The method operates on very high resolution (VHR) remote-sensing optical imagery and follows a modular approach. Images are projected onto a hierarchical image representation structure, the Max-Tree, which interfaces multi-dimensional features of the image components. Positive and negative samples are selected interactively from the image space and are translated into features describing best the targeted and non-desired patterns. Sourcing the feature entries into a hierarchical clustering algorithm, the kd-Tree, yields a structured representation that ensures fast classification. A classification is computed directly from the kd-Tree and is applied on the Max-Tree for accepting or rejecting image components. The complete process cycle is demonstrated on gigapixel-sized VHR satellite images and requires 3 min for building the Max-Tree, 30 min for hierarchical clustering and less than 10 s for each example based query.
机译:在本文中,提出了一种交互式图像信息挖掘协议,旨在实现计算有效的模式解释。该方法在超高分辨率(VHR)遥感光学图像上运行,并遵循模块化方法。图像被投影到分层图像表示结构Max-Tree上,该结构与图像组件的多维特征相接。从图像空间以交互方式选择正样本和负样本,并将其转换为最能描述目标和非期望模式的特征。将特征条目输入到分层聚类算法kd-Tree中,可以生成确保快速分类的结构化表示。直接从kd-Tree计算分类,并将其应用于Max-Tree,以接受或拒绝图像分量。完整的过程周期在千兆像素大小的VHR卫星图像上进行了演示,并且需要3分钟来构建Max-Tree,30分钟用于层次聚类,并且每个基于示例的查询需要不到10 s。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号