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

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

来源：评论

学校读者我要写书评

暂无评论

Anomaly Handwritten Text Detection for Automatic Descriptive Answer Evaluation 22

Anomaly Handwritten Text Detection for Automatic Descriptive...

引用

Proceedings of the 2022 11th International Conference on Computing and pattern recognition

作者： Nilanjana Chatterjee Palaiahnaakote Shivakumara Umapada Pal Tong Lu Yue Lu Computer Vision and Pattern Recognition Unit Indian Statistical Institute India Faculty of Computer Science and Information Technology University of Malaya Malaysia National Key Lab for Novel Software Technology Nanjing University China Shanghai Key Laboratory of Multidimensional Information Processing East China Normal University China

ISBN: (纸本)9781450397056

Although there are advanced technologies for character recognition, automatic descriptive answer evaluation is an open challenge for the document image analysis community due to large diversified handwritten text and answers to the question. This paper presents a novel method for detecting anomaly handwritten text in the responses written by the students to the questions. The method is proposed based on the fact that when the students are confident in answering questions, the students usually write answers legibly and neatly while they are not confident, they write sloppy writing which may not be easy for the reader to understand. To detect such anomaly handwritten text, we explore a new combination of Fourier transform and deep learning model for detecting edges. This result preserves the structure of handwritten text. For extracting features for classification of anomaly text and normal text, the proposed method studies the behavior of writing style, especially the variation at ascenders and descenders. Therefore, the proposed work draws principal axis which is invariant to rotation, scaling and some extent to distortion for the edge images. With respect to principal axis, the proposed method draws medial axis using uppermost and lowermost points. The distance between the medial axis and principal axis points are considered as feature vector. Further, the feature vector is passed to Artificial Neural Network for classification of anomaly text. The proposed method is evaluated by testing on our own dataset, standard dataset of gender identification (IAM) and handwritten forgery detection dataset (ACPR 2019). The results on different datasets show that the proposed work outperforms the existing methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Evaluating deformation patterns of the thoracic aorta in gated CTA sequences

Evaluating deformation patterns of the thoracic aorta in gat...

引用

IEEE International Symposium on Biomedical Imaging

作者： Ernst Schwartz Roman Gottardi Johannes Holfeld Christian Loewe Martin Czerny Georg Langs Computational Image Analysis and Radiology Lab (CIR) Medical University of Vienna Austria Pattern Recognition and Image Processing Group University of Technology Vienna Austria Division of Cardiothoracic Surgery Department of Surgery Medical University of Vienna Austria Division of Interventional Radiology Department of Radiology Medical University of Vienna Austria Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology USA

ISBN: (纸本)9781424441259;9781424441266

Cardiovascular interventions in the region of the aortic isthmus such as stent-grafting and vessel transposition introduce substantial changes in the deformation properties of the affected vessels. The changes play a fundamental role in the long-term prognosis for any such treatment, but are only poorly understood to date. We explore a fully automated method to quantify the deformation patterns of the thoracic aorta in gated computed tomography sequences. The aorta is segmented by a level set approach that accurately identifies the vessel lumen in each frame of the sequence. Consequently, landmarks on the vessel wall in each frame are registered using a probabilistic method. This allows for the measurement of global and local deformation properties. We evaluate our method on synthetic datasets and report first results of its application on real world data.

关键词： Biomedical imaging image segmentation Radiology Cardiology Surgery Computed tomography Level set Electrocardiography Pathology Deformable models

来源：评论

学校读者我要写书评

暂无评论

Sparse generalized canonical correlation analysis: Distributed alternating iteration based approach

arXiv

引用

arXiv 2020年

作者： Cai, Jia Lv, Kexin Huo, Junyi Huang, Xiaolin Yang, Jie School of Statistics and Mathematics Guangdong University of Finance & Economics Big Data and Educational Statistics Application Laboratory 21 Chisha Road Guangzhou Guangdong510320 China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University MOE Key Laboratory of System Control and Information Processing 800 Dongchuan Road Shanghai200240 China School of Electronics and Computer Science University of Southampton University Road SouthamptonSO17 1BJ United Kingdom

Sparse canonical correlation analysis (CCA) is a useful statistical tool to detect latent information with sparse structures. However, sparse CCA works only for two datasets, i.e., there are only two views or two distinct objects. To overcome this limitation, in this paper, we propose a sparse generalized canonical correlation analysis (GCCA), which could detect the latent relations of multiview data with sparse structures. Moreover, the introduced sparsity could be considered as Laplace prior on the canonical variates. Specifically, we convert the GCCA into a linear system of equations and impose 1 minimization penalty for sparsity pursuit. This results in a nonconvex problem on Stiefel manifold, which is difficult to solve. Motivated by Boyd’s consensus problem, an algorithm based on distributed alternating iteration approach is developed and theoretical consistency analysis is investigated elaborately under mild conditions. Experiments on several synthetic and real world datasets demonstrate the effectiveness of the proposed algorithm. Copyright © 2020, The Authors. All rights reserved.

关键词： Statistical mechanics

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Fast Algorithm for Parallel Solving Inversion of Large Scale Small Matrices Based on Gpu

SSRN

引用

SSRN 2022年

作者： Jin, Xuebin Chen, Yewang Fan, Wentao Zhang, Yong Du, Jixiang The College of Computer Science and Technology Huaqiao University Xiamen China Fujian Key Laboratory of Big Data Intelligence and Security Huaqiao University Xiamen China Xiamen Key Laboratory of Computer Vision and Pattern Recognition Huaqiao University China Provincial Key Laboratory for Computer Information Processing Technology Soochow University Soochow China College of Mechanical Engineering and Automation Huaqiao University Xiamen China

Inverting a matrix is time-consuming, and many works focus on accelerating inverting a single large matrix by GPU. However, the problem of inverting large-scale small matrices has little attention. In this paper, we propose a Revised In-Place Inversion algorithm for inverting large-scale small matrices, which runs on the CUDA platform and utilizes multicore GPUs. The proposed algorithm is well-suited for large-scale-small matrices (dimension $n \leq 32$), which can invert millions of small matrices within tens of milliseconds. In addition, we find there is an upper bound of input data size for each GPU device, the performance will degrade if the input data size is too large. Hence, we improve the proposed method by dividing matrices into batches according to this finding. Experimental results show that this strategy can effectively alleviate the performance degradation for inverting large scale small matrices, and maintain the high-performance execution of the algorithm. © 2022, The Authors. All rights reserved.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Random Fourier Features for Asymmetric kernels

arXiv

引用

arXiv 2022年

作者： He, Mingzhen He, Fan Liu, Fanghui Huang, Xiaolin Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University 800 Dongchuan RD. Minhang District Shanghai200240 China Laboratory for Information and Inference Systems École Polytechnique Fédérale de Lausanne EPFL SV-BMC AA-B118 Lausanne1015 Switzerland

The random Fourier features (RFFs) method is a powerful and popular technique in kernel approximation for scalability of kernel methods. The theoretical foundation of RFFs is based on the Bochner theorem (Bochner, 2005) that relates symmetric, positive definite (PD) functions to probability measures. This condition naturally excludes asymmetric functions with a wide range applications in practice, e.g., directed graphs, conditional probability, and asymmetric kernels. Nevertheless, understanding asymmetric functions (kernels) and its scalability via RFFs is unclear both theoretically and empirically. In this paper, we introduce a complex measure with the real and imaginary parts corresponding to four finite positive measures, which expands the application scope of the Bochner theorem. By doing so, this framework allows for handling classical symmetric, PD kernels via one positive measure;symmetric, non-positive definite kernels via signed measures;and asymmetric kernels via complex measures, thereby unifying them into a general framework by RFFs, named AsK-RFFs. Such approximation scheme via complex measures enjoys theoretical guarantees in the perspective of the uniform convergence. In algorithmic implementation, to speed up the kernel approximation process, which is expensive due to the calculation of total mass, we employ a subset-based fast estimation method that optimizes total masses on a sub-training set, which enjoys computational efficiency in high dimensions. Our AsK-RFFs method is empirically validated on several typical large-scale datasets and achieves promising kernel approximation performance, which demonstrate the effectiveness of AsK-RFFs. © 2022, CC BY.

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Framelet-based sparse regularization for uneven intensity correction of remote sensing images in a retinex variational framework

引用

Optik 2016年第3期127卷 1184-1189页

作者： Xia Lan Zhiyong Zuo Huanfeng Shen Liangpei Zhang Jing Hu The 10th Institute of China Electronics Technology Group Corporation Chengdu 610036 China The School of Resource and Environmental Sciences Wuhan University Wuhan 430079 China The State Key Laboratory of Information Engineering in Surveying Mapping and Remote Sensing Wuhan University Wuhan 430079 China National Key Laboratory of Science and Technology on Multispectral Information Processing Institute for Pattern Recognition and Artificial Intelligence Huazhong University of Science and Technology Wuhan 430074 China

Correcting uneven intensity distribution from a single image has long been a challenging problem with remote sensing image. In this paper, an analysis-based sparse prior is employed in the retinex variational framework for the uneven intensity correction of remote sensing images. This sparse regularization model is used to adjust uneven intensity by regularizing the sparsity of the reflectance component under framelet transform. Furthermore, the alternating minimization algorithm and split Bregman method are adopted to solve the framelet-based sparse regularization model. The experiments, with both simulated images and real-life images, show that the proposed model can effectively correct the uneven intensity distribution.

关键词： Framelet Retinex Uneven intensity correction Remote sensing image Split Bregman algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：