scispace - formally typeset
Search or ask a question
Journal ArticleDOI

Pattern Recognition and Machine Learning

01 Aug 2007-Technometrics (Taylor & Francis)-Vol. 49, Iss: 3, pp 366-366
TL;DR: This book covers a broad range of topics for regular factorial designs and presents all of the material in very mathematical fashion and will surely become an invaluable resource for researchers and graduate students doing research in the design of factorial experiments.
Abstract: (2007). Pattern Recognition and Machine Learning. Technometrics: Vol. 49, No. 3, pp. 366-366.
Citations
More filters
Journal ArticleDOI
TL;DR: The main computational, morphometric and image processing methods that have been used in recent years to analyze images of plants are reviewed, introducing readers to relevant botanical concepts along the way.
Abstract: Plants are of fundamental importance to life on Earth. The shapes of leaves, petals and whole plants are of great significance to plant science, as they can help to distinguish between different species, to measure plant health, and even to model climate change. The growing interest in biodiversity and the increasing availability of digital images combine to make this topic timely. The global shortage of expert taxonomists further increases the demand for software tools that can recognize and characterize plants from images. A robust automated species identification system would allow people with only limited botanical training and expertise to carry out valuable field work. We review the main computational, morphometric and image processing methods that have been used in recent years to analyze images of plants, introducing readers to relevant botanical concepts along the way. We discuss the measurement of leaf outlines, flower shape, vein structures and leaf textures, and describe a wide range of analytical methods in use. We also discuss a number of systems that apply this research, including prototypes of hand-held digital field guides and various robotic systems used in agriculture. We conclude with a discussion of ongoing work and outstanding problems in the area.

340 citations


Cites background from "Pattern Recognition and Machine Lea..."

  • ...In computer science by contrast, ‘‘classification’’ refers to the assigning of an individual example to one of a finite number of discrete categories, whereas ‘‘clustering’’ refers to the discovery of groups within a set of individuals, based on similarities (Bishop, 2007, p.3)....

    [...]

Journal ArticleDOI
TL;DR: This article motivates and provides a review for methods that account for spectral variability during hyperspectral unmixing and endmember estimation and a discussion on topics for future work in this area.
Abstract: Variable illumination and environmental, atmospheric, and temporal conditions cause the measured spectral signature for a material to vary within hyperspectral imagery. By ignoring these variations, errors are introduced and propagated throughout hyperspectral image analysis. To develop accurate spectral unmixing and endmember estimation methods, a number of approaches that account for spectral variability have been developed. This article motivates and provides a review for methods that account for spectral variability during hyperspectral unmixing and endmember estimation and a discussion on topics for future work in this area.

340 citations

Journal ArticleDOI
TL;DR: This hands-on tutorial introduces the reader to QM/ML models based on kernel learning, an elegant, systematically nonlinear form of ML.
Abstract: Models that combine quantum mechanics (QM) with machine learning (ML) promise to deliver the accuracy of QM at the speed of ML. This hands-on tutorial introduces the reader to QM/ML models based on kernel learning, an elegant, systematically nonlinear form of ML. Pseudocode and a reference implementation are provided, enabling the reader to reproduce results from recent publications where atomization energies of small organic molecules are predicted using kernel ridge regression. © 2015 Wiley Periodicals, Inc.

340 citations

Journal ArticleDOI
TL;DR: A DL model based on a convolutional neural network is proposed to classify different brain tumor types using two publicly available datasets and the results indicate the ability of the model for brain tumor multi-classification purposes.
Abstract: Brain tumor classification is a crucial task to evaluate the tumors and make a treatment decision according to their classes. There are many imaging techniques used to detect brain tumors. However, MRI is commonly used due to its superior image quality and the fact of relying on no ionizing radiation. Deep learning (DL) is a subfield of machine learning and recently showed a remarkable performance, especially in classification and segmentation problems. In this paper, a DL model based on a convolutional neural network is proposed to classify different brain tumor types using two publicly available datasets. The former one classifies tumors into (meningioma, glioma, and pituitary tumor). The other one differentiates between the three glioma grades (Grade II, Grade III, and Grade IV). The datasets include 233 and 73 patients with a total of 3064 and 516 images on T1-weighted contrast-enhanced images for the first and second datasets, respectively. The proposed network structure achieves a significant performance with the best overall accuracy of 96.13% and 98.7%, respectively, for the two studies. The results indicate the ability of the model for brain tumor multi-classification purposes.

338 citations


Additional excerpts

  • ...The probability of any class (j) can be calculated over (k) different classes as a function y (z) and their total summations are equal to 1 [37] as shown in FIGURE 10....

    [...]

Journal ArticleDOI
TL;DR: It is argued that Monte Carlo methods provide a source of rational process models that connect optimal solutions to psychological processes and is proposed that a particle filter with a single particle provides a good description of human inferences.
Abstract: Rational models of cognition typically consider the abstract computational problems posed by the environment, assuming that people are capable of optimally solving those problems. This differs from more traditional formal models of cognition, which focus on the psychological processes responsible for behavior. A basic challenge for rational models is thus explaining how optimal solutions can be approximated by psychological processes. We outline a general strategy for answering this question, namely to explore the psychological plausibility of approximation algorithms developed in computer science and statistics. In particular, we argue that Monte Carlo methods provide a source of rational process models that connect optimal solutions to psychological processes. We support this argument through a detailed example, applying this approach to Anderson's (1990, 1991) rational model of categorization (RMC), which involves a particularly challenging computational problem. Drawing on a connection between the RMC and ideas from nonparametric Bayesian statistics, we propose 2 alternative algorithms for approximate inference in this model. The algorithms we consider include Gibbs sampling, a procedure appropriate when all stimuli are presented simultaneously, and particle filters, which sequentially approximate the posterior distribution with a small number of samples that are updated as new data become available. Applying these algorithms to several existing datasets shows that a particle filter with a single particle provides a good description of human inferences.

338 citations


Cites background from "Pattern Recognition and Machine Lea..."

  • ...…of probabilistic inference is not just a problem in cognitive science—it is an issue that arises in computer science and statistics, resulting in a number of general purpose algorithms (for an introduction and examples, see Bishop, 2006; Hastie, Tibshirani, & Friedman, 2001; Mackay, 2003)....

    [...]