用VB编写Windows XP系统的娱乐游戏类附件工具

介绍如何用最少的VB代码,自制WindowsXP系统的娱乐游戏类附件工具。     

实时图像增强算法改进及FPGA实现

针对复杂背景的多目标图像,提出了一种基于直方图的实时自适应图像增强方法.该方法根据自适应直方图窗口选择高低阈值,通过灰度线性变换及灰度级等间距密度均衡进行图像增强.利用该算法增强图像视频时,采用FPGA,通过并行处理结构及流水线技术,可实时处理每秒50帧780×582×12bits的可见光图像.在处理视频的过程中,由前一帧图像的直方图信息,来增强后一帧图像.理论分析和实验结果均表明,该算法克服了直方图均衡及平台直方图均衡增强图像引起的灰度断层现象,有效地增强了图像的对比度,提高了图像质量.     

同形映射下的曲面场景的匹配算法的性能分析

针对移动机器人在曲面场景的匹配问题中,同形约束用于解决极约束产生的匹配模糊性问题和发现新的匹配点.实际上是平面块对曲面进行近似逼近的过程.逼近程度和逼近性能需要有指标进行定性和定量的衡量.故提出了两种性能评价指标:平均映射误差和平均映射匹配对.仿真实验结果的分析证明,场景深度变化或者场景距离摄像机的距离变化,对立体匹配算法性能本身不受影响,但映射和建立匹配关系时所需要的同形矩阵的数量不同.而且,随着特征点的稠密度提高,曲面场景的稳定性降低.可随着迭代过程的进行,算法本身结果还趋于稳定.     

基于方向导数的多光谱图像快速融合新算法

针对提升小波变换的特点,研究图像融合规则,提出了一种新的基于方向导数的多分辨多光谱图像快速融合算法。首先,利用提升小波变换得到待融合源图像的多分辨分析;然后以小波域方向导数为判据,在图像的多分辨分析的相应各级上进行融合,得到融合图像的多分辨分析;最后,利用提升小波反变换重构融合图像。使用多光谱图像对算法进行验证并与方向对比度算法进行对比,结果表明,融合图像完好的融合了源图像的信息,且算法运算时间短。     

机器视觉中特征点提取算法的探讨

机器视觉中特征点的提取是基于点特征图像配准算法的一个非常关键的步骤。首先从特征点定义出发,介绍了近年来国内外出现的几种常用的点特征提取算法,然后利用特征提取方法评价标准,对各种检测算子进行了综合的分析和讨论,最后,通过运用VC++编程语言工具进行算法仿真,对试验结果进行比较分析,理论与实践相结合,合理评价了各种方法的性能、优缺点、适用环境,论述对学习图像检测和具体工程应用具有很好的参考价值,并且为这些方法的改进提供了指导性意见。     

Cryo-EM image alignment based on nonuniform fast Fourier transform

In single particle analysis, two-dimensional (2-D) alignment is a fundamental step intended to put into register various particle projections of biological macromolecules collected at the electron microscope. The efficiency and quality of three-dimensional (3-D) structure reconstruction largely depends on the computational speed and alignment accuracy of this crucial step. In order to improve the performance of alignment, we introduce a new method that takes advantage of the highly accurate interpolation scheme based on the gridding method, a version of the nonuniform fast Fourier transform, and utilizes a multi-dimensional optimization algorithm for the refinement of the orientation parameters. Using simulated data, we demonstrate that by using less than half of the sample points and taking twice the runtime, our new 2-D alignment method achieves dramatically better alignment accuracy than that based on quadratic interpolation. We also apply our method to image to volume registration, the key step in the single particle EM structure refinement protocol. We find that in this case the accuracy of the method not only surpasses the accuracy of the commonly used real-space implementation, but results are achieved in much shorter time, making gridding-based alignment a perfect candidate for efficient structure determination in single particle analysis.     

Relational-Convergent Transformer for image captioning

Image captioning describes the visual content of a given image by using natural language sentences, and plays a key role in the fusion and utilization of the image features. However, in the existing image captioning models, the decoder sometimes fails to efficiently capture the relationships between image features because of their lack of sequential dependencies. In this paper, we propose a Relational-Convergent Transformer (RCT) network to obtain complex intramodality representations in image captioning. In RCT, a Relational Fusion Module (RFM) is designed for capturing the local and global information of an image by a recursive fusion. Then, a Relational-Convergent Attention (RCA) is proposed, which is composed of a self-attention and a hierarchical fusion module for aggregating global relational information to extract a more comprehensive intramodal contextual representation. To validate the effectiveness of the proposed model, extensive experiments are conducted on the MSCOCO dataset. The experimental results show that the proposed method outperforms some of the state-of-the-art methods.     

HDR Image Generation based on Intensity Clustering and Local Feature Analysis

This paper describes a cluster-based method for combining differently exposed images in order to increase their dynamic range. Initially an image is decomposed into a set of arbitrary shaped regions. For each region we compute a utility function which is based on the amount of presented information and an entropy. This function is used to select the most appropriate exposure for each region. After the exposures are selected, a bilateral filtering is applied in order to make the interregional transitions smooth. As a result we obtain weighting coefficients for each exposure and pixel. An output image is combined from clusters of input images using weights. Each pixel of the output image is calculated as a weighted sum of exposures. The proposed method allows recovering details from overexposed and underexposed parts of image without producing additional noise. Our experiments show effectiveness of the algorithm for the high dynamic range scenes. It requires no information about shutter speed or camera parameters. This method shows robust results even if the exposure difference between input images is 2-stops or higher.     

An experimental study on the applicability of evolutionary algorithms to craniofacial superimposition in forensic identification

Photographic supra-projection is a forensic process that aims to identify a missing person from a photograph and a skull found. One of the crucial tasks throughout all this process is the craniofacial superimposition which tries to find a good fit between a 3D model of the skull and the 2D photo of the face. This photographic supra-projection stage is usually carried out manually by forensic anthropologists. It is thus very time consuming and presents several difficulties. In this paper, we aim to demonstrate that real-coded evolutionary algorithms are suitable approaches to tackle craniofacial superimposition. To do so, we first formulate this complex task in forensic identification as a numerical optimization problem. Then, we adapt three different evolutionary algorithms to solve it: two variants of a real-coded genetic algorithm and the state of the art evolution strategy CMA-ES. We also consider an existing binary-coded genetic algorithm as a baseline. Results on several superimposition problems of real-world identification cases solved by the Physical Anthropology lab at the University of Granada (Spain) are considered to test our proposals.