共查询到20条相似文献，搜索用时 500 毫秒
1.
Automated visual inspection of fabric defects is a challenge due to the diversity of the fabric patterns and defects. Although there are many automated inspection methods of identifying fabric defects, most methods process images containing the fabric patterns classified as the crystallographic group p1 and implicitly assume the fabric patterns are arranged in fixed directions. This paper proposes an automated defect inspection method which calibrates the fabric image and then segments the image into none-overlapped sub-images which are called lattices. Thus, the image is represented by hundreds of lattices sharing some common features instead of millions of unrelated pixels. The defect inspection problem is transformed to comparing the lattice similarity based on the shared features and identifying the defective lattices as the outliers in the feature space. The performance of the proposed method ILS (Isotropic Lattice Segmentation) is evaluated on the databases of images containing fabric patterns arranged orthogonally and arbitrarily. By comparing the resultant images with ground-truth images, an overall detection rate of 0.955 is achieved, which is comparable with the state-of-the-art methods. 相似文献
2.
设计了2种全新的自动掌纹分割算法.第1种利用一致局部二进制模式的频数统计逐块检测背景区域;第2种根据相邻区域(块)之间的纹理差异容忍度,将相似的区域合二为一,差异较大的标记为两类区域.然后通过区域生长分别得到掌纹前景和背景.2种算法在标准掌纹档案库中都得到了成功应用. 相似文献
3.
Quantitative feedback theory (QFT) is a powerful design technique for robust feedback control systems with plant uncertainties. In applying QFT to design robust feedback control systems, the generation of plant templates is an essential step. For a system with affinely dependent parameters and the parameter domain is a box, it is well known that the boundary of a plant template is included in the image of the set of edges of the parameter domain box. One can obtain the plant template from the image of the set of edges. However, this approach to the generation of the plant template leads to heavy computational burden since it wastes much computational effort computing the images of points on edges which lie in the interior of the plant template. In this paper, an efficient algorithm is proposed to identify, from an edge of the parameter domain box, the set of parameter points whose image lies in the interior of the plant template. The computational burden for generating the plant template thus can be obviously reduced by eliminating the identified sets of parameter points in the plant template generation procedure. Numerical examples are included to illustrate the efficiency of the algorithm. 相似文献
4.
一种新型的基于数学形态学和颜色特征车牌定位算法 总被引：4，自引：0，他引：4
在分析了车牌定位现有算法优缺点的基础上,本文提出一种新型的综合利用车牌纹理特征、颜色特征和几何特征的快速定位算法.该算法利用数学形态学充分挖掘车牌纹理特征以及消除噪声干扰.把图像分割为若干子区域,利用纹理条件和颜色条件判断,对各子区域进行独特的分类和聚类融合,最终由粗至细精确地定位出车牌所在位置,为后续车牌字符的分割识别步骤打下良好基础.实验结果表明,对于各种情况下的车牌图像,该算法都能有效地对车牌进行定位,具有定位准确率高,运行速度快,抗干扰性强的特点. 相似文献
5.
In this paper, we propose a novel approach to automatic generation of summary templates from given collections of summary articles. We first develop an entity-aspect LDA model to simultaneously cluster both sentences and words into aspects. We then apply frequent subtree pattern mining on the dependency parse trees of the clustered and labeled sentences to discover sentence patterns that well represent the aspects. Finally, we use the generated templates to construct summaries for new entities. Key features of our method include automatic grouping of semantically related sentence patterns and automatic identification of template slots that need to be filled in. Also, we implement a new sentence compression algorithm which use dependency tree instead of parser tree. We apply our method on five Wikipedia entity categories and compare our method with three baseline methods. Both quantitative evaluation based on human judgment and qualitative comparison demonstrate the effectiveness and advantages of our method. 相似文献
6.
We argue that the quality of a summary can be evaluated based on how many concepts in the original document(s) that can be preserved after summarization. Here, a concept refers to an abstract or concrete entity or its action often expressed by diverse terms in text. Summary generation can thus be considered as an optimization problem of selecting a set of sentences with minimal answer loss. In this paper, we propose a document concept lattice that indexes the hierarchy of local topics tied to a set of frequent concepts and the corresponding sentences containing these topics. The local topics will specify the promising sub-spaces related to the selected concepts and sentences. Based on this lattice, the summary is an optimized selection of a set of distinct and salient local topics that lead to maximal coverage of concepts with the given number of sentences. Our summarizer based on the concept lattice has demonstrated competitive performance in Document Understanding Conference 2005 and 2006 evaluations as well as follow-on tests. 相似文献
7.
8.
Several techniques are available for implementing a scalar digital filter using lattice and ladder structures which are known to yield low noise realizations. Of these, the lattice and ladder structures proposed by Gray and Markel have the advantage of being internally scaled. Block implementation of a scalar digital filter offers a number of advantages. In this paper, new algorithms to realize block digital filters in the form of cascaded lattice or ladder two-pairs are proposed. Block lattice and ladder structures similar to Gray and Markel's scalar structure are obtained by using Levinson recursion. Also, normalized block lattice and ladder structures are developed. 相似文献
9.
A multigroup version of the method of successive generations is used to determine the multiplication factors of unmoderated and unreflected periodic lattices of identical fissile components. The lattice components must be one-dimensional (i.e. spheres, infinitely long cylinders or infinite slabs). Lattices of nearly one-dimensional components (cubes or long cylinders) may, however, be approximately treated. The lattice components may be arranged in a linear, planar or cuboidal manner; the permissible component arrangements being limited by the lattice component geometry. 相似文献
10.
用模板生成用户所需的调查表等信息是日常工作中最常用的技巧,针对模板生成的文件,提出自动采集基于模板生成文档信息的思路,并给出一个实例。在不同的信息收集系统中,采用本文的思路和方法,可以大大减轻信息收集者的工作量。 相似文献
11.
Matheus A. Marins Felipe M.L. Ribeiro Sergio L. Netto Eduardo A.B. da Silva 《Journal of The Franklin Institute》2018,355(4):1913-1930
Similarity-based modeling (SBM) is a technique whereby the normal operation of a system is modeled in order to detect faults by analyzing their similarity to the normal system states. First proposed around two decades ago, SBM has been successfully used for fault detection in varied systems. In spite of this success, there is not much study performed in the literature regarding its design, that encompasses both similarity metrics and model training. This work aims at contributing with an in-depth study of SBM for fault detection considering these two design aspects. This is done in the context of proposing a novel system to identify rotating-machinery faults based on SBM, that is employed either as a standalone classifier or to generate features for a random forest classifier. New approaches for training the model and new similarity metrics are investigated. Experimental results are shown for the recently developed Machinery Fault Database (MaFaulDa) that has an extensive set of sequences and fault types, and for the Case Western Reserve University (CWRU) bearing database. Results for both databases indicate that the proposed techniques increase the generalization power of the similarity model and of the associated classifier, achieving accuracies of 98.5% on MaFaulDa and 98.9% on CWRU database. 相似文献
12.
定制科技期刊LaTeX论文模板的思路和实践 总被引：1，自引：1，他引：0
【目的】为科技期刊量身定制简洁高效的LaTeX模版,提高编辑工作质量和效率并指导作者规范写作。【方法】 结合编辑部多年LaTeX模板的使用经验,通过实践总结,提出新一代科技期刊论文模板的设计理念和方法。通过与其他模版的对比,介绍了新模版实现的功能和优势。【结果】设计的LaTeX模版使作者自行排版成为可能,使作者容易上手,并指导作者规范写作,同时大大提高编辑工作效率。【结论】量身定制科技期刊LaTeX论文模版,能提高编辑工作质量和效率,并能指导作者提高论文质量。 相似文献
13.
针对创新社区日益增长的海量信息阻碍了用户对知识进行有效获取和创造的现状,将模糊形式概念分析（FFCA）理论应用于创新社区领先用户的个性化知识推荐研究。首先识别出创新社区领先用户并对其发帖内容进行文本挖掘得到用户——知识模糊形式背景,然后构建带有相似度的模糊概念格对用户偏好进行建模,最后基于模糊概念格和协同过滤的推荐算法为领先用户提供个性化知识推荐有序列表。以手机用户创新社区为例,验证了基于FFCA的领先用户个性化知识推荐方法的可行性,有助于满足用户个性化知识需求,促进用户更好地参与社区知识创新。 相似文献
14.
《Information processing & management》2020,57(4):102248
In information retrieval, the task of query performance prediction (QPP) is concerned with determining in advance the performance of a given query within the context of a retrieval model. QPP has an important role in ensuring proper handling of queries with varying levels of difficulty. Based on the extant literature, query specificity is an important indicator of query performance and is typically estimated using corpus-specific frequency-based specificity metrics However, such metrics do not consider term semantics and inter-term associations. Our work presented in this paper distinguishes itself by proposing a host of corpus-independent specificity metrics that are based on pre-trained neural embeddings and leverage geometric relations between terms in the embedding space in order to capture the semantics of terms and their interdependencies. Specifically, we propose three classes of specificity metrics based on pre-trained neural embeddings: neighborhood-based, graph-based, and cluster-based metrics. Through two extensive and complementary sets of experiments, we show that the proposed specificity metrics (1) are suitable specificity indicators, based on the gold standards derived from knowledge hierarchies (Wikipedia category hierarchy and DMOZ taxonomy), and (2) have better or competitive performance compared to the state of the art QPP metrics, based on both TREC ad hoc collections namely Robust’04, Gov2 and ClueWeb’09 and ANTIQUE question answering collection. The proposed graph-based specificity metrics, especially those that capture a larger number of inter-term associations, proved to be the most effective in both query specificity estimation and QPP. We have also publicly released two test collections (i.e. specificity gold standards) that we built from the Wikipedia and DMOZ knowledge hierarchies. 相似文献
15.
The evolution of carbon dioxide bubbles dissolving in water is experimentally examined using long microchannels. We study the coupling between bubble hydrodynamics and dissolution in confined geometries. The gas impregnation process in liquid produces significant flow rearrangements. Depending on the initial volumetric liquid fraction, three operating regimes are identified, namely saturating, coalescing, and dissolving. The morphological and dynamical transition from segmented to dilute bubbly flows is investigated. Tracking individual bubbles along the flow direction is used to calculate the temporal evolution of the liquid volumetric fraction and the average flow velocity near reference bubbles over long distances. This method allows us to empirically establish the functional relationship between bubble size and velocity. Finally, we examine the implication of this relationship during the coalescing flow regime, which limits the efficiency of the dissolution process. 相似文献
16.
17.
《Information processing & management》2023,60(5):103468
Assessing the similarity of scientific outputs based on an indicator has not been addressed much so far. The topic, however, may find several potential applications which can help enrich procedures of ranking, research monitoring, and scientific policy-making. The present study offers a new method to quantify such similarities based on keyword co-occurrence matrices. In the proposed method, first, the keyword co-occurrence networks are transformed into their associated newly defined fuzzy sets, named as scientosemantic domains. Then, a fuzzy distance between the two domains is found based on an arbitrary indicator. In this paper, the three indicators of frequency, development and investment appeal are used. The proposed method is implemented for five types of concept comparison. For each type, concepts are represented by a canonical keyword with different field codes. Scientosemantic domains of concepts are sourced out of bibliometric data obtained from appropriate queries on SCOPUS. Number of keywords used to define scientosemantic domains ranges from about 30 to 800. Since indicator-based comparison of scientosemantic domains are not dealt with in the literature, the obtained distances between concepts are verified by qualitative and expert evaluations. For all cases, frequency- and development-based distances are less than those for investment appeal; while crisp distances for the latter extend beyond 0.6, the former does not exceed 0.3. The greatest distances are observed for investment appeal in technology-related keywords. 相似文献
18.
Roi Blanco Gianmarco De Francisci Morales Fabrizio Silvestri 《Information processing & management》2015
We present IntoNews, a system to match online news articles with spoken news from a television newscasts represented by closed captions. We formalize the news matching problem as two independent tasks: closed captions segmentation and news retrieval. The system segments closed captions by using a windowing scheme: sliding or tumbling window. Next, it uses each segment to build a query by extracting representative terms. The query is used to retrieve previously indexed news articles from a search engine. To detect when a new article should be surfaced, the system compares the set of retrieved articles with the previously retrieved one. The intuition is that if the difference between these sets is large enough, it is likely that the topic of the newscast currently on air has changed and a new article should be displayed to the user. In order to evaluate IntoNews, we build a test collection using data coming from a second screen application and a major online news aggregator. The dataset is manually segmented and annotated by expert assessors, and used as our ground truth. It is freely available for download through the Webscope program.1 Our evaluation is based on a set of novel time-relevance metrics that take into account three different aspects of the problem at hand: precision, timeliness and coverage. We compare our algorithms against the best method previously proposed in literature for this problem. Experiments show the trade-offs involved among precision, timeliness and coverage of the airing news. Our best method is four times more accurate than the baseline. 相似文献
19.
[目的/意义] 构建基于用户兴趣标签的网络社团识别模型（Fuzzy Interests and User Hybrid Model,FIUHM）,揭示用户兴趣与社团形式概念间的模糊层级关系,实现多粒度属性与社团拓扑结构的层次聚类。[方法/过程] 通过抽取豆瓣电影社区数据,实现基于用户标签的兴趣强度语义标注,利用用户相似度,获取社区用户间兴趣语义距离;将网络社区的领接矩阵映射为社团形式背景,构建社团模糊概念格,建立社团形式概念及其偏序关系集,完成社团形式概念建模;通过计算社团稳定指数,识别网络社团边界,并聚类最大独立社团,实现兴趣社团的在线检测。[结果/结论] 通过对比实验,验证了FIUHM模型的有效性,实验表明将模糊形式概念分析引入网络社团识别研究,利用模糊概念格的偏序关系建模用户节点间的兴趣相似度,有利于提高社团识别的分辨率。 相似文献
20.
具有区间数的多目标格序决策方法研究 总被引：14，自引：1，他引：14
运用格序决策理论对区间数的排序问题进行研究，提出了一种新方法。在目前格序决策前期研究成果和以往的规范型决策研究的基础上，基于格提出了赋值函数的概念，并定义了两元素之间的“偏好距离”，然后证明了区间数构成的集合按照一定的比较规则构成一个偏序，求出区间数集(满足格序特征)中元素间的“偏好距离”该方法使用了比全序可更真实地反映决策者偏好结构的格序，它对提高决策的科学性和实用性有重要意义，最后给出了一个算例。 相似文献