Local tetra patterns: a new feature descriptor for content-based image retrieval

In this paper, we propose a novel image indexing and retrieval algorithm using local tetra patterns (LTrPs) for content-based image retrieval (CBIR). The standard local binary pattern (LBP) and local ternary pattern (LTP) encode the relationship between the referenced pixel and its surrounding neighbors by computing gray-level difference. The proposed method encodes the relationship between the referenced pixel and its neighbors, based on the directions that are calculated using the first-order derivatives in vertical and horizontal directions. In addition, we propose a generic strategy to compute nth-order LTrP using (n - 1)th-order horizontal and vertical derivatives for efficient CBIR and analyze the effectiveness of our proposed algorithm by combining it with the Gabor transform. The performance of the proposed method is compared with the LBP, the local derivative patterns, and the LTP based on the results obtained using benchmark image databases viz., Corel 1000 database (DB1), Brodatz texture database (DB2), and MIT VisTex database (DB3). Performance analysis shows that the proposed method improves the retrieval result from 70.34%/44.9% to 75.9%/48.7% in terms of average precision/average recall on database DB1, and from 79.97% to 85.30% and 82.23% to 90.02% in terms of average retrieval rate on databases DB2 and DB3, respectively, as compared with the standard LBP.     

Expert content-based image retrieval system using robust local patterns

A new image indexing and retrieval algorithm for content based image retrieval is proposed in this paper. The local region of the image is represented by making the use of local difference operator (LDO), separating it into two components i.e. sign and magnitude. The sign LBP operator (S_LBP) is a generalized LBP operator. The magnitude LBP (M_LBP) operator is calculated using the magnitude of LDO. A robust LBP (RLBP) operator is presented employing robust S_LBP and robust M_LBP. Further, the combination of Gabor transform and RLBP operator has also been presented. The robustness is established by conducting four experiments on different image database i.e. Corel 1000 (DB1), Brodatz texture database (DB2) and MIT VisTex database (DB3) under different lighting (illumination) and noise conditions. Investigations reveal a promising achievement of the technique presented when compared to S_LBP and other existing transform domain techniques in terms of their evaluation measures.     

A novel local octa-pattern feature descriptor for image retrieval

The local tetra patterns (LTrPs) gives four-directional information and ignores the diagonal pixel information, thereby affecting the retrieved image efficiency. In the present work, a novel retrieval approach has been proposed using local octa-patterns (LOcPs) for content-based image indexing and retrieval. The proposed approach encodes the center pixel directional information with its eight adjacent neighbors, from the directions that are computed using the first-order derivatives. Also the nth-order LOcP is computed using \((n-1)\)th-order local direction variations. In addition, the performance of the developed method by combining it with the Gabor transform has been analyzed. The performance of the proposed technique has been compared to existing techniques like LBP, LTP, LDP, and LTrP on Corel-1000 database (DB1) and Describable Textures Dataset (DB2). The performance observed shows that the developed method improves the retrieval parameters from 75.9%/77.13% to 79.4%/81.5% in the form of average precision on DB1/DB2 databases.     

基于特征融合的粒子滤波目标跟踪新方法

针对传统粒子滤波(PF)算法采用单一颜色特征建模 跟踪目标性能差的缺陷,提出一种颜色特征与纹理特 征相融合的PF目标跟踪新算法。首先,采用一种具有抗噪声和保护纹理边缘的全局中值二值 模式 (GMBP)纹理算子,对模板图像进行局部差绝对值处理,得到幅 值序列模板,将幅值序列模板内的中值作为模板的阈值,与模板邻域比较获得新的纹理图像 ;然后,与 具有光照不变特性的局部二值模式(LBP)纹理算子结合,形成一种(GMLBP)新的纹理描述算子 。最后,分别计算GMLBP纹理特征粒子权值和HSV颜色特征粒子权 值,并依据权值大小确定融合系数,对纹理特征粒子权值和颜色特征粒子权值进行线 性融合,再对融合后粒子权值进行归一化处理,从而得到目标位置状态的最终估计值。对比 实验结果表明, 相对于单一颜色特征的目标跟踪算法,所提算法捕捉目标位置准确且具有更低的平均跟踪误 差,其平均误差降低了近2倍。     

基于区域最大相似度的快速图像分割算法

针对基于区域最大相似度图像分割(MSRM)算法中利 用颜色直方图描述符计算相邻区域之间相似度存 在着计算量大和描述能力的不足,提出改用基于局部二值模式(LBP)纹理描述符计 算相邻区域相似度的改进MSRM(IMSRM)算法。LBP描述符通过对像素点之间局 部微结构进行编码实 现了对其空间关系的描述,有效提高了对区域特征的描述能力,并且所获得的特征矢量维数 远小于颜色直 方图,区域之间的相似度计算效率大幅度得到提高。与MSRM算法对比实验表明,IMSRM算法 可以从各种复杂背景中有效提取待分割对象的轮廓,所提取的轮廓边缘细节上更优,算法执 行效率能够提高50%左右。     

基于多条件随机场模型的图像3D空间布局理解

图像3D空间布局理解在自动驾驶系统以及目标识别中扮演着重要的角色.本文提出一种基于多条件随机场模型集成的图像3D空间布局理解算法.首先,基于多次图像分割生成多个不同尺度的超像素图像;然后,结合LBP表面纹理特征、LM滤波器组获得的方向纹理特征、颜色特征以及图像中超像素的位置和形状特征,建立各尺度的超像素图像中超像素的特征表达;最后,为各尺度的超像素图像分别构建相应的条件随机场模型,并应用D-S证据合成理论对多个条件随机场模型的推断结果进行集成,实现对图像3D空间布局的理解.在公共数据集GC和KITTI Layout上的实验结果表明,同已有算法相比,本文提出的算法提高了图像3D空间布局理解的准确率.     

基于仿射变换模型的图像跟踪系统的实现

文中设计研制了一种新型的基于仿射变换模型的实时图像跟踪系统。本跟踪系统已经通过实践检验,能够稳定的、准确的、快速的跟踪目标。并且系统有很大的升级潜力,除了能够满足仿射变换跟踪的要求之外,还能适用于其他的一些算法,构成鲁棒性更强的图像跟踪系统。实践证明该跟踪系统性能优于经典的相关跟踪系统。     

Texture representation and retrieval using the causal autoregressive model

In this paper we propose to revisit the well-known autoregressive model (AR) as a texture representation model. We consider the AR model with causal neighborhoods. First, we will define the AR model and discuss briefly the parameters estimation process. Then, we will present the synthesis algorithm and we will show some experimental results. A perceptual interpretation of the AR estimated parameters will be then proposed and discussed. In particular, a computational measure to estimate the degree of randomness/regularity of textures is proposed. The set of the estimated parameters will be then applied in content-based image retrieval (CBIR) to model texture content and experimental results are shown. Benchmarking, using the precision/recall measures conducted on the well-known Brodatz database, shows interesting results.     

Integration of wavelet transform,Local Binary Patterns and moments for content-based image retrieval

The proliferation of large number of images has made it necessary to develop systems for indexing and organizing images for easy access. This has made Content-Based Image Retrieval (CBIR) an important area of research in Computer Vision. This paper proposes a combination of features in multiresolution analysis framework for image retrieval. In this work, the concept of multiresolution analysis has been exploited through the use of wavelet transform. This paper combines Local Binary Pattern (LBP) with Legendre Moments at multiple resolutions of wavelet decomposition of image. First, LBP codes of Discrete Wavelet Transform (DWT) coefficients of images are computed to extract texture feature from image. The Legendre Moments of these LBP codes are then computed to extract shape feature from texture feature for constructing feature vectors. These feature vectors are used to search and retrieve visually similar images from large database. The proposed method has been tested on five benchmark datasets, namely, Corel-1K, Olivia-2688, Corel-5K, Corel-10K, and GHIM-10K, and performance of the proposed method has been measured in terms of precision and recall. The experimental results demonstrate that the proposed method outperforms some of the other state-of-the-art methods in terms of precision and recall.     

基于局部结构变换域稀疏外观模型的目标跟踪

[目的]为了降低稀疏表示目标跟踪算法的计算复杂度,[方法]在粒子滤波框架下提出了基于局部结构变换域稀疏外观模型的视觉目标跟踪算法.[结果]该算法在目标区域附近提取重叠的局部图像块,并计算出所有局部图像块的二维离散余弦变换,获得图像块的变换域系数.变换域的能量集中特性被采用来降低字典的维度与候选样本的数量,并且对系数压缩一定的自由度可以抑制噪声与遮挡影响.采用被裁剪的样本与字典获得局部图像块的稀疏编码,然后将当前目标区域中所有小图像块的稀疏向量加权融合得到目标区域的稀疏表示值,并通过决策模型获取最优跟踪结果.与现有三种最新的跟踪算法比较的实验结果表明,[结论]所提算法的跟踪性能接近或超过对比算法,同时大大减小了f1范数最小化的计算复杂度.     

Efficient Cloud Image Retrieval System Using Weighted-Inverted Index and Database Filtering Algorithms

With the advance of multimedia technology and communications, images and videos become the major streaming information through the Internet. How to fast retrieve desired similar images precisely from the Internet scale image/video databases is the most important retrieval control target. In this paper, a cloud based content-based image retrieval (CBIR) scheme is presented. Database-categorizing based on weighted-inverted index (DCWⅡ) and database filtering algorithm (DFA) is used to speed up the features matching process. In the DCWⅡ, the weights are assigned to discrete cosine transform (DCT) coefficients histograms and the database is categorized by weighted features. In addition, the DFA filters out the irrelevant image in the database to reduce unnecessary computation loading for features matching. Experiments show that the proposed CBIR scheme outperforms previous work in the precision-recall performance and maintains mean average precision (mAP) about 0.678 in the large-scale database comprising one million images. Our scheme also can reduce about 50% to 85% retrieval time by pre-filtering the database, which helps to improve the efficiency of retrieval systems.     

基于局部二进制模式和图变换的快速匹配算法

针对图像匹配在图像拼接、目标识别等领域的应用中尺度不变特征变换（Scale Invariant Feature Transform,SIFT）算法计算复杂度高、实时性较差的问题,提出了一种基于局部二进制模式（Local Binary Patterns,LBP）和图变换（Graph Transformation Matching,GTM）的匹配算法.首先采用SIFT特征检测提取特征点并以特征点为中心取13×13的图像块作为特征区域;然后用本文提出的局部旋转不变二进制模式（Local Rotation Invariant Binary Patterns,LRIBP）描述子对特征区域进行描述产生29维的特征描述向量,降低了描述子的复杂度,并以欧氏距离为度量准则进行初始匹配;最后采用图变换匹配算法剔除误匹配点,从而提高算法的运算速率和匹配精度.仿真结果表明,本文所提算法不仅具有较高的精度和较强的鲁棒性,并且减少了算法的运算量,提高了算法的实时性.     

一种新的多尺度旋转不变性纹理特征提取方法

提出一种基于局部Walsh谱(LWS)的多尺度旋转不变性纹理特征提取方法。首先通过比较每个像素点与邻近点的灰度值生成局部二值序列,然后计算局部二值序列的离散Walsh-Hadamard变换(DWT)的功率谱,最后采用功率谱的各谱点值构成特征直方图描述纹理特征。通过选择不同半径和采样点的局部二值序列可以得到不同尺度下的纹理特征,利用DWT功率谱的循环移位不变性可实现纹理特征的旋转不变性。纹理分类实验结果表明:与灰度共生矩阵(GLCM)、Gabor滤波器组等纹理特征相比,LWS在纹理鉴别能力和计算时间上具有较明显优势;与局部二值模式(LBP)相比,LWS在纹理分类准确率和旋转不变性方面均优于LBD。     

MRI and CT image indexing and retrieval using local mesh peak valley edge patterns

In this paper, a new pattern based feature, local mesh peak valley edge pattern (LMePVEP) is proposed for biomedical image indexing and retrieval. The standard LBP extracts the gray scale relationship between the center pixel and its surrounding neighbors in an image. Whereas the proposed method extracts the gray scale relationship among the neighbors for a given center pixel in an image. The relations among the neighbors are peak/valley edges which are obtained by performing the first-order derivative. The performance of the proposed method (LMePVEP) is tested by conducting two experiments on two benchmark biomedical databases. Further, it is mentioned that the databases used for experiments are OASIS−MRI database which is the magnetic resonance imaging (MRI) database and VIA/I–ELCAP-CT database which includes region of interest computer tomography (CT) images. The results after being investigated show a significant improvement in terms average retrieval precision (ARP) and average retrieval rate (ARR) as compared to LBP and LBP variant features.     

基于金字塔分解和扇形局部均值二值模式的鲁棒纹理分类方法

针对传统局部二值模式(LBP)的特征鉴别力有限和噪声敏感性问题,该文提出一种基于金字塔分解和扇形局部均值二值模式的纹理特征提取方法。首先,将原始图像进行金字塔分解,得到对应于不同分解级别的低频和高频(差分)图像。为提取兼具鉴别力和稳健性的特征,进一步采用阈值化处理技术将高频图像转化为正、负高频图。然后,基于局部均值操作提出一种扇形局部均值二值模式(SLMBP),用于计算各级分解图像的纹理特征码。最后,对纹理特征码进行跨频带的联合编码和跨级别的直方图加权,从而获得最终的纹理特征。在公开的3个纹理数据库(Outex, Brodatz和UIUC)上进行分类实验,结果表明该文所提方法能够有效地提高纹理图像在无噪声环境和含高斯噪声环境下的分类精度。     

针对MME的JPEG图像隐写分析方法研究

MME（Modified Matrix Encoding）作为一种新兴的JPEG图像隐写技术,具有隐写量大、对图片的改动小、抗检测性优于传统隐写算法等优点。文中在采用Markov特征的基础上,加入了能够更好描述图像局部纹理的局部二值模式（LBP）与局部顺序对比模式（LOCP）特征,并应用Ensemble分类器完成分类和识别。通过对UCID图像库的大量实验,得到了一种针对MME算法的最优特征组合。相比传统的隐写分析方法,文中所提出的方法具有更好的检测正确率。     

CLUE: cluster-based retrieval of images by unsupervised learning.

In a typical content-based image retrieval (CBIR) system, target images (images in the database) are sorted by feature similarities with respect to the query. Similarities among target images are usually ignored. This paper introduces a new technique, cluster-based retrieval of images by unsupervised learning (CLUE), for improving user interaction with image retrieval systems by fully exploiting the similarity information. CLUE retrieves image clusters by applying a graph-theoretic clustering algorithm to a collection of images in the vicinity of the query. Clustering in CLUE is dynamic. In particular, clusters formed depend on which images are retrieved in response to the query. CLUE can be combined with any real-valued symmetric similarity measure (metric or nonmetric). Thus, it may be embedded in many current CBIR systems, including relevance feedback systems. The performance of an experimental image retrieval system using CLUE is evaluated on a database of around 60,000 images from COREL. Empirical results demonstrate improved performance compared with a CBIR system using the same image similarity measure. In addition, results on images returned by Google's Image Search reveal the potential of applying CLUE to real-world image data and integrating CLUE as a part of the interface for keyword-based image retrieval systems.