default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBreton L. Minnehan
Person information
- affiliation (PhD 2019): Rochester Institute of Technology, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j4]Navya Nagananda
, Abu Md Niamul Taufique, Raaga Madappa, Chowdhury Sadman Jahan, Breton L. Minnehan, Todd V. Rovito, Andreas E. Savakis:
Benchmarking Domain Adaptation Methods on Aerial Datasets. Sensors 21(23): 8070 (2021)- 2020
- [j3]Abu Md Niamul Taufique, Breton L. Minnehan, Andreas E. Savakis:
Benchmarking Deep Trackers on Aerial Videos. Sensors 20(2): 547 (2020) - 2019
- [j2]Breton L. Minnehan, Andreas E. Savakis:
Deep domain adaptation with manifold aligned label transfer. Mach. Vis. Appl. 30(3): 473-485 (2019) - [j1]Breton L. Minnehan, Andreas E. Savakis:
Grassmann Manifold Optimization for Fast L1-Norm Principal Component Analysis. IEEE Signal Process. Lett. 26(2): 242-246 (2019)
Conference and Workshop Papers
- 2022
- [c7]Navya Nagananda, Breton L. Minnehan, Andreas E. Savakis:
Robust $L_p$-Norm Linear Discriminant Analysis with Proxy Matrix Optimization. TAG-ML 2022: 277-286 - 2021
- [c6]David Schwab, Sean M. O'Rourke, Breton L. Minnehan:
Combining LSTM and MDN Networks for traffic forecasting using the Argoverse Dataset. FUSION 2021: 1-6 - 2019
- [c5]Breton L. Minnehan, Andreas E. Savakis:
Cascaded Projection: End-To-End Network Compression and Acceleration. CVPR 2019: 10715-10724 - 2018
- [c4]Breton L. Minnehan, Andreas E. Savakis:
Learning Robust Feature Representations in Deep Networks for Image Classification. MIXDES 2018: 29-33 - 2017
- [c3]Breton L. Minnehan, Andreas E. Savakis:
Manifold Guided Label Transfer for Deep Domain Adaptation. CVPR Workshops 2017: 744-752 - 2015
- [c2]Andreas E. Savakis, Mohammad Faiz Quraishi, Breton L. Minnehan:
Object tracking on mobile devices using binary descriptors. IMAWM 2015: 94080B - 2014
- [c1]Breton L. Minnehan, Henry Spang, Andreas E. Savakis:
Robust and Efficient Tracker Using Dictionary of Binary Descriptors and Locality Constraints. ISVC (1) 2014: 589-598
Informal and Other Publications
- 2021
- [i4]Abu Md Niamul Taufique, Breton L. Minnehan, Andreas E. Savakis:
Benchmarking Deep Trackers on Aerial Videos. CoRR abs/2103.12924 (2021) - [i3]Navya Nagananda, Breton L. Minnehan, Andreas E. Savakis:
Grassmann Iterative Linear Discriminant Analysis with Proxy Matrix Optimization. CoRR abs/2104.08112 (2021) - 2019
- [i2]Breton L. Minnehan, Andreas E. Savakis:
Cascaded Projection: End-to-End Network Compression and Acceleration. CoRR abs/1903.04988 (2019) - 2018
- [i1]Breton L. Minnehan, Andreas E. Savakis:
DEFRAG: Deep Euclidean Feature Representations through Adaptation on the Grassmann Manifold. CoRR abs/1806.07688 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
