Novel data-driven methods for target detection and classification and their application to Raman spectroscopy.

More About This Textbook

Overview

Target detection and classification is a fundamental problem in many applications. The main aim in this problem is to determine the existence of certain targets that might be corrupted with both interferences and noises. The target may be a specific known signal, or signals from a given candidate set. The traditional detection approaches are based on the perfect knowledge of interferences. In practice, however, it is most often difficult to obtain reliable prior information on the interferences embedded in the observed data. Hence, detectors that do not rely on the information about the interference are more desirable in general.;In this dissertation, we focus on data-driven methods for target detection and classification that use only the observed data and develop a class of detectors for the detection of both a specific target and targets from a set. We also present a subspace partitioning scheme to enhance the performance of all subspace-based detectors by improving the conditioning of the target subspace. The proposed methods are implemented for Raman spectroscopy in the joint contaminated surface detection (JCSD) system, as well as the appropriate pre-processing and spectral matching techniques for the JCSD system. They have been shown to work effectively in simulations, experiments, and on the field data.;For the first problem, detection of a specified target, we develop two data-driven detection methods. The first one uses a constrained independent component analysis (c-ICA) approach. We derive constrained version of the Infomax algorithm and show that a decision can be made on the existence of a certain target by defining a suitable measure of closeness. Then, we develop a second method that uses the upper bound of the correlation between the target and mixing components as the detection index (DCB), and derive the expression for this correlation bound using the observed data.;A more common and challenging problem is that of determining the presence of targets in a given mixture without the explicit information on the targets themselves, other than a candidate set. We present a novel detection approach, detection with canonical correlation (DCC) for this problem where we also assume that there is no prior information on the interference. We use the maximum canonical correlations between the target set and the observation data set as the detection statistic, and the coefficients of the canonical vector to determine the indices of components from a given target library, thus enabling both detection and classification of the target components that might be present in the mixture. We derive an approximate distribution of the maximum canonical correlation when targets are present. For applications where the contributions of components are non-negative, non-negativity constraints are incorporated into the canonical correlation analysis framework and a recursive algorithm is derived.;The performance of detectors can severely degrade when the target and interference subspace are either singular or have strong linear dependence among its elements. Considering the fact that an ill-conditioned subspace implies the existence of high correlations between linear combinations of the data set components, we propose a subspace partitioning scheme to improve the conditioning of the target subspace by reducing the inner correlations among the linear combinations of the target components. As a result, detection can be performed in a number of better-conditioned subspaces instead of the original ill-conditioned subspace, hence significantly enhancing the detection performance.;Finally, the proposed data-driven detection approaches and partitioning scheme are implemented for joint contaminated surface detection system. We also develop effective pre-processing and peak matching techniques for Raman data. Simulation and experimental results demonstrate the effectiveness of the detectors developed in this dissertation.
Read More Show Less

Product Details

  • ISBN-13: 9781109186833
  • Publisher: ProQuest LLC
  • Sold by: Barnes & Noble
  • Format: eTextbook
  • Pages: 136
  • File size: 6 MB

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)