Efficient interval partitioning for constrained global optimization

A new efficient interval partitioning approach to solve constrained global optimization problems is proposed. This involves a new parallel subdivision direction selection method as well as an adaptive tree search. The latter explores nodes (intervals in variable domains) using a restricted hybrid depth-first and best-first branching strategy. This hybrid approach is also used for activating local search to identify feasible stationary points. The new tree search management technique results in improved performance across standard solution and computational indicators when compared to previously proposed techniques. On the other hand, the new parallel subdivision direction selection rule detects infeasible and suboptimal boxes earlier than existing rules, and this contributes to performance by enabling earlier reliable deletion of such subintervals from the search space.     

A modification of a solution concept of the linear programming problem with interval coefficients in the constraints

We propose a modification of a concept of solving a linear programming problem with interval coefficients in the constraints. The original concept imposes the decision maker a way comparing intervals, our modification—which is an interactive approach, comprising the original one as its special case—gives him more freedom in the choice of the preference relation. Thanks to this flexibility he may be able to find a solution which better suits his needs and attitude towards risk. What is more, our modification corrects a serious drawback of the original method.     

A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion

In this paper we discuss a minmax regret version of the single-machine scheduling problem with the total flow time criterion. Uncertain processing times are modeled by closed intervals. We show that if the deterministic problem is polynomially solvable, then its minmax regret version is approximable within 2.     

Automated Spleen Injury Detection Using 3D Active Contours and Machine Learning

The spleen is one of the most frequently injured organs in blunt abdominal trauma. Computed tomography (CT) is the imaging modality of choice to assess patients with blunt spleen trauma, which may include lacerations, subcapsular or parenchymal hematomas, active hemorrhage, and vascular injuries. While computer-assisted diagnosis systems exist for other conditions assessed using CT scans, the current method to detect spleen injuries involves the manual review of scans by radiologists, which is a time-consuming and repetitive process. In this study, we propose an automated spleen injury detection method using machine learning. CT scans from patients experiencing traumatic injuries were collected from Michigan Medicine and the Crash Injury Research Engineering Network (CIREN) dataset. Ninety-nine scans of healthy and lacerated spleens were split into disjoint training and test sets, with random forest (RF), naive Bayes, SVM, k-nearest neighbors (k-NN) ensemble, and subspace discriminant ensemble models trained via 5-fold cross validation. Of these models, random forest performed the best, achieving an Area Under the receiver operating characteristic Curve (AUC) of 0.91 and an F1 score of 0.80 on the test set. These results suggest that an automated, quantitative assessment of traumatic spleen injury has the potential to enable faster triage and improve patient outcomes.     

Magnetic-resonance image segmentation based on improved variable weight multi-resolution Markov random field in undecimated complex wavelet domain

To solve the problem that the magnetic resonance (MR) image has weak boundaries, large amount of information, and low signal-to-noise ratio, we propose an image segmentation method based on the multi-resolution Markov random field (MRMRF) model. The algorithm uses undecimated dual-tree complex wavelet transformation to transform the image into multiple scales. The transformed low-frequency scale histogram is used to improve the initial clustering center of the K-means algorithm, and then other cluster centers are selected according to the maximum distance rule to obtain the coarse-scale segmentation. The results are then segmented by the improved MRMRF model. In order to solve the problem of fuzzy edge segmentation caused by the gray level inhomogeneity of MR image segmentation under the MRMRF model, it is proposed to introduce variable weight parameters in the segmentation process of each scale. Furthermore, the final segmentation results are optimized. We name this algorithm the variable-weight multi-resolution Markov random field (VWMRMRF). The simulation and clinical MR image segmentation verification show that the VWMRMRF algorithm has high segmentation accuracy and robustness, and can accurately and stably achieve low signal-to-noise ratio, weak boundary MR image segmentation.     

Luminescence efficiencies of self- and Tm activated CaWO4 under vacuum ultraviolet radiation excitation

Luminescence efficiency of self-activated CaWO₄ under 147 nm vacuum ultraviolet (VUV) radiation excitation is about 90% of that of BaMgAl₁₀O₁₇:Eu²⁺ (BAM), the commercial blue plasma display panel (PDP) phosphor. However, the color purity and the particle size of the former needs substantial modification before it can be considered for application in PDP. CaWO₄:Tm exhibits Tm³⁺ emission peaks in the blue region due to energy transfer from WO₄ to Tm³⁺ ions but the overall emission intensity under 147 nm excitation is reduced when compared to that of CaWO₄.     

Partially coherent optical processor for enhancement of partial second order derivatives of an image: Analysis and implementation

We present an optical processor capable to perform partial second derivatives of an image working with partially coherent illumination. The proposed system utilizes a liquid crystal display, onto which images to be derived are displayed. The method is based on the capacity of these devices to generate simultaneously a contrast reverted replica of the image displayed on it. A positive replica of original image is obtained when the LCD is between crossed polarizers, while the negative one is obtained with the LCD is between parallel polarizers. Since the LCD is a diffraction element, both polarizer arrangements may be simultaneously implemented, for example, in a 4f optical processor using polarization filtering of the different diffraction orders. When three images (two replicas of original image displaced in opposite direction and the other one with contrast reverted and centered at the origin.) are imagined across a slightly defocused plane, one obtains an image with enhanced second derivatives in a given direction. No other incoherent (or partially coherent) optical system is presently known which can perform partial second-order derivatives of an image. Experimental results obtained are presented.     

基于局部轮廓特征的无人机头部检测跟踪算法

针对无人机的结构特点,提出了一种基于目标轮廓提取、轮廓自动分段、头部定位以及头部模板匹配四个模块的目标头部检测跟踪算法.首先对第一帧图像提取目标轮廓,并通过计算轮廓点的变化率,对轮廓进行自动分段,得到目标的4个局部轮廓点列,进而根据头部轮廓点列的特点,完成头部轮廓筛选,然后利用基于目标中轴的二次曲线拟合,实现头部顶点的...     

基于窄带多区域水平集方法的遥感图像分割

由于遥感图像存在边缘混叠等问题,经典的C-V模型会产生大量的冗余轮廓,而且无法分割多个同质区域的目标.为此,提出了基于C-V模型的窄带多区域水平集图像分割方法,采用N-1个水平集函数将图像分割成N(N＞1)个区域,每个水平集函数表达一个区域.该方法一方面通过建立独立多区域水平集模型可以消除多余的轮廓,避免分割区域的重叠...     

Unsupervised MRI segmentation of brain tissues using a local linear model and level set

Real-world magnetic resonance imaging of the brain is affected by intensity nonuniformity (INU) phenomena which makes it difficult to fully automate the segmentation process. This difficult task is accomplished in this work by using a new method with two original features: (1) each brain tissue class is locally modeled using a local linear region representative, which allows us to account for the INU in an implicit way and to more accurately position the region's boundaries; and (2) the region models are embedded in the level set framework, so that the spatial coherence of the segmentation can be controlled in a natural way. Our new method has been tested on the ground-truthed Internet Brain Segmentation Repository (IBSR) database and gave promising results, with Tanimoto indexes ranging from 0.61 to 0.79 for the classification of the white matter and from 0.72 to 0.84 for the gray matter. To our knowledge, this is the first time a region-based level set model has been used to perform the segmentation of real-world MRI brain scans with convincing results.