Lei Luo

Lei Luo

Auto-generated profile, based on publicly available information

Lei Luo

Nanjing University of Science and Technology

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
1 December 2015 in Pattern Recognition
Verified
Journal Article
Closed access
LLLei Luo
Lei Luo
JYJian Yang
Jian Yang
JQJianjun Qian
Jianjun Qian
YTYing Tai
Ying Tai

26 September 2023 in Telematics and Informatics
Verified
Journal Article
Open access
TQTyreal Yizhou Qian
Tyreal Yizhou Qian
BYBo Yu
Bo Yu
RMRobbie Matz
Robbie Matz
LLLei Luo
Lei Luo
CXChenglong Xu
Chenglong Xu

7 September 2022 in Sport Management Review
Verified
Journal Article
Closed access
TQTyreal Yizhou Qian
Tyreal Yizhou Qian
RMRobbie Matz
Robbie Matz
LLLei Luo
Lei Luo
CZClaire C. Zvosec
Claire C. Zvosec
Although the concept of market demand has been extensively examined in the literature, most scholarly efforts have been devoted to understanding men’s spectator sports. There is scant research that investigates market demand for women’s spectator sports with a focus on gender dynamics. This study sought to fill that gap through developing a formative–formative hierarchical component model of core and peripheral market demand for a women’s professional tennis event (the Wuhan Open) and examining their differing impacts on future attendance intentions based on gender. Results derived from the importance-performance map analysis (IPMA) indicated that the most important core market demand components were player quality and economic consideration. However, only women considered game schedule important, while only men deemed venue characteristics and peripheral services important. Our study highlights the necessity and merits of deciphering market demand for women’s spectator sports in a more nuanced manner and contributes to the growing marketing literature on women’s sports fandom. Managerially, we offer practical implications per the IPMA for more effective and efficient integration of marketing initiatives.

7 February 2024 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
HXHanyu Xuan
Hanyu Xuan
ZWZhiliang Wu
Zhiliang Wu
JYJian Yang
Jian Yang
BJBo Jiang
Bo Jiang
LLLei Luo
Lei Luo
YYYan Yan
Yan Yan
By observing a scene and listening to corresponding audio cues, humans can easily recognize where the sound is. To achieve such cross-modal perception on machines, existing methods take advantage of the maps obtained by interpolation operations to localize the sound source. As semantic object-level localization is more attractive for prospective practical applications, we argue that these map-based methods only offer a coarse-grained and indirect description of the sound source. Additionally, these methods utilize a single audio-visual tuple at a time during self-supervised learning, causing the model to lose the crucial chance to reason about the data distribution of large-scale audio-visual samples. Although the introduction of Audio-Visual Contrastive Learning ( AVCL ) can effectively alleviate this issue, the contrastive set constructed by randomly sampling is based on the assumption that the audio and visual segments from all other videos are not semantically related. Since the resulting contrastive set contains a large number of faulty negatives, we believe that this assumption is rough. In this paper, we advocate a novel proposal-based solution that directly localizes the semantic object-level sound source, without any manual annotations. The Global Response Map ( GRM ) is incorporated as an unsupervised spatial constraint to filter those instances corresponding to a large number of sound-unrelated regions. As a result, our proposal-based Sound Source Localization ( SSL ) can be cast into a simpler Multiple Instance Learning ( MIL ) problem. To overcome the limitation of random sampling in AVCL , we propose a novel Active Contrastive Set Mining ( ACSM ) to mine the contrastive sets with informative and diverse negatives for robust AVCL . Our approaches achieve state-of-the-art ( SOTA ) performance when compared to several baselines on multiple SSL datasets with diverse scenarios.

22 September 2016 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
LLLei Luo
Lei Luo
LCLiang Chen
Liang Chen
JYJian Yang
Jian Yang
JQJianjun Qian
Jianjun Qian
BZBob Zhang
Bob Zhang
Structured sparsity, as an extension of standard sparsity, has shown the outstanding performance when dealing with some highly correlated variables in computer vision and pattern recognition. However, the traditional mixed (L 1 , L 2 ) or (L 1 , L ∞ ) group norm becomes weak in characterizing the internal structure of each group, since they cannot alleviate the correlations between variables. Recently, nuclear norm has been validated to be useful for depicting a spatially structured matrix variable. It considers the global structure of the matrix variable but overlooks the local structure. To combine the advantages of structured sparsity and nuclear norm, this paper presents a tree-structured nuclear norm approximation (TSNA) model assuming that the representation residual with tree-structured prior is a random matrix variable and follows a dependent matrix distribution. The extended alternating direction method of multipliers is utilized to solve the proposed model. An efficient bound condition based on the extended restricted isometry constants is provided to show the exact recovery of the proposed model under the given noisy case. In addition, TSNA is connected with some newest methods, such as sparse representation-based classifier, nuclear-L 1 norm joint regression, and nuclear norm-based matrix regression, which can be regarded as the special cases of TSNA. Experiments with face reconstruction and recognition demonstrate the benefits of TSNA over other approaches.

11 August 2017 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
SCShuo Chen
Shuo Chen
JYJian Yang
Jian Yang
LLLei Luo
Lei Luo
YWYang Wei
Yang Wei
KZKaihua Zhang
Kaihua Zhang
YTYing Tai
Ying Tai
This paper develops a novel method to address the structural noise in samples for image classification. Recently, regression-related classification methods have shown promising results when facing the pixelwise noise. However, they become weak in coping with the structural noise due to ignoring of relationships between pixels of noise image. Meanwhile, most of them need to implement the iterative process for computing representation coefficients, which leads to the high time consumption. To overcome these problems, we exploit a latent pattern model called low-rank latent pattern approximation (LLPA) to reconstruct the test image having structural noise. The rank function is applied to characterize the structure of the reconstruction residual between test image and the corresponding latent pattern. Simultaneously, the error between the latent pattern and the reference image is constrained by Frobenius norm to prevent overfitting. LLPA involves a closed-form solution by the virtue of a singular value thresholding operator. The provided theoretic analysis demonstrates that LLPA indeed removes the structural noise during classification task. Additionally, LLPA is further extended to the form of matrix regression by connecting multiple training samples, and alternating direction of multipliers method with Gaussian back substitution algorithm is used to solve the extended LLPA. Experimental results on several popular data sets validate that the proposed methods are more robust to image classification with occlusion and illumination changes, as compared to some existing state-of-the-art reconstruction-based methods and one deep neural network-based method.