2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing 2014
DOI: 10.1109/synasc.2014.25
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Converting of Large Sparse Matrices to Quadtree Format

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 4 publications
0
1
0
Order By: Relevance
“…Then, Gargantini proposed a linear quad tree representation method and removed the pointers because of the large consumption of the storage [8]. The linear quad tree method is widely used not only in image representation [9][10][11] but also in many other fields [12][13][14][15]. However, it emphasized partitioning the image in a strictly symmetric way which might easily ignore the characteristics of the partitioned blocks.…”
Section: Introductionmentioning
confidence: 99%
“…Then, Gargantini proposed a linear quad tree representation method and removed the pointers because of the large consumption of the storage [8]. The linear quad tree method is widely used not only in image representation [9][10][11] but also in many other fields [12][13][14][15]. However, it emphasized partitioning the image in a strictly symmetric way which might easily ignore the characteristics of the partitioned blocks.…”
Section: Introductionmentioning
confidence: 99%