Test beam studies of the TRD prototype filled with different gas mixtures based on Xe, Kr, and Ar

Towards the end of LHC Run1, gas leaks were observed in some parts of the Transition Radiation Tracker (TRT) of ATLAS. Due to these leaks, primary Xenon based gas mixture was replaced with Argon based mixture in various parts. Test-beam studies with a dedicated Transition Radiation Detector (TRD) prototype were carried out in 2015 in order to understand transition radiation performance with mixtures based on Argon and Krypton. We present and discuss the results of these test-beam studies with different active gas compositions.Comment: 5 pages,12 figures, The 2nd International Conference on Particle Physics and Astrophysics (ICPPA-2016); Acknowledgments section correcte

Some results of test beam studies of Transition Radiation Detector prototypes at CERN

Operating conditions and challenging demands of present and future accelerator experiments result in new requirements on detector systems. There are many ongoing activities aimed to develop new technologies and to improve the properties of detectors based on existing technologies. Our work is dedicated to development of Transition Radiation Detectors (TRD) suitable for different applications. In this paper results obtained in beam tests at SPS accelerator at CERN with the TRD prototype based on straw technology are presented. TRD performance was studied as a function of thickness of the transition radiation radiator and working gas mixture pressure

Content-Based Image Retrieval of Skin Lesions by Evolutionary Feature Synthesis

Abstract. This paper gives an example of evolved features that improve image retrieval performance. A content-based image retrieval system for skin lesion images is presented. The aim is to support decision making by retrieving and displaying relevant past cases visually similar to the one under examination. Skin lesions of five common classes, including two non-melanoma cancer types, are used. Colour and texture features are extracted from lesions. Evolutionary algorithms are used to create composite features that optimise a similarity matching function. Experiments on our database of 533 images are performed and results are compared to those obtained using simple features. The use of the evolved composite features improves the precision by about 7%.

Lesion detection in demoscopy images with novel density-based and active contour approaches

<p>Abstract</p> <p>Background</p> <p>Dermoscopy is one of the major imaging modalities used in the diagnosis of melanoma and other pigmented skin lesions. Automated assessment tools for dermoscopy images have become an important field of research mainly because of inter- and intra-observer variations in human interpretation. One of the most important steps in dermoscopy image analysis is the detection of lesion borders, since many other features, such as asymmetry, border irregularity, and abrupt border cutoff, rely on the boundary of the lesion. </p> <p>Results</p> <p>To automate the process of delineating the lesions, we employed Active Contour Model (ACM) and boundary-driven density-based clustering (BD-DBSCAN) algorithms on 50 dermoscopy images, which also have ground truths to be used for quantitative comparison. We have observed that ACM and BD-DBSCAN have the same border error of 6.6% on all images. To address noisy images, BD-DBSCAN can perform better delineation than ACM. However, when used with optimum parameters, ACM outperforms BD-DBSCAN, since ACM has a higher recall ratio.</p> <p>Conclusion</p> <p>We successfully proposed two new frameworks to delineate suspicious lesions with i) an ACM integrated approach with sharpening and ii) a fast boundary-driven density-based clustering technique. ACM shrinks a curve toward the boundary of the lesion. To guide the evolution, the model employs the exact solution <abbrgrp><abbr bid="B27">27</abbr></abbrgrp> of a specific form of the Geometric Heat Partial Differential Equation <abbrgrp><abbr bid="B28">28</abbr></abbrgrp>. To make ACM advance through noisy images, an improvement of the model’s boundary condition is under consideration. BD-DBSCAN improves regular density-based algorithm to select query points intelligently.</p

Analysis of density based and fuzzy c-means clustering methods on lesion border extraction in dermoscopy images

<p>Abstract</p> <p>Background</p> <p>Computer-aided segmentation and border detection in dermoscopic images is one of the core components of diagnostic procedures and therapeutic interventions for skin cancer. Automated assessment tools for dermoscopy images have become an important research field mainly because of inter- and intra-observer variations in human interpretation. In this study, we compare two approaches for automatic border detection in dermoscopy images: density based clustering (DBSCAN) and Fuzzy C-Means (FCM) clustering algorithms. In the first approach, if there exists enough density –greater than certain number of points- around a point, then either a new cluster is formed around the point or an existing cluster grows by including the point and its neighbors. In the second approach FCM clustering is used. This approach has the ability to assign one data point into more than one cluster.</p> <p>Results</p> <p>Each approach is examined on a set of 100 dermoscopy images whose manually drawn borders by a dermatologist are used as the ground truth. Error rates; false positives and false negatives along with true positives and true negatives are quantified by comparing results with manually determined borders from a dermatologist. The assessments obtained from both methods are quantitatively analyzed over three accuracy measures: border error, precision, and recall. </p> <p>Conclusion</p> <p>As well as low border error, high precision and recall, visual outcome showed that the DBSCAN effectively delineated targeted lesion, and has bright future; however, the FCM had poor performance especially in border error metric.</p

Linear, Deterministic, and Order-Invariant Initialization Methods for the K-Means Clustering Algorithm

Over the past five decades, k-means has become the clustering algorithm of choice in many application domains primarily due to its simplicity, time/space efficiency, and invariance to the ordering of the data points. Unfortunately, the algorithm's sensitivity to the initial selection of the cluster centers remains to be its most serious drawback. Numerous initialization methods have been proposed to address this drawback. Many of these methods, however, have time complexity superlinear in the number of data points, which makes them impractical for large data sets. On the other hand, linear methods are often random and/or sensitive to the ordering of the data points. These methods are generally unreliable in that the quality of their results is unpredictable. Therefore, it is common practice to perform multiple runs of such methods and take the output of the run that produces the best results. Such a practice, however, greatly increases the computational requirements of the otherwise highly efficient k-means algorithm. In this chapter, we investigate the empirical performance of six linear, deterministic (non-random), and order-invariant k-means initialization methods on a large and diverse collection of data sets from the UCI Machine Learning Repository. The results demonstrate that two relatively unknown hierarchical initialization methods due to Su and Dy outperform the remaining four methods with respect to two objective effectiveness criteria. In addition, a recent method due to Erisoglu et al. performs surprisingly poorly.Comment: 21 pages, 2 figures, 5 tables, Partitional Clustering Algorithms (Springer, 2014). arXiv admin note: substantial text overlap with arXiv:1304.7465, arXiv:1209.196