排序方式: 共有17条查询结果,搜索用时 78 毫秒
1.
全监督语义分割网络在训练时需要耗费大量的人力与时间成本来标注样本。所以减少人工标注样本的时间,同时提升语义分割效果,对于深度学习网络的快速部署和应用推广具有重要意义。提出一种基于改进图像风格迁移网络(CycleGAN-AD)的样本扩充方法。以CycleGAN为基础,在生成器中引入注意力机制并将深度残差网络改为密集连接卷积网络。利用计算机批量产生自带标签的模拟样本,使用CycleGAN-AD网络将模拟样本风格迁移成为真实样本风格(标签不变),并用于扩充训练样本。对石墨电极的钢印字符进行语义分割的实验结果表明,采用CycleGAN-AD网络进行样本扩充后,其分割效果得到显著提升,MIoU值最高升至0.826 0。可见,提出的样本扩充方法有希望在显著减少人工标注工作量的同时,获得高质量的训练样本。 相似文献
2.
Hai?HeEmail author Weiyi?Meng Clement?Yu Zonghuan?Wu 《The VLDB Journal The International Journal on Very Large Data Bases》2004,13(3):256-273
An increasing number of databases are becoming Web accessible through form-based search interfaces, and many of these sources are database-driven e-commerce sites. It is a daunting task for users to access numerous Web sites individually to get the desired information. Hence, providing a unified access to multiple e-commerce search engines selling similar products is of great importance in allowing users to search and compare products from multiple sites with ease. One key task for providing such a capability is to integrate the Web search interfaces of these e-commerce search engines so that user queries can be submitted against the integrated interface. Currently, integrating such search interfaces is carried out either manually or semiautomatically, which is inefficient and difficult to maintain. In this paper, we present WISE-Integrator - a tool that performs automatic integration of Web Interfaces of Search Engines. WISE-Integrator explores a rich set of special metainformation that exists in Web search interfaces and uses the information to identify matching attributes from different search interfaces for integration. It also resolves domain differences of matching attributes. In this paper, we also discuss how to automatically extract information from search interfaces that is needed by WISE-Integrator to perform automatic interface integration. Our experimental results, based on 143 real-world search interfaces in four different domains, indicate that WISE-Integrator can achieve high attribute matching accuracy and can produce high-quality integrated search interfaces without human interactions.Received: 2 January 2004, Accepted: 25 March 2004, Published online: 12 August 2004Edited by: M. Carey 相似文献
3.
Many databases have become Web-accessible through form-based search interfaces (i.e., HTML forms) that allow users to specify
complex and precise queries to access the underlying databases. In general, such a Web search interface can be considered
as containing an interface schema with multiple attributes and rich semantic/meta-information; however, the schema is not
formally defined in HTML. Many Web applications, such as Web database integration and deep Web crawling, require the construction
of the schemas. In this paper, we first propose a schema model for representing complex search interfaces, and then present
a layout-expression based approach to automatically extract the logical attributes from search interfaces. We also rephrase
the identification of different types of semantic information as a classification problem, and design several Bayesian classifiers
to help derive semantic information from extracted attributes. A system, WISE-iExtractor, has been implemented to automatically
construct the schema from any Web search interfaces. Our experimental results on real search interfaces indicate that this
system is highly effective. 相似文献
4.
基于FLUENT的后混合磨料水射流喷嘴内流场的数值模拟 总被引:2,自引:0,他引:2
以后混合磨料水射流喷嘴为研究对象,基于多相流动的欧拉模型,应用FLUENT流体分析软件对几种典型后混合磨料喷嘴的内流场进行数值模拟和仿真,得到压力分布、速度分布、湍流能量分布.结果表明:喷嘴内由于涡旋的形成损耗了部分能量,使得射流出口速度和动能明显降低;存在一个最优圆柱长度使得磨料出口速度达到最大值,其长度为喷嘴出口直径的23~37倍时,磨料得到最高的出口速度;喷嘴内流体紊动能的分布主要集中在喷嘴近壁区和几何形状变化较大的区域. 相似文献
5.
6.
A methodology to retrieve text documents from multiple databases 总被引:1,自引:0,他引:1
Yu C. King-Lup Liu Weiyi Meng Zonghuan Wu Rishe N. 《Knowledge and Data Engineering, IEEE Transactions on》2002,14(6):1347-1361
This paper presents a methodology for finding the n most similar documents across multiple text databases for any given query and for any positive integer n. This methodology consists of two steps. First, the contents of databases are indicated approximately by database representatives. Databases are ranked using their representatives with respect to the given query. We provide a necessary and sufficient condition to rank the databases optimally. In order to satisfy this condition, we provide three estimation methods. One estimation method is intended for short queries; the other two are for all queries. Second, we provide an algorithm, OptDocRetrv, to retrieve documents from the databases according to their rank and in a particular way. We show that if the databases containing the n most similar documents for a given query are ranked ahead of other databases, our methodology will guarantee the retrieval of the n most similar documents for the query. When the number of databases is large, we propose to organize database representatives into a hierarchy and employ a best-search algorithm to search the hierarchy. It is shown that the effectiveness of the best-search algorithm is the same as that of evaluating the user query against all database representatives. 相似文献
7.
8.
9.
通过对椭圆封头的几何特征和数控加工工艺进行分析,得出其制造难点在于控制内、外曲面等壁厚达到要求,通过求解内、外曲面轮廓的参数方程,并对不同数控编程方法进行分析,得到该椭圆封头的数控加工及数控编程方案,解决了该椭圆封头的数控加工问题. 相似文献
10.