This is an era of pervasive big data, streaming in from all sorts of sensors such as medical scanners, surveillance cameras, smart appliances and cellphones. Even equipped with the most powerful hardware and software for data processing, one may still get lost in this massive collection of noisy data and miss 'seeing the forest for the trees'. This project addresses a fundamental issue in the data sciences: what are we looking for in a seemingly structure-less complex data set? Based on proven mathematical theories about symmetry and inspired by human vision, the investigator will construct a roadmap for discovering all possible potential patterns in these datasets and provide computationally effective tools to discover such patterns even in their distorted and disguised forms. Such a relentless pattern-seeking algorithm will illustrate the power of a 'treasure hunt' type search, promote automatic pattern discovery, and fill a gap in current practice of data analysis, thus advancing data science. The outcome from this project will be applicable to data sets from diverse fields, from biomedical domains such as drug discovery, gene mapping and human movement monitoring, to computer vision applications like driverless car navigation, urban scene understanding, and anomalous activity detection for surveillance.
This research formulates a symmetry group theory-based regularity space and constructs a computational platform for pattern-seeking algorithms that are principle-driven and human perception-inspired. The transitions among zero states of the proposed regularity-space, guided by group theory and learned from human perception, will be governed by a seamless marriage with Bayesian probability theory. The two key ingredients of a pattern, minimum cells and inter-cell topology, will be explored extensively on large scale, multimodality, high dimensional real-world sensory data. The aims are to construct and validate computational tools facilitating effective unsupervised recurring pattern discovery, followed by recovering geometric transformations, and finally by quantitatively linking the full regularity-perception spectrum from regular, near-regular to irregular. The finiteness, uniqueness and completeness of this group theory-based regularity space will provide a sound computational framework to guide pattern seeking in general data science.
This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.
|Effective start/end date||9/1/19 → 8/31/22|
- National Science Foundation: $508,000.00