Chris Kreucher

Chris Kreucher

Auto-generated profile, based on publicly available information

Chris Kreucher

Integrity Applications, Inc. (United States)

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 December 2005 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
CKC. Kreucher
C. Kreucher
KKK. Kastella
K. Kastella
AHA.O. Hero
A.O. Hero
This work addresses the problem of tracking multiple moving targets by recursively estimating the joint multitarget probability density (JMPD). Estimation of the JMPD is done in a Bayesian framework and provides a method for tracking multiple targets which allows nonlinear target motion and measurement to state coupling as well as nonGaussian target state densities. The JMPD technique simultaneously estimates both the target states and the number of targets in the surveillance region based on the set of measurements made. We give an implementation of the JMPD method based on particle filtering techniques and provide an adaptive sampling scheme which explicitly models the multitarget nature of the problem. We show that this implementation of the JMPD technique provides a natural way to track a collection of targets, is computationally tractable, and performs well under difficult conditions such as target crossing, convoy movement, and low measurement signal-to-noise ratio (SNR).

1 March 2005 in Signal Processing
Verified
Journal Article
Closed access
CKChris Kreucher
Chris Kreucher
KKKeith Kastella
Keith Kastella
AIAlfred O. Hero Iii
Alfred O. Hero Iii

1 April 1999 in IEEE Transactions on Robotics and Automation
Verified
Journal Article
Closed access
CKC. Kreucher
C. Kreucher
SLS. Lakshmanan
S. Lakshmanan
This paper introduces a new algorithm, called lane-finding in another domain (LANA), for detecting lane markers in images acquired from a forward-looking vehicle-mounted camera. The method is based on a novel set of frequency domain features that capture relevant information concerning the strength and orientation of spatial edges. The frequency domain features are combined with a deformable template prior, in order to detect the lane markers of interest. Experimental results that illustrate the performance of this algorithm on images with varying lighting and environmental conditions, shadowing, lane occlusion(s), solid and dashed lines, etc. are presented. LANA detects lane markers well under a very large and varied collection of roadway images. A comparison is drawn between this frequency feature-based LANA algorithm and the spatial feature-based LOIS lane detection algorithm. This comparison is made from experimental, computational and methodological standpoints.

28 May 2009 in Discrete Event Dynamic Systems
Verified
Journal Article
Closed access
PDF file
ECEdwin K. P. Chong
Edwin K. P. Chong
CKChristopher M. Kreucher
Christopher M. Kreucher
AHAlfred O. Hero
Alfred O. Hero

4 October 2006
Verified
Conference Paper
Closed access
CKC. Kreucher
C. Kreucher
AHA.O. Hero
A.O. Hero
KKK. Kastella
K. Kastella
Several authors have proposed sensor scheduling methods that are driven by information theoretic measures. In the information driven approach, the relative merit of different sensing actions is measured by the corresponding expected gain in information. Information driven approaches stand in stark contrast to task driven methods, i.e., methods that select some physical performance criteria and explicitly manage the sensor based on that criteria. This paper investigates the difference between a particular information driven approach, one that maximizes an alpha-Rényi measure of information gain, and task driven methods with a combination of theory and simulation. First, we give a mathematical relation that shows that when the decision error depends only weakly on the target state a certain type of marginalized information gain is a close approximation to the Bayes risk associated with performing a specific task. Second, we perform an empirical comparison between information driven and task driven approaches that maximize information gain or minimize risk, respectively. In particular, we give a task driven method that uses the sensor in a manner that is expected to maximize the probability the target is correctly located after the next measurement. We find as expected that the task driven method outperforms the information driven method when the performance is measured by risk, i.e., probability of localization error. However, the performance difference between the two methods is very small, suggesting that the information gain is a good surrogate for risk for this application.

1 December 2016
Verified
Conference Paper
Closed access
MWMichael Wilmanski
Michael Wilmanski
CKChris Kreucher
Chris Kreucher
AHAlfred Hero
Alfred Hero
To date, automatic target recognition (ATR) techniques in synthetic aperture radar (SAR) imagery have largely focused on features that use only the magnitude part of SAR's complex valued magnitude-plus-phase history. While such techniques are often very successful, they inherently ignore the significant amount of discriminatory information available in the phase. This paper describes a method for exploiting the complex information for ATR by using a convolutional neural network (CNN) that accepts fully complex input features. We show a performance leap from 87.30% to 99.21% accuracy on real collected wide-angle SAR data with the use of complex features.