Frequency layered color indexing for content-based image retrieval

Image patches of different spatial frequencies are likely to have different perceptual significance as well as reflect different physical properties. Incorporating such concept is helpful to the development of more effective image retrieval techniques. We introduce a method which separates an image into layers, each of which retains only pixels in areas with similar spatial frequency characteristics and uses simple low-level features to index the layers individually. The scheme associates indexing features with perceptual and physical significance thus implicitly incorporating high level knowledge into low level features. We present a computationally efficient implementation of the method, which enhances the power and at the same time retains the simplicity and elegance of basic color indexing. Experimental results are presented to demonstrate the effectiveness of the method.     

SS*:一种嵌入视觉特性的多维图像索引算法

图像检索因信息量巨大，查询速度至关重要。一种有效的方法是对图像特征进行多维索引，然后按多维索引算法检索。但是，现有的多维索引算法并不是专门针对图像数据库设计的，没有考虑图像的视觉特性，检索性能不理想。文章针对图像信息的特点，结合SS多维索引算法，设计了一种新的基于内容的图像检索的多维索引算法——SS^*算法。实验表明，该算法对图像检索是有效的。     

基于中心矩特征的雷达HRRP自动目标识别

针对雷达高分辨距离像(HRRP)的方位敏感性和平移敏感性，对一定角域内的HRRP非相干平均，提取具有平移不变性的中心矩作为特征向量，采用Karhunen-Loeve变换进一步进行特征压缩，建立相应的支撑矢量机（SVM）分类算法，与基于原始距离像特征的最大似然(ML)方法和基于中心矩特征的ML方法识别结果比较，该方法在减少计算量的同时具有较高的识别率，具有良好的推广能力。     

基于局部频率特征和局部方向特征的虹膜识别算法

描述了一种不同于现有方法的新颖虹膜识别算法,利用多尺度多方向的二维奇对称Gabor滤波器,同时提取虹膜纹理的局部频率特征和局部方向特征.这种方法更全面的描述了虹膜纹理的特征空间,克服了之前的虹膜识别算法只提取局部频率特征或者只提取局部方向特征的局限性.特征匹配采用类似加权市街距离的方法来进行,而且根据眼睑和睫毛的分布特点设计匹配模板,能够最大限度的减少它们对匹配的干扰.与Daugman算法进行对比的实验数据表明,本算法具有非常优越的识别性能.     

基于Gabor滤波的表情动态特征提取方法

针对目前动态特征提取方法在提取序列表情特征时人脸外貌特征也一起被提取的缺陷,提出了一种基于Gabor滤波的表情动态特征提取方法。利用Gabor滤波器在频率和方向上的选择特性,在提取表情特征时较好地抑制了人脸外貌特征的提取,从而减少了表情特征中人脸外貌特征的含量。在Cohn-Kanade和CMU-AMP人脸库上的表情识别实验表明,本文方法获得的表情动态特征对表情识别更有效。     

基于区域非均匀空间采样特征的图像分类方法

大量实验证明抽取图像中稠密局部特征能够大大提高图像分类性能,目前的常用策略是基于空间均匀密集采样来实现稠密局部特征的抽取。该文提出一种新的基于区域非均匀空间采样的局部特征抽取方法。首先,用过分割技术对原始图像进行分割,从而得到图像的分割区域,并采用显著性检测技术估计每个过分割区域的重要性。然后,在保证不增加采样数的情况下,对重要的显著性区域的边界实行密集均匀采样,对区域内部根据区域大小和重要性实行随机采样。最后,采用词袋表示模型来实现图像分类。在两个广泛应用的数据库,8类体育运动(UIUC Sports)和256类自然图像(Caltech-256)数据库进行实验。实验结果证明,该文提出的采样策略进一步提高了基于稠密局部特征的图像分类性能。     

轮式车与履带车目标的识别

从常规脉冲雷达的目标回波这一角度对轮式车和履带车两类目标的特征进行了分析,找出了它们之间的不同之处、提出了对这两类目标进行分类识别的方法,并经现场检验,证明这种方法是有效的。     

Image fusion and subpixel parameter estimation for automatedoptical inspection of electronic components

The authors present a new approach to automated optical inspection (AOI) of circular features that combines image fusion with subpixel edge detection and parameter estimation. In their method, several digital images are taken of each part as it moves past a camera, creating an image sequence. These images are fused to produce a high-resolution image of the features to be inspected. Subpixel edge detection is performed on the high-resolution image, producing a set of data points that is used for ellipse parameter estimation. The fitted ellipses are then back-projected into 3-space in order to obtain the sizes of the circular features being inspected, assuming that the depth is known. The method is accurate, efficient, and easily implemented. The authors present experimental results for real intensity images of circular features of varying sizes. Their results demonstrate that their algorithm shows greatest improvement over traditional methods in cases where the feature size is small relative to the resolution of the imaging device     

基于兴趣点局部分布特征的图像检索方法

提出了一种基于兴趣点颜色和空间分布特征的图像检索方法。该方法把图像内容看作为由若干兴趣点组成的集合,首先利用小波系数的空间方向树特性来检测兴趣点,然后利用基于兴趣点的环形颜色直方图和空间离散度来描述图像的特征,最后用加权特征距离来估计图像内容的相似度。同时,通过利用环形颜色直方图和空间离散度作为图像特征保证了该算法能够对图像的尺度变化、旋转变化和平移变化具有很好的抑制能力。在含有1000幅图像的数据库上所做的一系列实验表明,该算法与其它基于兴趣点的方法相比,能够更准确和高效地查找出用户所需的图像,明显地提高了检索精度。     

Using Feature-Based Models with Complexity Penalization for Selecting Features

Feature selection and inference through modeling are combined into one method based on a network that can be used to point out irrelevant, redundant and dependent features in the data. It is shown that this network method is efficient in terms of reducing the number of calculations for estimating the probabilities under different model assumptions by breaking the data into fractions. We prove that the probability estimations within the network method lead to the detection of non-informative features with probability one if the data is sufficiently large. The proposed method’s accuracy in detecting complex relations between features, selecting informative features and classifying data-sets with different dimensions is assessed through experiments using both synthetic and real data. The results from the network method compare favorably with those from the well-known and powerful feature selection algorithms. It is further shown that the network method can handle complex relations between the features that are intractable for other algorithms.     

基于主曲线的脱机手写数字识别

该文提出了一种基于主曲线的脱机手写数字识别方法.该方法将主曲线及知识约简算法运用于识别模型中.主曲线是主成份分析的非线性推广,它是通过数据分布"中间"并满足"自相合"的光滑曲线.它较好地反映了数据分布的结构特征.粗糙集理论的知识约简是从决策表中获取决策(分类)规则的有效工具.本文将主曲线用于训练数据的特征提取,根据主曲线的特征生成决策表;利用我们提出的知识约简算法对决策表进行处理,自动获得分类规则.这种方法既符合人的识别习惯,又克服了利用统计特征识别所带来的不足.实验结果表明了该方法能有效提高手写数字的识别率,为脱机手写数字识别的研究提供了一条新途径.     

Efficient Content-Based Image Retrieval Methods Using Color and Texture

In this paper, we propose efficient content-based image retrieval methods using the automatic extraction of the low-level visual features as image content. Two new feature extraction methods are presented. The first one is an advanced color feature extraction derived from the modification of Stricker's method. The second one is a texture feature extraction using some DCT coefficients which represent some dominant directions and gray level variations of the image. In the experiment with an image database of 200 natural images, the proposed methods show higher performance than other methods. They can be combined into an efficient hierarchical retrieval method.     

Two-dimensional strip spectral correlation algorithm to fast estimation of 2D-cyclic spectral function for texture analysis

This paper presents a new affective scheme to estimate the two-dimensional cyclic spectral function of a texture as a two-dimensional signal. Recently, considering textures as cyclostationary signals, several algorithms have been introduced to utilize the more discriminant features of hidden periodicity for texture analysis, such as one-dimensional strip spectral correlation analysis (1D-SSCA), one-dimensional FFT-accumulated method, and direct frequency smoothing method. Although the reported results of these algorithms are proper, all of them suffer a drawback: they sweep texture images row by row and column by column and analyze them as one-dimensional signals, and hence lose the relationships between neighboring pixels. In this paper a new efficient extended algorithm namely two-dimensional SSCA is proposed to estimate the two-dimensional cyclic spectral function for two-dimensional signals. This algorithm is fast respect to other cyclic spectral function estimators and is based on 1D-SSCA algorithm. The effectiveness of the proposed algorithm is evaluated on three well-known databases. The experimental results illustrate that the proposed scheme is computationally efficient, generates flexible features and improves correct classification rate, in comparison with other studies in this field.     

Deep multi query image retrieval

There exist few studies investigating the multi-query image retrieval problem. Existing methods are not based on hash codes. As a result, they are not efficient and fast. In this study, we develop an efficient and fast multi-query image retrieval method when the queries are related to more than one semantic. Image hash codes are generated by a deep hashing method. Consequently, the method requires lower storage space, and it is faster compared to the existing methods. The retrieval is based on the Pareto front method. Reranking performed on the retrieved images by using non-binary deep-convolutional features increase retrieval accuracy considerably. Unlike previous studies, the method supports an arbitrary number of queries. It outperforms similar multi-query image retrieval studies in terms of retrieval time and retrieval accuracy.     

Generalized feature extraction using expansion matching

A novel generalized feature extraction method based on the expansion matching (EXM) method and on the Karhunen-Loeve transform (KLT) is presented. The method provides an efficient way to locate complex features of interest like corners and junctions with reduced number of filtering operations. The EXM method is used to design optimal detectors for a set of model elementary features. The KL representation of these model EXM detectors is used to filter the image and detect candidate interest points from the energy peaks of the eigen coefficients. The KL coefficients at these candidate points are then used to efficiently reconstruct the response and differentiate real junctions and corners from arbitrary features in the image. The method is robust to additive noise and is able to successfully extract, classify, and find the myriad compositions of corner and junction features formed by combinations of two or more edges or lines. This method differs from previous works in several aspects. First, it treats the features not as distinct entities, but as combinations of elementary features. Second, it employs an optimal set of elementary feature detectors based on the EM approach. Third, the method incorporates a significant reduction in computational complexity by representing a large set of EXM filters by a relatively small number of eigen filters derived by the KL transform of the basic EXM filter set. This is a novel application of the KL transform, which is usually employed to represent signals and not impulse responses as in our present work.     

应用于LED显示系统的单线串接通信方法

该文介绍了一种先进的发光二极管（LED）显示系统的单线串接通信方法,该通信方法具有通信效率高、指令丰富、控制灵活、同步效果好等特点。可以有效地解决传统LED通信系统信号传输苛刻的时序配合问题,提高整个LED显示系统的稳定性和控制灵活性,同时也比当前LED通信系统具有更高的效率。     

Automatic soccer video analysis and summarization

We propose a fully automatic and computationally efficient framework for analysis and summarization of soccer videos using cinematic and object-based features. The proposed framework includes some novel low-level processing algorithms, such as dominant color region detection, robust shot boundary detection, and shot classification, as well as some higher-level algorithms for goal detection, referee detection, and penalty-box detection. The system can output three types of summaries: i) all slow-motion segments in a game; ii) all goals in a game; iii) slow-motion segments classified according to object-based features. The first two types of summaries are based on cinematic features only for speedy processing, while the summaries of the last type contain higher-level semantics. The proposed framework is efficient, effective, and robust. It is efficient in the sense that there is no need to compute object-based features when cinematic features are sufficient for the detection of certain events, e.g., goals in soccer. It is effective in the sense that the framework can also employ object-based features when needed to increase accuracy (at the expense of more computation). The efficiency, effectiveness, and robustness of the proposed framework are demonstrated over a large data set, consisting of more than 13 hours of soccer video, captured in different countries and under different conditions.     

一种改进的相位一致性图像特征检测方法

同时检测出包括边缘特征和线特征在内的多种图像特征一直是图像特征检测中的难点。在相位一致性基本原理的基础上,提出了一种基于局部频率的相位一致性检测图像特征的算法。试验结果表明,采用的算法在图像特征的细节保留和定位方面要优于传统的相位一致性算法和Canny算法。     

Detection of landmines and underground utilities from acoustic and GPR images with a cepstral approach

This paper introduces a cepstral approach for the automatic detection of landmines and underground utilities from acoustic and ground penetrating radar (GPR) images. This approach is based on treating the problem as a pattern recognition problem. Cepstral features are extracted from a group of images, which are transformed first to 1-D signals by lexicographic ordering. Mel-frequency cepstral coefficients (MFCCs) and polynomial shape coefficients are extracted from these 1-D signals to form a database of features, which can be used to train a neural network with these features. The target detection can be performed by extracting features from any new image with the same method used in the training phase. These features are tested with the neural network to decide whether a target exists or not. The different domains are tested and compared for efficient feature extraction from the lexicographically ordered 1-D signals. Experimental results show the success of the proposed cepstral approach for landmine detection from both acoustic and GPR images at low as well as high signal to noise ratios (SNRs). Results also show that the discrete cosine transform (DCT) is the most appropriate domain for feature extraction.