jinqiao wang -皇冠球网的网址

we theoretically prove that mae serves as a patch-level contrastive learning, where each patch within an image is considered as a distinct category. this presents a significant conflict with global-level contrastive learning, which treats all patches in an image as an identical category. to address this conflict, this work abandons the non-generalizable global-level constraints and proposes explicit patch-level contrastive learning as a solution. specifically, this work employs the encoder of mae to generate dual-branch features, which then perform patch-level learning through a decoder. our approach can learn heterogeneous representations from a single image while avoiding the conflicts encountered by previous methods. massive experiments affirm the potential of our method for learning from arbitrary scenarios.

ieee/cvf conference on computer vision and pattern recognition (cvpr), 2024

we propose a novel retraining-free structured pruning framework for llms, named flap (fluctuation-based adaptive structured pruning). it is hardware-friendly by effectively reducing storage and enhancing inference speed. first, flap determines whether the output feature map is easily recoverable when a column of weight is removed, based on the fluctuation pruning metric. then it standardizes the importance scores to adaptively determine the global compressed model structure. at last, flap adds additional bias terms to recover the output feature maps using the baseline values. without any retraining, our method significantly outperforms the state-of-the-art methods, including llm-pruner and the extension of wanda in structured pruning.

association for the advancement of artificial intelligence (aaai), 2024

in this paper, we explore the utilization of large vision-language model (lvlm) to address the industrial anomaly detection (iad) problem. we generate training data by simulating anomalous images and producing corresponding textual descriptions for each image. we also employ an image decoder to provide fine-grained semantic and design a prompt learner to fine-tune the lvlm using prompt embeddings. our anomalygpt eliminates the need for manual threshold adjustments, thus directly assesses the presence and locations of anomalies. additionally, anomalygpt supports multi-turn dialogues and exhibits impressive few-shot in-context learning capabilities. with only one normal shot, anomalygpt achieves the state-of-the-art performance with an accuracy of 86.1%, an image-level auc of 94.1%, and a pixel-level auc of 95.3% on the mvtec-ad dataset.

association for the advancement of artificial intelligence (aaai), 2024

we provides a lightweight segment anything(sam) solution for the open source community. this project has achieved over 6.8k stars and 600 forks on github, ranking first on the github trending list for several days and becoming a popular project on the hugging face platform for several consecutive days. in addition, fastsam has been widely reported by domestic and foreign media. in terms of commercial cooperation, fastsam has partnered with huawei's terminal department to develop the camera function for mobile phones, and has also partnered with tencent's youtu department to promote the image segmentation function for game specific scenes. these cooperation cases not only demonstrate the practicality of fastsam technology, but also demonstrate its widespread application and influence in the industry.

in this work, we propose an unsupervised bgs algorithm based on zero-shot object detection called zero-shot background subtraction zbs. the proposed method fully utilizes the advantages of zero-shot object detection to build the open-vocabulary instance-level background model. based on it, the foreground can be effectively extracted by comparing the detection results of new frames with the background model. zbs performs well for sophisticated scenarios, and it has rich and extensible categories. furthermore, our method can easily generalize to other tasks, such as abandoned object detection in unseen environments. we experimentally show that zbs surpasses state-of-the-art unsupervised bgs methods by 4.70% f-measure on the cdnet 2014 dataset.

ieee/cvf conference on computer vision and pattern recognition (cvpr), 2023

vision-language pre-training (vlp) has been shown to be an efficient method to improve the performance of models on different vision-and-language downstream tasks. most of the public cross-modal datasets that contain more than 100m image-text pairs are in english; there is a lack of available large-scale and high-quality chinese vlp datasets. in this work, we propose a new framework for automatic dataset acquisition and cleaning with which we construct a new large-scale and high-quality cross-modal dataset named as taisu, containing 166 million images and 219 million chinese captions. taisu is currently the largest publicly accessible chinese cross-modal dataset. furthermore, we test our dataset on several vision-language downstream tasks. results demonstrate that taisu can serve as a promising vlp dataset, both for understanding and generative tasks.

neural information processing systems (neurips), 2022

visual tasks vary a lot in their output formats and concerned contents, therefore it is hard to process them with an identical structure. one main obstacle lies in the high-dimensional outputs in object-level visual tasks. in this paper, we propose an object-centric vision framework, obj2seq. obj2seq takes objects as basic units, and regards most object-level visual tasks as sequence generation problems of objects. obj2seq is able to flexibly determine input categories to satisfy customized requirements, and be easily extended to different visual tasks. when experimenting on ms coco, obj2seq achieves 45.7% ap on object detection, 89.0% ap on multi-label classification and 65.0% ap on human pose estimation.

neural information processing systems (neurips), 2022

in this paper, we propose a reid-specific pre-training method, part-aware self-supervised pre-training (pass), which can generate part-level features to offer fine-grained information and is more suitable for reid. pass divides the images into several local areas, and the local views randomly cropped from each area are assigned a specific learnable [part] token. on the other hand, the [part]s of all local areas are also appended to the global views. pass learns to match the outputs of the local views and global views on the same [part]. that is, the learned [part] of the local views from a local area is only matched with the corresponding [part] learned from the global views. as a result, each [part] can focus on a specific local area of the image and extracts fine-grained information of this area. experiments show pass sets the new state-of-the-art performances on market1501 and msmt17 on various reid tasks.

european conference on computer vision (eccv), 2022

the identity embeddings of different instances are likely to be linearly inseparable in some complex scenes, such as crowded scene or when the number of instances in the image is large. to reduce the impact of this phenomenon on keypoint grouping, we try to learn a sparse multidimensional embedding for each keypoint. we observe that the different dimensions of embeddings are highly linearly correlated. to address this issue, we impose an additional constraint on the embeddings during training phase. based on the fact that the scales of instances usually have significant variations, we utilize the scales of instances to regularize the embeddings, which effectively reduces the linear correlation of embeddings and makes embeddings being sparse. our method achieves state-of-the-art results on crowdpose test (74.5 ap) and coco test-dev (72.8 ap), outperforming other bottom-up methods.

european conference on computer vision (eccv), 2022

self-supervised learning (ssl) holds promise in leveraging large amounts of unlabeled data. however, the success of popular ssl methods has limited on single-centric-object images like those in imagenet and ignores the correlation among the scene and instances, as well as the semantic difference of instances in the scene. to address the above problems, we propose a unified self-supervised visual pre-training (univip) to learn versatile visual representations on either single-centric-object or non-iconic dataset. our method outperforms byol by 2.5% with the same pre-training epochs in linear probing, and surpass current self-supervised object detection methods on coco dataset, demonstrating its universality and potential.

ieee/cvf conference on computer vision and pattern recognition (cvpr), 2022

we point out that the extremely imbalanced weight norm distribution under the long-tail setting yields ill conditioned decision boundary, which severely deteri orates the performance. we present a category-aware angular margin loss (c2am loss) that can adaptively adjust the decision boundary for learning a more compact and intrinsic feature representation. c2am loss brings obvious performance improvement (4.9%∼5.2% ap m) when compared with baseline and achieves new state-of-the-art on both lvis v0.5 and v1.0.

ieee/cvf conference on computer vision and pattern recognition (cvpr), 2022

in this paper, we present dtt, a novel single-object discriminative tracker, based on an encoder-decoder transformer architecture. by self- and encoder-decoder attention mechanisms, our approach is able to exploit the rich scene information in an end-to-end manner, effectively removing the need for hand-designed discriminative models. dtt is conceptually simple and easy to implement. it yields state-of-the-art performance on four popular benchmarks while running at over 50 fps.

international conference on computer vision (iccv), 2021

existing cnn based 3d human reconstruction methods highly depend on weak supervision signals, due to the lack of in-the-wild paired 3d supervision. however, the network easily suffers from local optima caused by the 2d-to-3d ambiguities. in this paper, we propose multi-initialization optimization network (mion) to reduce this ambiguity. in the first stage, we optimize different coarse 3d reconstruction candidates matches with a given 2d keypoints. in the second stage, we design a mesh refinement transformer (mrt) to refine each coarse reconstruction via a self-attention mechanism. finally, a consistency estimation network (cen) is proposed to find the best result from multiple candidates via the visual evidence in rgb image. experiments demonstrate that our mion outperforms other methods on multiple public benchmarks.

acm multimedia (acm mm), 2021

the fixed patch splitting in existing tranformers usually destroys the semantics of objects. to address this problem, we propose a new deformable patch (depatch) module which learns to adaptively split the images into patches with different positions and scales in a data-driven way rather than using predefined fixed patches. in this way, our method can well preserve the semantics in patches. as it can work as a plug-and-play module, we build a deformable patch-based transformer (dpt) and conduct extensive experiments on image classification and object detection. results indicates that our method can bring significant improvements.

acm multimedia (acm mm), 2021

we propose a novel and end-to-end trainable mot architecture that extends centernet by adding an sot branch for tracking objects in parallel with the existing branch for object detection, allowing the mot task to benefit from the strong discriminative power of sot methods in an effective and efficient way. the added sot branch trains a separate sot model per target online to distinguish the target from its surrounding targets, assigning sot models the novel discrimination. the proposed tracker achieves idf1s of 0.719 and 0.714 on mot17 and mot20 benchmarks, respectively, while running at 16 fps on mot17.

internaltional conference on computer vision and pattern recogintion (cvpr), 2021

we devise a novel adaptive class suppression loss (acsl) to protect the training of tail categories and perform discriminative learning between semantically similar categories. specifically, we introduce a statistic-free perspective to analyze the long-tail distribution, breaking the limitation of manual grouping. according to this perspective, our acsl adjusts the suppression gradients for each sample of each class adaptively, ensuring the training consistency and boosting the discrimination for rare categories. extensive experiments on long-tail datasets lvis and open images show that the our acsl achieves 5.18% and 5.2% improvements with resnet50-fpn, and sets a new state of the art.

ieee conference on computer vision and pattern recognition (cvpr), 2021

we propose the identity-guided human semantic parsing approach (isp) to locate both the human body parts and personal belongings at pixel-level for aligned person re-id only with person identity labels. we design the cascaded clustering on feature maps to generate the pseudo-labels of human parts. specifically, for the pixels of all images of a person, we first group them to foreground or background and then group the foreground pixels to human parts. the cluster assignments are subsequently used as pseudo-labels of human parts to supervise the part estimation and isp iteratively learns the feature maps and groups them.

european conference on computer vision (eccv), 2020

we propose a blended grammar network to exploit the inherent hierarchical structure of a human body and the relationship of different human parts by means of grammar rules in both cascaded and paralleled manner. in this way, conspicuous parts, which are easily distinguished from the background, can amend the segmentation of inconspicuous ones, improving the foreground extraction. our method obtains state-of-the-art performance on pascal-person-part, lip, and ppss datasets.

european conference on computer vision (eccv), 2020

one of the most intractable issues for facial age estimation is label ambiguity. some existing methods adopt distribution learning to tackle this issue. actually, most of them set a fixed value to the variance of gaussian label distribution for all the images. however, the variance is closely related to the correlation between adjacent ages and should vary across ages and identities. in this paper, we propose an adaptive variance based distribution learning (avdl) method for facial age estimation. avdl introduces the data-driven optimization framework, meta-learning, to achieve this. extensive experiments on fg-net and morph ii datasets show the superiority of our proposed approach to the existing state-of-the-art methods.

european conference on computer vision, eccv (2020)

after observing that the features used in most online discriminatively trained trackers are not optimal, in this paper, we propose a novel and effective architecture to learn optimal feature embeddings for online discriminative tracking. our method, called dcfst, integrates the solver of a discriminant model that is differentiable and has a closed-form solution into convolutional neural networks. then, the resulting network can be trained in an end-to-end way, obtaining optimal feature embeddings for the discriminant model-based tracker. extensive experiments on six public benchmarks show that our approach achieves state-of-the-art accuracy, while running beyond the real-time speed.

european conference on computer vision, eccv (2020)

we propose a versatile large batch optimization framework for object detection, named largedet, which successfully scales the batch size to larger than 1k for the first time. specifically, we present a novel periodical moments decay lamb (pmd-lamb) algorithm to effectively reduce the negative effects of the lagging historical gradients. additionally, the synchronized batch normalization (syncbn) is utilized to help fast convergence.

european conference on computer vision (eccv) 2020

we propose a knowledge distillation method for the face detection task. this method decouples the distillation task of face detection into two subtasks, i.e., the classification distillation subtask and the regression distillation subtask. we add the task-specific convolutions in the teacher network and add the adaption convolutions on the feature maps of the student network to generate the task decoupled features. then, each subtask uses different samples in distilling the features to be consistent with the corresponding detection subtask. moreover, we propose an effective probability distillation method to joint boost the accuracy of the student network.

acm multimedia (acm mm), 2020

we propose a novel part-aware context network (pcnet) to deal with a challenge of how to generate adaptive contextual features for the various sizes and shapes of human parts. pcnet consists a relational aggregation module to capture the representative global context by mining associated semantics of human parts, and a relational dispersion module to generate the discriminative and effective local context and neglect disturbing one by making the affinity of human parts dispersed.

computer vision and pattern recognition (cvpr), 2020

we propose a progressive pose grammar network learned with bi-c3d (bidirectional convolutional 3d) for human pose estimation. firstly, a local multi-scale bi-c3d kinematics grammar is proposed to promote the message passing process among the locally related joints. the multi-scale kinematics grammar excavates different levels human context learned by the network. moreover, a global sequential grammar is put forward to capture the long-range dependencies among the human body joints. the whole procedure can be regarded as a local-global progressive refinement process.

the association for the advancement of artificial intelligence (aaai), 2020

we propose a novel fully convolutional network, named as attention couplenet, to incorporate the attention-related information and global and local information of objects to improve the detection performance. specifically, the proposed method effectively exploits the cascade attention structure to gradually focus on the target regions by generating several class-agnostic attention feature maps. then, the attention maps are encoded into the network to acquire object-aware features.

ieee transactions on image processing (tip), 2019

fdkcf* casts aside the popular acceleration tool, fast fourier transform, employed by all existing cf trackers, and exploits the inherent high-overlap among real, ie, noncyclic, and dense samples to efficiently construct the kernel matrix of kcf. fdkcf* enjoys the following three advantages. (i) it is efficiently trained in kernel space and spatial domain without the boundary effect. (ii) almost all repeated calculations are eliminated, and the remaining ones are accelerated with gpu. its fps is almost independent of the number of feature channels. therefore, it is almost real-time, even though the high-dimensional deep features are employed. (iii) its localization accuracy is state-of-the-art.

international conference on computer vision (iccv), 2019

to reduce the computational complexity of deep cnn models in visual tracking, we propose a small feature distilled network (fdn) by imitating the intermediate representations of a much deeper network for obtaining small and fast-to-execute shallow models based on model compression. to further speed-up, we introduce a shift-and-stitch method to reduce the arithmetic operations, while preserving the spatial resolution of the distilled feature maps unchanged. comprehensive experiments on tracking benchmarks show that the proposed approach achieves 5x speed-up with competitive performance to the state-of-the-art deep trackers.

ieee transactions on cybernetics, 2019

we propose a two-level attention network, consisting of hard part-level attention and soft pixel-level attention, to adaptively extract discriminative features from the visual appearance of vehicles. the former one is designed to localize the salient vehicle parts like windscreen and car-head. the later one gives an additional attention refinement at pixel level to focus on the distinctive characteristics within each part. the proposed network can learn comprehensive and discriminative feature representations and achieve the sota performance on three large-scale datasets.

ieee transactions on image processing(tip), 2019

the semantic ambiguity caused by inconsistent annotations greatly degrades the facial landmark detection performance. to address this problem, we propose a novel probabilistic model which introduces a latent variable to represent the “real” ground-truth. the framework couples two parts: training landmark detection cnn and searching the “real” ground-truth, which are alternatively optimized. in addition, we propose a global heatmap correction unit to recover the unconfidently predicted landmarks due to occlusion and low quality, by considering the global face shapes as a constraint. extensive experiments on image-based and video-based datasets demonstrate the effectiveness of our method.

computer vision and pattern recognition (cvpr), 2019

recent dominant approaches typically follow an attention-based encoder-decoder framework that uses a unidirectional decoder to perform decoding in a left-to-right manner, but ignoring equally important right-to-left grammar information. we propose a novel gate-based bidirectional interactive decoding network (gbidn) to excavate the global grammatical information in text sequences. the bidirectional grammar information is fully fused through the interaction of the bidirectional decoders, and the visual context information is also combined to exploit the complementary advantages of different information. through a gated context mechanism, the fusion process is adjusted to reduce the influence of noise, thus achieving more accurate decoding.

international conference on information and knowledge management (cikm), 2019

although mkcf achieves more powerful discriminability than kcf through introducing multi-kernel learning (mkl) into kcf, its improvement over kcf is quite limited and its computational burden increases significantly in comparison with kcf. to address these problems, the mkl version of cf objective function is reformulated with its upper bound, alleviating the negative mutual interference of different kernels significantly. then, an efficient approximate solution is derived to keep the novel mkcf, mkcfup, running at very high fps. mkcfup outperforms kcf and mkcf with large margins and is still comparable to kcf in efficiency.

computer vision and pattern recognition (cvpr), 2018

there exists complex intra- and inter-class variations for vehicle re-identification. to address this problem, we propose a structured feature embedding learning framework by exploiting an efficient coarse-to-fine ranking loss to pull images of the same vehicle as close as possible and achieve discrimination between images from different vehicles as well as vehicles from different vehicle models. furthermore, to facilitate the research development, we build so far the largest vehicle re-id dataset “vehicle-1m” which involves nearly 1 million images captured in various surveillance scenarios.

the association for the advancement of artificial intelligence (aaai), 2018

we develop an end-to-end progressive cognitive network to segment human parts. in order to establish a hierarchical relationship, a novel component-aware region convolution structure is proposed. with this structure, latter layers inherit prior component information from former layers and pay its attention to a finer component. in this way, we deal with human parsing as a progressive recognition task, that is, we first locate the whole human and then segment the hierarchical components gradually.

the association for the advancement of artificial intelligence (aaai), 2018

we present the couplenet, a concise yet effective network that simultaneously couples global, local and context cues for accurate object detection. our system naturally combines the advantages of different region-based approaches with the coupling structure. with the combination of local part representation, global structural information and the contextual assistance, our couplenet achieves state-of-the-art results on the challenging pascal voc and coco datasets without using any extra tricks in the testing phase.

international conference on computer vision (iccv), 2017

we propose a real-time automatic deep matting approach for mobile devices. by leveraging the densely connected blocks and the dilated convolution, a light full convolutional network is designed to predict a coarse binary mask for portrait images. and a feathering block, which is edge-preserving and matting adaptive, is further developed to learn the guided filter and transform the binary mask into alpha matte.

acm multimedia conference (acm mm), 2017