基于视觉特征信息量度量的高斯尺度参数自适应算法

为了避免计算过于复杂或因丢弃过多关键信息而造成失真过大的问题,在高斯尺度空间的构造中应正确选用尺度参数,以使图像信息的变化呈现均匀的特点。目前,许多高斯尺度空间应用中采用的层之间的尺度参数关系并不明确,使得分层效果不理想。本文基于视觉特征模型,提出一种自适应高斯尺度参数的算法,并通过对SAR图像降噪处理对比试验验证了它的有效性,从而为图像的高层次处理如目标识别等提供了信息量稳定变化的尺度空间。     

基于SIFT的图像特征提取算法研究

图像特征点提取的性能决定着图像匹配的效率,提出了一种基于多尺度空间的SIFT算法,该算法对图像旋转、尺度缩放、亮度变化等方面具有较好适应性,分析了SIFT算法的基本模型与基于尺度空间的关键点的位置、尺度及方向参数的获取方式,实验证明,该算法对不同尺度空间上特征点的尺度、方向、大小信息获取具有较高的准确率,算法的稳定性与鲁棒性强。     

基于视觉特征的尺度空间信息量度量

图像的多尺度表示指的是从原始图像出发,导出一系列越来越平滑、简化的图像。这种简化意味着信息的丢失。如果能定量描述每一个尺度中图像的信息,这对于多尺度表示来说有着重要的作用。虽然Sporring等人提出的尺度空间信息熵度量能解决一些问题,但是并不满足从视觉理论和直观的基础上提出的尺度空间信息量度量的基本要求,例如形态不变性等,为此在M arr视觉理论基础上定义了一个新的具有视觉意义的尺度空间信息度量,并在典型的高斯尺度空间中,证明了它确实满足从视觉理论和直观的基础上提出的尺度空间信息量度量的基本要求。数值试验验证了这种定义在视觉上是可靠的,从而为图像尺度的自适应选择提供了一种可靠的方法。     

基于多尺度下特征点的检测

提出了一种在不同尺度空间下特征点提取的方法.该方法通过构造图像设高斯金字塔和高斯差分金字塔,进行极值检测,然后在极值点中去除低对比度的点并消除边界点的响应,得到关键点,最后计算关键点的方位和模的大小,从而得到特征点.利用该方法把取得的特征点对图像旋转、亮度变化、尺度缩放等情况下保持不变,此外对视角变化、仿射变换、噪声也保持一定的稳定性.给出了实验参数,并且对实验结果进行分析.     

基于高斯金字塔的遥感云图多尺度特征提取

提出了一种针对可见光遥感图像云图的多尺度特征提取方法。该方法通过高斯金字塔将遥感云图分解到多尺度空间,以此为基础将图像的灰度特征进行多尺度延拓,从而得到图像的多尺度特征矢量。实验结果表明在相同的特征算法和分类器条件下,多尺度延拓能够提升分类精度,更加有效地实现云图和地物的分类。     

抑制光照不均匀影响的图像特征点提取算法

为解决在光照不均匀情况下图像特征点提取算法表现效果不佳的问题,提出了一种改进的尺度不变特征转换（Scale Invariant Feature Transform,SIFT）算法抑制光照不均的影响。该方法在尺度空间构造中对输入的图像进行频域上的高斯高通滤波处理来滤除光照成分,并结合Top-hat变换弱化高斯滤波器参数选取难度,利用高斯卷积构建基于光照滤除与参数弱化的高斯差分金字塔,融合SIFT算法生成具有良好光照不变性的GT-SIFT描述子,进行特征点提取与匹配。实验结果表明,与传统算法相比改进算法在光照不均匀条件下具有更好的鲁棒性,图像特征点提取与匹配效果更好。     

一种基于多尺度分析的线条重构方法

针对图像中线条的重构与理解,基于多尺度空间理论,提出通过多尺度、多角度高斯-拉普拉斯滤波的最大能量响应,对线条进行自适应增强,同时获取线条的尺度、角度信息,利用非极大值抑制对线条实现检测,利用已获取的线条尺度与角度信息对线条进行重构。实验结果表明该线条重构算法的有效性。     

一种KAZE算法在人脸图像匹配中的应用

基于KAZE人脸图像匹配算法是通过加性算子分裂算法来进行非线性扩散滤波,从而解决高斯分解带来的边界模糊和细节丢失问题. 利用任意步长构造稳定的非线性尺度空间,寻找不同尺度归一化后的Hessian局部极大值点来实现特征点的检测,采用M-SURF来描述特征点,从而构造特征描述向量. 在VS2010和Opencv环境下分别对KAZE特征和SIFT特征实现人脸图像的匹配. 通过改变输入人脸图像的模糊度,旋转角度,尺度大小,亮度变化结合Matlab对KAZE,SIFT,SURF进行进一步的性能仿真实验. 实验结果表明,即使在高斯模糊,角度旋转,尺度变换和亮度变化等情况下依然保持良好的性能.     

一种图像特征点匹配算法——Haar-Gaussian&NICD算法

提出了一种基于哈尔小波分解变换和高斯尺度空间的图像特征点匹配算法.首先利用哈尔小波变换对基础图像进行3层行列分解,然后利用高斯函数卷积核对这些分解图像,进行尺度变换.提出了一个小波高斯金字塔塔林的概念,即对通过小波变换产生的多张不同分辨率的基础图像分别进行高斯尺度变换进而产生一个个独立的高斯金字塔,进而产生独立的高斯差分金字塔林,完成特征点检测.再引进规范化强对比度描述子对特征点进行描述.结果表明:Haar-Gaussia&NICD算法的效果和SIFT算法相当,特征点数量优于SIFT算法,在局部特征匹配方面要更有优势;而且和NICD描述子搭配使用,在运行速度方面要比SIFT算法更快.     

小波尺度空间中的边缘检测算法

提出用一个非线性的小波尺度空间代替高斯尺度空间,得到小波尺度空间中的边缘检测算法.实验结果表明该边缘检测方法优于Canny边缘检测的多尺度方法,能够保留更多的图像细节边缘,具有较强的抗噪声能力.     

Scale-space properties of the multiscale morphologicaldilation-erosion

A multiscale morphological dilation-erosion smoothing operation and its associated scale-space expansion for multidimensional signals are proposed. Properties of this smoothing operation are developed and, in particular a scale-space monotonic property for signal extrema is demonstrated. Scale-space fingerprints from this approach have advantages over Gaussian scale-space fingerprints in that: they are defined for negative values of the scale parameter; have monotonic properties in two and higher dimensions; do not cause features to be shifted by the smoothing; and allow efficient computation. The application of reduced multiscale dilation-erosion fingerprints to the surface matching of terrain is demonstrated     

Scale-space for discrete signals

A basic and extensive treatment of discrete aspects of the scale-space theory is presented. A genuinely discrete scale-space theory is developed and its connection to the continuous scale-space theory is explained. Special attention is given to discretization effects, which occur when results from the continuous scale-space theory are to be implemented computationally. The 1D problem is solved completely in an axiomatic manner. For the 2D problem, the author discusses how the 2D discrete scale space should be constructed. The main results are as follows: the proper way to apply the scale-space theory to discrete signals and discrete images is by discretization of the diffusion equation, not the convolution integral; the discrete scale space obtained in this way can be described by convolution with the kernel, which is the discrete analog of the Gaussian kernel, a scale-space implementation based on the sampled Gaussian kernel might lead to undesirable effects and computational problems, especially at fine levels of scale; the 1D discrete smoothing transformations can be characterized exactly and a complete catalogue is given; all finite support 1D discrete smoothing transformations arise from repeated averaging over two adjacent elements (the limit case of such an averaging process is described); and the symmetric 1D discrete smoothing kernels are nonnegative and unimodal, in both the spatial and the frequency domain     

Time-Causal and Time-Recursive Spatio-Temporal Receptive Fields

We present an improved model and theory for time-causal and time-recursive spatio-temporal receptive fields, obtained by a combination of Gaussian receptive fields over the spatial domain and first-order integrators or equivalently truncated exponential filters coupled in cascade over the temporal domain. Compared to previous spatio-temporal scale-space formulations in terms of non-enhancement of local extrema or scale invariance, these receptive fields are based on different scale-space axiomatics over time by ensuring non-creation of new local extrema or zero-crossings with increasing temporal scale. Specifically, extensions are presented about (i) parameterizing the intermediate temporal scale levels, (ii) analysing the resulting temporal dynamics, (iii) transferring the theory to a discrete implementation in terms of recursive filters over time, (iv) computing scale-normalized spatio-temporal derivative expressions for spatio-temporal feature detection and (v) computational modelling of receptive fields in the lateral geniculate nucleus (LGN) and the primary visual cortex (V1) in biological vision. We show that by distributing the intermediate temporal scale levels according to a logarithmic distribution, we obtain a new family of temporal scale-space kernels with better temporal characteristics compared to a more traditional approach of using a uniform distribution of the intermediate temporal scale levels. Specifically, the new family of time-causal kernels has much faster temporal response properties (shorter temporal delays) compared to the kernels obtained from a uniform distribution. When increasing the number of temporal scale levels, the temporal scale-space kernels in the new family do also converge very rapidly to a limit kernel possessing true self-similar scale-invariant properties over temporal scales. Thereby, the new representation allows for true scale invariance over variations in the temporal scale, although the underlying temporal scale-space representation is based on a discretized temporal scale parameter. We show how scale-normalized temporal derivatives can be defined for these time-causal scale-space kernels and how the composed theory can be used for computing basic types of scale-normalized spatio-temporal derivative expressions in a computationally efficient manner.     

Temporal Scale Selection in Time-Causal Scale Space

When designing and developing scale selection mechanisms for generating hypotheses about characteristic scales in signals, it is essential that the selected scale levels reflect the extent of the underlying structures in the signal. This paper presents a theory and in-depth theoretical analysis about the scale selection properties of methods for automatically selecting local temporal scales in time-dependent signals based on local extrema over temporal scales of scale-normalized temporal derivative responses. Specifically, this paper develops a novel theoretical framework for performing such temporal scale selection over a time-causal and time-recursive temporal domain as is necessary when processing continuous video or audio streams in real time or when modelling biological perception. For a recently developed time-causal and time-recursive scale-space concept defined by convolution with a scale-invariant limit kernel, we show that it is possible to transfer a large number of the desirable scale selection properties that hold for the Gaussian scale-space concept over a non-causal temporal domain to this temporal scale-space concept over a truly time-causal domain. Specifically, we show that for this temporal scale-space concept, it is possible to achieve true temporal scale invariance although the temporal scale levels have to be discrete, which is a novel theoretical construction. The analysis starts from a detailed comparison of different temporal scale-space concepts and their relative advantages and disadvantages, leading the focus to a class of recently extended time-causal and time-recursive temporal scale-space concepts based on first-order integrators or equivalently truncated exponential kernels coupled in cascade. Specifically, by the discrete nature of the temporal scale levels in this class of time-causal scale-space concepts, we study two special cases of distributing the intermediate temporal scale levels, by using either a uniform distribution in terms of the variance of the composed temporal scale-space kernel or a logarithmic distribution. In the case of a uniform distribution of the temporal scale levels, we show that scale selection based on local extrema of scale-normalized derivatives over temporal scales makes it possible to estimate the temporal duration of sparse local features defined in terms of temporal extrema of first- or second-order temporal derivative responses. For dense features modelled as a sine wave, the lack of temporal scale invariance does, however, constitute a major limitation for handling dense temporal structures of different temporal duration in a uniform manner. In the case of a logarithmic distribution of the temporal scale levels, specifically taken to the limit of a time-causal limit kernel with an infinitely dense distribution of the temporal scale levels towards zero temporal scale, we show that it is possible to achieve true temporal scale invariance to handle dense features modelled as a sine wave in a uniform manner over different temporal durations of the temporal structures as well to achieve more general temporal scale invariance for any signal over any temporal scaling transformation with a scaling factor that is an integer power of the distribution parameter of the time-causal limit kernel. It is shown how these temporal scale selection properties developed for a pure temporal domain carry over to feature detectors defined over time-causal spatio-temporal and spectro-temporal domains.     

Non-Linear Scale-Spaces Isomorphic to the Linear Case with Applications to Scalar,Vector and Multispectral Images

A basic requirement of scale-space representations in general is that of scale causality, which states that local extrema in the image should not be enhanced when resolution is diminished. We consider a special class of nonlinear scale-spaces consistent with this constraint, which can be linearised by a suitable isomorphism in the grey-scale domain so as to reproduce the familiar Gaussian scale-space. We consider instances in which nonlinear representations may be the preferred choice, as well as instances in which they enter by necessity. We also establish their relation to morphological scale-space representations based on a quadratic structuring function.     

Exploring and exploiting the structure of saddle points in Gaussian scale space

When an image is filtered with a Gaussian of width σ and σ is considered as an extra dimension, the image is extended to a Gaussian scale-space (GSS) image. In earlier work it was shown that the GSS-image contains an intensity-based hierarchical structure that can be represented as a binary ordered rooted tree. Key elements in the construction of the tree are iso-intensity manifolds and scale-space saddles.A scale-space saddle is a critical point in scale space. When it connects two different parts of an iso-intensity manifold, it is called “dividing”, otherwise it is called “void”. Each dividing scale-space saddle is connected to an extremum in the original image via a curve in scale space containing critical points. Using the nesting of the iso-intensity manifolds in the GSS-image and the dividing scale-space saddles, each extremum is connected to another extremum. In the tree structure, the dividing scale-space saddles form the connecting elements in the hierarchy: they are the nodes of the tree. The extrema of the image form the leaves, while the critical curves are represented as the edges.To identify the dividing scale-space saddles, a global investigation of the scale-space saddles and the iso-intensity manifolds through them is needed.In this paper an overview of the situations that can occur is given. In each case it is shown how to distinguish between void and dividing scale-space saddles. Furthermore, examples are given, and the difference between selecting the dividing and the void scale-space saddles is shown. Also relevant geometric properties of GSS images are discussed, as well as their implications for algorithms used for the tree extraction.As main result, it is not necessary to search through the whole GSS image to find regions related to each relevant scale-space saddle. This yields a considerable reduction in complexity and computation time, as shown in two examples.     

Comparison of SIFT,Bi-SIFT,and Tri-SIFT and their frequency spectrum analysis

This paper aims to explore frequency behavior of isotropic (regular SIFT) and anisotropic (Bi-SIFT and Tri-SIFT) versions of the scale-space keypoint detection algorithm SIFT. We introduced a new smoothing function Trilateral filter that can be used in formation of a scale-space as an alternative to the Gaussian scale-space. The number of matching pixels, warping error, and scatteredness are employed in comparison. We made the comparison out of face dataset and object dataset for scale, orientation, and view-angle transformations as well as lighting and compression variations. The comparison results show that anisotropic smoothing detects more keypoints than isotropic one. The Tri-SIFT is more robust to variation in viewpoint angle.