一种用于小目标检测的可配置二维自适应预测器设计

分析了用于图像中小目标检测的自适应预测器的支撑区域与其检测性能之间的关系 ,认为支撑区域应按照被处理图像统计特性进行设置 ,以正确区分图像中的目标与背景成分 .在此基础上 ,提出了一种基于 TDNL MS(Two Di-m ensional Normalized L east Mean Square)算法的支撑区域可配置的自适应预测器结构 ,通过设置适当的支撑区域 ,该预测器不仅可用于处理具有不同统计特性的图像 ,而且可以在一定程度上保持对成像面积逐渐变化的小目标的检测能力 .本文提出的预测器结构 ,只需要在每个抽头内部增加简单的控制逻辑 ,就可以实现支撑区域的任意配置 ,是一种较为理想的设计方案     

基于本体的跨语言信息检索模型

随着网络信息的日益丰富和用户需求的提高,人们已经不能满足于仅仅在同一语种中进行检索,跨语言的信息检索(CLIR)因而受到人们越来越多的关注。为此,本文提出了一种新的基于语义的跨语言信息检索模型Onto-CLIR,该模型在传统信息检索技术的基础上,利用本体来刻画不同语言中对应的领域知识,以解决从查询语言到检索语言之间转换过程中出现的语义损失和曲解等问题,从而保证在检索过程中能够有效地遵循用户的查询意图,获得预期的检索信息。本文以体育新闻检索为背景,以英文查询作为查询请求,检索来自新浪网的体育类新闻,结果表明采用基于本体的跨语言信息检索方法之后检索的查全率和查准率平均提高10个百分点左右,有效地改善了检索性能。     

基于知识图的汉语基本名词短语分析模型

本文提出了一种基于知识图的汉语baseNP分析模型。它以知识图为知识表示方法,利用《知网》为语义知识资源,采用以语义为主、语法为辅的策略,先为短语中的每一个实词构造“词图”,然后合并“词图”而组成“短语图”,最后得到一个关于汉语baseNP结构信息和语义信息的知识图。因此它不仅分析了汉语baseNP结构的内部句法关系,而且分析了汉语baseNP结构成分间的语义关系并以知识图的形式表示出了这种语义关系。实验结果表明这个模型对于汉语baseNP的分析是有效的。     

基于互连网的术语定义获取系统

文中介绍了一个实验性的基于互联网的术语定义获取系统,可以方便、迅速的从互连网上查找术语的定义以及与定义有关的内容,给用户迅速获得新生术语以及新技术词汇的定义方面的知识提供方便。系统采用一组术语定义的语言学模式,以多线程方式高效下载网页,并从中匹配符合术语定义模式的文本段落,再经一定后续处理,形成返回给用户的结果。系统中使用的语言学模式是在一定量的科技期刊语料库中获取的。试验结果表明系统的运行效率高,结果的准确度比较令人满意。     

语料库词性标注一致性检查方法研究

在对大规模语料库进行深加工时,保证词性标注的一致性已成为建设高质量语料库的首要问题。本文提出了基于聚类和分类的语料库词性标注一致性检查的新方法,该方法避开了以前一贯采用的规则或统计的方法,利用聚类和分类的思想,对范例进行聚类并求出阈值,对测试数据分类来确定其标注的正误,进而得出每篇文章的词性标注一致性情况,进一步保证大规模语料库标注的正确性。     

自然场景文本定位

随着自然场景文本识别研究的不断深入,建立标准的场景文本图像库和了解该领域的研究现状变得越来越重要。为此,2003年国际文档分析和识别大会专门建立了一个这样的图像库,并组织了自然场景文本识别比赛,我们参加了其中的自然场景文本定位分赛。本文对我们参加这次比赛的算法做了介绍并给出了比赛结果,在文章最后,对参赛算法做了比较,指出了场景文本定位的发展现状。     

数字图像中边缘算法的实验研究

边缘检测是图像处理、计算机视觉中的基础内容．也是至今仍未得到圆满解决的一类。目前图像处理大多数都是针对数字图像，本文对数字图像中几种具有代表性的边缘检测算法进行了理论分析，并通过编程实验，对各种算法进行实现，通过比较得出了各自的优缺点和适用范围。     

Tri-view morphing

This paper presents an efficient image-based approach to navigate a scene based on only three wide-baseline uncalibrated images without the explicit use of a 3D model. After automatically recovering corresponding points between each pair of images, an accurate trifocal plane is extracted from the trifocal tensor of these three images. Next, based on a small number of feature marks using a friendly GUI, the correct dense disparity maps are obtained by using our trinocular-stereo algorithm. Employing the barycentric warping scheme with the computed disparity, we can generate an arbitrary novel view within a triangle spanned by three camera centers. Furthermore, after self-calibration of the cameras, 3D objects can be correctly augmented into the virtual environment synthesized by the tri-view morphing algorithm. Three applications of the tri-view morphing algorithm are demonstrated. The first one is 4D video synthesis, which can be used to fill in the gap between a few sparsely located video cameras to synthetically generate a video from a virtual moving camera. This synthetic camera can be used to view the dynamic scene from a novel view instead of the original static camera views. The second application is multiple view morphing, where we can seamlessly fly through the scene over a 2D space constructed by more than three cameras. The last one is dynamic scene synthesis using three still images, where several rigid objects may move in any orientation or direction. After segmenting three reference frames into several layers, the novel views in the dynamic scene can be generated by applying our algorithm. Finally, the experiments are presented to illustrate that a series of photo-realistic virtual views can be generated to fly through a virtual environment covered by several static cameras.     

Parallel Processing of First Order Linear Recurrence on SMP Machines

In this paper, we propose a new algorithm that analyzes the data dependency pattern in the first-order linear recurrence (FOLR) and transforms it into algebraically equivalent expanded form so that it can be processed in parallel using the threads on symmetric multiprocessor (SMP) machines. The transformation aims to eliminate the data dependencies in the naive nested form of the FOLR. However, as this transformation may result in extra multiplication operations, our algorithm examines the immanent overhead of the expanded form of the FOLR and generates a new hybrid form of the FOLR. The hybrid form combines nested and appropriately expanded form in order to make it suitable for parallel processing. The parallel algorithm based on the hybrid form of the FOLR is analytically examined and tested through implementation on SMP machines. The implementation details, such as the workload balancing between processors and the optimization of cache performance, are also discussed. The experimental results show that the parallel algorithm based on the hybrid form of the FOLR considerably improves the performance on SMP machines that have three of more processors.     

Methods of Image Compression by PHL Transform

In this paper an image data compression scheme based on Periodic Haar Piecewise-Linear (PHL) transform and quantization tables is proposed. Effectiveness of the compression for different classes of images is evaluated. The comparison of the compression quality using PHL and DCT transforms is given.