Filter Results:
- Full text PDF available (13)
Publication Year
2003
2018
- This year (3)
- Last 5 years (17)
- Last 10 years (29)
Publication Type
Co-author
Journals and Conferences
Data Set Used
Learn More
- Hairong Liu, Shuicheng Yan
- 2010 IEEE Computer Society Conference on Computer…
- 2010
We investigate how to discover all common visual patterns within two sets of feature points. Common visual patterns generally share similar local features as well as similar spatial layout. In this… (More)
- Hairong Liu, Shuicheng Yan
- ICML
- 2010
In this paper, we study how to robustly compute the modes of a graph, namely the dense subgraphs, which characterize the underlying compact patterns and are thus useful for many applications. We… (More)
- Hairong Liu, Longin Jan Latecki, Shuicheng Yan
- IEEE Transactions on Pattern Analysis and Machine…
- 2013
In this paper, we propose an efficient algorithm to detect dense subgraphs of a weighted graph. The proposed algorithm, called the shrinking and expansion algorithm (SEA), iterates between two… (More)
- Hairong Liu, Wenyu Liu, Longin Jan Latecki
- 2010 IEEE Computer Society Conference on Computer…
- 2010
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming problem, and obtain… (More)
- Luoqi Liu, Xiang Lin, Hairong Liu, Shuicheng Yan
- IEEE Transactions on Circuits and Systems for…
- 2014
We investigate large-scale face identification in unconstrained videos with 1000 subjects. This problem is very challenging, and until now most studies have only considered the scenarios with a small… (More)
- Hairong Liu, Longin Jan Latecki, Shuicheng Yan
- NIPS
- 2010
In this paper, we regard clustering as ensembles of k-ary affinity relations and clusters correspond to subsets of objects with maximal average affinity relations. The average affinity relation of a… (More)
- Si Liu, Hairong Liu, Longin Jan Latecki, Shuicheng Yan, Changsheng Xu, Hanqing Lu
- AAAI
- 2011
In this paper, we propose a novel method to select the most informative subset of features, which has little redundancy and very strong discriminating power. Our proposed approach automatically… (More)
- Hairong Liu, Shuicheng Yan
- 2012 IEEE Conference on Computer Vision and…
- 2012
In this paper, we propose an efficient method to detect the underlying structures in data. The same as RANSAC, we randomly sample MSSs (minimal size samples) and generate hypotheses. Instead of… (More)
- Eric Battenberg, Jitong Chen, +8 authors Zhenyao Zhu
- 2017 IEEE Automatic Speech Recognition and…
- 2017
In this work, we perform an empirical comparison among the CTC, RNN-Transducer, and attention-based Seq2Seq models for end-to-end speech recognition. We show that, without any language model, Seq2Seq… (More)
- Hairong Liu, Longin Jan Latecki, Wenyu Liu
- International Journal of Computer Vision
- 2008
In this paper, we propose a new definition of curvature, called visual curvature. It is based on statistics of the extreme points of the height functions computed over all directions. By gradually… (More)