数字图像边缘检测算子的性能实验比较

本文对数字图像中几种具有代表性的边缘检测算子进行了理论分析，并通过VC编程实验，对各种算法进行实现，通过比较得出了各自的优缺点和适用范围。     

Nonlinear filtering structure for image smoothing in mixed-noise environments

This paper introduces a new nonlinear filtering structure for filtering image data that have been corrupted by both impulsive and nonimpulsive additive noise. Like other nonlinear filters, the proposed filtering structure uses order-statistic operations to remove the effects of the impulsive noise. Unlike other filters, however, nonimpulsive noise is smoothed by using a maximum a posteriori estimation criterion. The prior model for the image is a novel Markov random-field model that models image edges so that they are accurately estimated while additive Gaussian noise is smoothed. The Markov random-field-based prior is chosen such that the filter has desirable analytical and computational properties. The estimate of the signal value is obtained at the unique minimum of the a posteriori log likelihood function. This function is convex so that the output of the filter can be easily computed by using either digital or analog computational methods. The effects of the various parameters of the model will be discussed, and the choice of the predetection order statistic filter will also be examined. Example outputs under various noise conditions will be given.     

Self-calibration based on invariant view recognition: Dynamic approach to navigation

We extend a dynamic approach of behavior generation to the representation of spatial information. Two levels of dynamics integrate dead-reckoning, dominant far from home bases, and piloting, dominant near home bases. When the view-based piloting system recognizes a home base, visual place information recalibrates the dead-reckoning system, inverting the hierarchical ordering of the two dynamic levels by time scale inversion. Reference views taken at discrete home bases are recognized invariantly under rotation of views. This process yields compass information. Continuous translational information is obtained as a neural place representation built from view correlations with a scattered set of local views. This self-calibrating cognitive map couples into a dynamics of heading direction integrating the behaviors of obstacle avoidance and target acquisition. Targets can be designated in terms of the cognitive map. We demonstrate the dynamical model in simulation.     

Laplace spectra as fingerprints for image recognition

In the area of image retrieval from data bases and for copyright protection of large image collections there is a growing demand for unique but easily computable fingerprints for images. These fingerprints can be used to quickly identify every image within a larger set of possibly similar images. This paper introduces a novel method to automatically obtain such fingerprints from an image. It is based on a reinterpretation of an image as a Riemannian manifold. This representation is feasible for gray value images and color images. We discuss the use of the spectrum of eigenvalues of different variants of the Laplace operator as a fingerprint and show the usability of this approach in several use cases. Contrary to existing works in this area we do not only use the discrete Laplacian, but also with a particular emphasis the underlying continuous operator. This allows better results in comparing the resulting spectra and deeper insights in the problems arising. We show how the well known discrete Laplacian is related to the continuous Laplace-Beltrami operator. Furthermore, we introduce the new concept of solid height functions to overcome some potential limitations of the method.     

Target differentiation with simple infrared sensors using statistical pattern recognition techniques

This study compares the performances of various statistical pattern recognition techniques for the differentiation of commonly encountered features in indoor environments, possibly with different surface properties, using simple infrared (IR) sensors. The intensity measurements obtained from such sensors are highly dependent on the location, geometry, and surface properties of the reflecting feature in a way that cannot be represented by a simple analytical relationship, therefore complicating the differentiation process. We construct feature vectors based on the parameters of angular IR intensity scans from different targets to determine their geometry and/or surface type. Mixture of normals classifier with three components correctly differentiates three types of geometries with different surface properties, resulting in the best performance (100%) in geometry differentiation. Parametric differentiation correctly identifies six different surface types of the same planar geometry, resulting in the best surface differentiation rate (100%). However, this rate is not maintained with the inclusion of more surfaces. The results indicate that the geometrical properties of the targets are more distinctive than their surface properties, and surface recognition is the limiting factor in differentiation. The results demonstrate that simple IR sensors, when coupled with appropriate processing and recognition techniques, can be used to extract substantially more information than such devices are commonly employed for.     

Radiosity with Well Distributed Ray Sets

In this paper we present a new radiosity algorithm, based on the notion of a well distributed ray set (WDRS). A WDRS is a set of rays, connecting mutually visible points and patches, that forms an approximate representation of the radiosity operator and the radiosity distribution. We propose an algorithm that constructs an optimal WDRS for a given accuracy and mesh. The construction is based on discrete importance sampling as in previously proposed stochastic radiosity algorithms, and on quasi Monte Carlo sampling. Quasi Monte Carlo sampling leads to faster convergence rates and the fact that the sampling is deterministic makes it possible to represent the well distributed ray set very efficiently in computer memory. Like previously proposed stochastic radiosity algorithms, the new algorithm is well suited for computing the radiance distribution in very complex diffuse scenes, when it is not feasible to explicitly compute and store form factors as in classical radiosity algorithms. Experiments show that the new algorithm is often more efficient than previously proposed Monte Carlo radiosity algorithms by half an order of magnitude and more.     

基于森林火灾平台的红外图像识别技术研究

森林火灾探测一直是森林资源保护工作中的老大难问题。早期的火灾探测技术多是基于火灾的烟雾和温度特征的,但其判别标准过于单一,误报率较高。随着计算机技术的发展和红外探测器的发明,出现了基于红外图像处理的森林火灾防护技术,该技术主要对红外探测器获得的森林现场的红外图像进行一定的处理后识别图像中是否有火灾出现。本文的主要工作是进行红外图像增强算法的研究,通过对各种算法的描述和仿真实验结果分析,提出一种相对较适合森林背景红外图像的处理算法一将基于频域处理的提升小波变换与直方图修正结合起来的红外图像增强算法。     

基于像素拓展的图形分割与合成的方法研究

提出了一种新的图像分割与合成方法。对于图像的分割,提出了新的分割算法,先是手工将一些明显属于物体和明显属于背景的像素分割出来,然后创建一个小矩形区域进行像素拓展迭代,迭代到图像边界为止。对于图像的合成,采用平均法,设计了新的算法,使物体的基本颜色保持不变的同时,降低了合成图像中从源图像分割的物体与新背景的差异,并使得其饱和度、色度、强度更加自然真实。