螺旋CT的滤过算法影响图像质量的研究

目的探讨螺旋CT滤过算法对图像质量的影响,如何充分有效地利用滤过算法技术和使用规律。方法分析不同的滤过算法对扫描水模的空间分辨力、噪声、CT值的影响,再用不同滤过算法对人体不同部位组织器官的扫描图像进行对比分析。结果滤过算法对低对比分辨力和噪声的影响较大,肺算法的低对比分辨力最高,边缘算法的噪声最大,软组织算法最小;对空间分辨力骨加算法和边缘算法最高,噪声也最大;对软组织使用低对比和低噪声的算法,会使组织边缘更加圆滑,增加软组织对比,对骨组织和肺组织使用高空间分辨力算法会增加组织边缘的锐利程度,图像显示更加清晰。滤过算法对组织的平均CT值影响较小,但对最大和最小值有影响。结论恰当选择滤过算法是保证CT图像质量的重要条件。

An algorithm for segmentation of lung ROI by mean-shift clustering combined with multi-scale HESSIAN matrix dot filtering

A new algorithm for segmentation of suspected lung ROI(regions of interest)by mean-shift clustering and multi-scale HESSIAN matrix dot filtering was proposed.Original image was firstly filtered by multi-scale HESSIAN matrix dot filters,round suspected nodular lesions in the image were enhanced,and linear shape regions of the trachea and vascular were suppressed.Then,three types of information,such as,shape filtering value of HESSIAN matrix,gray value,and spatial location,were introduced to feature space.The kernel function of mean-shift clustering was divided into product form of three kinds of kernel functions corresponding to the three feature information.Finally,bandwidths were calculated adaptively to determine the bandwidth of each suspected area,and they were used in mean-shift clustering segmentation.Experimental results show that by the introduction of HESSIAN matrix of dot filtering information to mean-shift clustering,nodular regions can be segmented from blood vessels,trachea,or cross regions connected to the nodule,non-nodular areas can be removed from ROIs properly,and ground glass object(GGO)nodular areas can also be segmented.For the experimental data set of 127 different forms of nodules,the average accuracy of the proposed algorithm is more than 90%.

A Probabilistic Rating Prediction and Explanation Inference Model for Recommender Systems

Collaborative Filtering(CF) is a leading approach to build recommender systems which has gained considerable development and popularity. A predominant approach to CF is rating prediction recommender algorithm, aiming to predict a user's rating for those items which were not rated yet by the user. However, with the increasing number of items and users, thedata is sparse.It is difficult to detectlatent closely relation among the items or users for predicting the user behaviors. In this paper,we enhance the rating prediction approach leading to substantial improvement of prediction accuracy by categorizing according to the genres of movies. Then the probabilities that users are interested in the genres are computed to integrate the prediction of each genre cluster. A novel probabilistic approach based on the sentiment analysis of the user reviews is also proposed to give intuitional explanations of why an item is recommended.To test the novel recommendation approach, a new corpus of user reviews on movies obtained from the Internet Movies Database(IMDB) has been generated. Experimental results show that the proposed framework is effective and achieves a better prediction performance.

Federal extended Kalman filter based on reconstructed observation in incomplete observations

In the estimation and identification of nonlinear system state,aiming at the adverse effect of observation missing randomly caused by detection probability of used sensor which is less than 1,a novel federal extended Kalman filter( FEKF) based on reconstructed observation in incomplete observations( ROIO) is proposed in this paper. On the basis of multi-sensor observation sets,the observation is exchanged at different times to construct a new observation set. Based on each observation set,an extended Kalman filter algorithm is used to estimate the state of the target,and then the federal filtering algorithm is used to solve the state estimation based on the multi-sensor observation data. The effect of the sensor probing probability on the filtering result and the effect of the number of sensors on the filtering result are obtained by the simulation experiment,respectively. The simulation results demonstrate effectiveness of the proposed algorithm.

Adaptive Gaussian Noise Image Removal Algorithm Using Filtering-Based Noise Estimation

This paper proposes a spatially denoising algorithm using filtering-based noise estimation for an image corrupted by Gaussian noise.The proposed algorithm consists of two stages:estimation and elimination of noise density.To adaptively deal with variety of the noise amount,a noisy input image is firstly filtered by a lowpass filter.Standard deviation of the noise is computed from different images between the noisy input and its filtered image.In addition,a modified Gaussian noise removal filter based on the local statistics such as local weighted mean,local weighted activity and local maximum is used to control the degree of noise suppression.Experiments show the effectiveness of the proposed algorithm.

Accelerating Packet Classification with Counting Bloom Filters for Virtual Open Flow Switching

The growing trend of network virtualization results in a widespread adoption of virtual switches in virtualized environments. However, virtual switching is confronted with great performance challenges regarding packet classification especially in Open Flow-based software defined networks. This paper first takes an insight into packet classification in virtual Open Flow switching, and points out that its performance bottleneck is dominated by flow table traversals of multiple failed mask probing for each arrived packet. Then we are motivated to propose an efficient packet classification algorithm based on counting bloom filters. In particular, counting bloom filters are applied to predict the failures of flow table lookups with great possibilities, and bypass flow table traversals for failed mask probing. Finally, our proposed packet classification algorithm is evaluated with real network traffic traces by experiments. The experimental results indicate that our proposed algorithm outperforms the classical one in Open v Switch in terms of average search length, and contributes to promote virtual Open Flow switching performance.

Adaptive bands filter bank optimized by genetic algorithm for robust speech recognition system

Perceptual auditory filter banks such as Bark-scale filter bank are widely used as front-end processing in speech recognition systems.However,the problem of the design of optimized filter banks that provide higher accuracy in recognition tasks is still open.Owing to spectral analysis in feature extraction,an adaptive bands filter bank (ABFB) is presented.The design adopts flexible bandwidths and center frequencies for the frequency responses of the filters and utilizes genetic algorithm (GA) to optimize the design parameters.The optimization process is realized by combining the front-end filter bank with the back-end recognition network in the performance evaluation loop.The deployment of ABFB together with zero-crossing peak amplitude (ZCPA) feature as a front process for radial basis function (RBF) system shows significant improvement in robustness compared with the Bark-scale filter bank.In ABFB,several sub-bands are still more concentrated toward lower frequency but their exact locations are determined by the performance rather than the perceptual criteria.For the ease of optimization,only symmetrical bands are considered here,which still provide satisfactory results.

Distributed Plume Source Localization Using Hierarchical Sensor Networks

A hierarchical wireless sensor networks(WSN) was proposed to estimate the plume source location.Such WSN can be of tremendous help to emergency personnel trying to protect people from terrorist attacks or responding to an accident.The entire surveillant field is divided into several small sub-regions.In each sub-region,the localization algorithm based on the improved particle filter(IPF) was performed to estimate the location.Some improved methods such as weighted centroid,residual resampling were introduced to the IPF algorithm to increase the localization performance.This distributed estimation method eliminates many drawbacks inherent with the traditional centralized optimization method.Simulation results show that localization algorithm is efficient for estimating the plume source location.

An evolutionary particle filter based EM algorithm and its application

In this paper, an evolutionary recursive Bayesian estimation algorithm is presented, which incorporates the latest observation with a new proposal distribution, and the posterior state density is represented by a Gaussian mixture model that is recovered from the weighted particle set of the measurement update step by means of a weighted expectation-maximization algorithm. This step replaces the resampling stage needed by most particle filters and relieves the effect caused by sample impoverishment. A nonlinear tracking problem shows that this new approach outperforms other related particle filters.

Managing High Volume Data for Network Attack Detection Using Real-Time Flow Filtering

In this paper, we present Real-Time Flow Filter (RTFF) -a system that adopts a middle ground between coarse-grained volume anomaly detection and deep packet inspection. RTFF was designed with the goal of scaling to high volume data feeds that are common in large Tier-1 ISP networks and providing rich, timely information on observed attacks. It is a software solution that is designed to run on off-the-shelf hardware platforms and incorporates a scalable data processing architecture along with lightweight analysis algorithms that make it suitable for deployment in large networks. RTFF also makes use of state of the art machine learning algorithms to construct attack models that can be used to detect as well as predict attacks.

Adaptive template filter method for image processing based on immune genetic algorithm

To preserve the original signal as much as possible and filter random noises as many as possible in image processing,a threshold optimization-based adaptive template filtering algorithm was proposed.Unlike conventional filters whose template shapes and coefficients were fixed,multi-templates were defined and the right template for each pixel could be matched adaptively based on local image characteristics in the proposed method.The superiority of this method was verified by former results concerning the matching experiment of actual image with the comparison of conventional filtering methods.The adaptive search ability of immune genetic algorithm with the elitist selection and elitist crossover(IGAE) was used to optimize threshold t of the transformation function,and then combined with wavelet transformation to estimate noise variance.Multi-experiments were performed to test the validity of IGAE.The results show that the filtered result of t obtained by IGAE is superior to that of t obtained by other methods,IGAE has a faster convergence speed and a higher computational efficiency compared with the canonical genetic algorithm with the elitism and the immune algorithm with the information entropy and elitism by multi-experiments.

Image Denoising Algorithm Considering Nonlocal Texture Pattern

Image denoising is indispensable for image processing.In this paper,image denoising algorithm based on Nonlocal Means(NLM)filter is proposed.Recently,abundant enhancements based on NLM filter have been performed.However,the performance of NLM filter is still inferior to that of other image processing approaches such as K-SVD.In this paper,NLM algorithm with weight refinement is utilized for image denoising.Weight refinement is performed to thoroughly take advantage of self-similarity of the image.Experimental results show good performance of the proposed method.

On Efficiency of Simultaneous Perturbation Stochastic Approximation Method for Implementation of an Adaptive Filter

In this paper, the simultaneous perturbation stochastic approximation （SPSA） algorithm is used for seeking optimal parameters in an adaptive filter developed for assimilating observations in the very high dimensional dynamical systems. The main results show that the SPSA is capable of yielding the high filter performance similar to that produced by classical optimization algorithms, with better performance for non-linear filtering problems as more and more observations are assimilated. The advantage of the SPSA is that at each iteration it requires only two measurements of the objective function to approximate the gradient vector regardless of the dimension of the control vector （or maximally, three measurements if second-order optimization algorithms are used）. The SPSA approach is thus free from the need to develop a discrete adjoint of tangent linear model as it is required up to now for solving optimization problems in very high dimensional systems. This technique offers promising perspectives on developing optimal assimilation systems encountered in the field of data assimilation in meteorology and oceanography.

A new method for extracting domain terminology

This article proposes a new general, highly efficient algorithm for extracting domain terminologies. This domain-independent algorithm with multi-layers of filters is a hybrid of statistic-oriented and rule-oriented methods. Utilizing the features of domain terminologies and the characteristics that are unique to Chinese, this algorithm extracts domain terminologies by generating multi-word unit （MWU） candidates at first and then fihering the candidates through multi-strategies. Our test resuhs show that this algorithm is feasible and effective.

Pre-filtering based automatic composition of multi-QoS semantic web services

To support the rapid automatic services composition and fulfill multi-quality of service （multi- QoS） demand, we propose a novel approach to realize services composition automatically by a prefihering process. Aimed at a set of web services with similar functionality and different quality of service （QoS） , a semantic services chain is given and a corresponding constructing algorithm is proposed to construct the data structure. A pre-filtering process is put forward to find whether a composition service before planning exists. It can avoid aborted planning. An optimal planning algorithm is proposed which can choose the most suitable service from a lot of similar candidate services based on semantic service chains and multi-QoS values. The algorithms can improve the correctness and automation performances of automated semantic web services composition. As an example, a concrete composite process is analyzed. Experimental results show the validity of the composite process.

CT图像边缘锐化及平滑功能在影像诊断中的价值

近年来,在临床医院配置的现代大型医疗设备越来越多,医学影像技术在临床诊断与医学研究中扮演了愈来愈重要的地位。影像设备的进步体现在提供的信息量逐步的增加,直观的影像结果一方面帮助临床排除许多不确定因素,分析解决大量疑难杂症。

Improved Algorithm for Distributed Localization in Wireless Sensor Networks

Many sensor network applications require location awareness,but it is often too expensive to equip a global positioning system(GPS) receiver for each network node.Hence,localization schemes for sensor networks typically use a small number of seed nodes that know their locations and protocols whereby other nodes estimate their locations from the messages they receive.For the inherent shortcomings of general particle filter(the sequential Monte Carlo method) this paper introduces particle swarm optimization and weighted centroid algorithm to optimize it.Based on improvement a distributed localization algorithm named WC-IPF(weighted centroid algorithm improved particle filter) has been proposed for localization.In this localization scheme the initial estimate position can be acquired by weighted centroid algorithm.Then the accurate position can be gotten via improved particle filter recursively.The extend simulation results show that the proposed algorithm is efficient for most condition.

Filtering and tracking with trinion-valued adaptive algorithms

A new model for three-dimensional processes based on the trinion algebra is introduced for the first time.Compared to the pure quaternion model, the trinion model is more compact and computationally more efficient,while having similar or comparable performance in terms of adaptive linear filtering. Moreover, the trinion model can effectively represent the general relationship of state evolution in Kalman filtering, where the pure quaternion model fails. Simulations on real-world wind recordings and synthetic data sets are provided to demonstrate the potential of this new modeling method.

Observability Analysis and Navigation Algorithm for Distributed Satellites System Using Relative Range Measurements

The problem of navigation for the distributed satellites system using relative range mea- surements is investigated. Firstly, observability for every participating satellites is analyzed based on the nonlinear Keplerian model containing J2 perturbation and the nonlinear measurements. It is proven that the minimum number of tracking satellites to assure the observability of the distributed satellites system is three. Additionally, the analysis shows that the J2 perturbation and the nonlinearity make little contribution to improve the observability for the navigation. Then, a quasi-consistent extended Kalman filter based navigation algorithm is proposed, which is quasi-consistent and can provide an on- line evaluation of the navigation precision. The simulation illustrates the feasibility and effectiveness of the proposed navigation algorithm for the distributed satellites system.

Retinex based low-light image enhancement using guided filtering and variational framework

A new image enhancement algorithm based on Retinex theory is proposed to solve the problem of bad visual effect of an image in low-light conditions. First, an image is converted from the RGB color space to the HSV color space to get the V channel. Next, the illuminations are respectively estimated by the guided filtering and the variational framework on the V channel and combined into a new illumination by average gradient. The new reflectance is calculated using V channel and the new illumination. Then a new V channel obtained by multiplying the new illumination and reflectance is processed with contrast limited adaptive histogram equalization(CLAHE). Finally, the new image in HSV space is converted back to RGB space to obtain the enhanced image. Experimental results show that the proposed method has better subjective quality and objective quality than existing methods.