Gotowa bibliografia na temat „Multiple Sparse Bayesian Learning”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Multiple Sparse Bayesian Learning”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Multiple Sparse Bayesian Learning"
1
Nannuru, Santosh, Kay L. Gemba, Peter Gerstoft, William S. Hodgkiss i Christoph F. Mecklenbräuker. "Sparse Bayesian learning with multiple dictionaries". Signal Processing 159 (czerwiec 2019): 159–70. http://dx.doi.org/10.1016/j.sigpro.2019.02.003.
Pełny tekst źródła
2
Zhang, Shuanghui, Yongxiang Liu i Xiang Li. "Sparse Aperture InISAR Imaging via Sequential Multiple Sparse Bayesian Learning". Sensors 17, nr 10 (10.10.2017): 2295. http://dx.doi.org/10.3390/s17102295.
Pełny tekst źródła
3
Shin, Myoungin, Wooyoung Hong, Keunhwa Lee i Youngmin Choo. "Passive Sonar Target Identification Using Multiple-Measurement Sparse Bayesian Learning". Sensors 22, nr 21 (4.11.2022): 8511. http://dx.doi.org/10.3390/s22218511.
Pełny tekst źródłaStreszczenie:
Accurate estimation of the frequency component is an important issue to identify and track marine objects (e.g., surface ship, submarine, etc.). In general, a passive sonar system consists of a sensor array, and each sensor receives data that have common information of the target signal. In this paper, we consider multiple-measurement sparse Bayesian learning (MM-SBL), which reconstructs sparse solutions in a linear system using Bayesian frameworks, to detect the common frequency components received by each sensor. In addition, the direction of arrival estimation was performed on each detected common frequency component using the MM-SBL based on beamforming. The azimuth for each common frequency component was confirmed in the frequency-azimuth plot, through which we identified the target. In addition, we perform target tracking using the target detection results along time, which are derived from the sum of the signal spectrum at the azimuth angle. The performance of the MM-SBL and the conventional target detection method based on energy detection were compared using in-situ data measured near the Korean peninsula, where MM-SBL displays superior detection performance and high-resolution results.
4
Sun, Bin, Haowen Chen, Xizhang Wei i Xiang Li. "Multitarget Direct Localization Using Block Sparse Bayesian Learning in Distributed MIMO Radar". International Journal of Antennas and Propagation 2015 (2015): 1–12. http://dx.doi.org/10.1155/2015/903902.
Pełny tekst źródłaStreszczenie:
The target localization in distributed multiple-input multiple-output (MIMO) radar is a problem of great interest. This problem becomes more complicated for the case of multitarget where the measurement should be associated with the correct target. Sparse representation has been demonstrated to be a powerful framework for direct position determination (DPD) algorithms which avoid the association process. In this paper, we explore a novel sparsity-based DPD method to locate multiple targets using distributed MIMO radar. Since the sparse representation coefficients exhibit block sparsity, we use a block sparse Bayesian learning (BSBL) method to estimate the locations of multitarget, which has many advantages over existing block sparse model based algorithms. Experimental results illustrate that DPD using BSBL can achieve better localization accuracy and higher robustness against block coherence and compressed sensing (CS) than popular algorithms in most cases especially for dense targets case.
5
Shin, Myoungin, Wooyoung Hong, Keunhwa Lee i Youngmin Choo. "Frequency Analysis of Acoustic Data Using Multiple-Measurement Sparse Bayesian Learning". Sensors 21, nr 17 (30.08.2021): 5827. http://dx.doi.org/10.3390/s21175827.
Pełny tekst źródłaStreszczenie:
Passive sonar systems are used to detect the acoustic signals that are radiated from marine objects (e.g., surface ships, submarines, etc.), and an accurate estimation of the frequency components is crucial to the target detection. In this paper, we introduce sparse Bayesian learning (SBL) for the frequency analysis after the corresponding linear system is established. Many algorithms, such as fast Fourier transform (FFT), estimate signal parameters via rotational invariance techniques (ESPRIT), and multiple signal classification (RMUSIC) has been proposed for frequency detection. However, these algorithms have limitations of low estimation resolution by insufficient signal length (FFT), required knowledge of the signal frequency component number, and performance degradation at low signal to noise ratio (ESPRIT and RMUSIC). The SBL, which reconstructs a sparse solution from the linear system using the Bayesian framework, has an advantage in frequency detection owing to high resolution from the solution sparsity. Furthermore, in order to improve the robustness of the SBL-based frequency analysis, we exploit multiple measurements over time and space domains that share common frequency components. We compare the estimation results from FFT, ESPRIT, RMUSIC, and SBL using synthetic data, which displays the superior performance of the SBL that has lower estimation errors with a higher recovery ratio. We also apply the SBL to the in-situ data with other schemes and the frequency components from the SBL are revealed as the most effective. In particular, the SBL estimation is remarkably enhanced by the multiple measurements from both space and time domains owing to remaining consistent signal frequency components while diminishing random noise frequency components.
6
Hu, Xiaowei, Ningning Tong, Xingyu He i Yuchen Wang. "2D Superresolution ISAR Imaging via Temporally Correlated Multiple Sparse Bayesian Learning". Journal of the Indian Society of Remote Sensing 46, nr 3 (12.10.2017): 387–93. http://dx.doi.org/10.1007/s12524-017-0709-3.
Pełny tekst źródła
7
Yuan, Cheng, i Mingjun Su. "Seismic spectral sparse reflectivity inversion based on SBL-EM: experimental analysis and application". Journal of Geophysics and Engineering 16, nr 6 (18.10.2019): 1124–38. http://dx.doi.org/10.1093/jge/gxz082.
Pełny tekst źródłaStreszczenie:
Abstract In this paper, we propose a new method of seismic spectral sparse reflectivity inversion that, for the first time, introduces Expectation-Maximization-based sparse Bayesian learning (SBL-EM) to enhance the accuracy of stratal reflectivity estimation based on the frequency spectrum of seismic reflection data. Compared with the widely applied sequential algorithm-based sparse Bayesian learning (SBL-SA), SBL-EM is more robust to data noise and, generally, can not only find a sparse solution with higher precision, but also yield a better lateral continuity along the final profile. To investigate the potential of SBL-EM in a seismic spectral sparse reflectivity inversion, we evaluate the inversion results by comparing them with those of a SBL-SA-based approach in multiple aspects, including the sensitivity to different frequency bands, the robustness to data noise, the lateral continuity of the final profiles and so on. Furthermore, we apply the mean square error (MSE), residual variance (RV) of seismograms and residual energy (RE) between the frequency spectra of the true and inverted reflectivity model to highlight the advantages of the proposed method over the SBL-SA-based approach in terms of spectral sparse reflectivity inversion within a sparse Bayesian learning framework. Multiple examples, including both numerical and field experiments, are carried out to validate the proposed method.
8
Narayanaswamy, Anughna, i Ramesha Muniyappa. "Underdetermined direction of arrival estimation for multiple input and multiple outputs sparse channel based on Bayesian learning framework". Indonesian Journal of Electrical Engineering and Computer Science 31, nr 1 (1.07.2023): 170. http://dx.doi.org/10.11591/ijeecs.v31.i1.pp170-179.
Pełny tekst źródłaStreszczenie:
Direction of arrival (DOA) estimation for a sparse channel has attracted serious attention recently. Better signal analysis and denoising achieve accuracy in DOA determination. This paper proposes an underdetermined DOA estimation for multiple input and multiple outputs (MIMO) sparse channels. A novel multi-kernel-based non-negative sparse Bayesian learning (MK NNSBL) framework is implemented using the multiplied form of basis vector within the manifold matrix for a defined grid. Meanwhile, virtual antenna locations are reconfigured by exploiting the conventional cuckoo search algorithm (CCSA) for the fine reception of incoming signals on a nonuniform linear array (NULA). The simulated results reveal that the novel approach outperforms in its optimal root mean square error (RMSE) for various signal-to-noise ratio (SNR) limits and the compilation time. The convergence comparative graph indicates the improved performance in the proposed framework over existing algorithms.
9
Qin, Yanhua, Yumin Liu i Zhongyuan Yu. "Underdetermined DOA estimation using coprime array via multiple measurement sparse Bayesian learning". Signal, Image and Video Processing 13, nr 7 (22.04.2019): 1311–18. http://dx.doi.org/10.1007/s11760-019-01480-x.
Pełny tekst źródła
10
Ma, Jitong, Jiacheng Zhang, Zhengyan Yang i Tianshuang Qiu. "Off-Grid DOA Estimation Using Sparse Bayesian Learning for MIMO Radar under Impulsive Noise". Sensors 22, nr 16 (20.08.2022): 6268. http://dx.doi.org/10.3390/s22166268.
Pełny tekst źródłaStreszczenie:
Direction of arrival (DOA) estimation is an essential and fundamental part of array signal processing, which has been widely used in radio monitoring, autonomous driving of vehicles, intelligent navigation, etc. However, it remains a challenge to accurately estimate DOA for multiple-input multiple-output (MIMO) radar in impulsive noise environments. To address this problem, an off-grid DOA estimation method for monostatic MIMO radar is proposed to deal with non-circular signals under impulsive noise. In the proposed method, firstly, based on the property of non-circular signal and array structure, a virtual array output was built and a real-valued sparse representation for the signal model was constructed. Then, an off-grid sparse Bayesian learning (SBL) framework is proposed and further applied to the virtual array to construct novel off-grid sparse model. Finally, off-grid DOA estimation was realized through the solution of the sparse reconstruction with high accuracy even in impulsive noise. Numerous simulations were performed to compare the algorithm with existing methods. Simulation results verify that the proposed off-grid DOA method enables evident performance improvement in terms of accuracy and robustness compared with other works on impulsive noise.
Rozprawy doktorskie na temat "Multiple Sparse Bayesian Learning"
1
Higson, Edward John. "Bayesian methods and machine learning in astrophysics". Thesis, University of Cambridge, 2019. https://www.repository.cam.ac.uk/handle/1810/289728.
Pełny tekst źródłaStreszczenie:
This thesis is concerned with methods for Bayesian inference and their applications in astrophysics. We principally discuss two related themes: advances in nested sampling (Chapters 3 to 5), and Bayesian sparse reconstruction of signals from noisy data (Chapters 6 and 7). Nested sampling is a popular method for Bayesian computation which is widely used in astrophysics. Following the introduction and background material in Chapters 1 and 2, Chapter 3 analyses the sampling errors in nested sampling parameter estimation and presents a method for estimating them numerically for a single nested sampling calculation. Chapter 4 introduces diagnostic tests for detecting when software has not performed the nested sampling algorithm accurately, for example due to missing a mode in a multimodal posterior. The uncertainty estimates and diagnostics in Chapters 3 and 4 are implemented in the $\texttt{nestcheck}$ software package, and both chapters describe an astronomical application of the techniques introduced. Chapter 5 describes dynamic nested sampling: a generalisation of the nested sampling algorithm which can produce large improvements in computational efficiency compared to standard nested sampling. We have implemented dynamic nested sampling in the $\texttt{dyPolyChord}$ and $\texttt{perfectns}$ software packages. Chapter 6 presents a principled Bayesian framework for signal reconstruction, in which the signal is modelled by basis functions whose number (and form, if required) is determined by the data themselves. This approach is based on a Bayesian interpretation of conventional sparse reconstruction and regularisation techniques, in which sparsity is imposed through priors via Bayesian model selection. We demonstrate our method for noisy 1- and 2-dimensional signals, including examples of processing astronomical images. The numerical implementation uses dynamic nested sampling, and uncertainties are calculated using the methods introduced in Chapters 3 and 4. Chapter 7 applies our Bayesian sparse reconstruction framework to artificial neural networks, where it allows the optimum network architecture to be determined by treating the number of nodes and hidden layers as parameters. We conclude by suggesting possible areas of future research in Chapter 8.
2
Parisi, Simone [Verfasser], Jan [Akademischer Betreuer] Peters i Joschka [Akademischer Betreuer] Boedeker. "Reinforcement Learning with Sparse and Multiple Rewards / Simone Parisi ; Jan Peters, Joschka Boedeker". Darmstadt : Universitäts- und Landesbibliothek Darmstadt, 2020. http://d-nb.info/1203301545/34.
Pełny tekst źródła
3
Tandon, Prateek. "Bayesian Aggregation of Evidence for Detection and Characterization of Patterns in Multiple Noisy Observations". Research Showcase @ CMU, 2015. http://repository.cmu.edu/dissertations/658.
Pełny tekst źródłaStreszczenie:
Effective use of Machine Learning to support extracting maximal information from limited sensor data is one of the important research challenges in robotic sensing. This thesis develops techniques for detecting and characterizing patterns in noisy sensor data. Our Bayesian Aggregation (BA) algorithmic framework can leverage data fusion from multiple low Signal-To-Noise Ratio (SNR) sensor observations to boost the capability to detect and characterize the properties of a signal generating source or process of interest. We illustrate our research with application to the nuclear threat detection domain. Developed algorithms are applied to the problem of processing the large amounts of gamma ray spectroscopy data that can be produced in real-time by mobile radiation sensors. The thesis experimentally shows BA’s capability to boost sensor performance in detecting radiation sources of interest, even if the source is faint, partiallyoccluded, or enveloped in the noisy and variable radiation background characteristic of urban scenes. In addition, BA provides simultaneous inference of source parameters such as the source intensity or source type while detecting it. The thesis demonstrates this capability and also develops techniques to efficiently optimize these parameters over large possible setting spaces. Methods developed in this thesis are demonstrated both in simulation and in a radiation-sensing backpack that applies robotic localization techniques to enable indoor surveillance of radiation sources. The thesis further improves the BA algorithm’s capability to be robust under various detection scenarios. First, we augment BA with appropriate statistical models to improve estimation of signal components in low photon count detection, where the sensor may receive limited photon counts from either source and/or background. Second, we develop methods for online sensor reliability monitoring to create algorithms that are resilient to possible sensor faults in a data pipeline containing one or multiple sensors. Finally, we develop Retrospective BA, a variant of BA that allows reinterpretation of past sensor data in light of new information about percepts. These Retrospective capabilities include the use of Hidden Markov Models in BA to allow automatic correction of a sensor pipeline when sensor malfunction may be occur, an Anomaly- Match search strategy to efficiently optimize source hypotheses, and prototyping of a Multi-Modal Augmented PCA to more flexibly model background and nuisance source fluctuations in a dynamic environment.
4
Ticlavilca, Andres M. "Multivariate Bayesian Machine Learning Regression for Operation and Management of Multiple Reservoir, Irrigation Canal, and River Systems". DigitalCommons@USU, 2010. https://digitalcommons.usu.edu/etd/600.
Pełny tekst źródłaStreszczenie:
The principal objective of this dissertation is to develop Bayesian machine learning models for multiple reservoir, irrigation canal, and river system operation and management. These types of models are derived from the emerging area of machine learning theory; they are characterized by their ability to capture the underlying physics of the system simply by examination of the measured system inputs and outputs. They can be used to provide probabilistic predictions of system behavior using only historical data. The models were developed in the form of a multivariate relevance vector machine (MVRVM) that is based on a sparse Bayesian learning machine approach for regression. Using this Bayesian approach, a predictive confidence interval is obtained from the model that captures the uncertainty of both the model and the data. The models were applied to the multiple reservoir, canal and river system located in the regulated Lower Sevier River Basin in Utah. The models were developed to perform predictions of multi-time-ahead releases of multiple reservoirs, diversions of multiple canals, and streamflow and water loss/gain in a river system. This research represents the first attempt to use a multivariate Bayesian learning regression approach to develop simultaneous multi-step-ahead predictions with predictive confidence intervals for multiple outputs in a regulated river basin system. These predictions will be of potential value to reservoir and canal operators in identifying the best decisions for operation and management of irrigation water supply systems.
5
Jin, Junyang. "Novel methods for biological network inference : an application to circadian Ca2+ signaling network". Thesis, University of Cambridge, 2018. https://www.repository.cam.ac.uk/handle/1810/285323.
Pełny tekst źródłaStreszczenie:
Biological processes involve complex biochemical interactions among a large number of species like cells, RNA, proteins and metabolites. Learning these interactions is essential to interfering artificially with biological processes in order to, for example, improve crop yield, develop new therapies, and predict new cell or organism behaviors to genetic or environmental perturbations. For a biological process, two pieces of information are of most interest. For a particular species, the first step is to learn which other species are regulating it. This reveals topology and causality. The second step involves learning the precise mechanisms of how this regulation occurs. This step reveals the dynamics of the system. Applying this process to all species leads to the complete dynamical network. Systems biology is making considerable efforts to learn biological networks at low experimental costs. The main goal of this thesis is to develop advanced methods to build models for biological networks, taking the circadian system of Arabidopsis thaliana as a case study. A variety of network inference approaches have been proposed in the literature to study dynamic biological networks. However, many successful methods either require prior knowledge of the system or focus more on topology. This thesis presents novel methods that identify both network topology and dynamics, and do not depend on prior knowledge. Hence, the proposed methods are applicable to general biological networks. These methods are initially developed for linear systems, and, at the cost of higher computational complexity, can also be applied to nonlinear systems. Overall, we propose four methods with increasing computational complexity: one-to-one, combined group and element sparse Bayesian learning (GESBL), the kernel method and reversible jump Markov chain Monte Carlo method (RJMCMC). All methods are tested with challenging dynamical network simulations (including feedback, random networks, different levels of noise and number of samples), and realistic models of circadian system of Arabidopsis thaliana. These simulations show that, while the one-to-one method scales to the whole genome, the kernel method and RJMCMC method are superior for smaller networks. They are robust to tuning variables and able to provide stable performance. The simulations also imply the advantage of GESBL and RJMCMC over the state-of-the-art method. We envision that the estimated models can benefit a wide range of research. For example, they can locate biological compounds responsible for human disease through mathematical analysis and help predict the effectiveness of new treatments.
6
Yazdani, Akram. "Statistical Approaches in Genome-Wide Association Studies". Doctoral thesis, Università degli studi di Padova, 2014. http://hdl.handle.net/11577/3423743.
Pełny tekst źródłaStreszczenie:
Genome-wide association studies, GWAS, typically contain hundreds of thousands single nucleotide polymorphisms, SNPs, genotyped for few numbers of samples. The aim of these studies is to identify regions harboring SNPs or to predict the outcomes of interest. Since the number of predictors in the GWAS far exceeds the number of samples, it is impossible to analyze the data with classical statistical methods. In the current GWAS, the widely applied methods are based on single marker analysis that does assess association of each SNP with the complex traits independently. Because of the low power of this analysis for detecting true association, simultaneous analysis has recently received more attention. The new statistical methods for simultaneous analysis in high dimensional settings have a limitation of disparity between the number of predictors and the number of samples. Therefore, reducing the dimensionality of the set of SNPs is required.
This thesis reviews single marker analysis and simultaneous analysis with a focus on Bayesian methods. It addresses the weaknesses of these approaches with reference to recent literature and illustrating simulation studies. To bypass these problems, we first attempt to reduce dimension of the set of SNPs with random projection technique. Since this method does not improve the predictive performance of the model, we present a new two-stage approach that is a hybrid method of single and simultaneous analyses. This full Bayesian approach selects the most promising SNPs in the first stage by evaluating the impact of each marker independently. In the second stage, we develop a hierarchical Bayesian model to analyze the impact of selected markers simultaneously. The model that accounts for related samples places the local-global shrinkage prior on marker effects in order to shrink small effects to zero while keeping large effects relatively large. The prior specification on marker effects, which is hierarchical representation of generalized double Pareto, improves the predictive performance. Finally, we represent the result of real SNP-data analysis through single-maker study and the new two-stage approach.Lo Studio di Associazione Genome-Wide, GWAS, tipicamente comprende centinaia di migliaia di polimorfismi a singolo nucleotide, SNPs, genotipizzati per pochi campioni. L'obiettivo di tale studio consiste nell'individuare le regioni cruciali SNPs e prevedere gli esiti di una variabile risposta. Dal momento che il numero di predittori è di gran lunga superiore al numero di campioni, non è possibile condurre l'analisi dei dati con metodi statistici classici. GWAS attuali, i metodi negli maggiormente utilizzati si basano sull'analisi a marcatore unico, che valuta indipendentemente l'associazione di ogni SNP con i tratti complessi. A causa della bassa potenza dell'analisi a marcatore unico nel rilevamento delle associazioni reali, l'analisi simultanea ha recentemente ottenuto più attenzione. I recenti metodi per l'analisi simultanea nel multidimensionale hanno una limitazione sulla disparità tra il numero di predittori e il numero di campioni. Pertanto, è necessario ridurre la dimensionalità dell'insieme di SNPs. Questa tesi fornisce una panoramica dell'analisi a marcatore singolo e dell'analisi simultanea, focalizzandosi su metodi Bayesiani. Vengono discussi i limiti di tali approcci in relazione ai GWAS, con riferimento alla letteratura recente e utilizzando studi di simulazione. Per superare tali problemi, si è cercato di ridurre la dimensione dell'insieme di SNPs con una tecnica a proiezione casuale. Poiché questo approccio non comporta miglioramenti nella accuratezza predittiva del modello, viene quindi proposto un approccio in due fasi, che risulta essere un metodo ibrido di analisi singola e simultanea. Tale approccio, completamente Bayesiano, seleziona gli SNPs più promettenti nella prima fase valutando l'impatto di ogni marcatore indipendentemente. Nella seconda fase, viene sviluppato un modello gerarchico Bayesiano per analizzare contemporaneamente l'impatto degli indicatori selezionati. Il modello che considera i campioni correlati pone una priori locale-globale ristretta sugli effetti dei marcatori. Tale prior riduce a zero gli effetti piccoli, mentre mantiene gli effetti più grandi relativamente grandi. Le priori specificate sugli effetti dei marcatori sono rappresentazioni gerarchiche della distribuzione Pareto doppia; queste a priori migliorano le prestazioni predittive del modello. Infine, nella tesi vengono riportati i risultati dell'analisi su dati reali di SNP basate sullo studio a marcatore singolo e sul nuovo approccio a due stadi.
7
Deshpande, Hrishikesh. "Dictionary learning for pattern classification in medical imaging". Thesis, Rennes 1, 2016. http://www.theses.fr/2016REN1S032/document.
Pełny tekst źródłaStreszczenie:
La plupart des signaux naturels peuvent être représentés par une combinaison linéaire de quelques atomes dans un dictionnaire. Ces représentations parcimonieuses et les méthodes d'apprentissage de dictionnaires (AD) ont suscité un vif intérêt au cours des dernières années. Bien que les méthodes d'AD classiques soient efficaces dans des applications telles que le débruitage d'images, plusieurs méthodes d'AD discriminatifs ont été proposées pour obtenir des dictionnaires mieux adaptés à la classification. Dans ce travail, nous avons montré que la taille des dictionnaires de chaque classe est un facteur crucial dans les applications de reconnaissance des formes lorsqu'il existe des différences de variabilité entre les classes, à la fois dans le cas des dictionnaires classiques et des dictionnaires discriminatifs. Nous avons validé la proposition d'utiliser différentes tailles de dictionnaires, dans une application de vision par ordinateur, la détection des lèvres dans des images de visages, ainsi que par une application médicale plus complexe, la classification des lésions de scléroses en plaques (SEP) dans des images IRM multimodales. Les dictionnaires spécifiques à chaque classe sont appris pour les lésions et les tissus cérébraux sains. La taille du dictionnaire pour chaque classe est adaptée en fonction de la complexité des données. L'algorithme est validé à l'aide de 52 séquences IRM multimodales de 13 patients atteints de SEPMost natural signals can be approximated by a linear combination of a few atoms in a dictionary. Such sparse representations of signals and dictionary learning (DL) methods have received a special attention over the past few years. While standard DL approaches are effective in applications such as image denoising or compression, several discriminative DL methods have been proposed to achieve better image classification. In this thesis, we have shown that the dictionary size for each class is an important factor in the pattern recognition applications where there exist variability difference between classes, in the case of both the standard and discriminative DL methods. We validated the proposition of using different dictionary size based on complexity of the class data in a computer vision application such as lips detection in face images, followed by more complex medical imaging application such as classification of multiple sclerosis (MS) lesions using MR images. The class specific dictionaries are learned for the lesions and individual healthy brain tissues, and the size of the dictionary for each class is adapted according to the complexity of the underlying data. The algorithm is validated using 52 multi-sequence MR images acquired from 13 MS patients
8
Chen, Cong. "High-Dimensional Generative Models for 3D Perception". Diss., Virginia Tech, 2021. http://hdl.handle.net/10919/103948.
Pełny tekst źródłaStreszczenie:
Modern robotics and automation systems require high-level reasoning capability in representing, identifying, and interpreting the three-dimensional data of the real world. Understanding the world's geometric structure by visual data is known as 3D perception. The necessity of analyzing irregular and complex 3D data has led to the development of high-dimensional frameworks for data learning. Here, we design several sparse learning-based approaches for high-dimensional data that effectively tackle multiple perception problems, including data filtering, data recovery, and data retrieval. The frameworks offer generative solutions for analyzing complex and irregular data structures without prior knowledge of data.
The first part of the dissertation proposes a novel method that simultaneously filters point cloud noise and outliers as well as completing missing data by utilizing a unified framework consisting of a novel tensor data representation, an adaptive feature encoder, and a generative Bayesian network. In the next section, a novel multi-level generative chaotic Recurrent Neural Network (RNN) has been proposed using a sparse tensor structure for image restoration. In the last part of the dissertation, we discuss the detection followed by localization, where we discuss extracting features from sparse tensors for data retrieval.Doctor of Philosophy
The development of automation systems and robotics brought the modern world unrivaled affluence and convenience. However, the current automated tasks are mainly simple repetitive motions. Tasks that require more artificial capability with advanced visual cognition are still an unsolved problem for automation. Many of the high-level cognition-based tasks require the accurate visual perception of the environment and dynamic objects from the data received from the optical sensor. The capability to represent, identify and interpret complex visual data for understanding the geometric structure of the world is 3D perception. To better tackle the existing 3D perception challenges, this dissertation proposed a set of generative learning-based frameworks on sparse tensor data for various high-dimensional robotics perception applications: underwater point cloud filtering, image restoration, deformation detection, and localization. Underwater point cloud data is relevant for many applications such as environmental monitoring or geological exploration. The data collected with sonar sensors are however subjected to different types of noise, including holes, noise measurements, and outliers. In the first chapter, we propose a generative model for point cloud data recovery using Variational Bayesian (VB) based sparse tensor factorization methods to tackle these three defects simultaneously. In the second part of the dissertation, we propose an image restoration technique to tackle missing data, which is essential for many perception applications. An efficient generative chaotic RNN framework has been introduced for recovering the sparse tensor from a single corrupted image for various types of missing data. In the last chapter, a multi-level CNN for high-dimension tensor feature extraction for underwater vehicle localization has been proposed.
9
Subramanian, Harshavardhan. "Combining scientific computing and machine learning techniques to model longitudinal outcomes in clinical trials". Thesis, Linköpings universitet, Institutionen för datavetenskap, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-176427.
Pełny tekst źródłaStreszczenie:
Scientific machine learning (SciML) is a new branch of AI research at the edge of scientific computing (Sci) and machine learning (ML). It deals with efficient amalgamation of data-driven algorithms along with scientific computing to discover the dynamics of the time-evolving process. The output of such algorithms is represented in the form of a governing equation(s) (e.g., ordinary differential equation(s), ODE(s)), which one can solve then for any time point and, thus, obtain a rigorous prediction. In this thesis, we present a methodology on how to incorporate the SciML approach in the context of clinical trials to predict IPF disease progression in the form of governing equation. Our proposed methodology also quantifies the uncertainties associated with the model by fitting 95\% high density interval (HDI) for the ODE parameters and 95\% posterior prediction interval for posterior predicted samples. We have also investigated the possibility of predicting later outcomes by using the observations collected at early phase of the study. We were successful in combining ML techniques, statistical methodologies and scientific computing tools such as bootstrap sampling, cubic spline interpolation, Bayesian inference and sparse identification of nonlinear dynamics (SINDy) to discover the dynamics behind the efficacy outcome as well as in quantifying the uncertainty of the parameters of the governing equation in the form of 95 \% HDI intervals. We compared the resulting model with the existed disease progression model described by the Weibull function. Based on the mean squared error (MSE) criterion between our ODE approximated values and population means of respective datasets, we achieved the least possible MSE of 0.133,0.089,0.213 and 0.057. After comparing these MSE values with the MSE values obtained after using Weibull function, for the third dataset and pooled dataset, our ODE model performed better in reducing error than the Weibull baseline model by 7.5\% and 8.1\%, respectively. Whereas for the first and second datasets, the Weibull model performed better in reducing errors by 1.5\% and 1.2\%, respectively. Comparing the overall performance in terms of MSE, our proposed model approximates the population means better in all the cases except for the first and second datasets, assuming the latter case's error margin is very small. Also, in terms of interpretation, our dynamical system model contains the mechanistic elements that can explain the decay/acceleration rate of the efficacy endpoint, which is missing in the Weibull model. However, our approach had a limitation in predicting final outcomes using a model derived from 24, 36, 48 weeks observations with good accuracy where as on the contrast, the Weibull model do not possess the predicting capability. However, the extrapolated trend based on 60 weeks of data was found to be close to population mean and the ODE model built on 72 weeks of data. Finally we highlight potential questions for the future work.
10
Francisco, André Biasin Segalla. "Esparsidade estruturada em reconstrução de fontes de EEG". Universidade de São Paulo, 2018. http://www.teses.usp.br/teses/disponiveis/43/43134/tde-13052018-112615/.
Pełny tekst źródłaStreszczenie:
Neuroimagiologia funcional é uma área da neurociência que visa o desenvolvimento de diversas técnicas para mapear a atividade do sistema nervoso e esteve sob constante desenvolvimento durante as últimas décadas devido à sua grande importância para aplicações clínicas e pesquisa. Técnicas usualmente utilizadas, como imagem por ressonância magnética functional (fMRI) e tomografia por emissão de pósitrons (PET) têm ótima resolução espacial (~ mm), mas uma resolução temporal limitada (~ s), impondo um grande desafio para nossa compreensão a respeito da dinâmica de funções cognitivas mais elevadas, cujas oscilações podem ocorrer em escalas temporais muito mais finas (~ ms). Tal limitação ocorre pelo fato destas técnicas medirem respostas biológicas lentas que são correlacionadas de maneira indireta com a atividade elétrica cerebral. As duas principais técnicas capazes de superar essa limitação são a Eletro- e Magnetoencefalografia (EEG/MEG), que são técnicas não invasivas para medir os campos elétricos e magnéticos no escalpo, respectivamente, gerados pelas fontes elétricas cerebrais. Ambas possuem resolução temporal na ordem de milisegundo, mas tipicalmente uma baixa resolução espacial (~ cm) devido à natureza mal posta do problema inverso eletromagnético. Um imenso esforço vem sendo feito durante as últimas décadas para melhorar suas resoluções espaciais através da incorporação de informação relevante ao problema de outras técnicas de imagens e/ou de vínculos biologicamente inspirados aliados ao desenvolvimento de métodos matemáticos e algoritmos sofisticados. Neste trabalho focaremos em EEG, embora todas técnicas aqui apresentadas possam ser igualmente aplicadas ao MEG devido às suas formas matemáticas idênticas. Em particular, nós exploramos esparsidade como uma importante restrição matemática dentro de uma abordagem Bayesiana chamada Aprendizagem Bayesiana Esparsa (SBL), que permite a obtenção de soluções únicas significativas no problema de reconstrução de fontes. Além disso, investigamos como incorporar diferentes estruturas como graus de liberdade nesta abordagem, que é uma aplicação de esparsidade estruturada e mostramos que é um caminho promisor para melhorar a precisão de reconstrução de fontes em métodos de imagens eletromagnéticos.Functional Neuroimaging is an area of neuroscience which aims at developing several techniques to map the activity of the nervous system and has been under constant development in the last decades due to its high importance in clinical applications and research. Common applied techniques such as functional magnetic resonance imaging (fMRI) and positron emission tomography (PET) have great spatial resolution (~ mm), but a limited temporal resolution (~ s), which poses a great challenge on our understanding of the dynamics of higher cognitive functions, whose oscillations can occur in much finer temporal scales (~ ms). Such limitation occurs because these techniques rely on measurements of slow biological responses which are correlated in a complicated manner to the actual electric activity. The two major candidates that overcome this shortcoming are Electro- and Magnetoencephalography (EEG/MEG), which are non-invasive techniques that measure the electric and magnetic fields on the scalp, respectively, generated by the electrical brain sources. Both have millisecond temporal resolution, but typically low spatial resolution (~ cm) due to the highly ill-posed nature of the electromagnetic inverse problem. There has been a huge effort in the last decades to improve their spatial resolution by means of incorporating relevant information to the problem from either other imaging modalities and/or biologically inspired constraints allied with the development of sophisticated mathematical methods and algorithms. In this work we focus on EEG, although all techniques here presented can be equally applied to MEG because of their identical mathematical form. In particular, we explore sparsity as a useful mathematical constraint in a Bayesian framework called Sparse Bayesian Learning (SBL), which enables the achievement of meaningful unique solutions in the source reconstruction problem. Moreover, we investigate how to incorporate different structures as degrees of freedom into this framework, which is an application of structured sparsity and show that it is a promising way to improve the source reconstruction accuracy of electromagnetic imaging methods.
Książki na temat "Multiple Sparse Bayesian Learning"
1
Donovan, Therese, i Ruth M. Mickey. Bayesian Statistics for Beginners. Oxford University Press, 2019. http://dx.doi.org/10.1093/oso/9780198841296.001.0001.
Pełny tekst źródłaStreszczenie:
Bayesian Statistics for Beginners is an entry-level book on Bayesian statistics. It is like no other math book you’ve read. It is written for readers who do not have advanced degrees in mathematics and who may struggle with mathematical notation, yet need to understand the basics of Bayesian inference for scientific investigations. Intended as a “quick read,” the entire book is written as an informal, humorous conversation between the reader and writer—a natural way to present material for those new to Bayesian inference. The most impressive feature of the book is the sheer length of the journey, from introductory probability to Bayesian inference and applications, including Markov Chain Monte Carlo approaches for parameter estimation, Bayesian belief networks, and decision trees. Detailed examples in each chapter contribute a great deal, where Bayes’ Theorem is at the front and center with transparent, step-by-step calculations. A vast amount of material is covered in a lighthearted manner; the journey is relatively pain-free. The book is intended to jump-start a reader’s understanding of probability, inference, and statistical vocabulary that will set the stage for continued learning. Other features include multiple links to web-based material, an annotated bibliography, and detailed, step-by-step appendices.
2
Gottlieb, Jacqueline. Neuronal Mechanisms of Attentional Control. Redaktorzy Anna C. (Kia) Nobre i Sabine Kastner. Oxford University Press, 2014. http://dx.doi.org/10.1093/oxfordhb/9780199675111.013.033.
Pełny tekst źródłaStreszczenie:
Damage to the human inferior parietal lobe produces an attentional disturbance known as contralateral neglect, and neurophysiological studies in monkeys have begun to unravel the cellular basis of this function. Converging evidence suggests that LIP encodes a sparse topographic map of the visual world that highlights attention-worthy objects or locations. LIP cells may facilitate sensory attentional modulations, and ultimately the transient improvement in perceptual thresholds that is the behavioural signature of visual attention. In addition, LIP projects to oculomotor centres where it can prime the production of a rapid eye movement (saccade). Importantly, LIP cells can select visual targets without triggering saccades, showing that they implement an internal (covert) form of selection that can be flexibly linked with action by virtue of additional, independent mechanisms. The target selection response in LIP is modulated by bottom-up factors and by multiple task-related factors. These modulations are likely to arise through learning and may reflect a multitude of computations through which the brain decides when and to what to attend.
Części książek na temat "Multiple Sparse Bayesian Learning"
1
Chatzis, Sotirios P. "Sparse Bayesian Recurrent Neural Networks". W Machine Learning and Knowledge Discovery in Databases, 359–72. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23525-7_22.
Pełny tekst źródła
2
Naik, Cian, François Caron, Judith Rousseau, Yee Whye Teh i Konstantina Palla. "Bayesian Nonparametrics for Sparse Dynamic Networks". W Machine Learning and Knowledge Discovery in Databases, 191–206. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-26419-1_12.
Pełny tekst źródła
3
Huang, Yong, i James L. Beck. "Sparse Bayesian Learning and its Application in Bayesian System Identification". W Bayesian Inverse Problems, 79–111. Boca Raton: CRC Press, 2021. http://dx.doi.org/10.1201/b22018-7.
Pełny tekst źródła
4
Zhang, Guanghao, Dongshun Cui, Shangbo Mao i Guang-Bin Huang. "Sparse Bayesian Learning for Extreme Learning Machine Auto-encoder". W Proceedings in Adaptation, Learning and Optimization, 319–27. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-23307-5_34.
Pełny tekst źródła
5
Lei, Yun, Xiaoqing Ding i Shengjin Wang. "Adaptive Sparse Vector Tracking Via Online Bayesian Learning". W Advances in Machine Vision, Image Processing, and Pattern Analysis, 35–45. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11821045_4.
Pełny tekst źródła
6
Michel, Vincent, Evelyn Eger, Christine Keribin i Bertrand Thirion. "Multi-Class Sparse Bayesian Regression for Neuroimaging Data Analysis". W Machine Learning in Medical Imaging, 50–57. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15948-0_7.
Pełny tekst źródła
7
Samek, Wojciech, Alexander Binder i Motoaki Kawanabe. "Multi-task Learning via Non-sparse Multiple Kernel Learning". W Computer Analysis of Images and Patterns, 335–42. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23672-3_41.
Pełny tekst źródła
8
Wang, Lu, Lifan Zhao, Guoan Bi i Xin Liu. "Alternative Extended Block Sparse Bayesian Learning for Cluster Structured Sparse Signal Recovery". W Wireless and Satellite Systems, 3–12. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-19153-5_1.
Pełny tekst źródła
9
Du, Changying, Changde Du, Guoping Long, Xin Jin i Yucheng Li. "Efficient Bayesian Maximum Margin Multiple Kernel Learning". W Machine Learning and Knowledge Discovery in Databases, 165–81. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-46128-1_11.
Pełny tekst źródła
10
Sabuncu, Mert R. "A Sparse Bayesian Learning Algorithm for Longitudinal Image Data". W Lecture Notes in Computer Science, 411–18. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-24574-4_49.
Pełny tekst źródłaStreszczenia konferencji na temat "Multiple Sparse Bayesian Learning"
1
Nannuru, Santosh, Kay L. Gemba i Peter Gerstoft. "Sparse Bayesian learning with multiple dictionaries". W 2017 IEEE Global Conference on Signal and Information Processing (GlobalSIP). IEEE, 2017. http://dx.doi.org/10.1109/globalsip.2017.8309149.
Pełny tekst źródła
2
Gerstoft, Peter, i Christoph F. Mecklenbrauker. "Wideband Sparse Bayesian Learning for DOA estimation from multiple snapshots". W 2016 IEEE Sensor Array and Multichannel Signal Processing Workshop (SAM). IEEE, 2016. http://dx.doi.org/10.1109/sam.2016.7569745.
Pełny tekst źródła
3
You, Kangyong, Wenbin Guo, Peiliang Zuo, Yueliang Liu i Wenbo Wang. "Sparse Bayesian Learning for Multiple Sources Localization with Unknown Propagation Parameters". W 2019 IEEE 30th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC). IEEE, 2019. http://dx.doi.org/10.1109/pimrc.2019.8904415.
Pełny tekst źródła
4
Li, Yuling, Xin Liu i Ying Liu. "Improved super-resolution optical fluctuation imaging by multiple sparse Bayesian learning method". W Optics in Health Care and Biomedical Optics VIII, redaktorzy Qingming Luo, Xingde Li, Yuguo Tang i Ying Gu. SPIE, 2018. http://dx.doi.org/10.1117/12.2500867.
Pełny tekst źródła
5
Li, Shaoyang, Xiaoming Tao, Yang Li i Jianhua Lu. "Large-scale structured sparse image reconstruction with correlated multiple-measurement vectors using Bayesian learning". W 2015 Picture Coding Symposium (PCS). IEEE, 2015. http://dx.doi.org/10.1109/pcs.2015.7170089.
Pełny tekst źródła
6
Liu, Chang, Yicong Wang, Jin Wang, Jie Wang, Li Tian i Xiao Yu. "IoT-based Electrical Device Positioning Method Using Multiple Signal Classification and Sparse Bayesian Learning". W 2022 IEEE 4th International Conference on Power, Intelligent Computing and Systems (ICPICS). IEEE, 2022. http://dx.doi.org/10.1109/icpics55264.2022.9873800.
Pełny tekst źródła
7
Wu, Jie, Yibo Hu, Biyue Fan, Wei Chen i Deyan Sun. "Using nonlinear sparse Bayesian learning model to identify the correlation between multiple clinical cognitive scores and neuroimaging measurements". W 2020 IEEE International Conference on Bioinformatics and Biomedicine (BIBM). IEEE, 2020. http://dx.doi.org/10.1109/bibm49941.2020.9313366.
Pełny tekst źródła
8
He, Jia, Changying Du, Changde Du, Fuzhen Zhuang, Qing He i Guoping Long. "Nonlinear Maximum Margin Multi-View Learning with Adaptive Kernel". W Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/254.
Pełny tekst źródłaStreszczenie:
Existing multi-view learning methods based on kernel function either require the user to select and tune a single predefined kernel or have to compute and store many Gram matrices to perform multiple kernel learning. Apart from the huge consumption of manpower, computation and memory resources, most of these models seek point estimation of their parameters, and are prone to overfitting to small training data. This paper presents an adaptive kernel nonlinear max-margin multi-view learning model under the Bayesian framework. Specifically, we regularize the posterior of an efficient multi-view latent variable model by explicitly mapping the latent representations extracted from multiple data views to a random Fourier feature space where max-margin classification constraints are imposed. Assuming these random features are drawn from Dirichlet process Gaussian mixtures, we can adaptively learn shift-invariant kernels from data according to Bochners theorem. For inference, we employ the data augmentation idea for hinge loss, and design an efficient gradient-based MCMC sampler in the augmented space. Having no need to compute the Gram matrix, our algorithm scales linearly with the size of training set. Extensive experiments on real-world datasets demonstrate that our method has superior performance.
9
Sharpe, Conner, Clinton Morris, Benjamin Goldsberry, Carolyn Conner Seepersad i Michael R. Haberman. "Bayesian Network Structure Optimization for Improved Design Space Mapping for Design Exploration With Materials Design Applications". W ASME 2017 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/detc2017-67643.
Pełny tekst źródłaStreszczenie:
Modern design problems present both opportunities and challenges, including multifunctionality, high dimensionality, highly nonlinear multimodal responses, and multiple levels or scales. These factors are particularly important in materials design problems and make it difficult for traditional optimization algorithms to search the space effectively, and designer intuition is often insufficient in problems of this complexity. Efficient machine learning algorithms can map complex design spaces to help designers quickly identify promising regions of the design space. In particular, Bayesian network classifiers (BNCs) have been demonstrated as effective tools for top-down design of complex multilevel problems. The most common instantiations of BNCs assume that all design variables are independent. This assumption reduces computational cost, but can limit accuracy especially in engineering problems with interacting factors. The ability to learn representative network structures from data could provide accurate maps of the design space with limited computational expense. Population-based stochastic optimization techniques such as genetic algorithms (GAs) are ideal for optimizing networks because they accommodate discrete, combinatorial, and multimodal problems. Our approach utilizes GAs to identify optimal networks based on limited training sets so that future test points can be classified as accurately and efficiently as possible. This method is first tested on a common machine learning data set, and then demonstrated on a sample design problem of a composite material subjected to a planar sound wave.
10
Qiao, Xuechun, i Yasen Wang. "Recursive Sparse Bayesian Learning". W 2022 China Automation Congress (CAC). IEEE, 2022. http://dx.doi.org/10.1109/cac57257.2022.10055431.
Pełny tekst źródłaRaporty organizacyjne na temat "Multiple Sparse Bayesian Learning"
1
Wang, Fulton, i Ali Pinar. Developing an Active Learning algorithm for learning Bayesian classifiers under the Multiple Instance Learning scenario. Office of Scientific and Technical Information (OSTI), październik 2020. http://dx.doi.org/10.2172/1821545.
Pełny tekst źródła
2
Engel, Bernard, Yael Edan, James Simon, Hanoch Pasternak i Shimon Edelman. Neural Networks for Quality Sorting of Agricultural Produce. United States Department of Agriculture, lipiec 1996. http://dx.doi.org/10.32747/1996.7613033.bard.
Pełny tekst źródłaStreszczenie:
The objectives of this project were to develop procedures and models, based on neural networks, for quality sorting of agricultural produce. Two research teams, one in Purdue University and the other in Israel, coordinated their research efforts on different aspects of each objective utilizing both melons and tomatoes as case studies. At Purdue: An expert system was developed to measure variances in human grading. Data were acquired from eight sensors: vision, two firmness sensors (destructive and nondestructive), chlorophyll from fluorescence, color sensor, electronic sniffer for odor detection, refractometer and a scale (mass). Data were analyzed and provided input for five classification models. Chlorophyll from fluorescence was found to give the best estimation for ripeness stage while the combination of machine vision and firmness from impact performed best for quality sorting. A new algorithm was developed to estimate and minimize training size for supervised classification. A new criteria was established to choose a training set such that a recurrent auto-associative memory neural network is stabilized. Moreover, this method provides for rapid and accurate updating of the classifier over growing seasons, production environments and cultivars. Different classification approaches (parametric and non-parametric) for grading were examined. Statistical methods were found to be as accurate as neural networks in grading. Classification models by voting did not enhance the classification significantly. A hybrid model that incorporated heuristic rules and either a numerical classifier or neural network was found to be superior in classification accuracy with half the required processing of solely the numerical classifier or neural network. In Israel: A multi-sensing approach utilizing non-destructive sensors was developed. Shape, color, stem identification, surface defects and bruises were measured using a color image processing system. Flavor parameters (sugar, acidity, volatiles) and ripeness were measured using a near-infrared system and an electronic sniffer. Mechanical properties were measured using three sensors: drop impact, resonance frequency and cyclic deformation. Classification algorithms for quality sorting of fruit based on multi-sensory data were developed and implemented. The algorithms included a dynamic artificial neural network, a back propagation neural network and multiple linear regression. Results indicated that classification based on multiple sensors may be applied in real-time sorting and can improve overall classification. Advanced image processing algorithms were developed for shape determination, bruise and stem identification and general color and color homogeneity. An unsupervised method was developed to extract necessary vision features. The primary advantage of the algorithms developed is their ability to learn to determine the visual quality of almost any fruit or vegetable with no need for specific modification and no a-priori knowledge. Moreover, since there is no assumption as to the type of blemish to be characterized, the algorithm is capable of distinguishing between stems and bruises. This enables sorting of fruit without knowing the fruits' orientation. A new algorithm for on-line clustering of data was developed. The algorithm's adaptability is designed to overcome some of the difficulties encountered when incrementally clustering sparse data and preserves information even with memory constraints. Large quantities of data (many images) of high dimensionality (due to multiple sensors) and new information arriving incrementally (a function of the temporal dynamics of any natural process) can now be processed. Furhermore, since the learning is done on-line, it can be implemented in real-time. The methodology developed was tested to determine external quality of tomatoes based on visual information. An improved model for color sorting which is stable and does not require recalibration for each season was developed for color determination. Excellent classification results were obtained for both color and firmness classification. Results indicted that maturity classification can be obtained using a drop-impact and a vision sensor in order to predict the storability and marketing of harvested fruits. In conclusion: We have been able to define quantitatively the critical parameters in the quality sorting and grading of both fresh market cantaloupes and tomatoes. We have been able to accomplish this using nondestructive measurements and in a manner consistent with expert human grading and in accordance with market acceptance. This research constructed and used large databases of both commodities, for comparative evaluation and optimization of expert system, statistical and/or neural network models. The models developed in this research were successfully tested, and should be applicable to a wide range of other fruits and vegetables. These findings are valuable for the development of on-line grading and sorting of agricultural produce through the incorporation of multiple measurement inputs that rapidly define quality in an automated manner, and in a manner consistent with the human graders and inspectors.