A region-based selective optical flow back-projection for genuine motion vector estimation

Motion vector plays one significant feature in moving object segmentation. However, the motion vector in this application is required to represent the actual motion displacement, rather than regions of visually significant similarity. In this paper, region-based selective optical flow back-projection (RSOFB) which back-projects optical flows in a region to restore the region's motion vector from gradient-based optical flows, is proposed to obtain genuine motion displacement. The back-projection is performed based on minimizing the projection mean square errors of the motion vector on gradient directions. As optical flows of various magnitudes and directions provide various degrees of reliability in the genuine motion restoration, the optical flows to be used in the RSOFB are optimally selected based on their sensitivity to noises and their tendency in causing motion estimation errors. In this paper a deterministic solution is also derived for performing the minimization and obtaining the genuine motion magnitude and motion direction.     

Volumetric three‐dimensional up‐conversion display medium

Abstract— Several rare‐earth‐doped fluoride crystals that are excited to emit visible light by sequential two‐photon absorption have been investigated as display‐medium candidates for static volumetric three‐dimensional displays. Dispersion of powders of these materials in a refractive‐index‐matched polymer is reported because such a medium may result in a scalable display. The scattering problem in such a medium is greatly reduced by index‐matching the polymer to the crystalline particles. An index‐matching condition that optimizes the performance is identified.     

High‐error approximate dictionary search using estimate hash comparisons

A method for finding all matches in a pre‐processed dictionary for a query string q and with at most k differences is presented. A very fast constant‐time estimate using hashes is presented. A tree structure is used to minimize the number of estimates made. Practical tests are performed, showing that the estimate can filter out 99% of the full comparisons for 40% error rates and dictionaries of up to four million words. The tree is found to be efficient up to a 50% error rate. Copyright © 2006 John Wiley & Sons, Ltd.     

Distributed multi-join query processing in data grids

Query processing in data grids is a difficult issue due to the heterogeneous, unpredictable and volatile behaviors of the grid resources. Applying join operations on remote relations in data grids is a unique and interesting problem. However, to the best of our knowledge, little is done to date on multi-join query processing in data grids. An approach for processing multi-join queries is proposed in this paper. Firstly, a relation-reduction algorithm for reducing the sizes of operand relations is presented in order to minimize data transmission cost among grid nodes. Then, a method for scheduling computer nodes in data grids is devised to parallel process multi-join queries. Thirdly, an innovative method is developed to efficiently execute join operations in a pipeline fashion. Finally, a complete algorithm for processing multi-join queries is given. Analytical and experimental results show the effectiveness and efficiency of the proposed approach.     

3D model retrieval using principal plane analysis and dynamic programming

Three dimensional models play an important role in many applications; the problem is how to select the appropriate models from a 3D database rapidly and accurately. In recent years, a variety of shape representations, statistical methods, and geometric algorithms have been proposed for matching 3D shapes or models. In this paper, we propose a 3D shape representation scheme based on a combination of principal plane analysis and dynamic programming. The proposed 3D shape representation scheme consists of three steps. First, a 3D model is transformed into a 2D image by projecting the vertices of the model onto its principal plane. Second, the convex hall of the 2D shape of the model is further segmented into multiple disjoint triangles using dynamic programming. Finally, for each triangle, a projection score histogram and moments are extracted as the feature vectors for similarity searching. Experimental results showed the robustness of the proposed scheme, which resists translation, rotation, scaling, noise, and destructive attacks. The proposed 3D model retrieval method performs fairly well in retrieving models having similar characteristics from a database of 3D models.     

Proposed modification to the CIECAM02 colour appearance model to include the simultaneous contrast effects

A modified CIECAM02 colour appearance model, named CIECAM02‐m2, is proposed to enable CIECAM02 to predict the simultaneous contrast effect. The structure of the CIECAM02‐m2 is a development from CIECAM02, and contains two different procedures for modifying the reference white; one is for lightness and the other is for hue. The model was tested using a data set accumulated in this study and the LUTCHI data. The CV values for three colour attributes between predictions and experimental data were used to evaluate the accuracy of the model. The low CV values obtained show the performance of the CIECAM02‐m2 model to predict the simultaneous contrast effect satisfactorily. © 2007 Wiley Periodicals, Inc. Col Res Appl, 32, 121 – 129, 2007     

巡航导弹机动地形相关系统

研究了一种适用于巡航导弹辅助导航的机动地形相关系统(MTCS)。介绍了 MTCS的工作原理、相关定位算法以及提高定位概率的技术途径,指出了系统设计中的关键技术。另外还讨论了 MTCS 的计算机运算,研究结论对地形辅助系统的设计有参考价值。     

Finding approximate matches in large lexicons

Approximate string matching is used for spelling correction and personal name matching. In this paper we show how to use string matching techniques in conjunction with lexicon indexes to find approximate matches in a large lexicon. We test several lexicon indexing techniques, including n-grams and permuted lexicons, and several string matching techniques, including string similarity measures and phonetic coding. We propose methods for combining these techniques, and show experimentally that these combinations yield good retrieval effectiveness while keeping index size and retrieval time low. Our experiments also suggest that, in contrast to previous claims, phonetic codings are markedly inferior to string distance measures, which are demonstrated to be suitable for both spelling correction and personal name matching.     

采用时间差分算法的九路围棋机器博弈系统

围棋机器博弈是机器博弈中重要的分支之一,其庞大的博弈空间给机器博弈研究者带来了巨大挑战.目前围棋机器博弈多采用静态估值搜索与蒙特卡洛树搜索,故将时间差分算法引入至九路围棋机器博弈系统中,提出基于时间差分算法的围棋机器博弈系统模型,该博弈系统具有一定的自学习能力,能在不断的对弈中逐步提高博弈能力.通过与采用α-β搜索算法的博弈系统进行实际对弈,证明了该方法的可行性.     

面向动态任务合作求解的联盟模型

多Agent系统中,Agent间通过形成联盟达到提高任务求解能力,获取更多收益的目的。主要关注联盟模型的改进和联盟形成阶段的改进,基于ARG(agent,role,group)元模型和学习机制提出了一种采用角色和学习机制的新联盟模型CLAR(coalition model based on learnin gagent and role);在采用合同网协议的CLAR联盟模型中提出了两阶段联盟形成机制;通过捕食者问题实验验证了角色和学习机制的作用,以及两阶段联盟形成机制在减少通讯代价上的作用。