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

Fast and effective method for stereo matching

Nanjing Youdian Daxue Xuebao (Ziran Kexue Ban)/Journal of Nanjing University of Posts and Telecommunications (Natural Science) 2007年第3期27卷 28-33页

作者： Dong, Yu-Ning College of Communication and Information Engineering Nanjing University of Posts and Telecommunications Nanjing 210003 China State Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China Jiangsu Provincial Key Laboratory of Computer Information Processing Technology Soochow University Suzhou 215006 China

In this paper we propose a novel edge-based, fast and effective stereo matching method. If utilizes various geometrical and local area constraints as well as structural information among edge segments to perform a constraint-directed matching. By employing a heuristic labelling technique, the combinatorial search for isomorphic graphs is greatly reduced in the matching process. The implementation and experimental results are presented to show the efficacy of the proposed method.

关键词： 3D information recovery Binocular vision Stereo matching

来源：评论

学校读者我要写书评

暂无评论

DAMPER: A Dual-Stage Medical Report Generation Framework with Coarse-Grained MeSH Alignment and Fine-Grained Hypergraph Matching

arXiv

引用

arXiv 2024年

作者： Huang, Xiaofei Chen, Wenting Liu, Jie Lu, Qisheng Luo, Xiaoling Shen, Linlin Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University Shenzhen China Department of Electrical Engineering City University of Hong Kong Kowloon Hong Kong National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

Medical report generation is crucial for clinical diagnosis and patient management, summarizing diagnoses and recommendations based on medical imaging. However, existing work often overlook the clinical pipeline involved in report writing, where physicians typically conduct an initial quick review followed by a detailed examination. Moreover, current alignment methods may lead to misaligned relationships. To address these issues, we propose DAMPER, a dual-stage framework for medical report generation that mimics the clinical pipeline of report writing in two stages. In the first stage, a MeSH-Guided Coarse-Grained Alignment (MCG) stage that aligns chest X-ray (CXR) image features with medical subject headings (MeSH) features to generate a rough keyphrase representation of the overall impression. In the second stage, a Hypergraph-Enhanced Fine-Grained Alignment (HFG) stage that constructs hypergraphs for image patches and report annotations, modeling high-order relationships within each modality and performing hypergraph matching to capture semantic correlations between image regions and textual phrases. Finally,the coarse-grained visual features, generated MeSH representations, and visual hypergraph features are fed into a report decoder to produce the final medical report. Extensive experiments on public datasets demonstrate the effectiveness of DAMPER in generating comprehensive and accurate medical reports, outperforming state-of-the-art methods across various evaluation metrics. Copyright © 2024, The Authors. All rights reserved.

关键词： Coarse-grained modeling

来源：评论

学校读者我要写书评

暂无评论

Detecting Optic Disk Based on Structured Learning

Detecting Optic Disk Based on Structured Learning

引用

IEEE International Conference on Robotics and Biomimetics

作者： Zhun Fan Yibiao Rong Xinye Cai Wenji Li Huibiao Lin Zefeng Yu Jiewei Lu Key Laboratory of Digital Signal and Image Processing of Guangdong Provincial College of Engineering Shantou University. 515063 Shantou China College of Engineering Shantou University. 515063 Shantou China school of computer science and technology Nanjing University of Aeronautics and Astronautics Jiangsu China

ISBN: (纸本)9781467396769

Optic Disk (OD) detection plays an important role for fundus image analysis. In this paper, we propose an algorithm for detecting OD mainly based on a classifier model trained by structured learning. Then we use the model to achieve the edge map of OD. Thresholding is performed on the edge map to obtain a binary image. Finally, circle Hough transform is carried out to approximate the boundary of OD by a circle. The proposed algorithm has been evaluated on the public database and obtained promising results. The results (an area overlap and Dices coefficients of 0.8636 and 0.9196, respectively, an accuracy of 0.9770, and a true positive and false positive fraction of 0.9212 and 0.0106) show that the proposed method is a robust tool for the segmentation of OD and is very competitive with the stage-of-the-art methods.

关键词： algorithm detecting method

来源：评论

学校读者我要写书评

暂无评论

On the Generalization of Machine-Learning-aided QoT Estimation in Optical Networks

On the Generalization of Machine-Learning-aided QoT Estimati...

引用

International Conference on Wireless and Optical Communications ( WOCC)

作者： Hanyu Gao Liang Zhang Bin Zhang Xiaoliang Chen Zhaohui Li Guangdong Provincial Key Labratory of Optoelectronic Information Processing Chips and Systems School of Electronics and Information Technology Sun Yat-sen University Guangzhou China Southern Marine Science and Engineering Guangdong Laboratory Zhuhai China Department of Electrical and Computer Engineering George Mason University Fairfax VA USA

This paper presents a composable machine learning method for generalizing the quality-of-transmission (QoT) metric estimation in optical networks. The composable machine learning approach characterizes this metric for lightpaths of arbitrary lengths by compositions of launch, propagation and readout modules. Results verify the feasibility of the design and show its successful application in facilitating autonomous lightpath provisioning.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Goods Anomaly Detection Based on Multi-Branch Feature Extraction and Foreground Mining

Goods Anomaly Detection Based on Multi-Branch Feature Extrac...

引用

IEEE International Symposium on information (IT) in Medicine and Education, ITME

作者： Zhiqian Jia Wei Li Zuoyong Li Zhipeng Mu Lihui Lin Shenghua Teng College of Electronic and Information Engineering Shandong University of Science and Technology Qingdao China Xiamen Air Traffic Management Station of CAAC Xiamen China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control College of Computer and Data Science MinjiangUniversity Fuzhou China Fujian Key Laboratory of Big Data Application and Intellectualization for Tea Industry School of Mathematics and Computer Science Wuyi University Fujian China

ISBN: (数字)9798350356670

ISBN: (纸本)9798350356687

In recent years, significant advancements have been made in the field of anomaly detection. Expanding anomaly detection tasks to new scenarios has become a development avenue. Anomaly detection for the outer packaging of supermarket goods is a challenging task due to the diversity of goods’ appearances, which results in some detection methods suffering from limited sensitivity to anomalies and inadequate target mining. To address these issues, we propose a novel unsupervised anomaly detection method based on multi-branch feature extraction and foreground cosine structure mining strategy. Firstly, we use anomaly synthesis technique to enhance the model’s perception of anomalies and construct more precise decision boundaries in the feature space. Secondly, a multi-branch feature extractor extracts and integrates multi-level and multi-scale features, providing rich texture and semantic information to improve the model’s adaptability in real-world scenarios. Finally, the foreground cosine loss focuses on target mining while supplementing local structural information, further enhancing the model’s ability to detect subtle anomalies. To validate the effectiveness of the proposed method, extensive experiments were conducted on the GoodsAD dataset, sampled from supermarket scenarios. Experimental results show that this method achieves significant performance in image-level detection and pixel-level localization.

关键词： Location awareness Adaptation models Sensitivity Semantics Education Packaging Feature extraction information technology Anomaly detection Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

Gaf-Net: Graph Attention Fusion Network for Multi-View Semi-Supervised Classification

SSRN

引用

SSRN 2023年

作者： Song, Na Du, Shide Wu, Zhihao Zhong, Luying Wang, Shiping School of Computer Science and Technology Hainan University Hainan570228 China School of Mechanical Electrical and Information Engineering Putian University Putian351100 China College of Computer and Data Science Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China

Multi-view semi-supervised classification is a typical task to classify data using a small amount of supervised information, which has attracted a lot of attention from researchers in past years. In practice, existing methods focus more on extracting spatial or spectral features using graph convolutional neural networks without considering the diversity and variability of graph structures and the contributions of different views. To address this challenge, a network framework termed graph attention fusion network is proposed, which is comprised of two phases: view-specific feature embedding and graph embedding fusion. In the former feature extraction stage, view-specific feature embedding module can flexibly focus on the neighborhood calculation operation to learn a weight for each neighboring node. In the latter feature fusion stage, the graph embedding fusion module is performed by complementarity and consistency to fuse these embeddings for semi-supervised classification tasks. We conduct extensive experiments in terms of semi-supervised classification on real-world datasets to validate the superiority of the proposed method over various existing state-ofthe-art methods. © 2023, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Online Attentive Kernel-Based Temporal Difference Learning

arXiv

引用

arXiv 2022年

作者： Yang, Guang Chen, Xingguo Yang, Shangdong Wang, Huihui Dong, Shaokang Gao, Yang The the Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications National Engineering Laboratory for Agri-Product Quality Traceability Beijing Technology and Business University China The State Key Laboratory for Novel Software Technology Nanjing University China The PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology China

With rising uncertainty in the real world, online Reinforcement Learning (RL) has been receiving increasing attention due to its fast learning capability and improving data efficiency. However, online RL often suffers from complex Value Function Approximation (VFA) and catastrophic interference, creating difficulty for the deep neural network to be applied to an online RL algorithm in a fully online setting. Therefore, a simpler and more adaptive approach is introduced to evaluate value function with the kernel-based model. Sparse representations are superior at handling interference, indicating that competitive sparse representations should be learnable, non-prior, non-truncated and explicit when compared with current sparse representation methods. Moreover, in learning sparse representations, attention mechanisms are utilized to represent the degree of sparsification, and a smooth attentive function is introduced into the kernel-based VFA. In this paper, we propose an Online Attentive Kernel-Based Temporal Difference (OAKTD) algorithm using two-timescale optimization and provide convergence analysis of our proposed algorithm. Experimental evaluations showed that OAKTD outperformed several Online Kernel-based Temporal Difference (OKTD) learning algorithms in addition to the Temporal Difference (TD) learning algorithm with Tile Coding on public Mountain Car, Acrobot, CartPole and Puddle World tasks. Copyright © 2022, The Authors. All rights reserved.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Hybridizing infeasibility driven and constrained-domination principle with MOEA/D for constrained multiobjective evolutionary optimization

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8916卷 249-261页

作者： Lin, Huibiao Fan, Zhun Cai, Xinye Li, Wenji Wang, Sheng Li, Jian Zhang, Chengdian School of Engineering Shantou University Guangdong515063 China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics NanjingJiangsu210016 China College of Science Shantou University Guangdong515063 China Guangdong Provincial Key Laboratory of Digital Signal and Image Processing Techniques Shantou University Guangdong515063 China

This paper presents a novel multiobjective constraint handling approach, named as MOEA/D-CDP-ID, to tackle constrained optimization problems. In the proposed method, two mechanisms, namely infeasibility driven (ID) and constrained-domination principle (CDP) are embedded into a prominent multiobjective evolutionary algorithm called MOEA/D. Constraineddomination principle defined a domination relation of two solutions in constraint handling problem. Infeasibility driven preserves a proportion of marginally infeasible solutions to join the searching process to evolve offspring. Such a strategy allows the algorithm to approach the constraint boundary from both the feasible and infeasible side of the search space, thus resulting in gaining a Pareto solution set with better distribution and convergence. The efficiency and effectiveness of the proposed approach are tested on several well-known benchmark test functions. In addition, the proposed MOEA/D-CDP-ID is applied to a real world application, namely design optimization of the two-stage planetary gear transmission system. Experimental results suggest that MOEA/D-CDP-ID can outperform other state-of-the-art algorithms for constrained multiobjective evolutionary optimization. © Springer International Publishing Switzerland 2014.

关键词： Constraint handling

来源：评论

学校读者我要写书评

暂无评论

Systematic Resource Allocation in Cloud RAN with Caching as a Service under Two Timescales

Systematic Resource Allocation in Cloud RAN with Caching as ...

引用

作者： Tang, Jianhua Quek, Tony Q. S. Chang, Tsung-Hui Shim, Byonghyo Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Hunan Normal University Changsha410081 China Institute of New Media and Communications Department of Electrical and Computer Engineering Seoul National University Seoul08826 Korea Republic of Information Systems Technology and Design Pillar Singapore University of Technology and Design Singapore487372 Singapore Department of Electronic Engineering Kyung Hee University Yongin17104 Korea Republic of School of Science and Engineering Chinese University of Hong Kong Shenzhen518172 China Shenzhen Research Institute of Big Data Shenzhen518172 China Department of Electrical and Computer Engineering Institute of New Media and Communications Seoul National University Seoul08826 Korea Republic of

Recently, cloud radio access network (C-RAN) with caching as a service (CaaS) was proposed to merge the functionalities of communication, computing, and caching (CCC) together. In this paper, we dissect the interactions of CCC in C-RAN with CaaS from two dimensions: physical resource dimension and time dimension. In the physical resource dimension, we identify how to segment the baseband unit (BBU) pool resources (i.e., computation and storage) into different types of virtual machines (VMs). In the time dimension, we address how the long-term resource segmentation in the BBU pool impacts on the short-term transmit beamforming at the remote radio heads. We formulate the problem as a stochastic mixed-integer nonlinear programming (SMINLP) to minimize the system cost, including the server cost, VM cost and wireless transmission cost. After a series of approximation, including sample average approximation, successive convex approximation, and semidefinite relaxation, the SMINLP is approximated as a global consensus problem. The alternating direction method of multipliers (ADMM) is utilized to obtain the solution in a parallel fashion. Simulation results verify the convergence of our proposed algorithm, and also confirm that the proposed scheme is more cost-saving than that without considering the integration of CCC. © 1972-2012 IEEE.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

CrossDiff: Exploring Self-Supervised Representation of Pansharpening via Cross-Predictive Diffusion Model

arXiv

引用

arXiv 2024年

作者： Xing, Yinghui Qu, Litao Zhang, Shizhou Zhang, Kai Zhang, Yanning Ran, Lingyan Zhang, Xiuwei Yin, Hanlin The Shaanxi Provincial Key Laboratory of Speech and Image Information Processing The National Engineering Laboratory for Integrated Aerospace-GroundOcean Big Data Application Technology School of Computer Science Northwestern Polytechnical University Xi’an710072 China The Research Development Institute Northwestern Polytechnical University in Shenzhen Shenzhen518057 China

Fusion of a panchromatic (PAN) image and corresponding multispectral (MS) image is also known as pansharpening, which aims to combine abundant spatial details of PAN and spectral information of MS. Due to the absence of high-resolution MS images, available deep-learning-based methods usually follow the paradigm of training at reduced resolution and testing at both reduced and full resolution. When taking original MS and PAN images as inputs, they always obtain sub-optimal results due to the scale variation. In this paper, we propose to explore the self-supervised representation of pansharpening by designing a cross-predictive diffusion model, named CrossDiff. It has two-stage training. In the first stage, we introduce a cross-predictive pretext task to pre-train the UNet structure based on conditional DDPM, while in the second stage, the encoders of the UNets are frozen to directly extract spatial and spectral features from PAN and MS, and only the fusion head is trained to adapt for pansharpening task. Extensive experiments show the effectiveness and superiority of the proposed model compared with state-of-the-art supervised and unsupervised methods. Besides, the cross-sensor experiments also verify the generalization ability of proposed self-supervised representation learners for other satellite’s datasets. We will release our code for reproducibility. © 2024, CC BY.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：