检索结果-内蒙古大学图书馆

SSRN 2023年

作者： Chen, Fang Zhao, Weiling Zhou, Xiaobo School of Electronics and Information Engineering Tongji University Shanghai201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China School of Biomedical Informatics The University of Texas Health Science Center at Houston HoustonTX77030 United States Center for Computational Systems Medicine

The categories of diabetic retinopathy (DR) are interrelated, and different ophthalmologists often give different results for the same fundus image. Automatic cross image retrieval of DR can provide an effective diagnostic solution for ophthalmologists and is of great significance in clinical practice. Cross-image (i.e. left and right fundus images for a patient) information is highly correlated and complementary and can be harnessed to improve various computer vision tasks such as image classification, object detection, image segmentation, and image retrieval. Previous studies did not explore the correlation between lesion areas in left and right fundus images of patients, limiting the effective diagnosis of DR. In this study, we proposed a cross-image siamese graph convolutional network(CIS-GCN) to retrieve fine-grained diabetic retinopathy fundus images. First, we constructed a global-specific structure to obtain the specific features of the left and right eyes. Then, we passed the specific features through the pathological localization network to obtain the location features of the lesion. Finally, a graph convolutional neural network was introduced to construct node sets for the left and right eyes, respectively, to represent relatively consistent regions in the fundus images of patients and learn their correlations. We tested our method using Diabetic Retinopathy Detection datasets and the results showed that our algorithm outperforms other state-of-the-art methods by 2.2% ~ 3.7% in image data retrieval. © 2023, The Authors. All rights reserved.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Greedy signal space recovery algorithm with overcomplete dictionaries in compressive sensing

arXiv

引用

arXiv 2019年

作者： Zhu, Jianchen Zhao, Shengjie Shi, Qingjiang Arce, Gonzalo R. College of Electronics and Information Engineering Tongji University Shanghai201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China School of Software Engineering Tongji University Shanghai201804 China Department of Electrical and Computer Engineering University of Delaware NewarkDE19716 United States

Compressive Sensing (CS) is a new paradigm for the efficient acquisition of signals that have sparse representation in a certain domain. Traditionally, CS has provided numerous methods for signal recovery over an orthonormal basis. However, modern applications have sparked the emergence of related methods for signals not sparse in an orthonormal basis but in some arbitrary, perhaps highly overcomplete, dictionary, particularly due to their potential to generate different kinds of sparse representation of signals. To this end, we apply a signal space greedy method, which relies on the ability to optimally project a signal onto a small number of dictionary atoms, to address signal recovery in this setting. We describe a generalized variant of the iterative recovery algorithm called Signal space Subspace Pursuit (SSSP) for this more challenging setting. Here, using the Dictionary-Restricted Isometry Property (D-RIP) rather than classical RIP, we derive a low bound on the number of measurements required and then provide the proof of convergence for the algorithm. The algorithm in noisy and noise-free measurements has low computational complexity and provides high recovery accuracy. Simulation results show that the algorithm outperforms best compared with the existing recovery algorithms. Copyright © 2019, The Authors. All rights reserved.

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

Modeling and analysis of three properties of mobile interactive systems based on variable Petri nets

arXiv

引用

arXiv 2021年

作者： Yang, Ru Ding, Zhijun Jiang, Changjun Zhou, MengChu The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University The Department of Computer Science and Technology Tongji University Shanghai201804 China The Institute of Systems Engineering Macau University of Science and Technology 999078 China The Department of Electrical and Computer Engineering New Jersey Institute of Technology NewarkNJ07102 United States

Due to the mobility and frequent disconnections, the correctness of mobile interaction systems, such as mobile robot systems and mobile payment systems, are often difficult to analyze. This paper introduces three critical properties of systems, called system connectivity, interaction soundness and data validity, and presents a related modeling and analysis method, based on a kind of Petri nets called VPN. For a given system, a model including component nets and interaction structure nets is constructed by using VPNs. The component net describes the internal process of each component, while the interaction structure net reflects the dynamic interaction between components. Based on this model, three properties are defined and analyzed. The case study of a practical mobile payment system shows the effectiveness of the proposed method. Copyright © 2021, The Authors. All rights reserved.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

Two-stream Hierarchical Similarity Reasoning for Image-text Matching

arXiv

引用

arXiv 2022年

作者： Chen, Ran Wang, Hanli Wang, Lei Kwong, Sam The Department of Computer Science & Technology Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai200092 China Frontiers Science Center for Intelligent Autonomous Systems Shanghai201210 China DeepBlue Academy of Sciences Shanghai200336 China The Department of Computer Science City University of Hong Kong Hong Kong

Reasoning-based approaches have demonstrated their powerful ability for the task of image-text matching. In this work, two issues are addressed for image-text matching. First, for reasoning processing, conventional approaches have no ability to find and use multi-level hierarchical similarity information. To solve this problem, a hierarchical similarity reasoning module is proposed to automatically extract context information, which is then co-exploited with local interaction information for efficient reasoning. Second, previous approaches only consider learning single-stream similarity alignment (i.e., image-to-text level or text-to-image level), which is inadequate to fully use similarity information for image-text matching. To address this issue, a two-stream architecture is developed to decompose image-text matching into image-to-text level and text-to-image level similarity computation. These two issues are investigated by a unifying framework that is trained in an end-to-end manner, namely two-stream hierarchical similarity reasoning network. The extensive experiments performed on the two benchmark datasets of MSCOCO and Flickr30K show the superiority of the proposed approach as compared to existing state-of-the-art methods. Copyright © 2022, The Authors. All rights reserved.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Joint Transmit Power and Trajectory Optimization for Two-Way Multi-Hop UAV Relaying Networks

Joint Transmit Power and Trajectory Optimization for Two-Way...

引用

IEEE International Conference on Communications Workshops, ICC

作者： Bing Li Shengjie Zhao Rongqing Zhang Hao Zhang Hanli Wang Liuqing Yang School of Software Engineering Tongji University Shanghai China National Mobile Communications Research Laboratory Southeast University China Ministry of Education Key Laboratory of Embedded System and Service Computing Tongji University Shanghai China School of Electronic and Information Engineer Tongji University Shanghai China Department of Electrical & Computer Engineering Colorado State University CO USA

ISBN: (数字)9781728174402

ISBN: (纸本)9781728174419

Unmanned aerial vehicle (UAV) has been regarded as a promising means to supplement ground communications. As flying relays, UAVs can be rapidly and flexibly deployed to assist data transmissions in many practical scenarios. In this paper, we investigate a two-way multi-hop UAV relaying network, where there are two ground users as sources and multiple UAVs as relays to help the two ground sources exchange information. We first provide an efficient two-way multi-hop UAV relaying pattern, which can achieve a data rate of 2/4 data packets per time slot with decode-and-forward (DF) protocol. Then, we further formulate a joint transmit power and trajectory optimization problem for the UAVs in this two-way multi-hop relaying scenario. The formulated problem is non-convex which makes it difficult to solve directly, hence we propose an iterative algorithm to obtain an approximate optimal solution. Numerical results demonstrate that our proposed network achieves significant throughput gains.

关键词： Relays Protocols Throughput Trajectory optimization Data communication

来源：评论

学校读者我要写书评

暂无评论

Random Occlusion Recovery with Noise Channel for Person Re-identification 16th

Random Occlusion Recovery with Noise Channel for Person Re-i...

引用

16th International Conference on Intelligent computing, ICIC 2020

作者： Zhang, Kun Wu, Di Yuan, Changan Qin, Xiao Wu, Hongjie Zhao, Xingming Zhang, Lijun Du, Yuchuan Wang, Hanli Institute of Machine Learning and Systems Biology School of Electronics and Information Engineering Tongji University Shanghai China Guangxi Academy of Science Nanning530025 China School of Computer and Information Engineering Nanning Normal University Nanning530299 China School of Computer Science and Technology Soochow University Suzhou215006 China School of Electronic and Information Engineering Suzhou University of Science and Technology Suzhou215009 China Fudan University Shanghai200433 China Key Laboratory of Computational Neuroscience and Brain-Inspired Intelligence Ministry of Education Shanghai China Collaborative Innovation Center of Intelligent New Energy Vehicle and School of Automotive Studies Tongji University Shanghai201804 China The Key Laboratory of Road and Traffic Engineering of the Ministry of Education Department of Transportation Engineering Tongji University Shanghai201804 China Department of Computer Science and Technology the Key Laboratory of Embedded System and Service Computing and Shanghai Institute of Intelligent Science and Technology Tongji University Shanghai200092 China

ISBN: (纸本)9783030607982

Person re-identification, as the basic task of a multi-camera surveillance system, plays an important role in a variety of surveillance applications. However, the current mainstream person re-identification model based on deep learning requires a lot of labeled data, which takes a lot of time and manpower. In this study, we proposed a person re-identification method based on random occlusion recovery with noise channel. We add random occlusion blocks to the original image, use the GAN model for repair, and use the repaired image to expand the original training set. After that, the generated image is adjusted through the noise channel. Finally, we use the enhanced data set to train the baseline model. Our model achieves the state-of-the-art on Market-1501 dataset, proving that the method is effective. © 2020, Springer Nature Switzerland AG.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

arXiv

引用

arXiv 2017年

作者： Lang, Guangming School of Mathematics and Statistics Changsha University of Science and Technology Changsha Hunan410114 China Department of Computer Science and Technology Tongji University Shanghai201804 China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China College of Mathematics and Econometrics Hunan University Changsha Hunan410004 China

In practice, there are many dynamic covering decision information systems, and knowledge reduction of dynamic covering decision information systems is a significant challenge of covering-based rough sets. In this paper, we first study mechanisms of constructing attribute reducts for consistent covering decision information systems when adding objects using related families. We also employ examples to illustrate how to construct attribute reducts of consistent covering decision information systems when adding objects. Then we investigate mechanisms of constructing attribute reducts for consistent covering decision information systems when deleting objects using related families. We also employ examples to illustrate how to construct attribute reducts of consistent covering decision information systems when deleting objects. Finally, the experimental results illustrates that the related family-based methods are effective to perform attribute reduction of dynamic covering decision information systems when object sets are varying with time. Copyright © 2017, The Authors. All rights reserved.

关键词： Rough set theory

来源：评论

学校读者我要写书评

暂无评论

arXiv

引用

arXiv 2017年

作者： Lang, Guangming School of Mathematics and Statistics Changsha University of Science and Technology Changsha Hunan410114 China Department of Computer Science and Technology Tongji University Shanghai201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China College of Mathematics and Econometrics Hunan University Changsha Hunan410004 China

In practical situations, there are many dynamic covering information systems with variations of attributes, but there are few studies on related family-based attribute reduction of dynamic covering information systems. In this paper, we first investigate updated mechanisms of constructing attribute reducts for consistent and inconsistent covering information systems when varying attribute sets by using related families. Then we employ examples to illustrate how to compute attribute reducts of dynamic covering information systems with variations of attribute sets. Finally, the experimental results illustrates that the related family-based methods are effective to perform attribute reduction of dynamic covering information systems when attribute sets are varying with time. Copyright © 2017, The Authors. All rights reserved.

关键词： Information use

来源：评论

学校读者我要写书评

暂无评论

Asymptotic throughput for large-scale wireless networks with general node density

引用

Wireless Networks 2012年第5期19卷 559-575页

作者： Cheng Wang Changjun Jiang Xiang-Yang Li Yunhao Liu Department of Computer Science Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China The Tsinghua National Laboratory for Information Science and Technology (TNLIST) Department of Computer Science and Engineering Tongji University Shanghai China The Department of Computer Science Illinois Institute of Technology Chicago USA The TNLIST and School of Software Tsinghua University Beijing China CSE The Hong Kong University of Science and Technology Kowloon Hong Kong

We study the asymptotic throughput for a large-scale wireless ad hoc network consisting of n nodes under the generalized physical model. We directly compute the throughput of multicast sessions to unify the unicast and broadcast throughputs. We design two multicast schemes based on the so-called ordinary arterial road system and parallel arterial road system, respectively. Correspondingly, we derive the achievable multicast throughput by taking account of all possible cases of n s = ω(1) and 1 ≤ n d ≤ n − 1, rather than only the cases of $$n_s=\Uptheta(n)$$ as in most related works, where n s and n d denote the number of sessions and the number of destinations of each session, respectively. Furthermore, we consider the network with a general node density $$\lambda \in [1,n]$$ , while the models in most related works are either random dense network (RDN) or random extended network (REN) where the density is λ = n and λ = 1, respectively, which further enhances the generality of this work. Particularly, for the special case of our results by letting λ = 1 and $$n_s=\Uptheta(n)$$ , we show that for some regimes of n d , the multicast throughputs achieved by our schemes are better than those derived by the well-known percolation-based schemes.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Approximate dynamic job-shop scheduling optimization for semiconductor assembly based on swarm intelligence

引用

Nanjing Li Gong Daxue Xuebao/Journal of Nanjing University of Science and Technology 2009年第SUPPL. 1期33卷 39-46页

作者： Kang, Qi Yang, Dong-Sheng Wang, Lei Wu, Qi-Di College of Electronics and Information Engineering Shanghai 201804 China Key Laboratory of Embedded System and Computer-service of Ministry of Education Tongji University Shanghai 201804 China

An approximate dynamic optimization method is proposed for a kind of semiconductor assembly job-shop scheduling based on swarm intelligence. In this method, a heuristic swarm stochastic optimization technology, i. e., the particle swarm optimization is adopted to find an optimal operation. sequence and the schedule strategy having the minimal total make-span (TMS) in its admissible sequence space. Meanwhile, a discrete dynamic programming approach is integrated to particle fitness evaluation. The numerical example based on the simplified produce model and the actual produce data is studied to illustrate the effectiveness of the method for job-shop scheduling.

关键词： Job shop scheduling

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：