Guo Zhenhua, Zhang Zhongcheng, Li Xiu, Li Qin, You Jane
Shenzhen Key Laboratory of Broadband Network & Multimedia, Graduate School at Shenzhen, Tsinghua University, Shenzhen, China.
Graduate School at Shenzhen, Tsinghua University, Shenzhen, China.
PLoS One. 2014 Feb 10;9(2):e88073. doi: 10.1371/journal.pone.0088073. eCollection 2014.
Using statistical textons for texture classification has shown great success recently. The maximal response 8 (Statistical_MR8), image patch (Statistical_Joint) and locally invariant fractal (Statistical_Fractal) are typical statistical texton algorithms and state-of-the-art texture classification methods. However, there are two limitations when using these methods. First, it needs a training stage to build a texton library, thus the recognition accuracy will be highly depended on the training samples; second, during feature extraction, local feature is assigned to a texton by searching for the nearest texton in the whole library, which is time consuming when the library size is big and the dimension of feature is high. To address the above two issues, in this paper, three binary texton counterpart methods were proposed, Binary_MR8, Binary_Joint, and Binary_Fractal. These methods do not require any training step but encode local feature into binary representation directly. The experimental results on the CUReT, UIUC and KTH-TIPS databases show that binary texton could get sound results with fast feature extraction, especially when the image size is not big and the quality of image is not poor.
最近,使用统计纹理基元进行纹理分类已取得了巨大成功。最大响应8(Statistical_MR8)、图像块(Statistical_Joint)和局部不变分形(Statistical_Fractal)是典型的统计纹理基元算法以及当前最先进的纹理分类方法。然而,使用这些方法存在两个局限性。首先,需要一个训练阶段来构建纹理基元库,因此识别准确率将高度依赖于训练样本;其次,在特征提取过程中,通过在整个库中搜索最近的纹理基元将局部特征分配给一个纹理基元,当库规模较大且特征维度较高时,这一过程非常耗时。为了解决上述两个问题,本文提出了三种二元纹理基元对应方法,即Binary_MR8、Binary_Joint和Binary_Fractal。这些方法不需要任何训练步骤,而是直接将局部特征编码为二进制表示。在CUReT、UIUC和KTH-TIPS数据库上的实验结果表明,二元纹理基元能够在快速特征提取的情况下获得良好的结果,尤其是当图像尺寸不大且图像质量不差时。