高提升滤波在低对比度目标相关探测中的应用

光电混合联合变换器可实现对目标的实时探测、识别及自动定位。但低对比度目标的相关峰强度很弱,甚至得不到相关峰．影响了目标的识别率。利用高提升滤波处理技术和图像分割对功率谱进行增强处理,可以有效提高功率谱对比度,最大限度保留光谱图像的细节信息,提高光电联合相关系统的目标识别率。     

中文文本抄袭检查系统的改良与设计

由于目前常见的文本抄袭检查系统都存在对文本的关键信息选择不准确的问题,从而影响了判断的准确性。开发的中文文本抄袭检查系统在采用k-grams算法的基础上,利用基于统计的中文分词技术对其改良。实验结果表明通过改良可以使系统更有效地选取关键信息,提高判断的准确性。     

中文分词技术在搜索引擎中的应用

本文介绍了搜索引擎的关键技术——中文分词技术,对中文分词技术的概念、常用算法以及分词的难点进行了详细介绍,让读者对中文分词的现状有所了解。     

基于嵌入式系统的图像对象分割

随着计算机科学和微电子技术的迅速发展,以计算机技术、集成电路技术和软件技术为核心的嵌入式系统的信息处理能力迅速提升,为基于嵌入式系统的图像信息处理提供了硬件基础。本文以ARM920T结构的S3C2410处理器为核心,构建了一个嵌入式图像处理平台,在嵌入式Linux操作系统的支撑下,实现了嵌入式图像的采集、图像灰度化和基于迭代法的图像对象分割,实验证明本系统是切实可行,为进一步的研究提供了基础。     

基于.NET的中文分词系统设计与实现

针对中文分词的相关理论,讨论了中文分词的难点、语料库和中文分词算法,然后在.NET下设计了一个中文分词系统。在长词优先的原则下通过SQL Server 2005自建了一个语料库。在Visual Studio 2005下,采用改进的正向减字最大匹配分词算法,使用ASP.NET和C#语言实现了这个系统。结果表明该分词系统达到了较好的分词效果。     

Ready to preorder: The case of weak process semantics

Recently, Aceto, Fokkink and Ingólfsdóttir proposed an algorithm to turn any sound and ground-complete axiomatisation of any preorder listed in the linear time-branching time spectrum at least as coarse as the ready simulation preorder, into a sound and ground-complete axiomatisation of the corresponding equivalence—its kernel. Moreover, if the former axiomatisation is ω-complete, so is the latter. Subsequently, de Frutos Escrig, Gregorio Rodríguez and Palomino generalised this result, so that the algorithm is applicable to any preorder at least as coarse as the ready simulation preorder, provided it is initials preserving. The current paper shows that the same algorithm applies equally well to weak semantics: the proviso of initials preserving can be replaced by other conditions, such as weak initials preserving and satisfying the second τ-law. This makes it applicable to all 87 preorders surveyed in “the linear time-branching time spectrum II” that are at least as coarse as the ready simulation preorder. We also extend the scope of the algorithm to infinite processes, by adding recursion constants. As an application of both extensions, we provide a ground-complete axiomatisation of the CSP failures equivalence for BCCS processes with divergence.     

Using anatomical knowledge expressed as fuzzy constraints to segment the heart in CT images

Segmenting the heart in medical images is a challenging and important task for many applications. In particular, segmenting the heart in CT images is very useful for cardiology and oncological applications such as radiotherapy. Although the majority of methods in the literature are designed for ventricle segmentation, there is a real interest in segmenting the heart as a whole in this modality. In this paper, we address this problem and propose an automatic and robust method, based on anatomical knowledge about the heart, in particular its position with respect to the lungs. This knowledge is represented in a fuzzy formalism and it is used both to define a region of interest and to drive the evolution of a deformable model in order to segment the heart inside this region. The proposed method has been applied on non-contrast CT images and the obtained results have been compared to manual segmentations of the heart, showing the good accuracy and high robustness of our approach.     

Color Subspaces as Photometric Invariants

Complex reflectance phenomena such as specular reflections confound many vision problems since they produce image ‘features’ that do not correspond directly to intrinsic surface properties such as shape and spectral reflectance. A common approach to mitigate these effects is to explore functions of an image that are invariant to these photometric events. In this paper we describe a class of such invariants that result from exploiting color information in images of dichromatic surfaces. These invariants are derived from illuminant-dependent ‘subspaces’ of RGB color space, and they enable the application of Lambertian-based vision techniques to a broad class of specular, non-Lambertian scenes. Using implementations of recent algorithms taken from the literature, we demonstrate the practical utility of these invariants for a wide variety of applications, including stereo, shape from shading, photometric stereo, material-based segmentation, and motion estimation.     

Nonparametric Bayesian Image Segmentation

Image segmentation algorithms partition the set of pixels of an image into a specific number of different, spatially homogeneous groups. We propose a nonparametric Bayesian model for histogram clustering which automatically determines the number of segments when spatial smoothness constraints on the class assignments are enforced by a Markov Random Field. A Dirichlet process prior controls the level of resolution which corresponds to the number of clusters in data with a unique cluster structure. The resulting posterior is efficiently sampled by a variant of a conjugate-case sampling algorithm for Dirichlet process mixture models. Experimental results are provided for real-world gray value images, synthetic aperture radar images and magnetic resonance imaging data.     

Partial Partitions,Partial Connections and Connective Segmentation

In connective segmentation (Serra in J. Math. Imaging Vis. 24(1):83–130, [2006]), each image determines subsets of the space on which it is “homogeneous”, in such a way that this family of subsets always constitutes a connection (connectivity class); then the segmentation of the image is the partition of space into its connected components according to that connection. Several concrete examples of connective segmentations or of connections on sets, indicate that the space covering requirement of the partition should be relaxed. Furthermore, morphological operations on partitions require the consideration of wider framework. We study thus partial partitions (families of mutually disjoint non-void subsets of the space) and partial connections (where connected components of a set are mutually disjoint but do not necessarily cover the set). We describe some methods for generating partial connections. We investigate the links between the two lattices of partial connections and of partial partitions. We generalize Serra’s characterization of connective segmentation and discuss its relevance. Finally we give some ideas on how the theory of partial connections could lead to improved segmentation algorithms.