Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleNovember 2024
Coarse-to-fine mechanisms mitigate diffusion limitations on image restoration
Computer Vision and Image Understanding (CVIU), Volume 248, Issue Chttps://doi.org/10.1016/j.cviu.2024.104118AbstractRecent years have witnessed the remarkable performance of diffusion models in various vision tasks. However, for image restoration that aims to recover clear images with sharper details from given degraded observations, diffusion-based methods ...
Highlights- Simple constraining noises cannot effectively learn complex degradation information.
- Embed diffusion into Transformer to model long-range dependencies to promote recovery.
- Coarse-to-Fine training improves quality affected by ...
- ArticleOctober 2024
Noise Calibration: Plug-and-Play Content-Preserving Video Enhancement Using Pre-trained Video Diffusion Models
AbstractIn order to improve the quality of synthesized videos, currently, one predominant method involves retraining an expert diffusion model and then implementing a noising-denoising process for refinement. Despite the significant training costs, ...
- research-articleSeptember 2024
Multi-view deep subspace clustering via level-by-level guided multi-level features learning
Applied Intelligence (KLU-APIN), Volume 54, Issue 21Pages 11083–11102https://doi.org/10.1007/s10489-024-05807-1AbstractMulti-view subspace clustering has attracted extensive attention due to its ability to efficiently handle data from diverse sources. In recent years, plentiful multi-view subspace clustering methods have emerged and achieved satisfactory ...
- research-articleFebruary 2024
Unveiling details in the dark: simultaneous brightening and zooming for low-light image enhancement
AAAI'24/IAAI'24/EAAI'24: Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence and Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence and Fourteenth Symposium on Educational Advances in Artificial IntelligenceArticle No.: 767, Pages 6899–6907https://doi.org/10.1609/aaai.v38i7.28515Existing super-resolution methods exhibit limitations when applied to nighttime scenes, primarily due to their lack of adaptation to low-pair dynamic range and noise-heavy dark-light images. In response, this paper introduces an innovative customized ...
- research-articleDecember 2023
Multi-view subspace clustering via consistent and diverse deep latent representations
Information Sciences: an International Journal (ISCI), Volume 651, Issue Chttps://doi.org/10.1016/j.ins.2023.119719AbstractMulti-view subspace clustering has recently received great interest in the communities of computer vision and pattern recognition, as it can overcome the limitation of conventional single-view subspace clustering by fusing complementary ...
-
- ArticleNovember 2023
- research-articleNovember 2023
SMPR: Single-stage multi-person pose regression
Highlights- A novel single-stage multi-person pose estimator.
- Better strategies to identify positive poses.
- A pose scoring module to enhance pose selection in NMS.
- Outperforms existing single-stage methods.
- Competitive with the latest ...
Existing multi-person pose estimators can be roughly divided into two-stage approaches (top-down and bottom-up approaches) and one-stage approaches. The two-stage methods either suffer high computational redundancy for additional person detectors ...
- ArticleOctober 2023
Single Image Dehazing with Deep-Image-Prior Networks
AbstractMost conventional dehazing methods focus on separately estimating key parameters (e.g., the transmission map and the atmospheric light) based on the atmospheric scattering model to generate haze-free images, which may face the limitation of error ...
- research-articleJuly 2023
Selecting the Best Part From Multiple Laplacian Autoencoders for Multi-View Subspace Clustering
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 35, Issue 7Pages 7457–7469https://doi.org/10.1109/TKDE.2022.3178145The multi-view subspace clustering attracts much attention in recent years. Most methods follow the framework of fusing the affinity graph learned in each view. In this framework, both the fusion strategy and built graph of each view are very important. ...
- research-articleOctober 2022
Deep multi-view subspace clustering via structure-preserved multi-scale features fusion
Neural Computing and Applications (NCAA), Volume 35, Issue 4Pages 3203–3219https://doi.org/10.1007/s00521-022-07864-4AbstractMulti-view subspace clustering has received widespread attention. Since data may violate the linear assumption in many practical applications, multi-view subspace clustering methods based on deep neural network are developed in recent years. ...
- research-articleJuly 2021
Single image deraining via deep shared pyramid network
The Visual Computer: International Journal of Computer Graphics (VISC), Volume 37, Issue 7Pages 1851–1865https://doi.org/10.1007/s00371-020-01944-zAbstractSingle image deraining is a highly ill-posed problem. Existing deep neural network-based algorithms usually use larger deep models to solve this problem, which is less effective and efficient. In this paper, we propose a deep neural network based ...
- research-articleOctober 2020
DCSFN: Deep Cross-scale Fusion Network for Single Image Rain Removal
MM '20: Proceedings of the 28th ACM International Conference on MultimediaPages 1643–1651https://doi.org/10.1145/3394171.3413820Rain removal is an important but challenging computer vision task as rain streaks can severely degrade the visibility of images that may make other visions or multimedia tasks fail to work. Previous works mainly focused on feature extraction and ...
- research-articleOctober 2020
Joint Self-Attention and Scale-Aggregation for Self-Calibrated Deraining Network
MM '20: Proceedings of the 28th ACM International Conference on MultimediaPages 2517–2525https://doi.org/10.1145/3394171.3413559In the field of multimedia, single image deraining is a basic pre-processing work, which can greatly improve the visual effect of subsequent high-level tasks in rainy conditions. In this paper, we propose an effective algorithm, called JDNet, to solve ...
- research-articleSeptember 2020
Single image deraining via nonlocal squeeze-and-excitation enhancing network
Applied Intelligence (KLU-APIN), Volume 50, Issue 9Pages 2932–2944https://doi.org/10.1007/s10489-020-01693-5AbstractRaindrop blur or rain streaks can severely degrade the visual quality of the images, which causes many practical vision systems to fail to work, such as autonomous driving and video surveillance. Hence, it is important to address the problem of ...
- research-articleJuly 2020
Densely connected multi-scale de-raining net
Multimedia Tools and Applications (MTAA), Volume 79, Issue 27-28Pages 19595–19614https://doi.org/10.1007/s11042-020-08855-0AbstractRainy images severely degrade the visibility and make many computer vision algorithms invalid. Hence, it is necessary to remove rain streaks from single image. In this paper, we propose a novel network to handle with single image de-raining, which ...
- research-articleNovember 2019
Robust subspace learning-based low-rank representation for manifold clustering
Neural Computing and Applications (NCAA), Volume 31, Issue 11Pages 7921–7933https://doi.org/10.1007/s00521-018-3617-8AbstractSpectral clustering-based subspace clustering methods have attracted broad interest in recent years. This kind of methods usually uses the self-representation in the original space to extract the affinity between the data points. However, we can ...
- research-articleAugust 2019
Bayesian rank penalization
Neural Networks (NENE), Volume 116, Issue CPages 246–256https://doi.org/10.1016/j.neunet.2019.04.018AbstractRank minimization is a key component of many computer vision and machine learning methods, including robust principal component analysis (RPCA) and low-rank representations (LRR). However, usual methods rely on optimization to produce a point ...
Highlights- We propose pGDP for rank penalization.
- We derive Bayesian versions of RPCA and LRR with pGDP prior.
- The fixed hyper-prior specification can result in good performance widely.
- Our methods have generality for rank penalization ...
- research-articleJune 2019
Learning diffusion on global graph: A PDE-directed approach for feature detection on geometric shapes
Computer Aided Geometric Design (CAGD), Volume 72, Issue CPages 111–125https://doi.org/10.1016/j.cagd.2019.04.020AbstractFeature and saliency analyses are crucial for various graphics applications. The key idea is to automatically compute and recommend the salient or outstanding regions of concerned models. However, there is no universally-applicable criterion for ...
Highlights- Propose an efficient framework to recommend interest region on arbitrary model.
- Formulate the task as PDEs-directed graph diffusion using a small training set.
- Exploit submodular optimization and guidance for adaptive and learnable ...
- ArticleSeptember 2018
- articleJuly 2018
A Nonuniform Method for Extracting Attractive Structures From Images
International Journal of Grid and High Performance Computing (IJGHPC-IGI), Volume 10, Issue 3Pages 14–28https://doi.org/10.4018/IJGHPC.2018070102This article describes how attractive structures are always correspond to objects of interest in human perception, thus extracting attractive structures is a fundamental problem in many image analysis tasks, which is of great practical importance. In ...