#### Filter Results:

- Full text PDF available (22)

#### Publication Year

2000

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- D E Fishkind, V Lyzinski, H Pao, L Chen, C E Priebe
- 2015

Suppose that a graph is realized from a stochastic block model where one of the blocks is of interest, but many or all of the vertices' block labels are unobserved. The task is to order the vertices with unobserved block labels into a " nomination list " such that, with high probability, vertices from the interesting block are concentrated near the list's… (More)

- James Allen Fill, Donniell E. Fishkind
- SIAM J. Matrix Analysis Applications
- 2000

In this paper we exhibit, under suitable conditions, a neat relationship between the Moore–Penrose generalized inverse of a sum of two matrices and the Moore–Penrose generalized inverses of the individual terms. We include an application to the parallel sum of matrices.

- Donniell E. Fishkind, Carey E. Priebe, K. E. Giles, L. N. Smith, Vural Aksakalli
- IEEE Trans. Systems, Man, and Cybernetics, Part A
- 2007

—Suppose there is a need to swiftly navigate through a spatial arrangement of possibly forbidden regions, with each region marked with the probability that it is, indeed, forbidden. In close proximity to any of these regions, you have the dynamic capability of disambiguating the region and learning for certain whether or not the region is forbidden—only in… (More)

- Joshua T. Vogelstein, John M. Conroy, +6 authors Carey E. Priebe
- 2011

Graph matching (GM)—the process of finding an optimal permutation of the vertices of one graph to minimize adjacency disagreements with the vertices of another—is rapidly becoming an increasingly important computational problem, arising in fields ranging from machine vision to neuroscience. Because GM is N P-hard, exact algorithms are unsuitable for today's… (More)

We consider the problem of safely and swiftly navigating through a spatial arrangement of potential hazard detections in which each detection has associated with it a probability that the detection is indeed a true hazard. When in close proximity to a detection, we assume the ability—for a cost—to determine whether or not the hazard is real. Our approach to… (More)

- Donniell E. Fishkind, Daniel L. Sussman, Minh Tang, Joshua T. Vogelstein, Carey E. Priebe
- SIAM J. Matrix Analysis Applications
- 2013

- Vince Lyzinski, Daniel L. Sussman, +5 authors Carey E. Priebe
- Parallel Computing
- 2015

We present a parallelized bijective graph matching algorithm that leverages seeds and is designed to match very large graphs. Our algorithm combines spectral graph embedding with existing state-of-the-art seeded graph matching procedures. We justify our approach by proving that modestly correlated, large stochastic block model random graphs are correctly… (More)

- Vince Lyzinski, Donniell E. Fishkind, Carey E. Priebe
- Journal of Machine Learning Research
- 2014

Graph matching is an important problem in machine learning and pattern recognition. Herein, we present theoretical and practical results on the consistency of graph matching for estimating a latent alignment function between the vertex sets of two graphs, as well as subsequent algorithmic implications when the latent alignment is partially observed. In the… (More)

- Vince Lyzinski, Donniell E. Fishkind, Marcelo Fiori, Joshua T. Vogelstein, Carey E. Priebe, Guillermo Sapiro
- IEEE Transactions on Pattern Analysis and Machine…
- 2016

Graph matching-aligning a pair of graphs to minimize their edge disagreements-has received wide-spread attention from both theoretical and applied communities over the past several decades, including combinatorics, computer vision, and connectomics. Its attention can be partially attributed to its computational difficulty. Although many heuristics have… (More)

- Lowell Abrams, Donniell E. Fishkind, Carey E. Priebe
- IEEE Trans. Med. Imaging
- 2002

The human cerebral cortex is topologically equivalent to a sphere when it is viewed as closed at the brain stem. Due to noise and/or resolution issues, magnetic resonance imaging may see "handles" that need to be eliminated to reflect the true spherical topology. Shattuck and Leahy present an algorithm to correct such an image. The basis for their… (More)