scholarly journals Exploring Inter-Instance Relationships within the Query Set for Robust Image Set Matching

Sensors ◽  
2019 ◽  
Vol 19 (22) ◽  
pp. 5051 ◽  
Author(s):  
Deyin Liu ◽  
Chengwu Liang ◽  
Zhiming Zhang ◽  
Lin Qi ◽  
Brian C. Lovell
Keyword(s):  
Optimization Problems ◽  
Low Rank ◽  
Collaborative Representation ◽  
Alternating Direction ◽  
Proposed Model ◽  
Class Level ◽  
Sparsity Constraints ◽  
Image Set ◽  
Robust Image ◽  
Public Datasets

Image set matching (ISM) has attracted increasing attention in the field of computer vision and pattern recognition. Some studies attempt to model query and gallery sets under a joint or collaborative representation framework, achieving impressive performance. However, existing models consider only the competition and collaboration among gallery sets, neglecting the inter-instance relationships within the query set which are also regarded as one important clue for ISM. In this paper, inter-instance relationships within the query set are explored for robust image set matching. Specifically, we propose to represent the query set instances jointly via a combined dictionary learned from the gallery sets. To explore the commonality and variations within the query set simultaneously to benefit the matching, both low rank and class-level sparsity constraints are imposed on the representation coefficients. Then, to deal with nonlinear data in real scenarios, the`kernelized version is also proposed. Moreover, to tackle the gross corruptions mixed in the query set, the proposed model is extended for robust ISM. The optimization problems are solved efficiently by employing singular value thresholding and block soft thresholding operators in an alternating direction manner. Experiments on five public datasets demonstrate the effectiveness of the proposed method, comparing favorably with state-of-the-art methods.

scholarly journals A Remote Sensing Image Destriping Model Based on Low-Rank and Directional Sparse Constraint

2021 ◽  
Vol 13 (24) ◽  
pp. 5126
Author(s):  
Xiaobin Wu ◽  
Hongsong Qu ◽  
Liangliang Zheng ◽  
Tan Gao ◽  
Ziyu Zhang
Keyword(s):  
Structural Characteristics ◽  
Optimal Solution ◽  
Noise Removal ◽  
Low Rank ◽  
Ripple Effects ◽  
Model Based ◽  
Tv Regularization ◽  
Proposed Model ◽  
Sparsity Constraints ◽  
Considerable Impact

Stripe noise is a common condition that has a considerable impact on the quality of the images. Therefore, stripe noise removal (destriping) is a tremendously important step in image processing. Since the existing destriping models cause different degrees of ripple effects, in this paper a new model, based on total variation (TV) regularization, global low rank and directional sparsity constraints, is proposed for the removal of vertical stripes. TV regularization is used to preserve details, and the global low rank and directional sparsity are used to constrain stripe noise. The directional and structural characteristics of stripe noise are fully utilized to achieve a better removal effect. Moreover, we designed an alternating minimization scheme to obtain the optimal solution. Simulation and actual experimental data show that the proposed model has strong robustness and is superior to existing competitive destriping models, both subjectively and objectively.

scholarly journals Remote Sensing Image Stripe Detecting and Destriping Using the Joint Sparsity Constraint with Iterative Support Detection

2019 ◽  
Vol 11 (6) ◽  
pp. 608 ◽  
Author(s):  
Yun-Jia Sun ◽  
Ting-Zhu Huang ◽  
Tian-Hui Ma ◽  
Yong Chen
Keyword(s):  
Remote Sensing ◽  
Real Data ◽  
Total Variation Regularization ◽  
Joint Sparsity ◽  
Alternating Direction ◽  
Proposed Model ◽  
Comparison Results ◽  
Wide Range ◽  
Image Edges ◽  
Full Consideration

Remote sensing images have been applied to a wide range of fields, but they are often degraded by various types of stripes, which affect the image visual quality and limit the subsequent processing tasks. Most existing destriping methods fail to exploit the stripe properties adequately, leading to suboptimal performance. Based on a full consideration of the stripe properties, we propose a new destriping model to achieve stripe detection and stripe removal simultaneously. In this model, we adopt the unidirectional total variation regularization to depict the directional property of stripes and the weighted ℓ 2 , 1 -norm regularization to depict the joint sparsity of stripes. Then, we combine the alternating direction method of multipliers and iterative support detection to solve the proposed model effectively. Comparison results on simulated and real data suggest that the proposed method can remove and detect stripes effectively while preserving image edges and details.

Noise-robust image fusion with low-rank sparse decomposition guided by external patch prior

2020 ◽  
Vol 523 ◽  
pp. 14-37 ◽  
Author(s):  
Huafeng Li ◽  
Xiaoge He ◽  
Zhengtao Yu ◽  
Jiebo Luo
Keyword(s):  
Image Fusion ◽  
Low Rank ◽  
Sparse Decomposition ◽  
Robust Image ◽  
Noise Robust

scholarly journals Optimization of Consignment-Store-Based Supply Chain with Black Hole Algorithm

Complexity ◽  
2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Ágota Bányai ◽  
Tamás Bányai ◽  
Béla Illés
Keyword(s):  
Black Hole ◽  
Supply Chain ◽  
Optimization Problems ◽  
Optimization Method ◽  
Chain Model ◽  
Supply Chain Optimization ◽  
Proposed Model ◽  
Supply Chain Model ◽  
Supply Model ◽  
Black Hole Algorithm

The globalization of economy and market led to increased networking in the field of manufacturing and services. These manufacturing and service processes including supply chain became more and more complex. The supply chain includes in many cases consignment stores. The design and operation of these complex supply chain processes can be described as NP-hard optimization problems. These problems can be solved using sophisticated models and methods based on metaheuristic algorithms. This research proposes an integrated supply model based on consignment stores. After a careful literature review, this paper introduces a mathematical model to formulate the problem of consignment-store-based supply chain optimization. The integrated model includes facility location and assignment problems to be solved. Next, an enhanced black hole algorithm dealing with multiobjective supply chain model is presented. The sensitivity analysis of the heuristic black hole optimization method is also described to check the efficiency of new operators to increase the convergence of the algorithm. Numerical results with different datasets demonstrate how the proposed model supports the efficiency, flexibility, and reliability of the consignment-store-based supply chain.

Low-rank regularized tensor discriminant representation for image set classification

2019 ◽  
Vol 156 ◽  
pp. 62-70 ◽  
Author(s):  
Peiguang Jing ◽  
Yuting Su ◽  
Zhengnan Li ◽  
Jing Liu ◽  
Liqiang Nie
Keyword(s):  
Low Rank ◽  
Image Set Classification ◽  
Image Set

scholarly journals Entropy-Penalized Semidefinite Programming

2019 ◽  
Author(s):  
Mikhail Krechetov ◽  
Jakub Marecek ◽  
Yury Maximov ◽  
Martin Takac
Keyword(s):  
Machine Learning ◽  
Time Complexity ◽  
Optimization Problems ◽  
Linear Time ◽  
Broad Class ◽  
Low Rank ◽  
Learning Problems ◽  
Unified Framework ◽  
Gradient Computation ◽  
Machine Learning Applications

Low-rank methods for semi-definite programming (SDP) have gained a lot of interest recently, especially in machine learning applications. Their analysis often involves determinant-based or Schatten-norm penalties, which are difficult to implement in practice due to high computational efforts. In this paper, we propose Entropy-Penalized Semi-Definite Programming (EP-SDP), which provides a unified framework for a broad class of penalty functions used in practice to promote a low-rank solution. We show that EP-SDP problems admit an efficient numerical algorithm, having (almost) linear time complexity of the gradient computation; this makes it useful for many machine learning and optimization problems. We illustrate the practical efficiency of our approach on several combinatorial optimization and machine learning problems.

scholarly journals A recommendations model with multiaspect awareness and hierarchical user-product attention mechanisms

2020 ◽  
Vol 17 (3) ◽  
pp. 849-865
Author(s):  
Zhongqin Bi ◽  
Shuming Dou ◽  
Zhe Liu ◽  
Yongbin Li
Keyword(s):  
State Of The Art ◽  
Weight Vector ◽  
User Preferences ◽  
The Other ◽  
Attention Networks ◽  
Proposed Model ◽  
Network Methods ◽  
Public Datasets ◽  
Novel Model ◽  
Attention Weight

Neural network methods have been trained to satisfactorily learn user/product representations from textual reviews. A representation can be considered as a multiaspect attention weight vector. However, in several existing methods, it is assumed that the user representation remains unchanged even when the user interacts with products having diverse characteristics, which leads to inaccurate recommendations. To overcome this limitation, this paper proposes a novel model to capture the varying attention of a user for different products by using a multilayer attention framework. First, two individual hierarchical attention networks are used to encode the users and products to learn the user preferences and product characteristics from review texts. Then, we design an attention network to reflect the adaptive change in the user preferences for each aspect of the targeted product in terms of the rating and review. The results of experiments performed on three public datasets demonstrate that the proposed model notably outperforms the other state-of-the-art baselines, thereby validating the effectiveness of the proposed approach.

Sign in / Sign up

Export Citation Format

Share Document