default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHuu Le
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j6]Giang Truong
, Huu Le, Erchuan Zhang, David Suter, Syed Zulqarnain Gilani:
Unsupervised Learning for Maximum Consensus Robust Fitting: A Reinforcement Learning Approach. IEEE Trans. Pattern Anal. Mach. Intell. 45(3): 3890-3903 (2023)- [c19]Christopher Zach, Huu Le:
Exploiting Redundancy for Large Scale Bundle Adjustment: In Partial Defense of Minimization by Alternation. SCIA (2) 2023: 500-516 - 2022
- [c18]Huu Le, Rasmus Kjær Høier, Che-Tsung Lin, Christopher Zach:
AdaSTE: An Adaptive Straight-Through Estimator to Train Binary Neural Networks. CVPR 2022: 460-469 - [i17]Giang Truong, Huu Le, Álvaro Parra, Syed Zulqarnain Gilani, Syed M. S. Islam, David Suter:
Fast Semantic-Assisted Outlier Removal for Large-scale Point Cloud Registration. CoRR abs/2202.10579 (2022) - [i16]Kha Gia Quach, Huu Le, Pha A. Nguyen, Chi Nhan Duong, Tien Dai Bui, Khoa Luu:
Depth Perspective-aware Multiple Object Tracking. CoRR abs/2207.04551 (2022) - 2021
- [j5]Huu Le, Tat-Jun Chin, Anders P. Eriksson, Thanh-Toan Do, David Suter:
Deterministic Approximate Methods for Maximum Consensus Robust Fitting. IEEE Trans. Pattern Anal. Mach. Intell. 43(3): 842-857 (2021) - [c17]Huu Le, Christopher Zach:
Robust Fitting with Truncated Least Squares: A Bilevel Optimization Approach. 3DV 2021: 1392-1400 - [c16]Giang Truong, Huu Le, David Suter, Erchuan Zhang, Syed Zulqarnain Gilani:
Unsupervised Learning for Robust Fitting: A Reinforcement Learning Approach. CVPR 2021: 10348-10357 - [c15]Kha Gia Quach, Pha A. Nguyen, Huu Le, Thanh-Dat Truong, Chi Nhan Duong, Minh-Triet Tran, Khoa Luu:
DyGLIP: A Dynamic Graph Model With Link Prediction for Accurate Multi-Camera Multiple Object Tracking. CVPR 2021: 13784-13793 - [i15]Huu Le, Christopher Zach:
Escaping Poor Local Minima in Large Scale Robust Estimation. CoRR abs/2102.10928 (2021) - [i14]Giang Truong, Huu Le, David Suter, Erchuan Zhang, Syed Zulqarnain Gilani:
Unsupervised Learning for Robust Fitting: A Reinforcement Learning Approach. CoRR abs/2103.03501 (2021) - [i13]Kha Gia Quach, Pha A. Nguyen, Huu Le, Thanh-Dat Truong, Chi Nhan Duong, Minh-Triet Tran, Khoa Luu:
DyGLIP: A Dynamic Graph Model with Link Prediction for Accurate Multi-Camera Multiple Object Tracking. CoRR abs/2106.06856 (2021) - [i12]Huu Le, Rasmus Kjær Høier, Che-Tsung Lin, Christopher Zach:
AdaSTE: An Adaptive Straight-Through Estimator to Train Binary Neural Networks. CoRR abs/2112.02880 (2021) - 2020
- [j4]Tuan Hoang, Thanh-Toan Do, Huu Le, Dang-Khoa Le Tan, Ngai-Man Cheung:
Simultaneous compression and quantization: A joint approach for efficient unsupervised hashing. Comput. Vis. Image Underst. 191: 102852 (2020) - [c14]Huu Le, Christopher Zach, Edward Rosten, Oliver J. Woodford:
Progressive Batching for Efficient Non-linear Least Squares. ACCV (3) 2020: 506-522 - [c13]Huu Le, Christopher Zach:
A Graduated Filter Method for Large Scale Robust Estimation. CVPR 2020: 5558-5567 - [c12]Christopher Zach, Huu Le:
Truncated Inference for Latent Variable Optimization Problems: Application to Robust Estimation and Learning. ECCV (26) 2020: 464-480 - [i11]Christopher Zach, Huu Le:
Truncated Inference for Latent Variable Optimization Problems: Application to Robust Estimation and Learning. CoRR abs/2003.05886 (2020) - [i10]Huu Le, Christopher Zach:
A Graduated Filter Method for Large Scale Robust Estimation. CoRR abs/2003.09080 (2020) - [i9]Huu Le, Christopher Zach, Edward Rosten, Oliver J. Woodford:
Progressive Batching for Efficient Non-linear Least Squares. CoRR abs/2010.10968 (2020)
2010 – 2019
- 2019
- [j3]Huu Le, Tuan Hoang, Michael J. Milford:
BTEL: A Binary Tree Encoding Approach for Visual Localization. IEEE Robotics Autom. Lett. 4(4): 4354-4361 (2019) - [j2]Thanh-Toan Do, Khoa Le, Tuan Hoang, Huu Le, Tam V. Nguyen, Ngai-Man Cheung:
Simultaneous Feature Aggregating and Hashing for Compact Binary Code Learning. IEEE Trans. Image Process. 28(10): 4954-4969 (2019) - [j1]Thanh-Toan Do, Tuan Hoang, Dang-Khoa Le Tan, Huu Le, Tam V. Nguyen, Ngai-Man Cheung:
From Selective Deep Convolutional Features to Compact Binary Representations for Image Retrieval. ACM Trans. Multim. Comput. Commun. Appl. 15(2): 43:1-43:22 (2019) - [c11]Huu M. Le, Thanh-Toan Do, Tuan Hoang, Ngai-Man Cheung:
SDRSAC: Semidefinite-Based Randomized Approach for Robust Point Cloud Registration Without Correspondences. CVPR 2019: 124-133 - [c10]Huu Le, Ming Xu, Tuan Hoang, Michael Milford:
Hierarchical Encoding of Sequential Data With Compact and Sub-Linear Storage Cost. ICCV 2019: 9823-9832 - [c9]Thanh-Toan Do, Tuan Hoang, Dang-Khoa Le Tan, Trung Pham, Huu Le, Ngai-Man Cheung, Ian D. Reid:
Binary Constrained Deep Hashing Network for Image Retrieval Without Manual Annotation. WACV 2019: 695-704 - [i8]Huu Le, Tuan Hoang, Qianggong Zhang, Thanh-Toan Do, Anders P. Eriksson, Michael Milford:
SASSE: Scalable and Adaptable 6-DOF Pose Estimation. CoRR abs/1902.01549 (2019) - [i7]Huu Le, Thanh-Toan Do, Tuan Hoang, Ngai-Man Cheung:
SDRSAC: Semidefinite-Based Randomized Approach for Robust Point Cloud Registration without Correspondences. CoRR abs/1904.03483 (2019) - [i6]Thanh-Toan Do, Khoa Le, Tuan Hoang, Huu Le, Tam V. Nguyen, Ngai-Man Cheung:
Simultaneous Feature Aggregating and Hashing for Compact Binary Code Learning. CoRR abs/1904.11820 (2019) - [i5]Huu Le, Tuan Hoang, Michael Milford:
BTEL: A Binary Tree Encoding Approach for Visual Localization. CoRR abs/1906.11992 (2019) - 2018
- [c8]Huu M. Le, Anders P. Eriksson, Thanh-Toan Do, Michael Milford:
A Binary Optimization Approach for Constrained K-Means Clustering. ACCV (4) 2018: 383-398 - [c7]Huu Le, Anders P. Eriksson, Thanh-Toan Do, Tat-Jun Chin, David Suter:
Non-smooth M-estimator for Maximum Consensus Estimation. BMVC 2018: 4 - [c6]Dang-Khoa Le Tan, Huu Le, Tuan Hoang, Thanh-Toan Do, Ngai-Man Cheung:
DeepVQ: A Deep Network Architecture for Vector Quantization. CVPR Workshops 2018: 2579-2582 - [c5]Qianggong Zhang, Tat-Jun Chin, Huu M. Le:
A Fast Resection-Intersection Method for the Known Rotation Problem. CVPR 2018: 3012-3021 - [c4]Zhipeng Cai, Tat-Jun Chin, Huu Le, David Suter:
Deterministic Consensus Maximization with Biconvex Programming. ECCV (12) 2018: 699-714 - [i4]Zhipeng Cai, Tat-Jun Chin, Huu Le, David Suter:
Deterministic consensus maximization with biconvex programming. CoRR abs/1807.09436 (2018) - [i3]Huu Le, Michael Milford:
Large scale visual place recognition with sub-linear storage growth. CoRR abs/1810.09660 (2018) - [i2]Huu Le, Anders P. Eriksson, Thanh-Toan Do, Michael Milford:
A Binary Optimization Approach for Constrained K-Means Clustering. CoRR abs/1810.10134 (2018) - 2017
- [c3]Huu Le, Tat-Jun Chin, David Suter:
An Exact Penalty Method for Locally Convergent Maximum Consensus. CVPR 2017: 379-387 - [c2]Huu Le, Tat-Jun Chin, David Suter:
RATSAC - Random Tree Sampling for Maximum Consensus Estimation. DICTA 2017: 1-8 - [i1]Huu Le, Tat-Jun Chin, Anders P. Eriksson, David Suter:
Deterministic Approximate Methods for Maximum Consensus Robust Fitting. CoRR abs/1710.10003 (2017) - 2016
- [c1]Huu Le, Tat-Jun Chin, David Suter:
Conformal Surface Alignment with Optimal Möbius Search. CVPR 2016: 2507-2516
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 2024-10-07 21:12 CEST 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:
