39 resultados para Unconstrained and convex optimization


Relevância:

40.00% 40.00%

Publicador:

Resumo:

In this paper, a computer-aided diagnostic (CAD) system for the classification of hepatic lesions from computed tomography (CT) images is presented. Regions of interest (ROIs) taken from nonenhanced CT images of normal liver, hepatic cysts, hemangiomas, and hepatocellular carcinomas have been used as input to the system. The proposed system consists of two modules: the feature extraction and the classification modules. The feature extraction module calculates the average gray level and 48 texture characteristics, which are derived from the spatial gray-level co-occurrence matrices, obtained from the ROIs. The classifier module consists of three sequentially placed feed-forward neural networks (NNs). The first NN classifies into normal or pathological liver regions. The pathological liver regions are characterized by the second NN as cyst or "other disease." The third NN classifies "other disease" into hemangioma or hepatocellular carcinoma. Three feature selection techniques have been applied to each individual NN: the sequential forward selection, the sequential floating forward selection, and a genetic algorithm for feature selection. The comparative study of the above dimensionality reduction methods shows that genetic algorithms result in lower dimension feature vectors and improved classification performance.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Fluorides are used in dental care due to their beneficial effect in tooth enamel de-/remineralization cycles. To achieve a desired constant supply of soluble fluorides in the oral cavity, different approaches have been followed. Here we present results on the preparation of CaF2 particles and their characterization with respect to a potential application as enamel associated fluoride releasing reservoirs. CaF2 particles were synthesized by precipitation from soluble NaF and CaCl2 salt solutions of defined concentrations and their morphology analyzed by scanning electron microscopy. CaF2 particles with defined sizes and shapes could be synthesized by adjusting the concentrations of the precursor salt solutions. Such particles interacted with enamel surfaces when applied at fluoride concentrations correlating to typical dental care products. Fluoride release from the synthesized CaF2 particles was observed to be largely influenced by the concentration of phosphate in the solution. Physiological solutions with phosphate concentration similar to saliva (3.5 mM) reduced the fluoride release from pure CaF2 particles by a factor of 10-20 × as compared to phosphate free buffer solutions. Fluoride release was even lower in human saliva. The fluoride release could be increased by the addition of phosphate in substoichiometric amounts during CaF2 particle synthesis. The presented results demonstrate that the morphology and fluoride release characteristics of CaF2 particles can be tuned and provide evidence of the suitability of synthetic CaF2 particles as enamel associated fluoride reservoirs.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

We report a novel strategy for the regulation of charge transport through single molecule junctions via the combination of external stimuli of electrode potential, internal modulation of molecular structures, and optimization of anchoring groups. We have designed redox-active benzodifuran (BDF) compounds as functional electronic units to fabricate metal–molecule–metal (m–M–m) junction devices by scanning tunneling microscopy (STM) and mechanically controllable break junctions (MCBJ). The conductance of thiol-terminated BDF can be tuned by changing the electrode potentials showing clearly an off/on/off single molecule redox switching effect. To optimize the response, a BDF molecule tailored with carbodithioate (−CS2–) anchoring groups was synthesized. Our studies show that replacement of thiol by carbodithioate not only enhances the junction conductance but also substantially improves the switching effect by enhancing the on/off ratio from 2.5 to 8.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Femoroacetabular impingement (FAI) before or after Periacetabular Osteotomy (PAO) is surprisingly frequent and surgeons need to be aware of the risk preoperatively and be able to avoid it intraoperatively. In this paper we present a novel computer assisted planning and navigation system for PAO with impingement analysis and range of motion (ROM) optimization. Our system starts with a fully automatic detection of the acetabular rim, which allows for quantifying the acetabular morphology with parameters such as acetabular version, inclination and femoral head coverage ratio for a computer assisted diagnosis and planning. The planned situation was optimized with impingement simulation by balancing acetabuar coverage with ROM. Intra-operatively navigation was conducted until the optimized planning situation was achieved. Our experimental results demonstrated: 1) The fully automated acetabular rim detection was validated with accuracy 1.1 ± 0.7mm; 2) The optimized PAO planning improved ROM significantly compared to that without ROM optimization; 3) By comparing the pre-operatively planned situation and the intra-operatively achieved situation, sub-degree accuracy was achieved for all directions.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

We present a novel surrogate model-based global optimization framework allowing a large number of function evaluations. The method, called SpLEGO, is based on a multi-scale expected improvement (EI) framework relying on both sparse and local Gaussian process (GP) models. First, a bi-objective approach relying on a global sparse GP model is used to determine potential next sampling regions. Local GP models are then constructed within each selected region. The method subsequently employs the standard expected improvement criterion to deal with the exploration-exploitation trade-off within selected local models, leading to a decision on where to perform the next function evaluation(s). The potential of our approach is demonstrated using the so-called Sparse Pseudo-input GP as a global model. The algorithm is tested on four benchmark problems, whose number of starting points ranges from 102 to 104. Our results show that SpLEGO is effective and capable of solving problems with large number of starting points, and it even provides significant advantages when compared with state-of-the-art EI algorithms.