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

A fast rigid registration algorithm for medical images

Journal of Fiber Bioengineering and Informatics 2014年第3期7卷 409-418页

作者： Feng, Yuncong Li, Xiongfei Zhang, Xiaoli Ding, Tienan Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun China Department of Computer Science and Technology Changchun China

Image registration is a vital research branch in medical image processing and analysis. In this paper, we proposed a new framework for rigid medical image registration. It can also be regarded as a pre-processing of non-rigid image registration algorithms. The interest of the algorithm lies in its simplicity and high e±ciency. In the registration algorithm, we firstly segmented the reference image and °oat image into two parts: tissue parts and background parts. Then the centers of the two images were located through performing distance transform on the two segmented tissue images. Finally, we detected the longest radius of the two tissue regions, by which we determined the rotating angle. We tested the registration algorithm on dozens of medical images, and the experimental results show us that the algorithm is competent for medical image registration.

关键词： Image registration

来源：评论

学校读者我要写书评

暂无评论

An Algorithm for the Discretization of an Ideal Projector

引用

Journal of Systems Science & Complexity 2016年第5期29卷 1400-1410页

作者： JIANG Xue ZHANG Shugong LI Zhe Institute of Mathematics Key Laboratory of Symbolic Computation and Knowledge Engineering (Ministry of Education) Jilin University Department of Applied Mathematics School of Science Changchun University of Science and Technology

Ideal interpolation is a generalization of the univariate Hermite interpolation. It is well known that every univariate Hermite interpolant is a pointwise limit of some Lagrange ***, a counterexample provided by Shekhtman Boris shows that, for more than two variables,there exist ideal interpolants that are not the limit of any Lagrange interpolants. So it is natural to consider: Given an ideal interpolant, how to find a sequence of Lagrange interpolants(if any) that converge to it. The authors call this problem the discretization for ideal interpolation. This paper presents an algorithm to solve the discretization problem. If the algorithm returns "True", the authors get a set of pairwise distinct points such that the corresponding Lagrange interpolants converge to the given ideal interpolant.

关键词： Discretization ideal interpolation Lagrange interpolation.

来源：评论

学校读者我要写书评

暂无评论

A novel method for computing the inverse of cardinal direction relations

引用

Journal of Convergence Information Technology 2012年第1期7卷 130-138页

作者： Wang, Fang Liu, Dayou Dong, Yiqun College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education

This paper focuses efforts on the problem of computing the inverse of cardinal direction relations (CRs), which is a fundamental problem in qualitative spatial reasoning. We study the quite expressive cardinal direction relation model for extended objects, known as cardinal direction calculus (CDC). We first concentrate on a set of a special type of CRs defined in CDC, named rectangle-CRs, and compute the inverse of rectangle-CRs by exploiting the evident connection between basic rectangle- CRs and interval relations. Then, we consider progressively the general cardinal direction relations in CDC, or called CDC relations for short, the inverse of which is computed by reducing to the computation of the inverse of rectangle-CRs. This simplifies the computations. Analyzing in theory and the final results both demonstrate that our algorithms are correct and complete and the time complexity is bounded by a constant number of operations.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

Improvement of escape time algorithm by no- escape-point

引用

Journal of Computers 2011年第8期6卷 1648-1653页

作者： Liu, Shuai Che, Xiangjiu Wang, Zhengxuan College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

Escape time algorithm is a universal algorithm when to create fractal image. A class of algorithms based on escape time algorithm is wasting-calculation. In this essay, when combined with the feature of eventually periodic point of functions, we define a kind of points as no-escape point. To analyze the shortcomings of the classic algorithm, we improve the escape time algorithm base on the no-escape points. We analyze the algorithm and put forward the best application scope for it. By create lots of fractal figures, we find the figures created by the two algorithms are consistent with each other except a few escape points. We compare the complexity between the two algorithms and find the iteration times by the improved algorithm are less than escape time algorithm when creating the fractal images. We do several experiments and find the improved algorithm is universal and it reduces the time-consuming. © 2011 ACADEMY PUBLISHER.

关键词： Fractals

来源：评论

学校读者我要写书评

暂无评论

Noise suppression of fluorescein angiogram sequences using bilateral filter

Noise suppression of fluorescein angiogram sequences using b...

引用

International Conference on Machine Learning and Cybernetics, ICMLC 2005

作者： Guo, Xiao-Xin Lu, Yi-Nan Xu, Zhi-Wen Liu, Zhan-Hui Wang, Yun-Xiao Pang, Yun-Jie Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Ministry of Education Qianjin Street 2699 Changchun 130012 China

ISBN: (纸本)078039092X

In this paper, a relatively flexible filter called extended bilateral filter is proposed, by which some particular filters can be designed via selecting an appropriate pixel of interest (POI) and defining a kernel for the filter according to some specified requirements. Based on the filter, a fluorescein-angiogram-oriented filter, high-intensity preserving (HIP) filter is introduced to solve the problems of high-intensity preservation when denoising. The results of the experiments show that the HIP filter has the ability of noise suppression, and the ability of high-intensity preservation, which can keep the intensities of bright pixels from degrading via distributing the weights adaptively according to the location and the intensity of each pixel. © 2005 IEEE.

关键词： Image processing

来源：评论

学校读者我要写书评

暂无评论

UAV Swarm-enabled Collaborative Post-disaster Communications in Low Altitude Economy via a Two-stage Optimization Approach

arXiv

引用

arXiv 2025年

作者： Zheng, Xiaoya Sun, Geng Li, Jiahui Wang, Jiacheng Wu, Qingqing Niyato, Dusit Jamalipour, Abbas College of Computer Science d Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University 639798 Singapore College of Computing and ta Science Nanyang Technological University 639798 Singapore Department of Electronic Engineering Shanghai Jiao Tong University Shanghai200240 China School of Electrical and Computer Engiering The University of Sydney SydneyNSW2006 Australia

The low-altitude economy (LAE), as a new economic paradigm, plays an indispensable role in cargo transportation, healthcare, infrastructure inspection, and especially post-disaster communication. Specifically, unmanned aerial vehicles (UAVs), as one of the core technologies of the LAE, can be deployed to provide communication coverage, facilitate data collection, and relay data for trapped users, thereby significantly enhancing the efficiency of post-disaster response efforts. However, conventional UAV self-organizing networks exhibit low reliability in long-range cases due to their limited onboard energy and transmit ability. Therefore, in this paper, we design an efficient and robust UAV-swarm enabled collaborative self-organizing network to facilitate post-disaster communications. Specifically, a ground device transmits data to UAV swarms, which then use collaborative beamforming (CB) technique to form virtual antenna arrays and relay the data to a remote access point (AP) efficiently. Then, we formulate a rescue-oriented post-disaster transmission rate maximization optimization problem (RPTRMOP), aimed at maximizing the transmission rate of the whole network. Given the challenges of solving the formulated RPTRMOP by using traditional algorithms, we propose a two-stage optimization approach to address it. In the first stage, the optimal traffic routing and the theoretical upper bound on the transmission rate of the network are derived. In the second stage, we transform the formulated RPTRMOP into a variant named V-RPTRMOP based on the obtained optimal traffic routing, aimed at rendering the actual transmission rate closely approaches its theoretical upper bound by optimizing the excitation current weight and the placement of each participating UAV via a diffusion model-enabled particle swarm optimization (DM-PSO) algorithm. Simulation results show the effectiveness of the proposed two-stage optimization approach in improving the transmission rate of the construct

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

Automatic localization of macular area based on structure label transfer

引用

International Journal of Ophthalmology(English edition) 2018年第3期11卷 422-428页

作者： Xiao-Xin Guo Qun Li Chao Sun Yi-Nan LU Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Changchun130012 Jilin Province China College of Computer Science and Technology Jilin University Changchun 130012 Jilin Province China

AIM： To explore feasibility and practicability of macula localization independent of macular morphological features. METHODS： A novel method was proposed to identify macula in fundus images by using structure label transfer. Its main idea was to match a processed image with the candidate images with known structures, and then transfer the structure label representing the macular to the processed image as a result of macula localization. In this way, macula localization couldn＇t be influenced by lesion or other interference any more. RESULTS： The average success rate in four datasets was 98.18%. For accuracy, the average error distance in four datasets was 0.151 optic disc diameter （ODD）. Even for severe lesion images, the proposed method can still maintain high success rate and high accuracy, e.g., 95.65% and 0.124 ODD in the case of STARE dataset, respectively, which indicated that the proposed method was highly robust and stable in the complicated situations. CONCLUSION： The proposed method can avoid the interference of lesion to macular morphological features in macula localization, and can locate macula with high accuracy and robustness, verifying its feasibility.

关键词： fundus image optic disc macula structurelabel transfer

来源：评论

学校读者我要写书评

暂无评论

An approach for calculating semantic similarity between words using WordNet

An approach for calculating semantic similarity between word...

引用

2011 2nd International Conference on Digital Manufacturing and Automation, ICDMA 2011

作者： Hao, Dou Zuo, Wanli Peng, Tao He, Fengling College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Changchun China

ISBN: (纸本)9780769544557

This paper presents a new edge-counting based method using Word Net to compute the similarity. The method achieves a similarity that perfectly fits with human rating and effectively simulate the human tHought process that is people prefer to consider more differences when the semantic distance between two word is closer, and vice versa. At last, we weigh up our model against a benchmark set by human similarity judgment, and obtain a much improved result compared with other methods. © 2011 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Tuning the Learning Rate for Stochastic Variational Inference

引用

Journal of Computer Science & Technology 2016年第2期31卷 428-436页

作者： Xi-Ming Li Ji-Hong Ouyang College of Computer Science and Technology Jilin University Changchun 130000 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130000 China

Stochastic variational inference （SVI） can learn topic models with very big corpora. It optimizes the variational objective by using the stochastic natural gradient algorithm with a decreasing learning rate. This rate is crucial for SVI; however, it is often tuned by hand in real applications. To address this, we develop a novel algorithm, which tunes the learning rate of each iteration adaptively. The proposed algorithm uses the Kullback-Leibler （KL） divergence to measure the similarity between the variational distribution with noisy update and that with batch update, and then optimizes the learning rates by minimizing the KL divergence. We apply our algorithm to two representative topic models： latent Dirichlet allocation and hierarchical Dirichlet process. Experimental results indicate that our algorithm performs better and converges faster than commonly used learning rates.

关键词： stochastic variational inference online learning adaptive learning rate topic model

来源：评论

学校读者我要写书评

暂无评论

Improved CS Algorithm and its Application in Parking Space Prediction

引用

Journal of Bionic engineering 2020年第5期17卷 1075-1083页

作者： Rui Guo Xuanjing Shen Hui Kang College of Computer Science and Technology Jilin UniversityChangchun 130012China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchun 130012China

This paper simulates the cuckoo incubation process and flight path to optimize the Wavelet Neural Network(WNN)model,and proposes a parking prediction algorithm based on WNN and improved Cuckoo Search(CS)***,the initialization parameters are provided to optimize the WNN using the improved *** traditional CS algorithm adopts the strategy of overall update and evaluation,but does not consider its own information,so the convergence speed is very *** proposed algorithm employs the evaluation strategy of group update,which not only retains the advantage of fast convergence of the dimension-by-dimension update evaluation strategy,but also increases the mutual relationship between the nests and reduces the overall running ***,we use the WNN model to predict parking *** proposed algorithm is compared with six different heuristic algorithms in five *** experimental results show that the proposed algorithm is superior to other algorithms in terms of running time and accuracy.

关键词： wavelet neural network cuckoo search algorithm available parking spaces prediction bionic

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：