05.12.2012 Views

NASA Scientific and Technical Aerospace Reports

NASA Scientific and Technical Aerospace Reports

NASA Scientific and Technical Aerospace Reports

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

ground sampling distance, therefore, embedded in a single pixel. Under such a circumstance, these targets can be only detected<br />

spectrally at the subpixel level, not spatially as ordinarily conducted by classical image processing techniques. This paper<br />

investigates a more challenging issue than subpixel detection, which is the estimation of target size at the subpixel level. More<br />

specifically, when a subpixel target is detected, we would like to know ‘what is the size of this particular target within the<br />

pixel?’ The proposed approach is to estimate the abundance fraction of a subpixel target present in a pixel, then find what<br />

portion it contributes to the pixel that can be used to determine the size of the subpixel target by multiplying the ground<br />

sampling distance. In order to make our idea work, the subpixel target abundance fraction must be accurately estimated to truly<br />

reflect the portion of a subpixel target occupied within a pixel. So, a fully constrained linear unmixing method is required to<br />

reliably estimate the abundance fractions of a subpixel target for its size estimation. In this paper, a recently developed fully<br />

constrained least squares linear unmixing is used for this purpose. Experiments are conducted to demonstrate the utility of the<br />

proposed method in comparison with an unconstrained linear unmixing method, unconstrained least squares method, two<br />

partially constrained least square linear unmixing methods, sum-to-one constrained least squares, <strong>and</strong> nonnegativity<br />

constrained least squares.<br />

DTIC<br />

Detection; Estimates; Image Processing; Imagery; Least Squares Method; Remote Sensing; Targets<br />

20060001835 North Carolina State Univ., Raleigh, NC USA<br />

Sensitivity to Noise Variance in a Social Network Dynamics Model<br />

Banks, H. T.; Karr, A. F.; Nguyen, H. K.; Samuels, J. R., Jr; Nov. 14, 2005; 16 pp.; In English<br />

Contract(s)/Grant(s): AFOSR-FA9550-04-1-0220<br />

Report No.(s): AD-A440344; No Copyright; Avail.: Defense <strong>Technical</strong> Information Center (DTIC)<br />

The dynamics of social networks are modeled with a system of continuous Stochastic Ordinary Differential Equations<br />

(SODE). With the proper amount of noise input, the SODE model captures dynamic features that are lacking in the<br />

corresponding deterministic ODE model. Therefore, sensitivity to noise levels is investigated by considering four different<br />

regimes: essentially deterministic, noise-enriched, noise-enlarged, <strong>and</strong> noise-dominated. Each regime is defined based on the<br />

behavior of solutions of the SODE, <strong>and</strong> the geometry of the regimes is categorized with stochastic simulations.<br />

DTIC<br />

Differential Equations; Human Relations; Mathematical Models; Network Analysis; Sensitivity; Stochastic Processes<br />

20060001852 Massachusetts Univ., Amherst, MA USA<br />

Practical Markov Logic Containing First-Order Quantifiers With Application to Identity Uncertainty<br />

Culotta, Aron; McCallum, Andrew; Sep. 8, 2005; 12 pp.; In English<br />

Report No.(s): AD-A440385; No Copyright; Avail.: Defense <strong>Technical</strong> Information Center (DTIC)<br />

Markov logic is a highly expressive language recently introduced to specify the connectivity of a Markov network using<br />

first-order logic. While Markov logic is capable of constructing arbitrary first-order formulae over the data, the complexity of<br />

these formulae is often limited in practice because of the size <strong>and</strong> connectivity of the resulting network. In this paper, we<br />

present approximate inference <strong>and</strong> training methods that incrementally instantiate portions of the network as needed to enable<br />

first-order existential <strong>and</strong> universal quantifiers in Markov logic networks. When applied to the problem of object identification,<br />

this approach results in a conditional probabilistic model that can reason about objects, combining the expressively of recently<br />

introduced BLOG models with the predictive power of conditional training. We validate our algorithms on the tasks of citation<br />

matching <strong>and</strong> author disambiguation.<br />

DTIC<br />

Identities; Markov Processes<br />

20060001857 Connecticut Univ., Storrs, CT USA<br />

Robust Action Strategies to Induce Desired Effects<br />

Tu, Haiying; Levchuk, Yuri N.; Pattipati, Krishna R.; Jan. 1, 2002; 23 pp.; In English; Original contains color illustrations<br />

Contract(s)/Grant(s): N00014-00-1-0101<br />

Report No.(s): AD-A440391; No Copyright; Avail.: Defense <strong>Technical</strong> Information Center (DTIC)<br />

This paper provides a new methodology for obtaining a near-optimal strategy (i.e., specification of courses of action over<br />

time) for achieving the desired effects in a mission environment that also is robust to environmental perturbations (i.e.,<br />

unexpected events <strong>and</strong>/or parameter uncertainties). A dynamic Bayesian network (DBN)-based stochastic mission model is<br />

employed to represent the dynamic <strong>and</strong> uncertain nature of the environment. Genetic algorithms are applied to search for a<br />

175

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!