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

SiamCMN: Jointing cycle memory and correlation network for Siamese object tracking

Optik 2023年第1期286卷

作者： Zhang, Baohua Zhang, Nianchao Li, Yongxiang Lu, Xiaoqi Gu, Yu Li, Jianjun School of Information Engineering Inner Mongolia University of Science and Technology Baotou Inner Mongolia014010 China Inner Mongolia Key Laboratory of Pattern Recognition and Intelligent Image Processing Baotou Inner Mongolia014010 China School of Information Engineering Mongolia Industrial University Hohhot Inner Mongolia010051 China College of Energy and Transportation Engineering Inner Mongolia Agricultural University Hohhot Inner Mongolia010018 China

In heterogeneous scenes with latent non-deterministic states, template features determine the performance of the Siamese network-based trackers, however, background noise is easily introduced in the search area matching process, which causes the trackers lack sufficient discrimination. To solve this problem, this paper proposes an object tracking algorithm based on the cyclic memory module. Firstly, the extracted primary features are mapped to the cyclic spatial memory network, the spatial memory unit is used to store the interference components. On this basis, the cyclic structure is used to filter out the interference components and refine the template features. Then a channel correlation network is introduced into the proposed method, which can mine semantic complementary information and capture global contextual relevance by modeling the positive and the negative correlation between the channels. The experimental results on tracking benchmarks such as OTB50, OTB100, UAV123, VOT2018, GOT10k, and LaSOT have shown that the proposed method outperforms recent representative algorithms in tracking accuracy in challenging scenarios. © 2023 Elsevier GmbH

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Novel way achieving 3D reconstruction of actual human face using multi images

引用

Tien Tzu Hsueh Pao/Acta Electronica Sinica 2008年第4期36卷 661-666页

作者： Hou, Wen-Guang Chan, Tai-Wai Ding, Ming-Yue Image Processing and Intelligent Control Key Laboratory Institute for Pattern Recognition and Artificial Intelligence Huazhong University of Science and Technology Wuhan 430074 China Industrial Centre Hong Kong Polytechnic University Hong Kong Hong Kong

A novel way achieving geometrical reconstruction of actual human face through projecting two types of texture on face in short time is advanced. The first type texture is stripe which is used to establish parallax grid between images. Taking into account of its results, the second type projecting texture is used to match by virtue of its abundant traits. After realizing geometrical reconstruction, the paper provides a general way about achieving actual texture reconstruction by the outer spherical surface surrounding object. In order to uniform color, it deals with parts of images in conjunct region and makes the color change meeting a certain function on condition of keeping their original information mostly. Results show this way can improve reconstruction quality and decrease complicacy of algorithm.

关键词： image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Generalization Properties of hyper-RKHS and its Applications

arXiv

引用

arXiv 2018年

作者： Liu, Fanghui Shi, Lei Huang, Xiaolin Yang, Jie Suykens, Johan A.K. Department of Electrical Engineering ESAT-STADIUS KU Leuven Kasteelpark Arenberg 10 LeuvenB-3001 Belgium Shanghai Key Laboratory for Contemporary Applied Mathematics School of Mathematical Sciences Fudan University Shanghai200433 China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Institute of Medical Robotics Shanghai Jiao Tong University Shanghai200240 China

This paper generalizes regularized regression problems in a hyper-reproducing kernel Hilbert space (hyper-RKHS), illustrates its utility for kernel learning and out-of-sample extensions, and proves asymptotic convergence results for the introduced regression models in an approximation theory view. Algorithmically, we consider two regularized regression models with bivariate forms in this space, including kernel ridge regression (KRR) and support vector regression (SVR) endowed with hyper-RKHS, and further combine divide-and-conquer with Nyström approximation for scalability in large sample cases. This framework is general: the underlying kernel is learned from a broad class, and can be positive definite or not, which adapts to various requirements in kernel learning. Theoretically, we study the convergence behavior of regularized regression algorithms in hyper-RKHS and derive the learning rates, which goes beyond the classical analysis on RKHS due to the non-trivial independence of pairwise samples and the characterisation of hyper-RKHS. Experimentally, results on several benchmarks suggest that the employed framework is able to learn a general kernel function form an arbitrary similarity matrix, and thus achieves a satisfactory performance on classification tasks. Copyright © 2018, The Authors. All rights reserved.

关键词： Approximation theory

来源：评论

学校读者我要写书评

暂无评论

Predicting functional impact of single amino acid polymorphisms by integrating sequence and structural features

Predicting functional impact of single amino acid polymorphi...

引用

IEEE International Conference on Systems Biology

作者： Mingjun Wang Hong-Bin Shen Tatsuya Akutsu Jiangning Song State Engineering Laboratory for Industrial Enzymes Tianjin Institute of Industrial Biotechnology Chinese Academy of Sciences (CAS) Tianjin China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai China Bioinformatics Center Institute for Chemical Research Kyoto University Uji Kyoto Japan Department of Biochemistry and Molecular Biology Faculty of Medicine Monash University Melbourne VIC Australia

Single amino acid polymorphisms (SAPs) are the most abundant form of known genetic variations associated with human diseases. It is of great interest to study the sequence-structure-function relationship underlying SAPs. In this work, we collected the human variant data from three databases and divided them into three categories, i.e. cancer somatic mutations (CSM), Mendelian disease-related variant (SVD) and neutral polymorphisms (SVP). We built support vector machine (SVM) classifiers to predict these three classes of SAPs, using the optimal features selected by a random forest algorithm. Consequently, 280 sequence-derived and structural features were initially extracted from the curated datasets from which 18 optimal candidate features were further selected by random forest. Furthermore, we performed a stepwise feature selection to select characteristic sequence and structural features that are important for predicting each SAPs class. As a result, our predictors achieved a prediction accuracy (ACC) of 84.97, 96.93, 86.98 and 88.24%, for the three classes, CSM, SVD and SVP, respectively. Performance comparison with other previously developed tools such as SIFT, SNAP and Polyphen2 indicates that our method provides a favorable performance with higher Sensitivity scores and Matthew's correlation coefficients (MCC). These results indicate that the prediction performance of SAPs classifiers can be effectively improved by feature selection. Moreover, division of SAPs into three respective categories and construction of accurate SVM-based classifiers for each class provides a practically useful way for investigating the difference between Mendelian disease-related variants and cancer somatic mutations.

关键词： Support vector machines Accuracy Proteins Feature extraction Humans Amino acids Databases

来源：评论

学校读者我要写书评

暂无评论

Learning data-adaptive non-parametric kernels

The Journal of Machine Learning Research

引用

The Journal of Machine Learning Research 2020年第1期21卷 8590-8628页

作者： Fanghui Liu Xiaolin Huang Chen Gong Jie Yang Li Li Department of Electrical Engineering ESAT-STADIUS KU Leuven Belgium Institute of Image Processing and Pattern Recognition Institute of Medical Robotics Shanghai Jiao Tong University Shanghai China PCA Lab Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology China and Department of Computing Hong Kong Polytechnic University Hong Kong SAR China Department of Automation BNRist Tsinghua University China

In this paper, we propose a data-adaptive non-parametric kernel learning framework in margin based kernel methods. In model formulation, given an initial kernel matrix, a data-adaptive matrix with two constraints is imposed in an entry-wise scheme. Learning this data-adaptive matrix in a formulation-free strategy enlarges the margin between classes and thus improves the model flexibility. The introduced two constraints are imposed either exactly (on small data sets) or approximately (on large data sets) in our model, which provides a controllable trade-off between model flexibility and complexity with theoretical demonstration. In algorithm optimization, the objective function of our learning framework is proven to be gradient-Lipschitz continuous. Thereby, kernel and classifier/regressor learning can be efficiently optimized in a unified framework via Nesterov's acceleration. For the scalability issue, we study a decomposition-based approach to our model in the large sample case. The effectiveness of this approximation is illustrated by both empirical studies and theoretical guarantees. Experimental results on various classification and regression benchmark data sets demonstrate that our non-parametric kernel learning framework achieves good performance when compared with other representative kernel learning based algorithms.

关键词： support vector machines non-parametric kernel learning gradient-Lipschitz continuous

来源：评论

学校读者我要写书评

暂无评论

3D RoI-aware U-net for accurate and efficient colorectal tumor segmentation

arXiv

引用

arXiv 2018年

作者： Huang, Yi-Jie Dou, Qi Wang, Zi-Xian Liu, Li-Zhi Jin, Ying Li, Chao-Feng Wang, Lisheng Chen, Hao Xu, Rui-Hua Institute of Image Processing and Pattern Recognition Department of Automation Shanghai Jiao Tong University China Imsight Medical Technology Co. Ltd. China Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong Sun Yat-sen University Cancer Center State Key Laboratory of Oncology in South China Collaborative Innovation Center for Cancer Medicine Guangzhou China

Segmentation of colorectal cancerous regions from 3D Magnetic Resonance (MR) images is a crucial procedure for radiotherapy which conventionally requires accurate delineation of tumour boundaries at an expense of labor, time and reproducibility. While deep learning based methods serve good baselines in 3D image segmentation tasks, small applicable patch size limits effective receptive field and degrades segmentation performance. In addition, Regions of interest (RoIs) localization from large whole volume 3D images serves as a preceding operation that brings about multiple benefits in terms of speed, target completeness, reduction of false positives. Distinct from sliding window or non-joint localization-segmentation based models, we propose a novel multitask framework referred to as 3D RoI-aware U-Net (3D RU-Net), for RoI localization and in-region segmentation where the two tasks share one backbone encoder network. With the region proposals from the encoder, we crop multi-level RoI in-region features from the encoder to form a GPU memory-efficient decoder for detail-preserving segmentation and therefore enlarged applicable volume size and effective receptive field. To effectively train the model, we designed a Dice formulated loss function for the global-to-local multi-task learning procedure. Based on the efficiency gains demonstrated by the proposed method, we went on to ensemble models with different receptive fields to achieve even higher performance costing minor extra computational expensiveness. Extensive experiments were subsequently conducted on 64 cancerous cases with a four-fold cross-validation, and the results showed significant superiority in terms of accuracy and efficiency over conventional state-of-the art frameworks. In conclusion, the proposed method has a huge potential for extension to other 3D object segmentation tasks from medical images due to its inherent generalizability. The code for the proposed method is publicly available. Copyright ©

关键词： Signal encoding

来源：评论

学校读者我要写书评

暂无评论

Vehicle Routing Problem with Time Windows using Hybrid Metaheuristic Dragonfly Algorithm and Variable Neighborhood Search: Work on Progress

Vehicle Routing Problem with Time Windows using Hybrid Metah...

引用

International Conference on Electrical Engineering, Computer Science and Informatics (EECSI)

作者： Yunita Yunita Deris Stiawan Dian Palupi Rini Doctoral Student at Faculty of Computer Science Sriwijaya University Intelligent System Research Group Faculty of Computer Science Sriwijaya University Palembang South Sumatera Communication Network and Information Security Research Group Faculty of Computer Science Sriwijaya University Palembang South Sumatera Image Processing dan Pattern Recognition Laboratory Group Faculty of Computer Science Sriwijaya University Palembang South Sumatera

ISBN: (数字)9798350355314

ISBN: (纸本)9798350355321

One of the problems with Smart Transportation is the problem of cost and travel time. This problem is known as the Variable Routing Problem (VRP). In some real cases, in addition to considering route selection, there are limitations on the capacity and time period for the vehicle to serve each customer known as Time Windows, so VRP has developed into Variable Routing Problem with Time Windows (VRPTW). One way to solve VRPTW is to use metaheuristic methods. However, the metaheuristic method has a weakness, which are it can get stuck in local optimums and fail to find better global solutions. To overcome this, a combination with other methods or known as hybrid is needed. The formulation of this research problem is how to develop a Smart transportation model using a metaheuristic hybrid algorithm. The purpose of this study is to develop a Smart transportation model using a metaheuristic hybrid algorithm. The method used is to combine two metaheuristic algorithms, which are the Dragonfly Algorithm (DA) and the Variable Neighborhood Search (VNS). The result of this research is a new algorithm model which is a hybrid between DA and VNS. Through a combination of global exploration using DA and local exploitation using VNS, this algorithm is expected to be able to find a better solution and faster convergence in solving VRPTW problems

关键词： Electrical engineering Computer science Costs Metaheuristics Vehicle routing Routing Search problems Smart transportation Informatics Convergence

来源：评论

学校读者我要写书评

暂无评论

MARL-based calibration for cameras with large FOV

引用

Optica Acta: International Journal of Optics 2024年第1-3期71卷

作者： Xinyu Yang Fuhan Chen Jingwen Jiang Hui Xie Qiaofeng Ou Key Laboratory of Jiangxi Province for Image Processing and Pattern Recognition School of Information Engineering Nanchang Hangkong University Nanchang People’s Republic of China

Achieving high-precision measurements in a large field of view (FOV) is a challenging task. The accuracy of vision measurements is determined by the quality of camera calibration, which is influenced by the pose of the target. To obtain suitable target pose, a target pose optimization method based on multi-agent reinforcement learning (MARL) is proposed. Firstly, the target pose optimization problem is modelled as a Markov decision process (MDP). Secondly, a multi-agent proximal policy optimization (MAPPO) algorithm for target pose optimization is designed by parameter sharing mechanism. Finally, optimization algorithm is adopted to camera calibration process. The calibration experiment was carried out under the large FOV of 4600 mm × 2300 mm. The results show that the back-projection error was 0.198 mm, the relative error of the diagonal length of target (505.847 mm) was 0.789 mm, and the success rate of large FOV camera calibration was 98.5%.

关键词： Camera calibration large FOV target pose optimization MARL MDP MAPPO

来源：评论

学校读者我要写书评

暂无评论

Constructing multi-modality and multi-classifier radiomics predictive models through reliable classifier fusion

arXiv

引用

arXiv 2017年

作者： Zhou, Zhiguo Zhou, Zhi-Jie Hao, Hongxia Li, Shulong Chen, Xi Zhang, You Folkert, Michael Wang, Jing Department of Radiation Oncology UT Southwestern Medical Center DallasTX United States High-Tech Institute of Xi'an Xi'an China Department of Information and Control Engineering Xi'an University of Technology Xi'an China School of Computer Science and Technology Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education Xidian University Xi'an China School of Biomedical Engineering Southern Medical Unversity Guangzhou China Institute of Image Processing and Pattern Recognition Xi'an Jiaotong Unversity Xi'an China

Radiomics aims to extract and analyze large numbers of quantitative features from medical images and is highly promising in staging, diagnosing, and predicting outcomes of cancer treatments. Nevertheless, several challenges need to be addressed to construct an optimal radiomics predictive model. First, the predictive performance of the model may be reduced when features extracted from an individual imaging modality (e.g. PET, CT, MRI) are blindly combined into a single predictive model. Second, because many different types of classifiers are available to construct a predictive model, selecting an "optimal" classifier for a particular application is still challenging. In this work, we developed multi-modality and multi-classifier radiomics predictive models that address the aforementioned issues in currently available models. Specifically, a new reliable classifier fusion strategy was proposed to optimally combine output from different modalities and classifiers. In this strategy, modality-specific classifiers were first trained, and an analytic evidential reasoning (ER) rule was developed to fuse the output score from each modality to construct an optimal predictive model. One public datasets and two clinical case studies were performed to validate model performance. The experimental results indicated that the proposed ER rule based radiomics models outperformed the traditional models that rely on a single classifier or simply use combined features from different modalities. Copyright © 2017, The Authors. All rights reserved.

关键词： Diagnosis

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Learning of Depth and Pose Based on Monocular Camera and Inertial Measurement Unit (IMU)

Unsupervised Learning of Depth and Pose Based on Monocular C...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Yanbo Wang Hanwen Yang Jianwei Cai Guangming Wang Jingchuan Wang Yi Huang University of Michigan-Shanghai Jiao Tong University Joint Institute Shanghai Jiao Tong University Shanghai China School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai China Department of Automation Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai Weitong Vision Technology Co. Ltd.

The main content of the research in this paper is the estimation of depth and pose based on monocular vision and Inertial Measurement Unit (IMU). The usual depth estimation network and pose estimation network require depth ground truth or pose ground truth as a supervised signal for training, while the depth ground truth and pose ground truth are hard to obtain, and monocular vision based depth estimation cannot predict absolute depth. In this paper, with the help of IMU, which is inexpensive and widely used, we can obtain angular velocity and acceleration information. Two new supervision signals are proposed and the calculation expressions are given. Among them, the model trained with acceleration constraint shows a good ability to estimate the absolute depth during the test. It can be considered that the model can estimate the absolute depth. We also derive the method of estimating the scale factor during the test from the acceleration constraint, and also achieve good results as the acceleration constraint does. In addition, this paper also studies the method of using IMU information as pose network input and as selecting conditions. Moreover, it analyzes and discusses the experimental results. At the same time, we also evaluate the effect of the pose estimation of the relevant models. This article starts by reviewing the achievements and deficiencies of the work in this field, combines the use of IMU, puts forward three new methods such as a new loss function, and conducts a test analysis and discussion of relevant indicators on the KITTI data set.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：