This paper describes a novel 3D needle segmentation algorithm for 3DUS data. The algorithm includes the 3D Gray-level Hough Transform (3DGHT), which is based on the representation (ψ, θ, ρ, α) of straight lines in...
详细信息
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 ...
详细信息
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.
A resource-constrained transport task scheduling problem (RCTTSP) with two optimal objectives was considered, and a multi-objective hybrid genetic algorithm (HGA) was proposed. The proposed algorithm used the serial s...
详细信息
A resource-constrained transport task scheduling problem (RCTTSP) with two optimal objectives was considered, and a multi-objective hybrid genetic algorithm (HGA) was proposed. The proposed algorithm used the serial scheduling method to initialize the population and evaluated the individual. It used the weighted sum method and the rank-based fitness assignment method to assign the individual fitness. Firstly, this paper described the multi-objective RCTTSP and presented the principle of the HGA, and then developed the algorithm to implement several experimental cases with different problem size;lastly the effectiveness and efficiency of the algorithm were compared. The numerical result indicated that the proposed multi-objective HGA can resolve the proposed multi-objective RCTTSP efficiently.
An efficient image denoising algorithm is introduced. Firstly, image pixels are classified into noisy pixels and noise-free pixels by four directional operators. Then an adaptive weighted median filter is designed to ...
详细信息
An efficient image denoising algorithm is introduced. Firstly, image pixels are classified into noisy pixels and noise-free pixels by four directional operators. Then an adaptive weighted median filter is designed to remove and restore the detected noisy pixels and keep the noise-free ones unchanged. Experimental results indicate that the proposed algorithm preserves image details well while removing impulsive noise efficiently, and its filtering performance is significantly superior to the classical median filter and some other typical and recently developed improved median filters.
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 desig...
详细信息
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.
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 gri...
详细信息
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.
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 conven...
详细信息
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.
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...
详细信息
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.
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. The...
详细信息
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.
暂无评论