We propose a constrained, three-dimensional, nonparametric, entropy-based, coupled, multi-shape approach to segment subcortical brain structures from magnetic resonance images (MRI). The proposed method uses PCA to de...
详细信息
We propose a constrained, three-dimensional, nonparametric, entropy-based, coupled, multi-shape approach to segment subcortical brain structures from magnetic resonance images (MRI). The proposed method uses PCA to develop shape models that capture structural variability. It integrates geometrical relationship between different structures into the algorithm by coupling them (limiting their independent deformations). On the other hand, to allow variations among coupled structures, it registers each structure separately when building the shape models. It defines an entropy-based energy function, which is minimized using quasi-Newton algorithm. To this end, probability density functions (pdf) are estimated iteratively using nonparametric Parzen window method. In the optimization algorithm, constraints are used to improve segmentation quality. These constraints are extracted from training data. Sample results are given for the segmentation of caudate, hippocampus, and putamen, illustrating highly superior performance of the proposed method compared to the most similar methods in the literature.
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.
A quick 3D needle segmentation algorithm for 3D US data is described in this paper. The algorithm includes the 3D quick randomized Hough transform (3DGHT), which is based on the 3D randomized Hough transform and coars...
详细信息
A quick 3D needle segmentation algorithm for 3D US data is described in this paper. The algorithm includes the 3D quick randomized Hough transform (3DGHT), which is based on the 3D randomized Hough transform and coarse-fine searching strategy. We tested it with water phantom. The results show that our algorithm works well in 3D US images with angular deviation less than 1 degree and position deviation less than 1 mm, and the computational time of segmentation with 35 MB data is within 1s.
Short-term forecasting of travel time is essential for the success of intelligent transportation system. In this paper, we review the state-of-art of short-term traffic forecasting models and outline their basic ideas...
详细信息
Short-term forecasting of travel time is essential for the success of intelligent transportation system. In this paper, we review the state-of-art of short-term traffic forecasting models and outline their basic ideas, related works, advantages and disadvantages of each model. An improved adaptive exponential smoothing (IAES) model is also proposed to overcome the drawbacks of the previous adaptive exponential smoothing model. Then, comparing experiments are carried out under normal traffic condition and abnormal traffic condition to evaluate the performance of four main branches of forecasting models on direct travel time data obtained by license plate matching (LPM). The results of experiments show each model seems to have its own strength and weakness. The forecasting performance of IASE is superior to other models in shorter forecasting horizon (one and two step forecasting) and the IASE is capable of dealing with all kind of traffic conditions.
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.
Understanding the primatespsila visual system has been one of the challenging problems of different groups of scientists for years. Though many studies, from physiology and neuroscience to computer vision, are done on...
详细信息
Understanding the primatespsila visual system has been one of the challenging problems of different groups of scientists for years. Though many studies, from physiology and neuroscience to computer vision, are done on different aspects of visual processing in the cortex, a comprehensive computational model of visual cortex is still missing. We have implemented a computational model of object recognition in ventral visual pathway in our previous work. This hierarchical model covers visual areas V1/V2, V4/PIT, and AIT sending inputs to the Prefrontal Cortex (PFC) for categorization. To extend our model, in this work, we have added a simple model of motion detection in neurons of areas V1 and MT of the dorsal stream to our previous model. This has enabled the model to perform another principal function of the visual cortex, i.e., motion perception.
In this paper, we propose an improved particle filter algorithm for real-time tracking a randomly moving target in dynamic environment with a moving monocular camera. For making the tracking task robustly and effectiv...
详细信息
ISBN:
(纸本)9780819469502
In this paper, we propose an improved particle filter algorithm for real-time tracking a randomly moving target in dynamic environment with a moving monocular camera. For making the tracking task robustly and effectively, color histogram based target model is integrated into particle filter algorithm. Bhattacharyya distance is used to weight samples by calculating each sample's histogram with a specified target model and it makes the measurement matching and samples' weight updating more reasonable. In order to reduce sample depletion, the improved algorithm will be able to take the latest observation into account. The experimental results confirm that the method is effective even when the monocular camera is moving and the target object is partially occluded in a clutter background.
In this paper, a face recognition method using local qualitative representations is proposed to solve the problem of face recognition in varying lighting. Based on the observation that the ordinal relationship between...
详细信息
ISBN:
(纸本)9780819469526
In this paper, a face recognition method using local qualitative representations is proposed to solve the problem of face recognition in varying lighting. Based on the observation that the ordinal relationship between the average brightness of image regions pair is invariant under lighting changes, Local Binary Mapping is defined as an illumination invariant for face recognition based on Local Binary Pattern descriptor, which extracts the local variance features of an image. For the 'symbol' feature vector, hamming distance is used as similarity measurement. It has been proved that the proposed method can provide the accuracy of 100 percent for subset 2, 3, 4 and 98.89 percent for subset 5 of the Yale facial database B when all images in subset 1 are used as gallery.
In this paper, a pixel-level image fusion algorithm based on Nonsubsampled Contourlet Transform (NSCT) has been proposed. Compared with Contourlet Transform, NSCT is redundant, shift-invariant and more suitable for im...
详细信息
ISBN:
(纸本)9780819469519
In this paper, a pixel-level image fusion algorithm based on Nonsubsampled Contourlet Transform (NSCT) has been proposed. Compared with Contourlet Transform, NSCT is redundant, shift-invariant and more suitable for image fusion. Each image from different sensors could be decomposed into a low frequency image and a series of high frequency images of different directions by multi-sacle NSCT. For low and high frequency images, they are fused based on local-contrast enhancement and definition respectively. Finally, fused image is reconstructed from low and high frequency fused images. Experiment demonstrates that NSCT could preserve edge significantly and the fusion rule based on region segmentation performances well in local-contrast enhancement.
暂无评论