Electron-impact excitation of Xe 26+ and its resultant spectral signature

We have carried out a 129 close-coupling level Dirac-Coulomb R-matrix calculation for the electron-impact excitation of Ni-like Xe. We have utilized this data to generate the spectral signature of Xe26+ in terms of feature photon-emissivity coefficients (F-PεCs). We have compared these F-PεCs with those generated using semi-relativistic plane-wave Born excitation data, which forms the heavy species baseline for the Atomic Data and Analysis Structure (ADAS), We find that the Born-based F-PεCs give a reasonable qualitative description of the spectral signature but that, quantitatively, the R-matrix-based F-PεCs differ by up to a factor of 2. The spectral signature of heavy species is key to diagnosing hot plasmas such as will be found in the International Thermonuclear Experimental Reactor.

Spectral Reflectance Characteristics of Kimberlite Indicator Minerals and Other Selected Mineral Grains

High chromium content in kimberlite indicator minerals such as pyrope garnet and diopside is often correlated with the presence of diamonds. In this study, kimberlite indicator minerals were examined using visible light reflectance spectroscopy to determine if chromium content can be correlated with spectral absorption features. The depth of absorption features in the visible spectral region were correlated with the molecular percentage of chromium and other first series transition metal elements obtained by electron microprobe data. In the visible part of the spectrum, chromium is evident by 3 absorption features in the pyrope reflectance spectrum; one isolated and narrow feature at the wavelength 689 nm was used to correlate with the chromium mol %. The isolation of this feature in the pyrope spectra is advantageous since it is not directly affected by other proximal absorption bands that could be caused by other transition metals. Analysis of the feature indicates that as grain volume increases the depth of the absorption feature will also increase. Clustering grain volumes into fractions yields better correlation between absorption depth and mol % chromium. Other types of garnet (almandine, grossular, spessartine) and kimberlite indicator minerals (olivine, diopside, chromite, ilmenite) were analyzed to determine if other absorption features could be used to predict the proportion of specific transition metal elements. Diopside in particular illustrates the same isolated chromium absorption feature as pyrope and may indicate mol percent but needs further study with larger sample sets.

“Improved Feature Extraction and Classification Techniques for Multispectral Brain Magnetic Resonance Images”

Magnetic Resonance Imaging (MRI) is a multi sequence medical imaging technique in which stacks of images are acquired with different tissue contrasts. Simultaneous observation and quantitative analysis of normal brain tissues and small abnormalities from these large numbers of different sequences is a great challenge in clinical applications. Multispectral MRI analysis can simplify the job considerably by combining unlimited number of available co-registered sequences in a single suite. However, poor performance of the multispectral system with conventional image classification and segmentation methods makes it inappropriate for clinical analysis. Recent works in multispectral brain MRI analysis attempted to resolve this issue by improved feature extraction approaches, such as transform based methods, fuzzy approaches, algebraic techniques and so forth. Transform based feature extraction methods like Independent Component Analysis (ICA) and its extensions have been effectively used in recent studies to improve the performance of multispectral brain MRI analysis. However, these global transforms were found to be inefficient and inconsistent in identifying less frequently occurred features like small lesions, from large amount of MR data. The present thesis focuses on the improvement in ICA based feature extraction techniques to enhance the performance of multispectral brain MRI analysis. Methods using spectral clustering and wavelet transforms are proposed to resolve the inefficiency of ICA in identifying small abnormalities, and problems due to ICA over-completeness. Effectiveness of the new methods in brain tissue classification and segmentation is confirmed by a detailed quantitative and qualitative analysis with synthetic and clinical, normal and abnormal, data. In comparison to conventional classification techniques, proposed algorithms provide better performance in classification of normal brain tissues and significant small abnormalities.

Crystal Structures and Spectral Aspects of Mixed Ligand Transition Metal Chelates Derived from Aldehyde based ONS Donor Thiosemicarbazones

Thiosemicarbazones have emerged as an important class of ligands over a period of time, for a variety of reasons, such as variable donor properties, structural diversity and biological applications. Interesting as the coordination chemistry may be, the driving force for the study of these ligands has undoubtedly been their biological properties and the majority of the 3000 or so publications on thiosemicarbazones since 2000 have alluded to this feature. Thiosemicarbazones with potential donor atoms in their structural skeleton fascinate coordination chemists with their versatile chelating behavior. The thiosemicarbazones of aromatic aldehydes and ketones form stable chelates with transition metal cations by utilizing both their sulfur and azomethine nitrogen as donor atoms. They have been shown to possess a diverse range of biological activities including anticancer, antitumor, antibacterial, antiviral, antimalarial and antifungal properties owing to their ability to diffuse through the semipermeable membrane of the cell lines. The enhanced effect may be attributed to the increased lipophilicity of the metal complexes compared to the ligand alone.

Spectral clustering independent component analysis for tissue classification from brain MRI

A spectral angle based feature extraction method, Spectral Clustering Independent Component Analysis (SC-ICA), is proposed in this work to improve the brain tissue classification from Magnetic Resonance Images (MRI). SC-ICA provides equal priority to global and local features; thereby it tries to resolve the inefficiency of conventional approaches in abnormal tissue extraction. First, input multispectral MRI is divided into different clusters by a spectral distance based clustering. Then, Independent Component Analysis (ICA) is applied on the clustered data, in conjunction with Support Vector Machines (SVM) for brain tissue analysis. Normal and abnormal datasets, consisting of real and synthetic T1-weighted, T2-weighted and proton density/fluid-attenuated inversion recovery images, were used to evaluate the performance of the new method. Comparative analysis with ICA based SVM and other conventional classifiers established the stability and efficiency of SC-ICA based classification, especially in reproduction of small abnormalities. Clinical abnormal case analysis demonstrated it through the highest Tanimoto Index/accuracy values, 0.75/98.8%, observed against ICA based SVM results, 0.17/96.1%, for reproduced lesions. Experimental results recommend the proposed method as a promising approach in clinical and pathological studies of brain diseases

Selecting Relevant Genes with a Spectral Approach

Array technologies have made it possible to record simultaneously the expression pattern of thousands of genes. A fundamental problem in the analysis of gene expression data is the identification of highly relevant genes that either discriminate between phenotypic labels or are important with respect to the cellular process studied in the experiment: for example cell cycle or heat shock in yeast experiments, chemical or genetic perturbations of mammalian cell lines, and genes involved in class discovery for human tumors. In this paper we focus on the task of unsupervised gene selection. The problem of selecting a small subset of genes is particularly challenging as the datasets involved are typically characterized by a very small sample size ?? the order of few tens of tissue samples ??d by a very large feature space as the number of genes tend to be in the high thousands. We propose a model independent approach which scores candidate gene selections using spectral properties of the candidate affinity matrix. The algorithm is very straightforward to implement yet contains a number of remarkable properties which guarantee consistent sparse selections. To illustrate the value of our approach we applied our algorithm on five different datasets. The first consists of time course data from four well studied Hematopoietic cell lines (HL-60, Jurkat, NB4, and U937). The other four datasets include three well studied treatment outcomes (large cell lymphoma, childhood medulloblastomas, breast tumors) and one unpublished dataset (lymph status). We compared our approach both with other unsupervised methods (SOM,PCA,GS) and with supervised methods (SNR,RMB,RFE). The results clearly show that our approach considerably outperforms all the other unsupervised approaches in our study, is competitive with supervised methods and in some case even outperforms supervised approaches.

Spectral asymmetry of the massless Dirac operator on a 3-torus

Consider the massless Dirac operator on a 3-torus equipped with Euclidean metric and standard spin structure. It is known that the eigenvalues can be calculated explicitly: the spectrum is symmetric about zero and zero itself is a double eigenvalue. The aim of the paper is to develop a perturbation theory for the eigenvalue with smallest modulus with respect to perturbations of the metric. Here the application of perturbation techniques is hindered by the fact that eigenvalues of the massless Dirac operator have even multiplicity, which is a consequence of this operator commuting with the antilinear operator of charge conjugation (a peculiar feature of dimension 3). We derive an asymptotic formula for the eigenvalue with smallest modulus for arbitrary perturbations of the metric and present two particular families of Riemannian metrics for which the eigenvalue with smallest modulus can be evaluated explicitly. We also establish a relation between our asymptotic formula and the eta invariant.

Objective determination of feature resolution in two sea surface temperature analyses

Considerable effort is presently being devoted to producing high-resolution sea surface temperature (SST) analyses with a goal of spatial grid resolutions as low as 1 km. Because grid resolution is not the same as feature resolution, a method is needed to objectively determine the resolution capability and accuracy of SST analysis products. Ocean model SST fields are used in this study as simulated “true” SST data and subsampled based on actual infrared and microwave satellite data coverage. The subsampled data are used to simulate sampling errors due to missing data. Two different SST analyses are considered and run using both the full and the subsampled model SST fields, with and without additional noise. The results are compared as a function of spatial scales of variability using wavenumber auto- and cross-spectral analysis. The spectral variance at high wavenumbers (smallest wavelengths) is shown to be attenuated relative to the true SST because of smoothing that is inherent to both analysis procedures. Comparisons of the two analyses (both having grid sizes of roughly ) show important differences. One analysis tends to reproduce small-scale features more accurately when the high-resolution data coverage is good but produces more spurious small-scale noise when the high-resolution data coverage is poor. Analysis procedures can thus generate small-scale features with and without data, but the small-scale features in an SST analysis may be just noise when high-resolution data are sparse. Users must therefore be skeptical of high-resolution SST products, especially in regions where high-resolution (~5 km) infrared satellite data are limited because of cloud cover.

Complex extreme learning machine applications in terahertz pulsed signals feature sets

This paper presents a novel approach to the automatic classification of very large data sets composed of terahertz pulse transient signals, highlighting their potential use in biochemical, biomedical, pharmaceutical and security applications. Two different types of THz spectra are considered in the classification process. Firstly a binary classification study of poly-A and poly-C ribonucleic acid samples is performed. This is then contrasted with a difficult multi-class classification problem of spectra from six different powder samples that although have fairly indistinguishable features in the optical spectrum, they also possess a few discernable spectral features in the terahertz part of the spectrum. Classification is performed using a complex-valued extreme learning machine algorithm that takes into account features in both the amplitude as well as the phase of the recorded spectra. Classification speed and accuracy are contrasted with that achieved using a support vector machine classifier. The study systematically compares the classifier performance achieved after adopting different Gaussian kernels when separating amplitude and phase signatures. The two signatures are presented as feature vectors for both training and testing purposes. The study confirms the utility of complex-valued extreme learning machine algorithms for classification of the very large data sets generated with current terahertz imaging spectrometers. The classifier can take into consideration heterogeneous layers within an object as would be required within a tomographic setting and is sufficiently robust to detect patterns hidden inside noisy terahertz data sets. The proposed study opens up the opportunity for the establishment of complex-valued extreme learning machine algorithms as new chemometric tools that will assist the wider proliferation of terahertz sensing technology for chemical sensing, quality control, security screening and clinic diagnosis. Furthermore, the proposed algorithm should also be very useful in other applications requiring the classification of very large datasets.

Novel spectral descriptor for object shape

In this paper, we propose a novel descriptor for shapes. The proposed descriptor is obtained from 3D spherical harmonics. The inadequacy of 2D spherical harmonics is addressed and the method to obtain 3D spherical harmonics is described. 3D spherical harmonics requires construction of a 3D model which implicitly represents rich features of objects. Spherical harmonics are used to obtain descriptors from the 3D models. The performance of the proposed method is compared against the CSS approach which is the MPEG-7 descriptor for shape contour. MPEG-7 dataset of shape contours, namely, CE-1 is used to perform the experiments. It is shown that the proposed method is effective.

Spectral shape descriptor using spherical harmonics

In this paper, we propose a spectral descriptor for shapes of objects. The method relies on transforming the 2D objects into 3D space; distance transform and scale space theory is used to transform objects into 3D space. Spherical harmonics of the voxel grid are used to obtain shape descriptors. The proposed methods are compared against two existing methods which use spherical harmonics for shape based retrieval of images. Comparison is done based on ranking of images which is articulated in recall-precision curves. MPEG-7 Still Images Content Set is used for performing experiments. Experimental results show that the performance of the proposed descriptor is significantly better than other methods in the same category.

Minimum spanning trees for valley and ridge characterization in digital elevation maps

Texture synthesis employs neighbourhood matching to generate appropriate new content. Terrain synthesis has the added constraint that new content must be geographically plausible. The profile recognition and polygon breaking algorithm (PPA) [Chang et al. 1998] provides a robust mechanism for characterizing terrain as systems of valley and ridge lines in digital elevation maps. We exploit this to create a terrain characterization metric that is robust, efficient to compute and is sensitive to terrain properties.

Terrain regions are characterized as a minimum spanning tree derived from a graph created from the sample points of the elevation map which are encoded as weights in the edges of the graph. This formulation allows us to provide a single consistent feature definition that is sensitive to the pattern of ridges and valleys in the terrain Alternative formulations of these weights provide richer characteristicmeasures and we provide examples of alternate definitions based on curvature and contour measures.

We show that the measure is robust, with a significant portion derived directly from information local to the terrain sample. Global terrain characteristics introduce the issue of over- and underconnected valley/ridge lines when working with sub-regions. This is addressed by providing two graph construction strategies, which respectively provide an upper bound on connectivity as a single spanning tree, and a lower bound as a forest of trees.

Efficient minimum spanning tree algorithms are adapted to the context of terrain data and are shown to provide substantially better performance than previous PPA implementations. In particular, these are able to characterize valley and ridge behaviour at every point even in large elevation maps, providing a measure sensitive to terrain features at all scales.

The resulting graph based formulation provides an efficient and elegant algorithm for characterizing terrain features. The measure can be calculated efficiently, is robust under changes of neighbourhood position, size and resolution and the hybrid measure is sensitive to terrain features both locally and globally.

Composite spectral shape descriptor

Effective spectral representations of shape region are proposed in literature. On the other hand, a significant spatial characteristic of shape region is shape contour because human beings discriminate shapes mainly by their contour features. It is proposed that a descriptor is obtained by complementing the spectral representation of shape region with the spectral representation of shape contour. Such a descriptor, obtained by explicitly combining two (or more) descriptors is termed composite descriptor. A composite descriptor is proposed; the effectiveness of the composite descriptor to represent shape region is evaluated.

Spike sorting using locality preserving projection with gap statistics and landmark-based spectral clustering

Understanding neural functions requires knowledge from analysing electrophysiological data. The process of assigning spikes of a multichannel signal into clusters, called spike sorting, is one of the important problems in such analysis. There have been various automated spike sorting techniques with both advantages and disadvantages regarding accuracy and computational costs. Therefore, developing spike sorting methods that are highly accurate and computationally inexpensive is always a challenge in the biomedical engineering practice.

Neural signal analysis by landmark-based spectral clustering with estimated number of clusters

Spike sorting plays an important role in analysing electrophysiological data and understanding neural functions. Developing spike sorting methods that are highly accurate and computationally inexpensive is always a challenge in the biomedical engineering practice. This paper proposes an automatic unsupervised spike sorting method using the landmark-based spectral clustering (LSC) method in connection with features extracted by the locality preserving projection (LPP) technique. Gap statistics is employed to evaluate the number of clusters before the LSC can be performed. Experimental results show that LPP spike features are more discriminative than those of the popular wavelet transformation (WT). Accordingly, the proposed method LPP-LSC demonstrates a significant dominance compared to the existing method that is the combination between WT feature extraction and the superparamagnetic clustering. LPP and LSC are both linear algorithms that help reduce computational burden and thus their combination can be applied into realtime spike analysis.