Share Email Print
cover

Proceedings Paper

Lossless divide and conquer for time-order sorting of N facial poses
Author(s): Ming Kai Hsu; Harold Szu
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Law enforcement agencies need a quick decision in May 1 2010 NY Time Square for quickly spot wanted car bomb individuals in a crowd. This goal requires real-time smart firmware and a smart search algorithm to know how to order the faces in a geometric way. We demonstrate such a sorting problem of N facial poses time ordering is like the TSP of N cities, NP-complete, having no exact deterministic solution. Here we demonstrated a heuristic working solution to answer the ONR grand challenge called Empire 2010. How could the N boxes of faces detected and cut by the efficient COST parallel color-hue-algorithm, without time mark, at a single CPU (or even with the time marks but collected videos from multiple vintage points) to determine automatically who speaks what, where, and when? There must be a cross platform sensory association from our different sensors.

Paper Details

Date Published: 9 June 2011
PDF: 7 pages
Proc. SPIE 8058, Independent Component Analyses, Wavelets, Neural Networks, Biosystems, and Nanoengineering IX, 80580W (9 June 2011); doi: 10.1117/12.887551
Show Author Affiliations
Ming Kai Hsu, The George Washington Univ. (United States)
Harold Szu, U.S. Army Night Vision & Electronic Sensors Directorate (United States)


Published in SPIE Proceedings Vol. 8058:
Independent Component Analyses, Wavelets, Neural Networks, Biosystems, and Nanoengineering IX
Harold Szu, Editor(s)

© SPIE. Terms of Use
Back to Top