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

作者： Iraji, Armin Davoodi-Bojd, Esmaeil Soltanian-Zadeh, Hamid Hossein-Zadeh, Gholam-Ali Control and Intelligent Processing Center of Excellence School of Electrical and Computer Engineering University of Tehran Tehran 14395-515 Iran Image Analysis Laboratory Radiology Department Henry Ford Hospital Detroit MI 48202 United States

ISBN: (纸本)9789644634284

For estimating the kurtosis parameter in Diffusion Kurtosis Imaging (DKI), usually second order expansion of the diffusion signal is used in conventional acquisition data. However, in this work, we show that this is not sufficient and should be reconsidered. Instead of using the second order expansion, we propose to use the third order expansion. At first, we show that the third order term of the Taylor's expansion has considerable values compared to second and first terms for the conventional b-values used in DKI. Then, for proving our claim empirically, we use real data to compare the proposed model with the previous one. To this end, five regions of the brain are extracted and for each region the fitting errors of both models are computed. The results confirm that the fitting error of the third order model is always (for all regions) less than the second order model. Although the improvement of the fitting error seems to be small, but considering the sensitivity analysis, this improvement can enhance the estimation of kurtosis. The resulting maps of the kurtosis parameter show this enhancement. The white matter in the map of third order model is more distinguishable than in the other model. © 2011 AmirKabir Univ of Tech.

关键词： Diffusion

来源：评论

学校读者我要写书评

暂无评论

Assessing lung volumetric variation to detect and stage COPD

Assessing lung volumetric variation to detect and stage COPD

引用

2011 1st Middle East Conference on Biomedical engineering, MECBME 2011

作者： Hosseini, M. Parsa Soltanian-Zadeh, Hamid Akhlaghpoor, Shahram Department of Electrical Engineering Islamic Azad University Science and Research Branch of Tehran Tehran Iran Image Analysis Laboratory Department of Radiology Henry Ford Health System Detroit MI United States Department of Radiology Tehran University of Medical Sciences Sina Hospital Tehran Iran Control and Intelligent Processing Center of Excellence School of Electrical and Computer Engineering University of Tehran Tehran Iran

ISBN: (纸本)9781424470006

Chronic obstructive pulmonary disease (COPD) is a devastating disease. In this paper, we propose a novel method for scoring of air trapping in the lungs for detection and evaluation of COPD. The proposed method finds volumetric changes of the lungs from inspiration to expiration. To this end, trachea CT images at full inspiration and expiration are compared. For this comparison, the lungs parenchyma in the inspiration and expiration images are found and changes in the surface and volume of the lungs between inspiration and expiration are used to define quantitative measures (features). Using these features, the subjects are classified into two groups of normal class and COPD patients using a Bayesian classifier. In addition, t-tests are applied to evaluate discrimination powers of the features for this classification. The main advantage of the proposed method is its ability to estimate air trapping in the lungs from CT images without human intervention. The proposed method may assists radiologists in the detection of COPD as a computer aided diagnosis (CAD) system. It may also assist them with the scoring of the disease (severity of air trapping in the lungs). © 2011 IEEE.

关键词： computerized tomography

来源：评论

学校读者我要写书评

暂无评论

A novel method for identification of COPD in inspiratory and expiratory states of CT images

A novel method for identification of COPD in inspiratory and...

引用

2011 1st Middle East Conference on Biomedical engineering, MECBME 2011

ISBN: (纸本)9781424470006

Chronic obstructive pulmonary disease (COPD) refers to a group of lung diseases that block airflow and cause a huge degree of human suffering. While there is no cure for COPD and the lung damage that results in this disease cannot be reversed, it is very important to diagnose it as early as possible. Additional to diagnosis, using a mathematical model to estimate severity of disease would be helpful for evaluation of treatment effects. This paper presents a new method for identifying COPD from three-dimensional (3-D) pulmonary X-ray CT images. The method has five main steps. First, corresponding positions of lungs in inspiration and expiration are found based on anatomical structures. Then, lung regions are segmented from the CT images by active contours. Next, the left and right lungs are separated using a sequence of morphological operations. Then, parenchyma variations in each lung are found as a relationship between inspiratory and expiratory states. Finally, a classifier is used to decide about the disease and its severity. A t-test is done to evaluate the results. Twelve patients with variable severity of COPD and twelve normal adults were included in this study. The proposed method may assist radiologists in the detection of COPD as a computer aided diagnosis (CAD) system. © 2011 IEEE.

关键词： Pulmonary diseases

来源：评论

学校读者我要写书评

暂无评论

Accelerating MatLab code using GPU: A review of tools and strategies

Accelerating MatLab code using GPU: A review of tools and st...

引用

2011 2nd International Conference on Artificial Intelligence, Management Science and Electronic Commerce, AIMSEC 2011

作者： Zhang, Baida Xu, Shuai Zhang, Feng Bi, Yuan Huang, Linqi National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China Department of Information Engineering Academy of Armored Force Engineering Beijing 100000 China Electronic Information Industry Co. Ltd Beijing 100085 China Naval Academy of Armament Beijing 100036 China School of Resources and Safety Engineering Central South University Changsha 410083 China

ISBN: (纸本)9781457705366

Lots of toolboxes of accelerating MatLab using GPU are available now[1], but, users are confused by which toolbox is best suitable for a particular task. Three toolboxes-Jacket, GPUmat, and parallel Computing Toolbox of MatLab are selected. For each toolbox, its advantages and pitfalls are reviewed, with an aim to allow the reader to identify which toolbox is appropriate for a given task. Strategies of whether a function should execute on GPU are given after a formula analysis. The analysis is also a framework for program automatically decides which function is cost-efficient to execute on GPU. A series of benchmark of different types of computing, including data transfer between GPU and CPU, data matrix Generation, matrix operation and GPU functions were tested in all three toolboxes. And the results show that Jacket is the best one. Some advices to improve the performance of toolboxes are given in the end. © 2011 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

The dynamic allocation model for the resources of cloud services delivery networks

引用

Jisuanji Xuebao/Chinese Journal of computers 2011年第12期34卷 2305-2318页

作者： Shi, Pei-Chang Wang, Huai-Min Yin, Gang Liu, Xue-Ning Yuan, Xiao-Qun Shi, Dian-Xi National Laboratory for Parallel and Distributed Processing School of Computer and Science National University of Defense Technology Changsha 410073 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China Department of Electronics and Information Engineering Huazhong Univ. of Sci. and Technol. Wuhan 430074 China

Cloud Services Delivery Networks (CSDN) constructs a layer distributed server overlay over the Internet, which uses the way to the nearest and on-demand approach providing services to end users. Facing the scale and diversification of the resource demand characteristics of the Internet cloud services, CSDN forms different logical sub-server overlay for different kinds of cloud services. However, most servers and bandwidth resources of CSDN are used to deliver the streaming and downloading kind of cloud services, and the dynamic allocation of their delivery resource is the main research emphasis in this paper. This paper first models the problem to be a multi-dimensional facility location problem, according to the two characteristics: the memory resource and bandwidth resource of this kind of application are the bottleneck resource;the hot contents of this kind of application can be delivered using the Peer-to-Peer mechanisms. After the model analyzed and its NP-Complete proved, we then propose a heuristic algorithm. Finally, using the service delivery cost savings as the performance metrics, while the actual system's operation trace is as the input, the effectiveness of the algorithm are comprehensively assessed.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

New image compression algorithm using proposed quantization approach

New image compression algorithm using proposed quantization ...

引用

International Conference on Pattern Analysis and Intelligent Robotics (ICPAIR)

作者： Seyed Mehdi Moghadas Hossein Pourghasem Rasoul Amirfattahi Department of Electrical Engineering Islamic Azad University Najafabad Iran Digital Signal Processing Research Laboratory Department of Electrical and Computer Engineering Isfahan University of Technology Isfahan Iran

A new quantization method is proposed in this paper. This method is useful for enhancement of compression quality when each kind of neural network is used to compress the image. By quantizing the image with the proposed method, the numbers of samples which must be reconstructed by neural network is reduced. This causes a remarkable increase in quality of the reconstructed image. For testing the proposed method we use autoassociative transform coding and by merging it with the proposed quantization method a new compression algorithm is obtained. Then results of compression by the merged method are compared with some previous works. Obtained results show that the proposed compression algorithm increases the compression quality of the images remarkably. Compression time and complexity in the merged method is also better than JPEG and make it suitable for the systems with low processor and hardware implementation.

关键词： Image coding Biological neural networks Image reconstruction Transform coding Neurons PSNR Training

来源：评论

学校读者我要写书评

暂无评论

Bayesian Spatiotemporal Multitask Learning for Radar HRRP Target Recognition

引用

IEEE Transactions on Signal processing 2011年第7期59卷 3182-3196页

作者： Lan Du Penghui Wang Hongwei Liu Mian Pan Feng Chen Zheng Bao Department of Electrical and Computer Engineering Duke University Durham NC USA National Laboratory of Radar Signal Processing Xidian University Xi'an China School of Electronic Information and Electrical Engineering Shanghai Jiaotong University Shanghai China

A Bayesian dynamic model based on multitask learning (MTL) is developed for radar automatic target recognition (RATR) using high-resolution range profile (HRRP). The aspect-dependent HRRP sequence is modeled using a truncated stick-breaking hidden Markov model (TSB-HMM) with time-evolving transition probabilities, in which the spatial structure across range cells is described by the hidden Markov structure and the temporal dependence between HRRP samples is described by the time evolution of the transition probabilities. This framework imposes the belief that temporally proximate HRRPs are more likely to be drawn from similar HMMs, while also allowing for possible distant repetition or “innovation”. In addition, as formulated the stick-breaking prior and MTL mechanism are employed to infer the number of hidden states in an HMM and learn the target-dependent states collectively for all targets. The form of the proposed hierarchical model allows efficient variational Bayesian (VB) inference, of interest for large-scale problems. To validate the formulation, example results are presented for an illustrative synthesized dataset and our main application-RATR, for which we consider the measured HRRP data. For the latter, we also make comparisons to the model with the independent state-transition statistics and some other existing statistical models for radar HRRP data.

关键词： Hidden Markov models Data models Radar Bayesian methods Target recognition Analytical models

来源：评论

学校读者我要写书评

暂无评论

Toward Optimal Deployment of Communication-Intensive Cloud Applications

Toward Optimal Deployment of Communication-Intensive Cloud A...

引用

IEEE International Conference on Cloud Computing, CLOUD

作者： Pei Fan Ji Wang Zibin Zheng Michael R. Lyu National Laboratory for Parallel & Distributed Processing National University of Defense Technology Changsha China Department of Computer Science & Engineering Chinese University of Hong Kong Hong Kong China

Strongly promoted by the leading industrial companies, cloud computing becomes increasingly popular in re-cent years. The growth rate of cloud computing surpasses even the most optimistic predictions. A cloud application is a large-scale distributed system that consist a lot of distributed cloud nodes. How to make optimal deployment of cloud applications is a challenging research problem. When deploying a cloud application to the cloud environment, cloud node ranking is one of the most important approaches for selecting optimal cloud nodes for the cloud application. Traditional ranking methods usually rank the cloud nodes based on their QoS values, without considering the communication performance between cloud nodes. However, such kind of node relationship is very important for the communication-intensive cloud applications (e.g., Message Passing Interface (MPI) programs), which have a lot of communications between the selected cloud nodes. In this paper, we propose a novel clustering-based method for selecting optimal cloud nodes for deploying communication-intensive applications to the cloud environment. Our method not only takes into account the cloud node qualities, but also the communication performance between different nodes. We deploy several well-known MPI programs on a real-world cloud and compare our method with other methods. The experimental results show the effectiveness of our cluster-based method.

关键词： Time factors Cloud computing Benchmark testing Quality of service Servers Clustering algorithms Databases

来源：评论

学校读者我要写书评

暂无评论

Model-based multiview stereo via level sets with statistical shape prior

Model-based multiview stereo via level sets with statistical...

引用

IEEE International Conference on Image processing

作者： Moumen El-Melegy Nagi Al-Ashwal Aly A. Farag Electrical Engineering Department Assiut University Asyut Egypt Computer Vision and Image Processing Laboratory University of Louisville KY USA

In this paper, we propose a methodology to incorporate 3D shape prior information in multi-view stereo. This is important for applications that deal with specific category of objects. The methodology is based on a new formulation of a level-set based energy functional. Shape prior model is then embedded in the energy functional to allow the reconstruction of an object with shape variations consistent with the training model examples. Several experiments to evaluate the proposed methodology are presented.

关键词： Shape Image reconstruction Level set Stereo vision Solid modeling Training Ellipsoids

来源：评论

学校读者我要写书评

暂无评论

LD: A Polynomial Time Algorithm for Tree Isomorphism

引用

Procedia engineering 2011年 15卷 2015-2020页

作者： Baida Zhang Yuhua Tang Junjie Wu Shuai Xu National laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan 410073 P. R. China Department of Information Engineering Academy of Armored Force Engineering Beijing 100000 P.R.China

Graph isomorphism problem has always been mathematics and engineering technology community concern, the reason mainly from two aspects: First, in theory, is generally believed that the problem is NP-complete problem; Second, the graph isomorphism the problem with good prospects, in chemistry, operations research, computer science, electronics, network theory has applications in many fields, but the exponential complexity of the algorithm and the algorithm itself makes the limitations applicable to the object involved with complex graphics the application of structure is difficult to determine the start. In this paper, class tree is proposed based on the node to delete the exact graph isomorphism problem, you can quickly determine the graph isomorphism problem, and theoretical analysis and experiments show that the algorithm can determine the class in polynomial time tree isomorphism problem.

关键词： Graph Isomorphism LD algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：