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

Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)

作者： Guokuan Li Yu Luo Wei Deng Xiangyang Xu Aihua Liu Enmin Song School of Computer Science and Technology Key Laboratory for Image Processing & Intelligent Control of Ministry of Education Huazhong University of Science and Technology Wuhan China School of Computer Science and Technology Huazhong University of Science and Technology China Ultrasound Department Sixth Hospital of Wuhan City China

B-scan ultrasound is the primary means for the diagnosis of fatty liver. However, due to use of various ultrasound equipments, poor quality of ultrasonic images and physical differences of patients, fatty liver diagnosis is mainly qualitative, and often depends on the subjective judgment of technicians and doctors. Therefore, computer-aided feature extraction and quantitative analysis of liver B-scan ultrasonic images will help to improve clinical diagnostic accuracy, repeatability and efficiency, and could provide a measure for severity of hepatic steatosis. This paper proposed a novel method of fatty liver diagnosis based on liver B-mode ultrasonic images using support vector machine (SVM). Fatty liver diagnosis was transformed into a pattern recognition problem of liver ultrasound image features. According to the different characteristics of fatty liver and healthy liver, important image features were extracted and selected to distinguish between the two categories. These features could be represented by near-field light-spot density, near-far-field grayscale ratio, grayscale co-occurrence matrix, and neighborhood gray-tone difference matrix (NGTDM). A SVM classifier was modeled and trained using the clinical ultrasound images of both fatty liver and normal liver. It was then exploited to classify normal and fatty livers, achieving a high recognition rate. The diagnostic results are satisfactorily consistent with those made by doctors. This method could be used for computer-aided diagnosis of fatty liver, and help doctors identify the fatty liver ultrasonic images rapidly, objectively and accurately.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Algorithm of Visual Target Tracking on Monocular Camera Based on Particle Filter

An Algorithm of Visual Target Tracking on Monocular Camera B...

引用

27th Chinese control Conference

作者： Liu Guocheng Wang Yongji Wuhan Univ Sch Power & Mech Engn Wuhan 430072 Peoples R China Educ Minist China Key Lab Image Proc & Intelligent Control Wuhan 430074 Peoples R China Huazhong Univ Sci & Technol Dept Control Sci & Engn Wuhan 430072 Peoples R China

ISBN: (纸本)9787900719706

An improved particle filter algorithm was presented to track a moving target under natural environment, in which the color histogram was integrated with the measurement model, the latest observations was taken into account and the system model is the second order autoregressive process. The proposed method can deal with rotation and scale transformation, variations in the light source and partial occlusions, and the tracked target can be rigid or non-rigid. The demonstration examples showed that the method can track the target with robustness in real-time.

关键词： Particle filter Visual tracking Color histogram

来源：评论

学校读者我要写书评

暂无评论

A wearable device for repetitive hand therapy

A wearable device for repetitive hand therapy

引用

IEEE/RAS-EMBS International Conference on Biomedical Robotics and Biomechatronics (BioRob)

作者： Kexin Xing Qi Xu Jiping He Yongji Wang Zhongwei Liu Xiaolin Huang Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Technology Huazhong University of Science and Technology Wuhan China Harrington Department of Bioengineering and Center for Neural Interface Design at the Biodesign Institute Arizona State University Tempe AZ USA Department of Rehabilitation Medicine Tongji Hospital Tongji Medical College Huazhong University of Science and Technology Wuhan China

Intensive task-oriented repetitive physical therapies provided by individualized interaction between the patient and a rehabilitation specialist can improve hand motor performance in patients survived from stroke and traumatic brain injury. However, the therapy process is long and expensive and difficult to evaluate quantitatively and objectively. The goal of this research is to develop a novel wearable device for robotic assisted hand repetitive therapy. We designed a pneumatic muscle (PM) driven therapeutic device that is wearable and provides assistive forces required for grasping and release movements. The robot has two distinct degrees of freedom at the thumb and the fingers. The embedded sensors feedback position and force information for robot control and quantitative evaluation of task performance. It has the potential of providing supplemental at-home therapy in addition to in the clinic treatment.

关键词： Medical treatment Robot sensing systems Force feedback Brain injuries Rehabilitation robotics Muscles Grasping Thumb Fingers Wearable sensors

来源：评论

学校读者我要写书评

暂无评论

Multi-objective carrier chaotic evolutionary algorithm for DNA sequences design

引用

Progress in Natural Science:Materials International 2007年第12期17卷 1515-1520页

作者： Xiao Jianhua, Xu Jin, Geng Xiutang and Pan Linqiang(key laboratory of image processing and intelligent control, Department of control Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China) Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China

DNA computing is a new vista of computation, which is of biochemical type. Since each piece of information is encoded in biological sequences, their design is crucial for successful DNA computation. DNA sequence design is involved with a number of design criteria, which is difficult to be solved by the traditional optimization methods. In this paper, the multi-objective carrier chaotic evolution algorithm (MCCEA) is introduced to solve the DNA sequence design problem. By merging the chaotic search base on power function carrier, a set of good DNA sequences are generated. Furthermore, the simulation results show the efficiency of our method.

关键词： DNA computing carrier chaotic search multi-objective evolutionary algorithm DNA sequences design.

来源：评论

学校读者我要写书评

暂无评论

A global heuristically search algorithm for DNA encoding

引用

Progress in Natural Science:Materials International 2007年第6期17卷 745-749页

作者： Zhang Kai, Pan Linqiang and Xu Jin (The key laboratory of image processing and intelligent control, Department of control Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China) Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China

A new efficient algorithm is developed to design DNA words with equal length for DNA computing. The algorithm uses a global heuristic optimizing search approach and converts constraints to a carry number to accelerate the convergence, which can generate a DNA words set satisfying some thermodynamic and combinatorial constraints. Based on the algorithm, a software for DNA words design is developed.

关键词： DNA computing encoding heuristic optimizing search

来源：评论

学校读者我要写书评

暂无评论

Signal processing for sound synthesis:: Computer-generated sounds and music for all

引用

IEEE SIGNAL processing MAGAZINE 2007年第2期24卷 8-+页

作者： Valimaki, Vesa Rabenstein, Rudolf Rocchesso, Davide Serra, Xavier Smith, Julius O. Key Lab of Intelligent Perception and Image Understanding of Ministry of Education Xidian University Xi'an China Key Lab of Radar Signal Processing Xidian University Xi'an China

Almost everybody uses sound synthesis in their daily lives, although many may not know it.

关键词： Acoustic signal processing Signal synthesis Multiple signal classification Music Synthesizers Signal processing algorithms Instruments Digital signal processing control system synthesis Mobile handsets

来源：评论

学校读者我要写书评

暂无评论

DNA-Based efficient evaluation of the S-boxes' resistance to differential cryptanalysis

引用

JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE 2007年第7-8期4卷 1263-1268页

作者： Chen, Zhihua Geng, Xiutang Xiao, Jianhua Zhang, Xuncai Huazhong Univ Sci & Technol Dept Control Sci & Engn Key Lab Image Proc & Intelligent Control Wuhan 430074 Peoples R China

This paper outlines the application of DNA computing in the information security field. In this paper, we describe a kind of parallel XOR function model based on DNA chip, hybridization, and enzyme-cut technology. Then we apply the model to the efficient evaluation of the S-boxes' resistance to differential cryptanalysis. From the application, we evaluate the output XOR value distribution statistics of S-boxes and estimate the security of DES.

关键词： DNA chip S-box input XOR output XOR enzyme-cut differential cryptanalysis

来源：评论

学校读者我要写书评

暂无评论

A simple simulated annealing algorithm for the maximum clique problem

引用

INFORMATION SCIENCES 2007年第22期177卷 5064-5071页

作者： Geng, Xiutang Xu, Jin Xiao, Jianhua Pan, Linqiang Huazhong Univ Sci & Technol Dept Control Sci & Engn Key Lab Image Proc & Intelligent Control Wuhan 430074 Peoples R China

Simulated annealing technique has mostly been used to solve various optimization and learning problems, and it is well known that the maximum clique problem is one of the most studied NP-hard optimization problems owing to its numerous applications. In this note, a simple simulated annealing algorithm for the maximum clique problem is proposed and tested on all 80 DIMACS maximum clique instances. Although it is simple, the proposed simulated annealing algorithm is efficient on most of the DIMACS maximum clique instances. The simulation results show that the proposed simulated annealing algorithm outperforms a recent efficient simulated annealing algorithm proposed by Xu and Ma, and the solutions obtained by the proposed simulated annealing algorithm have the equal quality with those obtained by a recent trust region heuristic algorithm of Stanislav Busygin. (C) 2007 Elsevier Inc. All rights reserved.

关键词： simulated annealing algorithm maximum clique problem minimum vertex cover problem NP-hard optimization problem heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

A novel DNA computing model based on RecA-mediated triple-stranded DNA structure

引用

Progress in Natural Science:Materials International 2007年第6期17卷 708-711页

作者： Fang Gang1, Zhang Shemin2, Dong Yafei1 and Xu Jin1(1. The key laboratory of image processing and intelligent control, Department of control Science & Engineering, Huazhong University of Science and Technology, Wuhan 430074, China 2. Shaanxi University of Technology, Hanzhong 723000, China) Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China Shaanxi University of Technology Hanzhong 723000 China

The field of DNA computing emerged in 1994 after Adleman’s paper was published. Henceforth,a few scholars solved some noted NP-complete problems in this way. And all these methods of DNA computing are based on conventional Watson-Crick hydrogen bond of doublehelical DNA molecule. In this paper, we show that the triple-stranded DNA structure mediated by RecA protein can be used for solving computational problems. Sequence-specific recognition of double-stranded DNA by oligonucleotide-directed triple helix (triplex) formation is used to carry out the algorithm. We present procedure for the 3-vertex-colorability problems. In our proposed procedure, it is suggested that it is possible to solve more complicated problems with more variables by this model.

关键词： DNA computing 3-vertex-colorability problem.

来源：评论

学校读者我要写书评

暂无评论

A recursive molecular sticker algorithm for the maximal clique problem

引用

JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE 2007年第7-8期4卷 1253-1256页

作者： Geng, Xiutang Xiao, Jianhua Xu, Jin Huazhong Univ Sci & Technol Dept Control Sci & Engn Key Lab Image Proc & Intelligent Control Wuhan 430074 Peoples R China

Among various DNA computing algorithms, it is very important to generate an initial data pool that covers both correct and incorrect answers. However, algorithms based on brute force search are limited to problem size, since the bigger the problem, the bigger the initial data pool. In this paper, we propose a recursive molecular sticker algorithm to resolve the maximal clique problem. Some graphs with more vertices can be handled with the proposed algorithm. Particularly, our algorithm is adapted to some graphs with lower edge density. For a given graph with n vertices, the time complexity of our algorithm is O(n(2)). In addition, three kinds of enzymes, two kinds of memory strands, n kinds of stickers, n sticker tubes, n+2 separation tubes and n data tubes are necessary for our recursive molecular sticker algorithm to resolve the maximal clique problem.

关键词： DNA computing sticker model maximal clique problem recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：