首页> 外文期刊>Journal of electronic imaging >Perceptually relevant grouping of image tokens on the basis of constraint propagation from local binary patterns
【24h】

Perceptually relevant grouping of image tokens on the basis of constraint propagation from local binary patterns

机译:基于局部二进制模式的约束传播,图像令牌在感知上相关的分组

获取原文
获取原文并翻译 | 示例
           

摘要

Grouping image tokens is an intermediate step needed to arrive at meaningful image representation and summarization. Usually, perceptual cues, for instance, gestalt properties inform token grouping. However, they do not take into account structural continuities that could be derived from other tokens belonging to similar structures irrespective of their location. We propose an image representation that encodes structural constraints emerging from local binary patterns (LBP), which provides a long-distance measure of similarity but in a structurally connected way. Our representation provides a grouping of pixels or larger image tokens that is free of numeric similarity measures and could therefore be extended to nonmetric spaces. The representation lends itself nicely to ubiquitous image processing applications such as connected component labeling and segmentation. We test our proposed representation on the perceptual grouping or segmentation task on the popular Berkeley segmentation dataset (BSD500) that with respect to human segmented images achieves an average F-measure of 0.559. Our algorithm achieves a high average recall of 0.787 and is therefore well-suited to other applications such as object retrieval and category-independent object recognition. The proposed merging heuristic based on levels of singular tree component has shown promising results on the BSD500 dataset and currently ranks 12th among all benchmarked algorithms, but contrary to the others, it requires no data-driven training or specialized preprocessing. (C) 2016 SPIE and IS& T
机译:对图像令牌进行分组是实现有意义的图像表示和汇总所需的中间步骤。通常,感知提示(例如,格式塔属性)会通知令牌分组。但是,它们没有考虑可能从属于类似结构的其他标记派生的结构连续性,而与它们的位置无关。我们提出了一种图像表示形式,该图像表示形式对从本地二进制模式(LBP)出现的结构约束进行编码,该结构约束提供了一种相似性的长距离度量,但以结构上相连的方式。我们的表示提供了一组像素或更大的图像标记,这些标记没有数字相似性度量,因此可以扩展到非度量空间。该表示非常适合于无处不在的图像处理应用程序,例如连接的组件标记和分段。我们在流行的伯克利分割数据集(BSD500)上对感知分组或分割任务的拟议表示法进行了测试,该数据集相对于人类分割图像的平均F值达到0.559。我们的算法实现了0.787的高平均召回率,因此非常适合其他应用程序,例如对象检索和与类别无关的对象识别。提出的基于奇异树成分级别的合并启发式方法已在BSD500数据集上显示出令人鼓舞的结果,目前在所有基准测试算法中排名第12位,但与其他算法相反,它不需要数据驱动的训练或专门的预处理。 (C)2016 SPIE和IS&T

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号