On the Consistency of the Normalized Eight-Point Algorithm

A recently proposed argument to explain the improved performance of the eight-point algorithm that results from using normalized data (Chojnacki, W., et al. in IEEE Trans. Pattern Anal. Mach. Intell. 25(9):1172–1177, 2003) relies upon adoption of a certain model for statistical data distribution. Under this model, the cost function that underlies the algorithm operating on the normalized data is statistically more advantageous than the cost function that underpins the algorithm using unnormalized data. Here we extend this explanation by introducing a more refined, structured model for data distribution. Under the extended model, the normalized eight-point algorithm turns out to be approximately consistent in a statistical sense. The proposed extension provides a link between the existing statistical rationalization of the normalized eight-point algorithm and the approach of Mühlich and Mester for enhancing total least squares estimation methods via equilibration. The paper forms part of a wider effort to rationalize and interrelate foundational methods in vision parameter estimation.     

EM procedures using mean field-like approximations for Markov model-based image segmentation

Image segmentation using Markov random fields involves parameter estimation in hidden Markov models for which the EM algorithm is widely used. In practice, difficulties arise due to the dependence structure in the models and approximations are required. Using ideas from the mean field approximation principle, we propose a class of EM-like algorithms in which the computation reduces to dealing with systems of independent variables. Within this class, the simulated field algorithm is a new stochastic algorithm which appears to be the most promising for its good performance and speed, on synthetic and real image experiments.     

Active set truncated-Newton algorithm for simultaneous optimization of distillation column

An active set truncated-Newton algorithm (ASTNA) is proposed to solve the large-scale bound constrained sub-problems. The global convergence of the algorithm is obtained and two groups of numerical experiments are made for the various large-scale problems of varying size. The comparison results between ASTNA and the subspace limited memory quasi-Newton algorithm and between the modified augmented Lagrange multiplier methods combined with ASTNA and the modified barrier function method show the stability and effectiveness of ASTNA for simultaneous optimization of distillation column.     

神经网络分类器的快速构造算法

使用ＢＰ算法训练多层网络的速度很慢而且事先难于确定隐节点和隐层的适当数目。本文提出一个有效的算法，先构造决策树，然后将构造的决策树转换为神经网。文中使用一个全局准则函数控制决策树的增长，它较好地匹配了树的复杂性和训练样本量及错分率界。实验结果，本文的算法比用ＢＰ算法训练多层网络要快，而其分类精度不低于用ＢＰ算法训练的多层神经网。     

一种产生式系统的并行推理模型

1.引言 在人工智能领域中,产生式系统是一种比较有效的知识表示方法,并得到了广泛应用。目前许多较为成功的专家系统都是用产生式系统实现的~[1]。随着应用领域的不断扩士其知识座的抓橄称渐增     

红外目标精跟踪方法的研究

本文提出了一种直接把红外前视传感器的输出作为测量值来跟踪红外目标的扩展型卡尔曼滤波跟踪算法。在滤波处理时,设置可变的测量矩阵,其目的在于提高运算速度和抑制噪声干扰。通过具体的实例,对所提跟踪算法的特点和有效性进行了细致的分析。     

WKB近似下的Fourier衍射成象方法

对于介质目标微波衍射成象，本文引入了ＷＫＢ近似来模拟目标内部总场。基于这种近似，我们导出了Ｆｏｕｒｉｅｒ衍射公式，并采用了广义滤波逆传播方法由目标空间谱实现目标特性的重建。计算机模拟结果表明采用ＷＫＢ近似重建目标特性较Ｂｏｒｎ近似有明显改善。     

The pickup and delivery problem: Faces and branch-and-cut algorithm

This paper formulates the pickup and delivery problem, also known as the dial-a-ride problem, as an integer program. Its polyhedral structure is explored and four classes of valid inequalities developed. The results of a branch-and-cut algorithm based on these constraints are presented.     

A protocol for performance evaluation of line detection algorithms

Accurate and efficient vectorization of line drawings is essential for any higher level processing in document analysis and recognition systems. In spite of the prevalence of vectorization and line detection methods, no standard for their performance evaluation protocol exists. We propose a protocol for evaluating both straight and circular line extraction to help compare, select, improve, and even design line detection algorithms to be incorporated into line drawing recognition and understanding systems. The protocol involves both positive and negative sets of indices, at pixel and vector levels. Time efficiency is also included in the protocol. The protocol may be extended to handle lines of any shape as well as other classes of graphic objects.