An interactive lung field segmentation scheme with automated capability

Feasible clinical application of any automated segmenting methodology demands more than just accuracy. Amendment to the automated delineation is necessary when the algorithm fails, however, integrated solution to such a scenario is largely absent in literature. Hence in this survey we devised an architecture that does both the automated and interactive lung field localizations using a single segmenting engine—random walker algorithm—so that intuitive amendment is only necessary when the automated generated delineation is unsatisfactory. The algorithm proceeds by first extracting 18 intensity profiles running horizontally, each of them equally spacing apart, and in each intensity profile three extreme points denoting the two lungs and the esophagus are determined through profile matching. This done, the algorithm removes profiles that do not intersect with the lung, and the rest of the extreme points are plugged into random walker algorithm to perform segmentation. The achieved accuracy in localization by the above was 0.8875 in terms of overlap measure (the maximum value for this parameter is 1) over 341 images. In the case where unsatisfactory delineation prompts amendment necessary, the user can interactively segment the lung by just a shift on some of the previous-determined points to the desired locations, and random walker algorithm is run again with the amended input. By such a fusion, the benefits of both the automated and interactive segmentation are shared in a single architecture.     

用聚类预报模型预报三峡水库来水量的探讨

为了开展三峡水库入库来水量长期预报,从北半球500 hPa高度场、太平洋海温场、北半球100 hPa高度场、北半球地面气压场与74项环流特征指数作为预报因子,采用回归方程求解和回归效果检验,建立回归聚类预报物理模型,对三峡水库6～8月各月平均来水量进行了长期预报分析。结果表明,三峡水库6~8月份各月来水量回归聚类预报的技术路线是可行的,正、负距平符号一致的概率能达到80%以上,效果较好,基本上可以满足生产需要。回归聚类预报物理模型具有一定的应用推广价值。     

试论基层企业勘测档案管理的新模式

笔者结合自己档案管理工作的经验,阐述了传统勘测档案管理的缺点和现代勘测档案管理特点和优势,对实施现代勘测档案的管理方式进行了较细致的论述。     

光学薄膜元器件外观特性机器视觉检测系统

本系统利用工业级摄像头及开发包的机器视觉功能与计算软件编程控制技术相结合,通过与输入控制系统中的标准膜片模板外观品质进行对比,实现高速高效、准确识别检测光学薄膜器件中滤光片的外观缺陷。可在生产线上根据外观品质标准模板中设定的类别进行自动分类装盒。     

Supervised classification of share price trends

Share price trends can be recognized by using data clustering methods. However, the accuracy of these methods may be rather low. This paper presents a novel supervised classification scheme for the recognition and prediction of share price trends. We first produce a smooth time series using zero-phase filtering and singular spectrum analysis from the original share price data. We train pattern classifiers using the classification results of both original and filtered time series and then use these classifiers to predict the future share price trends. Experiment results obtained from both synthetic data and real share prices show that the proposed method is effective and outperforms the well-known K-means clustering algorithm.     

Two computational regimes of a single-compartment neuron separated by a planar boundary in conductance space

Recent in vitro data show that neurons respond to input variance with varying sensitivities. Here we demonstrate that Hodgkin-Huxley (HH) neurons can operate in two computational regimes: one that is more sensitive to input variance (differentiating) and one that is less sensitive (integrating). A boundary plane in the 3D conductance space separates these two regimes. For a reduced HH model, this plane can be derived analytically from the V nullcline, thus suggesting a means of relating biophysical parameters to neural computation by analyzing the neuron's dynamical system.     

A scalable kernel-based semisupervised metric learning algorithm with out-of-sample generalization ability

In recent years, metric learning in the semisupervised setting has aroused a lot of research interest. One type of semisupervised metric learning utilizes supervisory information in the form of pairwise similarity or dissimilarity constraints. However, most methods proposed so far are either limited to linear metric learning or unable to scale well with the data set size. In this letter, we propose a nonlinear metric learning method based on the kernel approach. By applying low-rank approximation to the kernel matrix, our method can handle significantly larger data sets. Moreover, our low-rank approximation scheme can naturally lead to out-of-sample generalization. Experiments performed on both artificial and real-world data show very promising results.     

A new graph cut-based multiple active contour algorithm without initial contours and seed points

This paper presents a new graph cut-based multiple active contour algorithm to detect optimal boundaries and regions in images without initial contours and seed points. The task of multiple active contours is framed as a partitioning problem by assuming that image data are generated from a finite mixture model with unknown number of components. Then, the partitioning problem is solved within a divisive graph cut framework where multi-way minimum cuts for multiple contours are efficiently computed in a top-down way through a swap move of binary labels. A split move is integrated into the swap move within that framework to estimate the model parameters associated with regions without the use of initial contours and seed points. The number of regions is also estimated as a part of the algorithm. Experimental results of boundary and region detection of natural images are presented and analyzed with precision and recall measures to demonstrate the effectiveness of the proposed algorithm.