SODA: A new method of in-scene atmospheric water vapor estimation and post-flight spectral recalibration for hyperspectral sensors: Application to the HyMap sensor at two locations

A new method of estimating per-pixel atmospheric column water vapor (ACWV) and potential differences in the reported band center wavelengths of the HyMap sensor has been developed. The new method uses variations of a second order derivative algorithm (SODA) to assess the impact of atmospheric residual features on calculated surface reflectance spectra after atmospheric compensation. The SODA method provides an alternative to the current band ratio techniques of ACWV estimation and also allows the same form of algorithm to be used for the estimation of possible band shifts. A comparison of in-situ measured surface reflectance at two field sites in Western Australia demonstrates improvement in the resulting spectra when post-flight updates are made to the reported HyMap band center wavelengths and applied during the atmospheric compensation process. The same SODA methodology was varied to estimate the ACWV on a per-pixel basis and found to significantly reduce the appearance of the underlying surface structure on the resulting ACWV images as well as improve the overall accuracy of the estimation. The ACWV estimated from the HyMap imagery at the two field sites was found to agree with in-situ atmospheric ACWV measurements to within 2% and represented a two fold increase in accuracy over a 3 band ratio Continuum Interpolated Band Ratio (CIBR) technique of ACWV estimation.     

Mapping arctic landfast ice extent using L-band synthetic aperture radar interferometry

In recent years methods have been developed to extract the seaward landfast ice edge from series of remote sensing images, with most of them relying on incoherent change detection in optical, infrared, or radar amplitude imagery. While such approaches provide valuable results, some still lack the required level of robustness and all lack the ability to fully automate the detection and mapping of landfast ice over large areas and long time spans. This paper introduces an alternative approach to mapping landfast ice extent that is based on coherent processing of interferometric L-band Synthetic Aperture Radar (SAR) data. The approach is based on a combined interpretation of interferometric phase pattern and interferometric coherence images to extract the extent and stability of landfast ice. Due to the low complexity of the base imagery used for landfast ice extraction, significant improvements in automation and reduction of required manual interactions by operators can be achieved. A performance analysis shows that L-band interferometric SAR (InSAR) data enable the mapping of landfast ice with high robustness and accuracy for a wide range of environmental conditions.     

Quantifying blood flow and wall shear stresses in the outflow tract of chick embryonic hearts

Wall shear stresses (WSS) exerted by blood flow on cardiac tissues modulate growth and development of the heart. To study the role of hemodynamic conditions on cardiac morphogenesis, here, we present a methodology that combines imaging and finite element modeling to quantify the in vivo blood flow dynamics and WSS in the cardiac outflow tract (OFT) of early chicken embryos (day 3 out of 21-day incubation period). We found a distinct blood flow field and heterogeneous distribution of WSS in the chicken embryonic heart OFT, which have physiological implications for OFT morphogenesis.     

Approximate steady-state analysis of large Markov models based on the structure of their decision diagram encoding

We propose a new approximate numerical algorithm for the steady-state solution of general structured ergodic Markov models. The approximation uses a state-space encoding based on multiway decision diagrams and a transition rate encoding based on a new class of edge-valued decision diagrams. The new method retains the favorable properties of a previously proposed Kronecker-based approximation, while eliminating the need for a Kronecker-consistent model decomposition. Removing this restriction allows for a greater utilization of event locality, which facilitates the generation of both the state-space and the transition rate matrix, thus extends the applicability of this algorithm to larger and more complex models.     

Information methods for model selection in linear mixed effects models with application to HCV data

In this paper, we derive a small sample Akaike information criterion, based on the maximized loglikelihood, and a small sample information criterion based on the maximized restricted loglikelihood in the linear mixed effects model when the covariance matrix of the random effects is known. Small sample corrected information criteria are proposed for a special case of linear mixed effects models, the balanced random-coefficient model, without assuming the random coefficients covariance matrix to be known. A simulation study comparing the derived criteria and several others for model selection in the linear mixed effects models is presented. We illustrate the behavior of the studied information criteria on real data from a study of subjects coinfected with HIV and Hepatitis C virus. Robustness of the criteria, in terms of the error distributed as a mixture of normal distributions, is also studied. Special attention is given to the behavior of the conditional AIC by Vaida and Blanchard (2005). Among the studied criteria, GIC performs best, while cAIC exhibits poor performance. Because of its inferior performance, as demonstrated in this work, we do not recommend its use for model selection in linear mixed effects models.     

Efficiently Testing Sparse <Emphasis Type="Italic">GF</Emphasis>(2) Polynomials

We give the first algorithm that is both query-efficient and time-efficient for testing whether an unknown function f:{0,1} ⁿ →{−1,1} is an s-sparse GF(2) polynomial versus ε-far from every such polynomial. Our algorithm makes poly(s,1/ε) black-box queries to f and runs in time n⋅poly(s,1/ε). The only previous algorithm for this testing problem (Diakonikolas et al. in Proceedings of the 48th Annual Symposium on Foundations of Computer Science, FOCS, pp. 549–558, 2007) used poly(s,1/ε) queries, but had running time exponential in s and super-polynomial in 1/ε.     

Guarding a set of line segments in the plane

We consider the following problem: Given a finite set of straight line segments in the plane, find a set of points of minimum size, so that every segment contains at least one point in the set. This problem can be interpreted as looking for a minimum number of locations of policemen, guards, cameras or other sensors, that can observe a network of streets, corridors, tunnels, tubes, etc. We show that the problem is strongly NP-complete even for a set of segments with a cubic graph structure, but in P for tree structures.     

A theorem for UGAS and ULES of (passive) nonautonomous systems: robust control of mechanical systems and ships

The main contribution of this paper is a theorem to guarantee uniform global asymptotic stability (UGAS) and uniform local exponential stability (ULES) for a class of nonlinear non‐autonomous systems which includes passive systems. These properties (and a uniform local Lipschitz condition) guarantee robustness of stability while weaker properties, like uniform global stability plus global convergence, do not. Our main result is then used in the tracking control problem of mechanical systems and ships. We use an adaptive backstepping design and prove UGAS of the closed‐loop tracking error system, in particular, we obtain that both the tracking and parameter estimation errors converge uniformly globally to zero. Copyright © 2001 John Wiley & Sons, Ltd.     

The Geometry and Matching of Lines and Curves Over Multiple Views

This paper describes the geometry of imaged curves in two and three views. Multi-view relationships are developed for lines, conics and non-algebraic curves. The new relationships focus on determining the plane of the curve in a projective reconstruction, and in particular using the homography induced by this plane for transfer from one image to another. It is shown that given the fundamental matrix between two views, and images of the curve in each view, then the plane of a conic may be determined up to a two fold ambiguity, but local curvature of a curve uniquely determines the plane. It is then shown that given the trifocal tensor between three views, this plane defines a homography map which may be used to transfer a conic or the curvature from two views to a third. Simple expressions are developed for the plane and homography in each case.A set of algorithms are then described for automatically matching individual line segments and curves between images. The algorithms use both photometric information and the multiple view geometric relationships. For image pairs the homography facilitates the computation of a neighbourhood cross-correlation based matching score for putative line/curve correspondences. For image triplets cross-correlation matching scores are used in conjunction with line/curve transfer based on the trifocal geometry to disambiguate matches. Algorithms are developed for both short and wide baselines. The algorithms are robust to deficiencies in the segment extraction and partial occlusion.Experimental results are given for image pairs and triplets, for varying motions between views, and for different scene types. The methods are applicable to line/curve matching in stereo and trinocular rigs, and as a starting point for line/curve matching through monocular image sequences.     

Visualizing multiwavelength astrophysical data

With recent advances in the measurement technology for allsky astrophysical imaging, our view of the sky is no longer limited to the tiny visible spectral range over the 2D Celestial sphere. We now can access a third dimension corresponding to a broad electromagnetic spectrum with a wide range of allsky surveys; these surveys span frequency bands including long wavelength radio, microwaves, very short X-rays, and gamma rays. These advances motivate us to study and examine multiwavelength visualization techniques to maximize our capabilities to visualize and exploit these informative image data sets. In this work, we begin with the processing of the data themselves, uniformizing the representations and units of raw data obtained from varied detector sources. Then we apply tools to map, convert, color-code, and format the multiwavelength data in forms useful for applications. We explore different visual representations for displaying the data, including such methods as textured image stacks, the horseshoe representation, and GPU-based volume visualization. A family of visual tools and analysis methods is introduced to explore the data, including interactive data mapping on the graphics processing unit (GPU), the mini-map explorer, and GPU-based interactive feature analysis.