Academic Journal

Approximate Pattern Matching using Hierarchical Graph Construction and Sparse Distributed Representation

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: Approximate Pattern Matching using Hierarchical Graph Construction and Sparse Distributed Representation
Συγγραφείς: Mathuria, Aakanksha, Hammerstrom, Dan
Πηγή: Proceedings of the International Conference on Neuromorphic Systems. :1-10
Στοιχεία εκδότη: ACM, 2019.
Έτος έκδοσης: 2019
Θεματικοί όροι: Engineering, Isomorphisms (Mathematics) -- Data processing, Image processing -- Data processing, 0202 electrical engineering, electronic engineering, information engineering, Computer vision, 02 engineering and technology, Optical data processing
Περιγραφή: With recent developments in deep networks, there have been significant advances in visual object detection and recognition. However, some of these networks are still easily fooled/hacked and have shown "bag of features" failures. Some of this is due to the fact that even deep networks make only marginal use of the complex structure that exists in real-world images, even after training on huge numbers of images. Biology appears to take advantage of such a structure, but how? In our research, we are studying approaches for robust pattern matching using still, 2D Blocks World images based on graphical representations of the various components of an image. Such higher order information represents the "structure" of the visual object. Here we discuss how the structural information of an image can be captured in a Sparse Distributed Representation (SDR) loosely based on cortical circuits. We apply probabilistic graph isomorphism and subgraph isomorphism to our 2D Blocks World images and achieve O (1) and O (nk) complexity for an approximate match. The optimal match is an NP-Hard problem. The image labeled graph is created using OpenCV to find the object contours and objects' labels and a fixed radius nearest neighbor algorithm to build the edges between the objects. Pattern matching is done using the properties of SDRs. Our research shows the promise of applying graph-based neuromorphic techniques for pattern matching of images based on such structure.
Τύπος εγγράφου: Article
Περιγραφή αρχείου: application/pdf
DOI: 10.1145/3354265.3354286
Σύνδεσμος πρόσβασης: https://pdxscholar.library.pdx.edu/cgi/viewcontent.cgi?article=1616&context=ece_fac
https://pdxscholar.library.pdx.edu/cgi/viewcontent.cgi?article=6654&context=open_access_etds
https://pdxscholar.library.pdx.edu/ece_fac/610/
Rights: URL: https://www.acm.org/publications/policies/copyright_policy#Background
Αριθμός Καταχώρησης: edsair.doi.dedup.....9fcbfeeecff7c20cc3d1b726f5c1a47e
Βάση Δεδομένων: OpenAIRE