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

Middle East Conference on Biomedical engineering (MECBME)

作者： Sayed Ahmad Salehi Rasoul Amirfattahi Department of Electrical and Computer Engineering Digital Signal Processing Research Laboratory Isfahan University of Technology Isfahan Iran

Regarding internal memory size, we proposed a new scan method for block-based structure to provide an efficient parametric structure for two Dimensional Discrete Wavelet Transform (2-D DWT). The main challenge in 2-D DWT structure is the amount of internal memory required to produce wavelet coefficients. The previous structures need fixed memory size depend on input frame size, but in proposed architecture, memory size is parametric and in trade off with the number of output memory access. Lifting scheme is incorporated to implement DWT.

关键词： Discrete wavelet transforms Memory management Hardware Pixel

来源：评论

学校读者我要写书评

暂无评论

Evaluation of some physiological statements about seizure, using processing of epileptic EEG signals

Evaluation of some physiological statements about seizure, u...

引用

Iranian Conference on electrical engineering (ICEE)

作者： F. Shayegh R. Amirfattahi S. Sadri K. Ansari-Asl Digital signal Processing Laboratory Department of Electrical and Computer Engineering Isfahan University of Technology Iran Electrical Department Engineering Faculty Shahid Chamran University of Ahvaz Iran

Seizure genesis is usually attributed to imbalance of the excitation and inhibition activities of neurons. It is claimed that slow inhibition mechanism is responsible for controlling the variations of the excitation mechanism, and any deficiency in this function will lead to disturbance of their natural balance. Fast inhibition mechanism is also known to collaborate with slow inhibitory processes. Any proof about the excitation and inhibition mechanisms refers to the ex-vivo or in-vitro experiments, i.e. from the microscopic point of view. Up to now, there is not a straight road into evaluating these hypotheses from the macroscopic view. In this paper we try to interpret the excitation-inhibition sequences extracted from some depth-EEG signals through an identification-based procedure. The aim is to check out whether the statements gained from microscopic observations are re-established in population of neurons in the case of MTLE or not. Using Neyman-Pearson hypothesis test technique we try to answer these questions. We observe that even in population of neurons slow inhibition is responsible for compensating excitatory processes to balance inhibitory /excitatory ratio, such that when it is impaired causes seizures to arise; also the average fast inhibitory process of population of neurons follows its slow inhibition dynamics. Also, we check the differentiation of the excitation-inhibition ratio between normal and ictal states, as well as between normal and pre-ictal states. Ictal activity is properly a state of abnormal high excitation-inhibition ratio but before beginning of seizures there are not unique patterns.

关键词： Brain modeling Electroencephalography Noise Mathematical model Neurons Cost function Equations

来源：评论

学校读者我要写书评

暂无评论

Elastic Shape Registration Using an Incremental Free Form Deformation Approach with the ICP Algorithm

Elastic Shape Registration Using an Incremental Free Form De...

引用

Canadian Conference on computer and Robot Vision, CRV

作者： Hossam Abdelmunim Aly A. Farag Computer & Systems Engineering Department Faculty of Engineering Ain Shams University Cairo Egypt Computer Vision and Image Processing Laboratory Electrical & Computer Engineering Department University of Louisville KY USA

Shape registration is one of the most challenging problems in computer vision and medical imaging. The process is affected by the way the shape is represented and the form of transformation used to move the source shape. Our paper handles the elastic shape registration by combining the incremental free form deformation (IFFD) with the point-based registration technique using the sum of least squares method. The iterative closest point (ICP) algorithm is used as a criteria to establish point correspondences in each level of the IFFD framework. The free form deformation (FFD) is well known in the literature and works by forming a lattice of control points that can move and hence deform the domain grid points smoothly and uniformly under some shape constrains. The control lattice resolution is increased step by step to achieve a satisfactory deformation of the source shape to exactly match the target boundaries. Our point-based registration is based on least squares that measure the Euclidean distance between source and target boundaries in addition to the shape constrains. The minimization gives a closed form solution of the lattice control points positions. Promising results will be demonstrated for closed and open shapes and structures. The approach can also work for structures that contain multiple parts without any problems.

关键词： Shape Lattices Iterative closest point algorithm Image resolution Mathematical model Equations Energy resolution

来源：评论

学校读者我要写书评

暂无评论

Elastic shape registration using an incremental free form deformation approach with the ICP algorithm

Elastic shape registration using an incremental free form de...

引用

IEEE International Conference on Image processing

作者： Hossam Abdelmunim Aly A. Farag Computer & Systems Engineering Department Ain Shams University Cairo Egypt Computer Vision and Image Processing Laboratory Electrical & Computer Engineering Department University of Louisville Louisville KY USA

Our paper handles the elastic shape registration by combining the incremental free form deformation (IFFD) with the point- based registration technique using the sum of least squares method. The iterative closest point (ICP) algorithm is used as criteria to establish point correspondences in each level of the IFFD framework. The IFFD control lattice resolution is in- creased step by step to achieve a satisfactory deformation of the source shape to exactly match the target boundaries. Our point-based registration is based on least squares that measure the Euclidean distance between source and target boundaries in addition to the shape constrains. The minimization gives a closed form solution of the lattice control points positions. Promising results will be demonstrated for closed and open shapes and structures. The approach can also work for structures that contain multiple parts without any problems.

关键词： Shape Lattices Iterative closest point algorithm Equations Spline Mathematical model Three dimensional displays

来源：评论

学校读者我要写书评

暂无评论

A compressive sensing based compressed neural network for sound source localization

A compressive sensing based compressed neural network for so...

引用

International Symposium on Artificial Intelligence and Signal processing (AISP)

作者： Mehdi Banitalebi Dehkordi Hamid Reza Abutalebi Hossein Ghanei Speech Processing Research Laboratory Electrical and Computer Engineering Department Yazd University Yazd Iran Electrical and Computer Engineering Department Yazd University Yazd Iran Idiap Research Institute Martigny Switzerland

Microphone arrays are today employed to specify the sound source locations in numerous real time applications such as speech processing in large rooms or acoustic echo cancellation. Signal sources may exist in the near field or far field with respect to the microphones. Current Neural Networks (NNs) based source localization approaches assume far field narrowband sources. One of the important limitations of these NN-based approaches is making balance between computational complexity and the development of NNs; an architecture that is too large or too small will affect the performance in terms of generalization and computational cost. In the previous analysis, saliency subject has been employed to determine the most suitable structure, however, it is time-consuming and the performance is not robust. In this paper, a family of new algorithms for compression of NNs is presented based on Compressive Sampling (CS) theory. The proposed framework makes it possible to find a sparse structure for NNs, and then the designed neural network is compressed by using CS. The key difference between our algorithm and the state-of-the-art techniques is that the mapping is continuously done using the most effective features; therefore, the proposed method has a fast convergence. The empirical work demonstrates that the proposed algorithm is an effective alternative to traditional methods in terms of accuracy and computational complexity.

关键词： Artificial neural networks Microphones Sparse matrices Approximation algorithms Training Biological neural networks Classification algorithms

来源：评论

学校读者我要写书评

暂无评论

Superiority of the 3rd order approximation model to the 2nd order in Diffusion Kurtosis Imaging

Superiority of the 3rd order approximation model to the 2nd ...

引用

作者： 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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：