2018 IEEE International Conference on Multimedia and Expo (ICME) 2018
DOI: 10.1109/icme.2018.8486524
|View full text |Cite
|
Sign up to set email alerts
|

Sparse Representation for Color Image Based on Geometric Algebra

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
2
1

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 11 publications
0
3
0
Order By: Relevance
“…where UU H = I M ×M , VV H = I N ×N , I is an identity matrix. Wang et al [11], [12] apply a new algorithm corresponding dictionary learning algorithm, namely K-GASVD, the details of K-GASVD algorithm are shown in Table 1. GA is used to map the color image into a high dimensional space for color image analysis and shows the superior performance compared with competing methods on color images.…”
Section: Applications To Signal and Image Processing A Applications To Sparse Representation Models For Image Processingmentioning
confidence: 99%
“…where UU H = I M ×M , VV H = I N ×N , I is an identity matrix. Wang et al [11], [12] apply a new algorithm corresponding dictionary learning algorithm, namely K-GASVD, the details of K-GASVD algorithm are shown in Table 1. GA is used to map the color image into a high dimensional space for color image analysis and shows the superior performance compared with competing methods on color images.…”
Section: Applications To Signal and Image Processing A Applications To Sparse Representation Models For Image Processingmentioning
confidence: 99%
“…When dealing with color image, the most urgent problem needed to be addressed is to avoid the loss of inherent relationship of RGB channels. Wang et al [19] applied geometric algebra to denote the structure of color information and map the color image into a high-dimensional space, and the model has been, until very recently, regarded as a powerful model for color image processing. Each color image patch can be represented as f = 0 + f 1 e 1 + f 2 e 2 + f 12 e 12 ∈ (G 2 ) N while applying GA, and the sparse representation model in G 2 has been given as…”
Section: Related Work a Review Of Current Sparse Representa-tion Modelsmentioning
confidence: 99%
“…Xu et al [18] provided an efficient color sparse representation model on account of the compatibility between quaternion matrix and color image to avoid losing the correlation of three color channels. Wang et al [19] applied geometric algebra to map the color image into a high-dimensional space to color image analysis and achieved high performance. To address the problem of high computational complexity owing to non-commutative multiplication, Shen et al [20] presented a novel theory of reduced geometric algebra (RGA) with commutative multiplication rules and a novel vector-valued sparse representation model for color image using RGA.…”
Section: Introductionmentioning
confidence: 99%