15 research outputs found

    Automatic Defect Detection for TFT-LCD Array Process Using Quasiconformal Kernel Support Vector Data Description

    Get PDF
    Defect detection has been considered an efficient way to increase the yield rate of panels in thin film transistor liquid crystal display (TFT-LCD) manufacturing. In this study we focus on the array process since it is the first and key process in TFT-LCD manufacturing. Various defects occur in the array process, and some of them could cause great damage to the LCD panels. Thus, how to design a method that can robustly detect defects from the images captured from the surface of LCD panels has become crucial. Previously, support vector data description (SVDD) has been successfully applied to LCD defect detection. However, its generalization performance is limited. In this paper, we propose a novel one-class machine learning method, called quasiconformal kernel SVDD (QK-SVDD) to address this issue. The QK-SVDD can significantly improve generalization performance of the traditional SVDD by introducing the quasiconformal transformation into a predefined kernel. Experimental results, carried out on real LCD images provided by an LCD manufacturer in Taiwan, indicate that the proposed QK-SVDD not only obtains a high defect detection rate of 96%, but also greatly improves generalization performance of SVDD. The improvement has shown to be over 30%. In addition, results also show that the QK-SVDD defect detector is able to accomplish the task of defect detection on an LCD image within 60 ms

    Paraxial light in a Cole-Cole nonlocal medium: integrable regimes and singularities

    Full text link
    Nonlocal nonlinear Schroedinger-type equation is derived as a model to describe paraxial light propagation in nonlinear media with different `degrees' of nonlocality. High frequency limit of this equation is studied under specific assumptions of Cole-Cole dispersion law and a slow dependence along propagating direction. Phase equations are integrable and they correspond to dispersionless limit of Veselov-Novikov hierarchy. Analysis of compatibility among intensity law (dependence of intensity on the refractive index) and high frequency limit of Poynting vector conservation law reveals the existence of singular wavefronts. It is shown that beams features depend critically on the orientation properties of quasiconformal mappings of the plane. Another class of wavefronts, whatever is intensity law, is provided by harmonic minimal surfaces. Illustrative example is given by helicoid surface. Compatibility with first and third degree nonlocal perturbations and explicit solutions are also discussed.Comment: 12 pages, 2 figures; eq. (36) corrected, minor change

    High frequency integrable regimes in nonlocal nonlinear optics

    Full text link
    We consider an integrable model which describes light beams propagating in nonlocal nonlinear media of Cole-Cole type. The model is derived as high frequency limit of both Maxwell equations and the nonlocal nonlinear Schroedinger equation. We demonstrate that for a general form of nonlinearity there exist selfguided light beams. In high frequency limit nonlocal perturbations can be seen as a class of phase deformation along one direction. We study in detail nonlocal perturbations described by the dispersionless Veselov-Novikov (dVN) hierarchy. The dVN hierarchy is analyzed by the reduction method based on symmetry constraints and by the quasiclassical Dbar-dressing method. Quasiclassical Dbar-dressing method reveals a connection between nonlocal nonlinear geometric optics and the theory of quasiconformal mappings of the plane.Comment: 45 pages, 4 figure

    Support vector machines to detect physiological patterns for EEG and EMG-based human-computer interaction:a review

    Get PDF
    Support vector machines (SVMs) are widely used classifiers for detecting physiological patterns in human-computer interaction (HCI). Their success is due to their versatility, robustness and large availability of free dedicated toolboxes. Frequently in the literature, insufficient details about the SVM implementation and/or parameters selection are reported, making it impossible to reproduce study analysis and results. In order to perform an optimized classification and report a proper description of the results, it is necessary to have a comprehensive critical overview of the applications of SVM. The aim of this paper is to provide a review of the usage of SVM in the determination of brain and muscle patterns for HCI, by focusing on electroencephalography (EEG) and electromyography (EMG) techniques. In particular, an overview of the basic principles of SVM theory is outlined, together with a description of several relevant literature implementations. Furthermore, details concerning reviewed papers are listed in tables and statistics of SVM use in the literature are presented. Suitability of SVM for HCI is discussed and critical comparisons with other classifiers are reported

    Structural Surface Mapping for Shape Analysis

    Get PDF
    Natural surfaces are usually associated with feature graphs, such as the cortical surface with anatomical atlas structure. Such a feature graph subdivides the whole surface into meaningful sub-regions. Existing brain mapping and registration methods did not integrate anatomical atlas structures. As a result, with existing brain mappings, it is difficult to visualize and compare the atlas structures. And also existing brain registration methods can not guarantee the best possible alignment of the cortical regions which can help computing more accurate shape similarity metrics for neurodegenerative disease analysis, e.g., Alzheimer’s disease (AD) classification. Also, not much attention has been paid to tackle surface parameterization and registration with graph constraints in a rigorous way which have many applications in graphics, e.g., surface and image morphing. This dissertation explores structural mappings for shape analysis of surfaces using the feature graphs as constraints. (1) First, we propose structural brain mapping which maps the brain cortical surface onto a planar convex domain using Tutte embedding of a novel atlas graph and harmonic map with atlas graph constraints to facilitate visualization and comparison between the atlas structures. (2) Next, we propose a novel brain registration technique based on an intrinsic atlas-constrained harmonic map which provides the best possible alignment of the cortical regions. (3) After that, the proposed brain registration technique has been applied to compute shape similarity metrics for AD classification. (4) Finally, we propose techniques to compute intrinsic graph-constrained parameterization and registration for general genus-0 surfaces which have been used in surface and image morphing applications

    Minimax estimation of smooth optimal transport maps

    Full text link
    Brenier's theorem is a cornerstone of optimal transport that guarantees the existence of an optimal transport map TT between two probability distributions PP and QQ over Rd\mathbb{R}^d under certain regularity conditions. The main goal of this work is to establish the minimax estimation rates for such a transport map from data sampled from PP and QQ under additional smoothness assumptions on TT. To achieve this goal, we develop an estimator based on the minimization of an empirical version of the semi-dual optimal transport problem, restricted to truncated wavelet expansions. This estimator is shown to achieve near minimax optimality using new stability arguments for the semi-dual and a complementary minimax lower bound. Furthermore, we provide numerical experiments on synthetic data supporting our theoretical findings and highlighting the practical benefits of smoothness regularization. These are the first minimax estimation rates for transport maps in general dimension.Comment: 53 pages, 6 figure

    Signal processing of EEG data and AI assisted classification of emotional responses based on visual stimuli

    Get PDF
    This report outlines the research conducted to explore on the topic of classification of human neurological data using machine learning models. The primary objective was to investigate alternative approaches for efficiently interpreting EEG data and test the possibilities for predicting human emotions. During the study, data was collected by recording the brain activity of volunteering respondents using electroencephalography. These participants were exposed to visual stimuli in the purpose of provoking specific neural activity as a result of emotional responses in the brain. The collected data underwent traditional signal preprocessing techniques typically employed in EEG data analysis. Subsequently, the filtered data was subjected to wavelet transformation, both with and without synchrosqueezing. Principal components analysis was used to perform dimensionality reduction on the resulting features extracted from the data. The final model achieved a prediction accuracy of 32% when classifying between eight different classes of emotional responses based on training data from three respondents

    An efficient emotion classification system using EEG

    Get PDF
    Emotion classification via Electroencephalography (EEG) is used to find the relationships between EEG signals and human emotions. There are many available channels, which consist of electrodes capturing brainwave activity. Some applications may require a reduced number of channels and frequency bands to shorten the computation time, facilitate human comprehensibility, and develop a practical wearable. In prior research, different sets of channels and frequency bands have been used. In this study, a systematic way of selecting the set of channels and frequency bands has been investigated, and results shown that by using the reduced number of channels and frequency bands, it can achieve similar accuracies. The study also proposed a method used to select the appropriate features using the Relief F method. The experimental results of this study showed that the method could reduce and select appropriate features confidently and efficiently. Moreover, the Fuzzy Support Vector Machine (FSVM) is used to improve emotion classification accuracy, as it was found from this research that it performed better than the Support Vector Machine (SVM) in handling the outliers, which are typically presented in the EEG signals. Furthermore, the FSVM is treated as a black-box model, but some applications may need to provide comprehensible human rules. Therefore, the rules are extracted using the Classification and Regression Trees (CART) approach to provide human comprehensibility to the system. The FSVM and rule extraction experiments showed that The FSVM performed better than the SVM in classifying the emotion of interest used in the experiments, and rule extraction from the FSVM utilizing the CART (FSVM-CART) had a good trade-off between classification accuracy and human comprehensibility

    Classification task-driven efficient feature extraction from tensor data

    Get PDF
    Automatic classification of complex data is an area of great interest as it allows to make efficient use of the increasingly data intensive environment that characterizes our modern world. This thesis presents to two contributions to this research area. Firstly, the problem of discriminative feature extraction for data organized in multidimensional arrays. In machine learning, Linear Discriminant Analysis (LDA) is a popular discriminative feature extraction method based on optimizing a Fisher type criterion to find the most discriminative data projection. Various extension of LDA to high-order tensor data have been developed. The method proposed is called the Efficient Greedy Feature Extraction method (EGFE). This method avoids solving optimization problems of very high dimension. Also, it can be stopped when the extracted features are deemed to be sufficient for a proper discrimination of the classes. Secondly, an application of EGFE methods to early detection of dementia disease. For the early detection task, four cognitive scores are used as the original data while we employ our greedy feature extraction method to derive discriminative privileged information feature from fMRI data. The results from the experiments presented in this thesis demonstrate the advantage of using privileged information for the early detection task
    corecore