|
David Roche, Debora Gil, & Jesus Giraldo. (2013). "Detecting loss of diversity for an efficient termination of EAs " In 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (pp. 561–566).
Abstract: Termination of Evolutionary Algorithms (EA) at its steady state so that useless iterations are not performed is a main point for its efficient application to black-box problems. Many EA algorithms evolve while there is still diversity in their population and, thus, they could be terminated by analyzing the behavior some measures of EA population diversity. This paper presents a numeric approximation to steady states that can be used to detect the moment EA population has lost its diversity for EA termination. Our condition has been applied to 3 EA paradigms based on diversity and a selection of functions
covering the properties most relevant for EA convergence.
Experiments show that our condition works regardless of the search space dimension and function landscape.
Keywords: EA termination; EA population diversity; EA steady state
|
|
|
Aura Hernandez-Sabate, Debora Gil, Petia Radeva, & E.N.Nofrerias. (2004). "Anisotropic processing of image structures for adventitia detection in intravascular ultrasound images " In Proc. Computers in Cardiology (Vol. 31, pp. 229–232). Chicago (USA).
Abstract: The adventitia layer appears as a weak edge in IVUS images with a non-uniform grey level, which difficulties its detection. In order to enhance edges, we apply an anisotropic filter that homogenizes the grey level along the image significant structures (ridges, valleys and edges). A standard edge detector applied to the filtered image yields a set of candidate points prone to be unconnected. The final model is obtained by interpolating the former line segments along the tangent direction to the level curves of the filtered image with an anisotropic contour closing technique based on functional extension principles
|
|
|
Albert Andaluz. (2009). "LV Contour Segmentation in TMR images using Semantic Description of Tissue and Prior Knowledge Correction " (Vol. 142). Master's thesis, , Bellaterra 08193, Barcelona, Spain.
Abstract: The Diagnosis of Left Ventricle (LV) pathologies is related to regional wall motion analysis. Health indicator scores such as the rotation and the torsion are useful for the diagnose of the Left Ventricle (LV) function. However, this requires proper identification of LV segments. On one hand, manual segmentation is robust, but it is slow and requires medical expertise. On the other hand, the tag pattern in Tagged Magnetic Resonance (TMR) sequences is a problem for the automatic segmentation of the LV boundaries. Consequently, we propose a method based in the classical formulation of parametric Snakes, combined with Active Shape models. Our semantic definition of the LV is tagged tissue that experiences motion in the systolic cycle. This defines two energy potentials for the Snake convergence. Additionally, the mean shape corrects excessive deviation from the anatomical shape. We have validated our approach in 15 healthy volunteers and two short axis cuts. In this way, we have compared the automatic segmentations to manual shapes outlined by medical experts. Also, we have explored the accuracy of clinical scores computed using automatic contours. The results show minor divergence in the approximation and the manual segmentations as well as robust computation of clinical scores in all cases. From this we conclude that the proposed method is a promising support tool for clinical analysis.
Keywords: Active Contour Models; Snakes; Active Shape Models; Deformable Templates; Left Ventricle Segmentation; Generalized Orthogonal Procrustes Analysis; Harmonic Phase Flow; Principal Component Analysis; Tagged Magnetic Resonance
|
|
|
Paula Fritzsche, C.Roig, Ana Ripoll, Emilio Luque, & Aura Hernandez-Sabate. (2006). "A Performance Prediction Methodology for Data-dependent Parallel Applications " In Proceedings of the IEEE International Conference on Cluster Computing (pp. 1–8).
Abstract: The increase in the use of parallel distributed architectures in order to solve large-scale scientific problems has generated the need for performance prediction for both deterministic applications and non-deterministic applications. In particular, the performance prediction of data dependent programs is an extremely challenging problem because for a specific issue the input datasets may cause different execution times. Generally, a parallel application is characterized as a collection of tasks and their interrelations. If the application is time-critical it is not enough to work with only one value per task, and consequently knowledge of the distribution of task execution times is crucial. The development of a new prediction methodology to estimate the performance of data-dependent parallel applications is the primary target of this study. This approach makes it possible to evaluate the parallel performance of an application without the need of implementation. A real data-dependent arterial structure detection application model is used to apply the methodology proposed. The predicted times obtained using the new methodology for genuine datasets are compared with predicted times that arise from using only one execution value per task. Finally, the experimental study shows that the new methodology generates more precise predictions.
|
|
|
Petia Radeva, & Enric Marti. (1995). "An improved model of snakes for model-based segmentation " In Proceedings of Computer Analysis of Images and Patterns (pp. 515–520).
Abstract: The main advantage of segmentation by snakes consists in its ability to incorporate smoothness constraints on the detected shapes that can occur. Likewise, we propose to model snakes with other properties that reflect the information provided about the object of interest in a different extent. We consider different kinds of snakes, those searching for contours with a certain direction, those preserving an object’s model, those seeking for symmetry, those expanding open, etc. The availability of such a collection of snakes allows not only the more complete use of the knowledge about the segmented object, but also to solve some problems of the existing snakes. Our experiments on segmentation of facial features justify the usefulness of snakes with different properties.
|
|
|
Jaume Garcia, David Rotger, Francesc Carreras, R.Leta, & Petia Radeva. (2003). "Contrast echography segmentation and tracking by trained deformable models " In Proc. Computers in Cardiology (Vol. 30, pp. 173–176). Centre de Visió per Computador – Dept. Informàtica, UAB Edifici O – Campus UAB, 08193 Bellater.
Abstract: The objective of this work is to segment the human left ventricle myocardium (LVM) in contrast echocardiography imaging and thus track it along a cardiac cycle in order to extract quantitative data about heart function. Ultrasound images are hard to work with due to their speckle appearance. To overcome this we report the combination of active contour models (ACM) or snakes and active shape models (ASM). The ability of ACM in giving closed and smooth curves in addition to the power of the ASM in producing shapes similar to the ones learned, evoke to a robust algorithm. Meanwhile the snake is attracted towards image main features, ASM acts as a correction factor. The algorithm was tested independently on 180 frames and satisfying results were obtained: in 95% the maximum difference between automatic and experts segmentation was less than 12 pixels.
|
|
|
David Roche, Debora Gil, & Jesus Giraldo. (2013). "Multiple active receptor conformation, agonist efficacy and maximum effect of the system: the conformation-based operational model of agonism, " . Drug Discovery Today, 18(7-8), 365–371.
Abstract: The operational model of agonism assumes that the maximum effect a particular receptor system can achieve (the Em parameter) is fixed. Em estimates are above but close to the asymptotic maximum effects of endogenous agonists. The concept of Em is contradicted by superagonists and those positive allosteric modulators that significantly increase the maximum effect of endogenous agonists. An extension of the operational model is proposed that assumes that the Em parameter does not necessarily have a single value for a receptor system but has multiple values associated to multiple active receptor conformations. The model provides a mechanistic link between active receptor conformation and agonist efficacy, which can be useful for the analysis of agonist response under different receptor scenarios.
|
|
|
David Roche, Debora Gil, & Jesus Giraldo. (2012). "Assessing agonist efficacy in an uncertain Em world " In A. Christopoulus and M. Bouvier (Ed.), 40th Keystone Symposia on mollecular and celular biology (79). Keystone Symposia.
Abstract: The operational model of agonism has been widely used for the analysis of agonist action since its formulation in 1983. The model includes the Em parameter, which is defined as the maximum response of the system. The methods for Em estimation provide Em values not significantly higher than the maximum responses achieved by full agonists. However, it has been found that that some classes of compounds as, for instance, superagonists and positive allosteric modulators can increase the full agonist maximum response, implying upper limits for Em and thereby posing doubts on the validity of Em estimates. Because of the correlation between Em and operational efficacy, τ, wrong Em estimates will yield wrong τ estimates.
In this presentation, the operational model of agonism and various methods for the simulation of allosteric modulation will be analyzed. Alternatives for curve fitting will be presented and discussed.
|
|
|
Gemma Sanchez, Josep Llados, & Enric Marti. (1997). Segmentation and analysis of linial texture in plans In Intelligence Artificielle et Complexité.. Paris.
Abstract: The problem of texture segmentation and interpretation is one of the main concerns in the field of document analysis. Graphical documents often contain areas characterized by a structural texture whose recognition allows both the document understanding, and its storage in a more compact way. In this work, we focus on structural linial textures of regular repetition contained in plan documents. Starting from an atributed graph which represents the vectorized input image, we develop a method to segment textured areas and recognize their placement rules. We wish to emphasize that the searched textures do not follow a predefined pattern. Minimal closed loops of the input graph are computed, and then hierarchically clustered. In this hierarchical clustering, a distance function between two closed loops is defined in terms of their areas difference and boundary resemblance computed by a string matching procedure. Finally it is noted that, when the texture consists of isolated primitive elements, the same method can be used after computing a Voronoi Tesselation of the input graph.
Keywords: Structural Texture, Voronoi, Hierarchical Clustering, String Matching.
|
|
|
Josep Llados, Ernest Valveny, Gemma Sanchez, & Enric Marti. (2002). "Symbol recognition: current advances and perspectives " In Dorothea Blostein and Young- Bin Kwon (Ed.), Graphics Recognition Algorithms And Applications (Vol. 2390, pp. 104–128). Lecture Notes in Computer Science. Springer-Verlag.
Abstract: The recognition of symbols in graphic documents is an intensive research activity in the community of pattern recognition and document analysis. A key issue in the interpretation of maps, engineering drawings, diagrams, etc. is the recognition of domain dependent symbols according to a symbol database. In this work we first review the most outstanding symbol recognition methods from two different points of view: application domains and pattern recognition methods. In the second part of the paper, open and unaddressed problems involved in symbol recognition are described, analyzing their current state of art and discussing future research challenges. Thus, issues such as symbol representation, matching, segmentation, learning, scalability of recognition methods and performance evaluation are addressed in this work. Finally, we discuss the perspectives of symbol recognition concerning to new paradigms such as user interfaces in handheld computers or document database and WWW indexing by graphical content.
|
|