Xiaojie Guo

Dr. Xiaojie Guo


Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 December 2016 in IEEE Transactions on Image Processing
Verified
Journal Article
Open access
XGXiaojie Guo
Xiaojie Guo
YLYu Li
Yu Li
HLHaibin Ling
Haibin Ling
When one captures images in low-light conditions, the images often suffer from low visibility. Besides degrading the visual aesthetics of images, this poor quality may also significantly degenerate the performance of many computer vision and multimedia algorithms that are primarily designed for high-quality inputs. In this paper, we propose a simple yet effective low-light image enhancement (LIME) method. More concretely, the illumination of each pixel is first estimated individually by finding the maximum value in R, G, and B channels. Furthermore, we refine the initial illumination map by imposing a structure prior on it, as the final illumination map. Having the well-constructed illumination map, the enhancement can be achieved accordingly. Experiments on a number of challenging low-light images are present to reveal the efficacy of our LIME and show its superiority over several state-of-the-arts in terms of enhancement quality and efficiency.

6 January 2021 in International Journal of Computer Vision
Verified
Journal Article
Closed access
PDF file
YZYonghua Zhang
Yonghua Zhang
XGXiaojie Guo
Xiaojie Guo
Jiayi MaJiayi Ma
Jiayi Ma
WLWei Liu
Wei Liu
JZJiawan Zhang
Jiawan Zhang

2 October 2022 in International Journal of Computer Vision
Verified
Journal Article
Closed access
PDF file
XGXiaojie Guo
Xiaojie Guo
QHQiming Hu
Qiming Hu

18 April 2018 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
Jiayi MaJiayi Ma
Jiayi Ma
Junjun JiangJunjun Jiang
Junjun Jiang
HZhuabing zhou
huabing zhou
JZJi Zhao
Ji Zhao
XGXiaojie Guo
Xiaojie Guo
Feature matching, which refers to establishing reliable correspondences between two sets of feature points, is a critical prerequisite in feature-based image registration. This paper proposes a simple yet surprisingly effective approach, termed as guided locality preserving matching, for robust feature matching of remote sensing images. The key idea of our approach is merely to preserve the neighborhood structures of potential true matches between two images. We formulate it into a mathematical model, and derive a simple closed-form solution with linearithmic time and linear space complexities. This enables our method to accomplish the mismatch removal from thousands of putative correspondences in only a few milliseconds. To handle extremely large proportions of outliers, we further design a guided matching strategy based on the proposed method, using the matching result on a small putative set with a high inlier ratio to guide the matching on a large putative set. This strategy can also significantly boost the true matches without sacrifice in accuracy. Experiments on various real remote sensing image pairs demonstrate the generality of our method for handling both rigid and nonrigid image deformations, and it is more than two orders of magnitude faster than the state-of-the-art methods with better accuracy, making it practical for real-time applications.

20 March 2019 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
Jiayi MaJiayi Ma
Jiayi Ma
Xingyu JiangXingyu Jiang
Xingyu Jiang
Junjun JiangJunjun Jiang
Junjun Jiang
JZJi Zhao
Ji Zhao
XGXiaojie Guo
Xiaojie Guo
Feature matching, which refers to establishing reliable correspondence between two sets of features, is a critical prerequisite in a wide spectrum of vision-based tasks. Existing attempts typically involve the mismatch removal from a set of putative matches based on estimating the underlying image transformation. However, the transformation could vary with different data. Thus, a pre-defined transformation model is often demanded, which severely limits the applicability. From a novel perspective, this paper casts the mismatch removal into a two-class classification problem, learning a general classifier to determine the correctness of an arbitrary putative match, termed as Learning for Mismatch Removal (LMR). The classifier is trained based on a general match representation associated with each putative match through exploiting the consensus of local neighborhood structures based on a multiple K -nearest neighbors strategy. With only ten training image pairs involving about 8000 putative matches, the learned classifier can generate promising matching results in linearithmic time complexity on arbitrary testing data. The generality and robustness of our approach are verified under several representative supervised learning techniques as well as on different training and testing data. Extensive experiments on feature matching, visual homing, and near-duplicate image retrieval are conducted to reveal the superiority of our LMR over the state-of-the-art competitors.

26 August 2019 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
Xingyu JiangXingyu Jiang
Xingyu Jiang
Jiayi MaJiayi Ma
Jiayi Ma
Junjun JiangJunjun Jiang
Junjun Jiang
XGXiaojie Guo
Xiaojie Guo
This paper focuses on removing mismatches from given putative feature matches created typically based on descriptor similarity. To achieve this goal, existing attempts usually involve estimating the image transformation under a geometrical constraint, where a pre-defined transformation model is demanded. This severely limits the applicability, as the transformation could vary with different data and is complex and hard to model in many real-world tasks. From a novel perspective, this paper casts the feature matching into a spatial clustering problem with outliers. The main idea is to adaptively cluster the putative matches into several motion consistent clusters together with an outlier/mismatch cluster. To implement the spatial clustering, we customize the classic density based spatial clustering method of applications with noise (DBSCAN) in the context of feature matching, which enables our approach to achieve quasi-linear time complexity. We also design an iterative clustering strategy to promote the matching performance in case of severely degraded data. Extensive experiments on several datasets involving different types of image transformations demonstrate the superiority of our approach over state-of-the-art alternatives. Our approach is also applied to near-duplicate image retrieval and co-segmentation and achieves promising performance.