Decomposition of gray-scale morphological templates using the rankmethod

Convolutions are a fundamental tool in image processing. Nonlinear convolutions are used in such operations as the median filter, the medial axis transform, and erosion and dilation as defined in mathematical morphology. For large convolution masks or structuring elements, the computation cost resulting from implementation can be prohibitive. However, in many instances, this cost can be significantly reduced by decomposing the templates representing the masks or structuring elements into a sequence of smaller templates. In addition, such decomposition can often be made architecture specific and, thus, resulting in optimal transform performance. In this paper we provide methods for decomposing morphological templates which are analogous to decomposition methods used in the linear domain. Specifically, we define the notion of the rank of a morphological template which categorizes separable morphological templates as templates of rank one. We establish a necessary and sufficient condition for the decomposability of rank one templates into 3×3 templates. We then use the invariance of the template rank under certain transformations in order to develop template decomposition techniques for templates of rank two     

安全高效的可撤销指纹模板构造

指纹特征加密是生物特征识别技术中最为活跃的研究领域之一.然而指纹特征是人体固有的特征,具有唯一性与终身不变性,一旦识别系统中的用户指纹模板丢失,将是永久性的.为了避免用户指纹模板丢失,基于巴特沃斯低通滤波器原型,设计了一组不可逆转换函数,将用户原始指纹模板转换为可撤销指纹模板,不同识别系统中存储的可撤销指纹模板具有互异性与不可逆性,进而有效规避原始指纹模板的不变性与公开性所带来的安全隐患.匹配精度、不可逆性、转换速度等方面的实验分析表明,所构造可撤销指纹模板方案在认证效率、安全性、计算效率等方面具有良好性能.     

面向对象有限元并行计算框架PANDA的应用模板

为解决面向对象有限元软件框架PANDA的应用问题,降低使用PANDA框架进行并行应用程序开发的难度,提高软件开发的重用性,从PANDA的框架设计、PANDA的应用模板和应用测试等3方面介绍针对不同物理问题的程序建立机制,即PANDA框架的使用方法--应用模板方法.PANDA框架的开发目前处于初始阶段,为提高其易用性仍需...     

Online fingerprint template improvement

This work proposes a technique that improves fingerprint templates by merging and averaging minutiae of multiple fingerprints. The weighted averaging scheme enables the template to change gradually with time in line with changes of the skin and imaging conditions. The recursive nature of the algorithm greatly reduces the storage and computation requirements of this technique. As a result, the proposed template improvement procedure can be performed online during the fingerprint verification process. Extensive experimental studies demonstrate the feasibility of the proposed algorithm.     

An improved species based genetic algorithm and its application in multiple template matching for embroidered pattern inspection

This paper describes an improved genetic algorithm (GA) using the notion of species in order to solve an embroidery inspection problem. This inspection problem is actually a multiple template matching problem which can be formulated as a multimodal optimization problem. In many cases, the run time of the multiple template matching problem is dominated by repeating the similarity calculations and moving the templates over the source image. To cope with this problem, the proposed species based genetic algorithm (SbGA) is capable to determine its neighborhood best values for solving multimodal optimization problems. The SbGA has been statistically tested and compared with other genetic algorithms on a number of benchmark functions. After proving its effectiveness, it is integrated with multi-template matching method, namely SbGA–MTM method to solve the embroidery inspection problem. Furthermore, the notion of bounded partial correlation (BPC) is also adopted as an acceleration strategy, which enhances the overall efficiency. Experimental results indicate that the SbGA–MTM method is proven to solve the inspection problem efficiently and effectively. With the proposed method, the embroidered patterns can be identified and checked automatically.     

基于伪Zernike矩的快速旋转无关图像匹配方法

传统的图像匹配方法往往会因为匹配图像与模板图像之间存在任意角度旋转而失效,而现有的抗旋转图像匹配方法因为计算量大而不能满足实时应用的需要.因此研究一种旋转无关的图像匹配算法成为必要.将圆投影匹配算法结合多值模板和塔形加速技术加快了滑动窗口的搜索效率,并使用伪Zernike矩进行精匹配.实验结果表明,改进后的算法在保证匹...     

基于Fingercode和同态加密的指纹认证方案

针对开放网络中进行指纹身份认证时的双方指纹隐私保护问题,提出了基于Fingercode和同态加密的指纹认证方案。相较传统方案,该方案中服务器端模板以加密形式保存,保护了用户指纹数据的安全性;设计了安全认证协议,使得服务器和用户可以联合计算双方指纹特征的距离而不会泄露各自特征数据的隐私。协议中采用了数据打包技术,能够明显减轻服务器与用户之间的通讯压力和计算复杂度。分析和实验结果表明,该方案具有安全性和一定的实用性。     

运用可变模板进行并行图像处理的一种快速算法

提出了一种在并行机上有效地计算（空间）可变模板的方法，论证了利用一个在图像网格点处计算多项式的优化算法，可以大大减少可变模板的运算量，对于包含非多项式函数的可变模板，可以用函数的泰勒级数展开实现在像素点上的递推运算，详细分析了可变模板中若干常用函数的泰勒展开用于实现模板运算的合理性，准确性和有效性，关于硬件的影响以及该方法的适用范围，也做了讨论。     

Using text classification and multiple concepts to answer e-mails

In text mining, the applications domain of text classification techniques is very broad to include text filtering, word identification, and web page classification, etc. Through text classification techniques, documents can be placed into previously defined classifications in order to save on time costs especially when manual document search methods are employed. This research uses text classification techniques applied to e-mail reply template suggestions in order to lower the burden of customer service personnel in responding to e-mails. Suggested templates allows customer service personnel, using a pre-determined number of templates, to find the needed reply template, and not waste time in searching for relevant answers from too much information available. Current text classification techniques are still single-concept based. This research hopes to use a multiple concept method to integrate the relationship between concepts and classifications which will thus allow easy text classification. Through integration of different concepts and classifications, a dynamically unified e-mail concept can recommend different appropriate reply templates. In so doing, the differences between e-mails can be definitely determined, effectively improving the accuracy of the suggested template. In addition, for e-mails with two or more questions, this research tries to come up with an appropriate reply template. Based on experimental verification, the method proposed in this research effectively proposes a template for e-mails of multiple questions. Therefore, using multiple concepts to display the document topic is definitely a clearer way of extracting information that a document wants to convey when the vector of similar documents is used.     

On-chip template training system and image processing applications using iterative annealing on ACE16k chip

Cellular neural networks proved to be a useful parallel computing system for image processing applications. Cellular neural networks (CNNs) constitute a class of recurrent and locally coupled arrays of identical cells. The connectivity among the cells is determined by a set of parameters called templates. CNN templates are the key parameters to perform a desired task. One of the challenging problems in designing templates is to find the optimal template that functions appropriately for the solution of the intended problem. In this paper, we have implemented the Iterative Annealing Optimization Method on the analog CNN chip to find an optimum template by training a randomly selected initial template. We have been able to show that the proposed system is efficient to find the suitable template for some specific image processing applications.     

A heuristic for the label printing problem

Label printing finds many applications in industry. However, this task is still labor intensive in many printing factories. Since each template can only accommodate a fixed number of labels, an important task is to work out the compositions of templates by allocating suitable labels to each template in order to fulfill the order requirements effectively. The template design could be rather arbitrary, which usually ends up with a lot of excessive printed labels. Enhancing the template design will significantly improve the efficiency of the printing process, and, at the same time, reduce the waste of resources. This motivates the study of more automatic design methods. In this paper, the problem is first formulated as a nonlinear integer programming problem. The main variables in the formulation are the compositions and the printing frequencies of templates. For practical purpose, each type of label is confined to one template only which allows automated packing and handling. The structure of the problems is carefully analyzed and a new algorithm is proposed. Numerical results show that the proposed method is a simple but effective way of generating good template designs.     

基于模板分解和积分图像的快速Kirsch边缘检测

将 Kirsch 算子的模板分解为差值模板和公共模板, 然后通过相邻差值模板的差异比较, 找出边缘强度最大的方向, 并计算出相应的边缘强度值, 避免了将8个方向的边缘强度全部算出, 减少了 Kirsch 算子的模板与原图像的卷积运算. 公共模板和原图像的卷积则利用灰度信息处理时得到的积分图像来加速. 实验证明应用这种快速算法的 Kirsch 边缘检测,运算量比当前主流快速算法(FKC 算法)有较大幅度的减少. 另外, 运用模板分解和积分图像减少卷积运算的思路具有一定通用性, 实例说明此思路可用于一些其它边缘检测和空域滤波算法中.     

Fast Computation of Variant Templates for Parallel Image Processing

In this paper, we propose a method for efficiently computing variant templates for image processing on parallel machines. It is demonstrated that the cumbersome computation of the variant templates can greatly be relieved by the use of an optimised algorithm for evaluating polynomials at grid points. For variant templates containing non-polynomial functions, the Taylor series of the function is exploited for iterative computation purpose. The aspects of validity, accuracy and effectiveness of the series form (for implementing the variant templates) of some commonly used functions are analysed in detail. The influence of hardware, as well as the limitations of the proposed approach are also discussed.     

基于剖分理论的遥感影像模板数据模型

随着数据量的增加和应用需求的扩大,遥感数据的高效组织管理和快捷处理速度已经成为制约遥感技术应用的瓶颈,地球剖分理论和高性能计算为上述问题解决提供了一种可能途径。针对上述问题,结合地球剖分模型,在遥感影像剖分面片的研究基础上,提出了剖分面片模板的概念模型及数据模型,设计了基于剖分面片模板的计算模式,构建了一个小型化剖分遥感影像模板数据库,并通过一个模板化应用的具体实例对上述模型进行了部分验证。实验结果验证了模型的可行性,提高了目标检索的效率。     

Multiple subclass pattern recognition: A maximin correlationapproach

This paper addresses a correlation based nearest neighbor pattern recognition problem where each class is given as a collection of subclass templates. The recognition is performed in two stages. In the first stage the class is determined. Templates for this stage are created using the subclass templates. Assignment into subclasses occurs in the second stage. This two stage approach may be used to accelerate template matching. In particular, the second stage may be omitted when only the class needs to be determined. The authors present a method for optimal aggregation of subclass templates into class templates. For each class, the new template is optimal in that it maximizes the worst case (i.e. minimum) correlation with its subclass templates. An algorithm which solves this maximin optimization problem is presented and its correctness is proved. In addition, test results are provided, indicating that the algorithm's execution time is polynomial in the number of subclass templates. The authors show tight bounds on the maximin correlation. The bounds are functions only of the number of original subclass templates and the minimum element in their correlation matrix. The algorithm is demonstrated on a multifont optical character recognition problem     

基于粒子群优化的模板匹配跟踪算法

针对基于模板匹配的跟踪算法运行速度较慢、成功率较低的问题,提出了一种基于粒子群优化(PSO)的模板匹配跟踪算法。该算法采用粒子群优化算法作为模板匹配算法候选模板的搜索策略,并采用自适应的更新目标模板。首先,在设定的搜索区域内随机采集30个候选模板,计算出个体最优候选模板和全局最优候选模板;其次,根据粒子群优化算法进行迭代求出匹配值最佳的候选模板即为目标;最后,根据最佳候选模板的匹配值大小来自适应更新目标模板。理论分析和实验仿真表明,与基于模板匹配的跟踪算法和基于粗精搜索的模板匹配跟踪算法相比,基于粒子群优化的模板匹配跟踪算法的计算量平均要少91.1%和69.8%,且成功率为原算法的2.02倍和1.94倍。实验结果表明,基于粒子群优化的模板匹配跟踪算法能实现很好的实时跟踪,并且提高了跟踪的鲁棒性。     

An evolutionary approach to pattern-based time series segmentation

Time series data, due to their numerical and continuous nature, are difficult to process, analyze, and mine. However, these tasks become easier when the data can be transformed into meaningful symbols. Most recent works on time series only address how to identify a given pattern from a time series and do not consider the problem of identifying a suitable set of time points for segmenting the time series in accordance with a given set of pattern templates (e.g., a set of technical patterns for stock analysis). However, the use of fixed-length segmentation is an oversimplified approach to this problem; hence, a dynamic approach (with high controllability) is preferable so that the time series can be segmented flexibly and effectively according to the needs of the users and the applications. In view of the fact that this segmentation problem is an optimization problem and evolutionary computation is an appropriate tool to solve it, we propose an evolutionary time series segmentation algorithm. This approach allows a sizeable set of pattern templates to be generated for mining or query. In addition, defining similarity between time series (or time series segments) is of fundamental importance in fitness computation. By identifying the perceptually important points directly from the time domain, time series segments and templates of different lengths can be compared and intuitive pattern matching can be carried out in an effective and efficient manner. Encouraging experimental results are reported from tests that segment both artificial time series generated from the combinations of pattern templates and the time series of selected Hong Kong stocks.     

Discontinuous Galerkin method on three-dimensional tetrahedral grids. The use of template metaprogramming of the C++ language

Many mathematical physics problems have great computational complexity, especially when they are solved on large-scale three-dimensional grids. The discontinuous Galerkin method is just an example of this kind. Therefore, reduction of the amount of computation is very a topical task. One of the possible ways to reduce the amount of computation is to move some of the computations to the compilation stage. With the appearance of templates, C++ provides such an opportunity. The paper demonstrates the use of template metaprogramming to speed up computations in the discontinuous Galerkin method. In addition, template metaprogramming sometimes simplifies the algorithm at the expense of its generalization.     

XTemplate 3.0: spatio-temporal semantics and structure reuse for hypermedia compositions

The use of declarative languages in digital TV systems, as well as IPTV systems, facilitates the creation of interactive applications. However, when an application becomes more complex, with many user interactions, for example, the hypermedia document that describes that application becomes bigger, having many lines of XML code. Thus, specification reuse is crucial for an efficient application development process. This paper proposes the XTemplate 3.0 language, which allows the creation of NCL hypermedia composite templates. Templates define generic structures of nodes and links to be added to a document composition, providing spatio-temporal synchronization semantics to it. The use of hypermedia composite templates aims at facilitating the authoring work, allowing the reuse of hypermedia document common specifications. Using composite templates, hypermedia documents become simpler and easier to be created. The 3.0 version of XTemplate adds new facilities to the XTemplate language, such as the possibility of specifying presentation information, the attribution of values to variables and connector parameters during template processing time and the template ability to extend other templates. As an application of XTemplate, this work extends the NCL 3.0 declarative language with XTemplate, adding semantics to NCL contexts and providing document structure reuse. In addition, this paper also presents two authoring tools: the template processor and the wizard to create NCL documents using templates. The wizard tool allows the author to choose a template included in a template base and create an NCL document using that template. The template processor transforms an NCL document using templates into a standard NCL 3.0 document according to digital TV and IPTV standards.     

在线复合模板模型表示的视觉目标跟踪

目的 视觉目标跟踪中,目标往往受到自身或场景中各种复杂干扰因素的影响,这对正确捕捉所感兴趣的目标信息带来极大的挑战。特别是,跟踪器所用的模板数据主要是在线学习获得,数据的可靠性直接影响到候选样本外观模型表示的精度。针对视觉目标跟踪中目标模板学习和候选样本外观模型表示等问题,采用一种较为有效的模板组织策略以及更为精确的模型表示技术,提出一种新颖的视觉目标跟踪算法。方法 跟踪框架中,将候选样本外观模型表示假设为由一组复合模板和最小重构误差组成的线性回归问题,首先利用经典的增量主成分分析法从在线高维数据中学习出一组低维子空间基向量(模板正样本),并根据前一时刻跟踪结果在线实时采样一些特殊的负样本加以扩充目标模板数据,再利用新组织的模板基向量和独立同分布的高斯—拉普拉斯混合噪声来线性拟合候选目标外观模型,最后估计出候选样本和真实目标之间的最大似然度,从而使跟踪器能够准确捕捉每一时刻的真实目标状态信息。结果 在一些公认测试视频序列上的实验结果表明,本文算法在目标模板学习和候选样本外观模型表示等方面比同类方法更能准确有效地反映出视频场景中目标状态的各种复杂变化,能够较好地解决各种不确定干扰因素下的模型退化和跟踪漂移问题,和一些优秀的同类算法相比,可以达到相同甚至更高的跟踪精度。结论 本文算法能够在线学习较为精准的目标模板并定期更新,使得跟踪器良好地适应内在或外在因素(姿态、光照、遮挡、尺度、背景扰乱及运动模糊等)所引起的视觉信息变化,始终保持其最佳的状态,使得候选样本外观模型的表示更加可靠准确,从而展现出更为鲁棒的性能。