Jianwei Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jianwei Yang has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
Zhengda Lu
School of Mathematics and Statistics, Nanjing University of Information Science and Technology, Nanjing, 210044, China
4 shared publicationsLiang Zhang
Nanjing Univ Informat Sci & Technol, Sch Math & Stat, Nanjing 210044, Jiangsu, Peoples R China
3 shared publicationsChunyuan Li
Microsoft Research
2 shared publicationsYuan Yan Tang
Faculty of Science and Technology, University of Macau, Macau, China
2 shared publications- Yuan Yan Tang
University of Macau
2 shared publications Yuepeng Wang
School of Mathematics and Statistics, Nanjing University of Information Science and Technology, Nanjing, China
2 shared publications
Latest Publications
- Top Cited Papers
- 27 November 2024
- Published by Springer Nature
- p. 467-484
Segment and Recognize Anything at Any Granularity
- 27 November 2024
- Published by Springer Nature
- p. 467-484
Top Cited PapersSegment and Recognize Anything at Any Granularity
- 28 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 55 (1) , 207-220
Adjustable Jacobi–Fourier Moment for Image Representation
The widely adopted Jacobi-Fourier moment (JFM) is limited by its inability to effectively capture spatial information. Although fractional-order JFM (FOJFM) introduces spatial information through a fractional-order parameter, the control of spatial information remains inadequate. This limitation stems from the insufficient control over zeros distribution associated with the used moment’s radial kernel. To address this issue, we generalize both JFM and FOJFM into a transformed JFM. A transformed function with four parameters is designed, and adjustable JFM (AJFM) is proposed. Two parameters correlate to increasing velocities on the left and right parts of the transformed functions, enabling zeros quantities of radial kernel fall in the left and right parts of the interval. The other two parameters segment the transformed function, adjusting regions where different quantities of zeros fall in. This refined control over the radial kernel’s zero distribution enhances the versatility of feature extraction by the AJFM, governed by the introduced parameters. Experimental results demonstrate that AJFM, with properly chosen parameters, can emphasize specific regions within an image more effectively.
- 28 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 55 (1) , 207-220
Adjustable Jacobi–Fourier Moment for Image Representation
The widely adopted Jacobi-Fourier moment (JFM) is limited by its inability to effectively capture spatial information. Although fractional-order JFM (FOJFM) introduces spatial information through a fractional-order parameter, the control of spatial information remains inadequate. This limitation stems from the insufficient control over zeros distribution associated with the used moment’s radial kernel. To address this issue, we generalize both JFM and FOJFM into a transformed JFM. A transformed function with four parameters is designed, and adjustable JFM (AJFM) is proposed. Two parameters correlate to increasing velocities on the left and right parts of the transformed functions, enabling zeros quantities of radial kernel fall in the left and right parts of the interval. The other two parameters segment the transformed function, adjusting regions where different quantities of zeros fall in. This refined control over the radial kernel’s zero distribution enhances the versatility of feature extraction by the AJFM, governed by the introduced parameters. Experimental results demonstrate that AJFM, with properly chosen parameters, can emphasize specific regions within an image more effectively.
- 30 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 32 (10577149) , 3266-3280
Local Orthogonal Moments for Local Features
By introducing parameters with local information, several types of orthogonal moments have recently been developed for the extraction of local features in an image. But with the existing orthogonal moments, local features cannot be well-controlled with these parameters. The reason lies in that zeros distribution of these moments’ basis function cannot be well-adjusted by the introduced parameters. To overcome this obstacle, a new framework, transformed orthogonal moment (TOM), is set up. Most existing continuous orthogonal moments such as Zernike moments, fractional-order orthogonal moments (FOOMs), etc. are all special cases of TOM. To control the basis function’s zeros distribution, a novel local constructor is designed, and local orthogonal moment (LOM) is proposed. Zeros distribution of LOM’s basis function can be adjusted with parameters introduced by the designed local constructor. Consequently, locations, where local features extracted from by LOM, are more accurate than those by FOOMs. In comparison with Krawtchouk moments and Hahn moments etc., the range, where local features are extracted from by LOM, is order insensitive. Experimental results demonstrate that LOM can be utilized to extract local features in an image.
- 30 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 32 (10577149) , 3266-3280
Local Orthogonal Moments for Local Features
By introducing parameters with local information, several types of orthogonal moments have recently been developed for the extraction of local features in an image. But with the existing orthogonal moments, local features cannot be well-controlled with these parameters. The reason lies in that zeros distribution of these moments’ basis function cannot be well-adjusted by the introduced parameters. To overcome this obstacle, a new framework, transformed orthogonal moment (TOM), is set up. Most existing continuous orthogonal moments such as Zernike moments, fractional-order orthogonal moments (FOOMs), etc. are all special cases of TOM. To control the basis function’s zeros distribution, a novel local constructor is designed, and local orthogonal moment (LOM) is proposed. Zeros distribution of LOM’s basis function can be adjusted with parameters introduced by the designed local constructor. Consequently, locations, where local features extracted from by LOM, are more accurate than those by FOOMs. In comparison with Krawtchouk moments and Hahn moments etc., the range, where local features are extracted from by LOM, is order insensitive. Experimental results demonstrate that LOM can be utilized to extract local features in an image.
- 27 November 2022
- Published by Springer Nature in Pattern Analysis and Applications
- Vol. 26 (2) , 529-542
Polar radius moment with application for affine invariants
- 27 November 2022
- Published by Springer Nature in Pattern Analysis and Applications
- Vol. 26 (2) , 529-542
Polar radius moment with application for affine invariants
- 21 November 2022
- Published by Elsevier in Digital Signal Processing
- Vol. 133
Image analysis with logarithmic Zernike moments
- 21 November 2022
- Published by Elsevier in Digital Signal Processing
- Vol. 133
Image analysis with logarithmic Zernike moments
- 7 October 2022
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 65 (3) , 373-393
Generalized Polar Coordinate Moments with Quasi Inner Product
- 7 October 2022
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 65 (3) , 373-393
Generalized Polar Coordinate Moments with Quasi Inner Product
- Open Access
Unified Contrastive Learning in Image-Text-Label Space
Visual recognition is recently learned via either supervised learning on human-annotated image-label data or language-image contrastive learning with webly-crawled image-text pairs. While supervised learning may result in a more discriminative representation, language-image pretraining shows unprecedented zero-shot recognition capability, largely due to the different properties of data sources and learning objectives. In this work, we introduce a new formulation by combining the two data sources into a common image-text-label space. In this space, we propose a new learning paradigm, called Unified Contrastive Learning (UniCL) with a single learning objective to seamlessly prompt the synergy of two data types. Extensive experiments show that our UniCL is an effective way of learning semantically rich yet discriminative representations, universally for image recognition in zero-shot, linear-probe, fully finetuning and transfer learning scenarios. Particularly, it attains gains up to 9.2% and 14.5% in average on zero-shot recognition benchmarks over the language-image contrastive learning and supervised learning methods, respectively. In linear probe setting, it also boosts the performance over the two methods by 7.3% and 3.4%, respectively. Our study also indicates that UniCL stand-alone is a good learner on pure image-label data, rivaling the supervised learning methods across three image classification datasets and two types of vision backbones, ResNet and Swin Transformer. Code is available at https://github.com/microsoft/UniCL.
Open AccessUnified Contrastive Learning in Image-Text-Label Space
Visual recognition is recently learned via either supervised learning on human-annotated image-label data or language-image contrastive learning with webly-crawled image-text pairs. While supervised learning may result in a more discriminative representation, language-image pretraining shows unprecedented zero-shot recognition capability, largely due to the different properties of data sources and learning objectives. In this work, we introduce a new formulation by combining the two data sources into a common image-text-label space. In this space, we propose a new learning paradigm, called Unified Contrastive Learning (UniCL) with a single learning objective to seamlessly prompt the synergy of two data types. Extensive experiments show that our UniCL is an effective way of learning semantically rich yet discriminative representations, universally for image recognition in zero-shot, linear-probe, fully finetuning and transfer learning scenarios. Particularly, it attains gains up to 9.2% and 14.5% in average on zero-shot recognition benchmarks over the language-image contrastive learning and supervised learning methods, respectively. In linear probe setting, it also boosts the performance over the two methods by 7.3% and 3.4%, respectively. Our study also indicates that UniCL stand-alone is a good learner on pure image-label data, rivaling the supervised learning methods across three image classification datasets and two types of vision backbones, ResNet and Swin Transformer. Code is available at https://github.com/microsoft/UniCL.
- Open Access
- 8 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 89617-89629
A Robust Spatial Information-Theoretic GMM Algorithm for Bias Field Estimation and Brain MRI Segmentation
Due to their simplicity and flexibility, the unsupervised statistical models such as Gaussian mixture model (GMM) are powerful tools to address the brain magnetic resonance (MR) images segmentation problems. However, the GMM is based only on the intensity information, which makes it sensitive to noise. Lots of GMM-based segmentation algorithms have the low segmentation accuracy because of the influence caused by noise and intensity inhomogeneity. To further improve the segmentation accuracy, a robust spatial information-theoretic GMM algorithm is proposed in this paper to simultaneously estimate the intensity inhomogeneity and segment brain MR images. First, a novel spatial factor containing the non-local spatial information is incorporated to reduce the impact of noise. The proposed spatial factor not only takes into account the local neighboring information, but also considers the spatial structure information of pixels. Thus, our algorithm can retain more image details while reducing the influence of noise. Second, the mutual information (MI) maximization method is used to identify and eliminate outliers. Finally, to overcome the impact of intensity inhomogeneity, we use a linear combination of a set of orthogonal polynomials to approximate the bias field. The objective function is integrated with the bias field estimation model to segment the images and estimate the bias field simultaneously. The experimental results on both synthetic and clinical brain MR images show that the proposed algorithm can overcome the influence of noise and intensity inhomogeneity, and achieve more accurate segmentation results.
- 8 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 89617-89629
Open AccessA Robust Spatial Information-Theoretic GMM Algorithm for Bias Field Estimation and Brain MRI Segmentation
Due to their simplicity and flexibility, the unsupervised statistical models such as Gaussian mixture model (GMM) are powerful tools to address the brain magnetic resonance (MR) images segmentation problems. However, the GMM is based only on the intensity information, which makes it sensitive to noise. Lots of GMM-based segmentation algorithms have the low segmentation accuracy because of the influence caused by noise and intensity inhomogeneity. To further improve the segmentation accuracy, a robust spatial information-theoretic GMM algorithm is proposed in this paper to simultaneously estimate the intensity inhomogeneity and segment brain MR images. First, a novel spatial factor containing the non-local spatial information is incorporated to reduce the impact of noise. The proposed spatial factor not only takes into account the local neighboring information, but also considers the spatial structure information of pixels. Thus, our algorithm can retain more image details while reducing the influence of noise. Second, the mutual information (MI) maximization method is used to identify and eliminate outliers. Finally, to overcome the impact of intensity inhomogeneity, we use a linear combination of a set of orthogonal polynomials to approximate the bias field. The objective function is integrated with the bias field estimation model to segment the images and estimate the bias field simultaneously. The experimental results on both synthetic and clinical brain MR images show that the proposed algorithm can overcome the influence of noise and intensity inhomogeneity, and achieve more accurate segmentation results.
- 30 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 29 (10577149) , 4114-4129
Quasi Fourier-Mellin Transform for Affine Invariant Features
Fourier-Mellin transform (FMT) has been widely used for the extraction of rotation- and scale-invariant features. However, affine transform is a more reasonable approximation model for real viewpoint change. Due to shearing, the integral along the angular direction in the calculation of FMT cannot be used to extract the inherent features of an image undergoing affine transform. To eliminate the effect of shearing, whitening transform should be conducted on the integral along the radial direction. FMT can hardly be modified by conventional whitening-based methods with low computational cost due to additional processes. In this paper, two factors are constructed and embedded into FMT. Quasi Fourier-Mellin transform (QFMT) is proposed. The embedding of these factors is equivalent to whitening transform and can eliminate the effect of shearing in the affine transform. In particular, QFMT can also be calculated by integrating along the radial direction followed by integrating along the angular direction, as in FMT. Based on QFMT, the quasi Fourier-Mellin descriptor (QFMD) is constructed for the extraction of affine invariant features. Some experiments have also been conducted to test the performance of the proposed method.
- 30 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 29 (10577149) , 4114-4129
Quasi Fourier-Mellin Transform for Affine Invariant Features
Fourier-Mellin transform (FMT) has been widely used for the extraction of rotation- and scale-invariant features. However, affine transform is a more reasonable approximation model for real viewpoint change. Due to shearing, the integral along the angular direction in the calculation of FMT cannot be used to extract the inherent features of an image undergoing affine transform. To eliminate the effect of shearing, whitening transform should be conducted on the integral along the radial direction. FMT can hardly be modified by conventional whitening-based methods with low computational cost due to additional processes. In this paper, two factors are constructed and embedded into FMT. Quasi Fourier-Mellin transform (QFMT) is proposed. The embedding of these factors is equivalent to whitening transform and can eliminate the effect of shearing in the affine transform. In particular, QFMT can also be calculated by integrating along the radial direction followed by integrating along the angular direction, as in FMT. Based on QFMT, the quasi Fourier-Mellin descriptor (QFMD) is constructed for the extraction of affine invariant features. Some experiments have also been conducted to test the performance of the proposed method.
- 1 January 2019
- Published by Elsevier in Pattern Recognition
- Vol. 85, 37-49
Mellin polar coordinate moment and its affine invariance
- 1 January 2019
- Published by Elsevier in Pattern Recognition
- Vol. 85, 37-49
Mellin polar coordinate moment and its affine invariance