Efficient group based Hilbert encoding and decoding algorithms

Promoting Hilbert curve encoding and decoding efficiency is crucial for many Hilbert curve based applications. The current state-view based algorithms usually design 1-order state-views (1-SVs) and iteratively access these state-views in order-wise manner, leading to excessive state-view accesses. T...

Full description

Saved in:
Bibliographic Details
Published in:Pattern recognition Vol. 167; p. 111718
Main Authors: Jia, Lianyin, Wang, Songyu, Sun, Shaowen, Ding, Jiaman, Li, Mengjuan, You, Jinguo, Qiao, Shaojie
Format: Journal Article
Language:English
Published: Elsevier Ltd 01.11.2025
Subjects:
ISSN:0031-3203
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Promoting Hilbert curve encoding and decoding efficiency is crucial for many Hilbert curve based applications. The current state-view based algorithms usually design 1-order state-views (1-SVs) and iteratively access these state-views in order-wise manner, leading to excessive state-view accesses. To solve this problem, this paper uses a new paradigm and designs novel k-order state-views (k-SVs), which coalesces k state-view accesses into one access, significantly decreasing the state-view accesses. An efficient grouping framework is then designed to divide each input data into groups. Efficient virtual filling mechanisms are further developed to facilitate the k-SVs to all the groups, thus improving the time and space efficiency. Based on these techniques, efficient grouping encoding and decoding algorithms and the corresponding batched algorithms are designed. Compared with the existing ones, our algorithms reduce the time complexity from O(n) to O(n/k), where n is the total number of orders in each coordinate or a Hilbert code. Experimental results show that our algorithms run up to 3.18 times faster than the fastest competitor. •Novel k-order state-views merge k accesses into one, decreasing state-view accesses.•Virtual filling extends k-order views to all groups, boosting time/space efficiency.•Efficient algorithms achieve 3.18× speedup over competitors.
AbstractList Promoting Hilbert curve encoding and decoding efficiency is crucial for many Hilbert curve based applications. The current state-view based algorithms usually design 1-order state-views (1-SVs) and iteratively access these state-views in order-wise manner, leading to excessive state-view accesses. To solve this problem, this paper uses a new paradigm and designs novel k-order state-views (k-SVs), which coalesces k state-view accesses into one access, significantly decreasing the state-view accesses. An efficient grouping framework is then designed to divide each input data into groups. Efficient virtual filling mechanisms are further developed to facilitate the k-SVs to all the groups, thus improving the time and space efficiency. Based on these techniques, efficient grouping encoding and decoding algorithms and the corresponding batched algorithms are designed. Compared with the existing ones, our algorithms reduce the time complexity from O(n) to O(n/k), where n is the total number of orders in each coordinate or a Hilbert code. Experimental results show that our algorithms run up to 3.18 times faster than the fastest competitor. •Novel k-order state-views merge k accesses into one, decreasing state-view accesses.•Virtual filling extends k-order views to all groups, boosting time/space efficiency.•Efficient algorithms achieve 3.18× speedup over competitors.
ArticleNumber 111718
Author Sun, Shaowen
Li, Mengjuan
Ding, Jiaman
Wang, Songyu
You, Jinguo
Jia, Lianyin
Qiao, Shaojie
Author_xml – sequence: 1
  givenname: Lianyin
  surname: Jia
  fullname: Jia, Lianyin
  email: lianyinjia@kust.edu.cn
  organization: Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming, 650500, Yunnan, China
– sequence: 2
  givenname: Songyu
  surname: Wang
  fullname: Wang, Songyu
  email: wsongyu913@163.com
  organization: Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming, 650500, Yunnan, China
– sequence: 3
  givenname: Shaowen
  surname: Sun
  fullname: Sun, Shaowen
  email: qq1023401301@163.com
  organization: Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming, 650500, Yunnan, China
– sequence: 4
  givenname: Jiaman
  orcidid: 0000-0002-4419-1297
  surname: Ding
  fullname: Ding, Jiaman
  email: jiamanding@kust.edu.cn
  organization: Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming, 650500, Yunnan, China
– sequence: 5
  givenname: Mengjuan
  surname: Li
  fullname: Li, Mengjuan
  email: lmjlykm@163.com
  organization: Library, Yunnan Normal University, Kunming, 650500, Yunnan, China
– sequence: 6
  givenname: Jinguo
  surname: You
  fullname: You, Jinguo
  email: jgyou@kust.edu.cn
  organization: Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming, 650500, Yunnan, China
– sequence: 7
  givenname: Shaojie
  surname: Qiao
  fullname: Qiao, Shaojie
  email: sjqiao@cuit.edu.cn
  organization: School of Software Engineering, Chengdu University of Information Technology, Chengdu, 610225, Sichuan, China
BookMark eNqFkM1KAzEUhbOoYFt9AxfzAjMmk_l1UZBSrVBwo-twJ_fOmDJNShIF396W0Y0LXV3Oge_AdxdsZp0lxm4EzwQX1e0-O0LUbshynpeZEKIWzYzNOZcilTmXl2wRwp7zU1_kc7ba9L3RhmxMBu_ej0kHgTDZmrEjHxOy2qGxQwIWE6SfMA7Om_h2CFfsoocx0PX3XbLXh83Lepvunh-f1ve7VEvexLSRKFtoyx5qiaKhEkkitlTwgrAXAF3bc2xRQtXprq46TlBRVbSNrOuiArlkd9Ou9i4ET73SJkI0zkYPZlSCq7O92qvJXp3t1WR_gotf8NGbA_jP_7DVhNFJ7MOQV-H8KE1oPOmo0Jm_B74A1mZ7WA
CitedBy_id crossref_primary_10_1016_j_patcog_2025_112457
Cites_doi 10.1016/j.patcog.2020.107353
10.1016/j.jmaa.2023.127654
10.1109/CDC.2017.8263684
10.1007/s00521-020-05128-7
10.3934/mbe.2023914
10.1109/CVPR52733.2024.00463
10.1109/TIP.2019.2895466
10.1016/j.patcog.2022.108591
10.1016/j.cose.2022.102660
10.4018/IJDWM.316161
10.14778/3407790.3407829
10.1109/TIP.2022.3186532
10.14778/3603581.3603598
10.1145/3397506
10.1109/TIP.2003.814250
10.1016/j.ins.2006.12.003
10.1016/j.patcog.2021.107857
10.1007/s10489-023-04945-2
10.1016/j.neunet.2024.106198
10.1109/CVPR52733.2024.00985
10.14778/3598581.3598589
10.1007/978-3-031-02444-3_42
10.1016/j.jksuci.2024.102085
ContentType Journal Article
Copyright 2025 Elsevier Ltd
Copyright_xml – notice: 2025 Elsevier Ltd
DBID AAYXX
CITATION
DOI 10.1016/j.patcog.2025.111718
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
ExternalDocumentID 10_1016_j_patcog_2025_111718
S0031320325003784
GroupedDBID --K
--M
-D8
-DT
-~X
.DC
.~1
0R~
123
1B1
1RT
1~.
1~5
29O
4.4
457
4G.
53G
5VS
7-5
71M
8P~
9JN
AABNK
AAEDT
AAEDW
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AATTM
AAXKI
AAXUO
AAYFN
AAYWO
ABBOA
ABDPE
ABEFU
ABFNM
ABFRF
ABHFT
ABJNI
ABMAC
ABWVN
ABXDB
ACBEA
ACDAQ
ACGFO
ACGFS
ACNNM
ACRLP
ACRPL
ACVFH
ACZNC
ADBBV
ADCNI
ADEZE
ADJOM
ADMUD
ADMXK
ADNMO
ADTZH
AEBSH
AECPX
AEFWE
AEIPS
AEKER
AENEX
AEUPX
AFJKZ
AFPUW
AFTJW
AFXIZ
AGCQF
AGHFR
AGQPQ
AGRNS
AGUBO
AGYEJ
AHHHB
AHJVU
AHZHX
AIALX
AIEXJ
AIGII
AIIUN
AIKHN
AITUG
AKBMS
AKRWK
AKYEP
ALMA_UNASSIGNED_HOLDINGS
AMRAJ
ANKPU
AOUOD
APXCP
ASPBG
AVWKF
AXJTR
AZFZN
BJAXD
BKOJK
BLXMC
BNPGV
CS3
DU5
EBS
EFJIC
EJD
EO8
EO9
EP2
EP3
F0J
F5P
FD6
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
GBLVA
GBOLZ
HLZ
HVGLF
HZ~
H~9
IHE
J1W
JJJVA
KOM
KZ1
LG9
LMP
LY1
M41
MO0
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
RNS
ROL
RPZ
SBC
SDF
SDG
SDP
SDS
SES
SEW
SPC
SPCBC
SSH
SST
SSV
SSZ
T5K
TN5
UNMZH
VOH
WUQ
XJE
XPP
ZMT
ZY4
~G-
9DU
AAYXX
ACLOT
CITATION
EFKBS
EFLBG
~HD
ID FETCH-LOGICAL-c308t-83d39a95fa73d18e5de3dd9e404edf1aab9f0d9d3a6bcb76b0ea6e649837746a3
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001498292900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0031-3203
IngestDate Sat Nov 29 06:56:33 EST 2025
Tue Nov 18 22:33:20 EST 2025
Sat Jun 28 18:15:47 EDT 2025
IsPeerReviewed true
IsScholarly true
Keywords Hilbert curve
Grouping
Virtual filling
K-order state-views
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c308t-83d39a95fa73d18e5de3dd9e404edf1aab9f0d9d3a6bcb76b0ea6e649837746a3
ORCID 0000-0002-4419-1297
ParticipantIDs crossref_citationtrail_10_1016_j_patcog_2025_111718
crossref_primary_10_1016_j_patcog_2025_111718
elsevier_sciencedirect_doi_10_1016_j_patcog_2025_111718
PublicationCentury 2000
PublicationDate November 2025
2025-11-00
PublicationDateYYYYMMDD 2025-11-01
PublicationDate_xml – month: 11
  year: 2025
  text: November 2025
PublicationDecade 2020
PublicationTitle Pattern recognition
PublicationYear 2025
Publisher Elsevier Ltd
Publisher_xml – name: Elsevier Ltd
References Verbruggen, Ginis (b4) 2023
Z. Yu, T-Drive trajectory data sample.
Kamata, Niimi, Kawaguchi (b37) 1996
Gao, Cao, Yao (b19) 2023; 16
Shahna, Mohamed (b2) 2020; 90
S.H. Nair, A. Sinha, L. Vachhani, Hilbert’s space-filling curve for regions with holes, in: IEEE 56th Annual Conference on Decision and Control, CDC, 2017, pp. 313–319.
Jia, Kong, Wang, Li, You, Ding (b30) 2022
Chung, Huang, Liu (b1) 2007
Jia, Tang, Li, Zhao, Wei (b17) 2023; 19
Moore (b24) 2016
Li, Zhong, Wang (b28) 2014
Heaney, Li, Matar (b3) 2024; 175
2017.
O’Shaughnessy, Sheridan (b6) 2022; 116
J. Ryu, S. i. Kamata, A fast and accurate point pattern matching algorithm based on multi-Hilbert scans, in: Asian Conference on Pattern Recognition., 2021.
Bappy, Simons, Nataraj, Manjunath, Roy-Chowdhury (b8) 2019
Böhm, Perdacher, Plant (b25) 2018
X. Wu, L. Jiang, P. Wang, et al., Point Transformer V3: Simpler Faster Stronger, in: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2024.
Lei, Tong, Wang (b26) 2023
J. Burkardt, Convert between 1D and 2D coordinates of Hilbert curve.
2010.
Abate, Bisogni, Castiglione, Nappi (b10) 2022; 127
Jia, Chen, Li, You, Ding (b29) 2020
Lu, Zhao, Tan, Wang (b14) 2020
Yan, Yan, Mahmood (b15) 2024
.
Atto, Benoit, Lambert (b7) 2020; 104
Li, Wang, Cong (b20) 2023; 16
Chen, Yu, Wang (b21) 2022
Zheng, Xie, Ma (b35) 2010
Li, Fan, Sun, Jia, Liang (b36) 2023
Ozkaraca (b22) 2024; 530
Tsinganos, Cornelis, Cornelis, Jansen, Skodras (b5) 2021
Qi, Tao, Chang, Zhang (b16) 2020
S. Niedermayr, J. Stumpfegger, R. Westermann, Compressed 3D Gaussian splatting for accelerated novel view synthesis, in: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2024.
Qi, Liu, Jensen, Kulik (b18) 2020
Ryu, i. Kamata (b12) 2021; 114
Grigorescu, Petkov, Westenberg (b34) 2003
10.1016/j.patcog.2025.111718_b13
Lu (10.1016/j.patcog.2025.111718_b14) 2020
Grigorescu (10.1016/j.patcog.2025.111718_b34) 2003
Verbruggen (10.1016/j.patcog.2025.111718_b4) 2023
Li (10.1016/j.patcog.2025.111718_b28) 2014
Gao (10.1016/j.patcog.2025.111718_b19) 2023; 16
10.1016/j.patcog.2025.111718_b32
10.1016/j.patcog.2025.111718_b11
10.1016/j.patcog.2025.111718_b33
Qi (10.1016/j.patcog.2025.111718_b16) 2020
Ozkaraca (10.1016/j.patcog.2025.111718_b22) 2024; 530
10.1016/j.patcog.2025.111718_b31
O’Shaughnessy (10.1016/j.patcog.2025.111718_b6) 2022; 116
Böhm (10.1016/j.patcog.2025.111718_b25) 2018
Jia (10.1016/j.patcog.2025.111718_b30) 2022
Shahna (10.1016/j.patcog.2025.111718_b2) 2020; 90
Zheng (10.1016/j.patcog.2025.111718_b35) 2010
Kamata (10.1016/j.patcog.2025.111718_b37) 1996
Ryu (10.1016/j.patcog.2025.111718_b12) 2021; 114
10.1016/j.patcog.2025.111718_b9
Li (10.1016/j.patcog.2025.111718_b36) 2023
Chen (10.1016/j.patcog.2025.111718_b21) 2022
Moore (10.1016/j.patcog.2025.111718_b24) 2016
10.1016/j.patcog.2025.111718_b23
Jia (10.1016/j.patcog.2025.111718_b29) 2020
10.1016/j.patcog.2025.111718_b27
Atto (10.1016/j.patcog.2025.111718_b7) 2020; 104
Abate (10.1016/j.patcog.2025.111718_b10) 2022; 127
Yan (10.1016/j.patcog.2025.111718_b15) 2024
Jia (10.1016/j.patcog.2025.111718_b17) 2023; 19
Bappy (10.1016/j.patcog.2025.111718_b8) 2019
Chung (10.1016/j.patcog.2025.111718_b1) 2007
Tsinganos (10.1016/j.patcog.2025.111718_b5) 2021
Heaney (10.1016/j.patcog.2025.111718_b3) 2024; 175
Qi (10.1016/j.patcog.2025.111718_b18) 2020
Li (10.1016/j.patcog.2025.111718_b20) 2023; 16
Lei (10.1016/j.patcog.2025.111718_b26) 2023
References_xml – volume: 127
  year: 2022
  ident: b10
  article-title: Head pose estimation: An extensive survey on recent techniques and applications
  publication-title: Pattern Recognit.
– start-page: 905
  year: 1996
  end-page: 909
  ident: b37
  article-title: A gray image compression using a Hilbert scan
– start-page: 846
  year: 2014
  end-page: 851
  ident: b28
  article-title: An algorithm for Hilbert ordering code based on state-transition matrix
  publication-title: J. Geo- Inf. Sci.
– reference: J. Ryu, S. i. Kamata, A fast and accurate point pattern matching algorithm based on multi-Hilbert scans, in: Asian Conference on Pattern Recognition., 2021.
– year: 2016
  ident: b24
  article-title: Fast hilbert curve generation, sorting, and range queries
– start-page: 3714
  year: 2020
  end-page: 3726
  ident: b14
  article-title: Distributed density peaks clustering revisited
  publication-title: IEEE Trans. Knowl. Data Eng.
– volume: 116
  year: 2022
  ident: b6
  article-title: Image-based malware classification hybrid framework based on space-filling curves
  publication-title: Comput. Secur.
– volume: 90
  year: 2020
  ident: b2
  article-title: A novel image encryption scheme using both pixel level and bit level permutation with chaotic map
  publication-title: Appl. Soft Comput.
– reference: S. Niedermayr, J. Stumpfegger, R. Westermann, Compressed 3D Gaussian splatting for accelerated novel view synthesis, in: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2024.
– start-page: 1494
  year: 2020
  end-page: 1501
  ident: b29
  article-title: State view based efficient Hilbert encoding and decoding algorithms (in Chinese)
  publication-title: J. Electron. Inf. Technol.
– reference: , 2017.
– volume: 104
  year: 2020
  ident: b7
  article-title: Timed-image based deep learning for action recognition in video sequences
  publication-title: Pattern Recognit.
– start-page: 20668
  year: 2023
  end-page: 20682
  ident: b36
  article-title: Efficient entry point encoding and decoding algorithms on 2D Hilbert space filling curve
  publication-title: Math. Biosci. Eng.
– reference: X. Wu, L. Jiang, P. Wang, et al., Point Transformer V3: Simpler Faster Stronger, in: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2024.
– start-page: 2341
  year: 2020
  end-page: 2354
  ident: b18
  article-title: Effectively learning spatial indices
  publication-title: Proc. VLDB Endow.
– start-page: 1426
  year: 2022
  end-page: 1434
  ident: b30
  article-title: 2-d Hilbert encoding and decoding algorithms on skewed data (in Chinese)
  publication-title: J. Tsinghua Univ. (Sci. Technol.)
– start-page: 32
  year: 2010
  end-page: 39
  ident: b35
  article-title: GeoLife: A collaborative social networking service among user, location and trajectory
  publication-title: IEEE Data Eng. Bull.
– start-page: 241
  year: 2018
  end-page: 254
  ident: b25
  article-title: A novel Hilbert curve for cache-locality preserving loops
  publication-title: IEEE Trans. Big Data
– reference: , 2010.
– reference: Z. Yu, T-Drive trajectory data sample.
– volume: 19
  year: 2023
  ident: b17
  article-title: An efficient association rule mining-based spatial keyword index
  publication-title: Int. J. Data Warehous. Min.
– start-page: 26655
  year: 2023
  end-page: 26671
  ident: b4
  article-title: Improving image classification of one-dimensional convolutional neural networks using Hilbert space-filling curves
  publication-title: Appl. Intell.
– start-page: 2130
  year: 2007
  end-page: 2151
  ident: b1
  article-title: Efficient algorithms for coding Hilbert curve of arbitrary-sized image and application to window query
  publication-title: Inform. Sci.
– volume: 530
  year: 2024
  ident: b22
  article-title: Planar substitutions to Lebesgue type space-filling curves and relatively dense fractal-like sets in the plane
  publication-title: J. Math. Anal. Appl.
– volume: 114
  year: 2021
  ident: b12
  article-title: An efficient computational algorithm for Hausdorff distance based on points-ruling-out and systematic random sampling
  publication-title: Pattern Recognit.
– year: 2023
  ident: b26
  article-title: W-Hilbert: A W-shaped Hilbert curve and coding method for multiscale geospatial data index
  publication-title: Int. J. Appl. Earth Obs. Geoinf.
– start-page: 729
  year: 2003
  end-page: 739
  ident: b34
  article-title: Contour detection based on nonclassical receptive field inhibition
  publication-title: IEEE Trans. Image Process.
– volume: 175
  year: 2024
  ident: b3
  article-title: Applying convolutional neural networks to data on unstructured meshes with space-filling curves
  publication-title: Neural Netw.
– reference: .
– start-page: 4609
  year: 2022
  end-page: 4621
  ident: b21
  article-title: Hilbert space filling curve based scan-order for point cloud attribute compression
  publication-title: IEEE Trans. Image Process.
– volume: 16
  year: 2023
  ident: b20
  article-title: Towards designing and learning piecewise space-filling curves
  publication-title: Proc. VLDB Endow.
– reference: J. Burkardt, Convert between 1D and 2D coordinates of Hilbert curve.
– start-page: 3286
  year: 2019
  end-page: 3300
  ident: b8
  article-title: Hybrid LSTM and encoder–decoder architecture for detection of image forgeries
  publication-title: IEEE Trans. Image Process.
– start-page: 1
  year: 2020
  end-page: 47
  ident: b16
  article-title: Packing R-trees with space-filling curves: Theoretical optimality, empirical efficiency, and bulk-loading parallelizability
  publication-title: ACM Trans. Database Syst.
– year: 2024
  ident: b15
  article-title: Achieving local differential location privacy protection in 3D space via Hilbert encoding and optimized random response
  publication-title: J. King Saud Univ.- Comput. Inf. Sci.
– volume: 16
  year: 2023
  ident: b19
  article-title: LMSFC: A novel multidimensional index based on learned monotonic space filling curves
  publication-title: Proc. VLDB Endow.
– reference: S.H. Nair, A. Sinha, L. Vachhani, Hilbert’s space-filling curve for regions with holes, in: IEEE 56th Annual Conference on Decision and Control, CDC, 2017, pp. 313–319.
– start-page: 2645
  year: 2021
  end-page: 2666
  ident: b5
  article-title: Hilbert sEMG data scanning for hand gesture recognition based on deep learning
  publication-title: Neural Comput. Appl.
– volume: 104
  year: 2020
  ident: 10.1016/j.patcog.2025.111718_b7
  article-title: Timed-image based deep learning for action recognition in video sequences
  publication-title: Pattern Recognit.
  doi: 10.1016/j.patcog.2020.107353
– volume: 530
  year: 2024
  ident: 10.1016/j.patcog.2025.111718_b22
  article-title: Planar substitutions to Lebesgue type space-filling curves and relatively dense fractal-like sets in the plane
  publication-title: J. Math. Anal. Appl.
  doi: 10.1016/j.jmaa.2023.127654
– ident: 10.1016/j.patcog.2025.111718_b27
  doi: 10.1109/CDC.2017.8263684
– start-page: 2645
  year: 2021
  ident: 10.1016/j.patcog.2025.111718_b5
  article-title: Hilbert sEMG data scanning for hand gesture recognition based on deep learning
  publication-title: Neural Comput. Appl.
  doi: 10.1007/s00521-020-05128-7
– start-page: 20668
  year: 2023
  ident: 10.1016/j.patcog.2025.111718_b36
  article-title: Efficient entry point encoding and decoding algorithms on 2D Hilbert space filling curve
  publication-title: Math. Biosci. Eng.
  doi: 10.3934/mbe.2023914
– ident: 10.1016/j.patcog.2025.111718_b9
  doi: 10.1109/CVPR52733.2024.00463
– ident: 10.1016/j.patcog.2025.111718_b33
– volume: 90
  year: 2020
  ident: 10.1016/j.patcog.2025.111718_b2
  article-title: A novel image encryption scheme using both pixel level and bit level permutation with chaotic map
  publication-title: Appl. Soft Comput.
– start-page: 32
  year: 2010
  ident: 10.1016/j.patcog.2025.111718_b35
  article-title: GeoLife: A collaborative social networking service among user, location and trajectory
  publication-title: IEEE Data Eng. Bull.
– year: 2016
  ident: 10.1016/j.patcog.2025.111718_b24
– ident: 10.1016/j.patcog.2025.111718_b31
– year: 2023
  ident: 10.1016/j.patcog.2025.111718_b26
  article-title: W-Hilbert: A W-shaped Hilbert curve and coding method for multiscale geospatial data index
  publication-title: Int. J. Appl. Earth Obs. Geoinf.
– start-page: 846
  year: 2014
  ident: 10.1016/j.patcog.2025.111718_b28
  article-title: An algorithm for Hilbert ordering code based on state-transition matrix
  publication-title: J. Geo- Inf. Sci.
– start-page: 1426
  year: 2022
  ident: 10.1016/j.patcog.2025.111718_b30
  article-title: 2-d Hilbert encoding and decoding algorithms on skewed data (in Chinese)
  publication-title: J. Tsinghua Univ. (Sci. Technol.)
– start-page: 3286
  year: 2019
  ident: 10.1016/j.patcog.2025.111718_b8
  article-title: Hybrid LSTM and encoder–decoder architecture for detection of image forgeries
  publication-title: IEEE Trans. Image Process.
  doi: 10.1109/TIP.2019.2895466
– start-page: 241
  year: 2018
  ident: 10.1016/j.patcog.2025.111718_b25
  article-title: A novel Hilbert curve for cache-locality preserving loops
  publication-title: IEEE Trans. Big Data
– volume: 127
  year: 2022
  ident: 10.1016/j.patcog.2025.111718_b10
  article-title: Head pose estimation: An extensive survey on recent techniques and applications
  publication-title: Pattern Recognit.
  doi: 10.1016/j.patcog.2022.108591
– volume: 116
  year: 2022
  ident: 10.1016/j.patcog.2025.111718_b6
  article-title: Image-based malware classification hybrid framework based on space-filling curves
  publication-title: Comput. Secur.
  doi: 10.1016/j.cose.2022.102660
– volume: 19
  issue: 2
  year: 2023
  ident: 10.1016/j.patcog.2025.111718_b17
  article-title: An efficient association rule mining-based spatial keyword index
  publication-title: Int. J. Data Warehous. Min.
  doi: 10.4018/IJDWM.316161
– start-page: 2341
  year: 2020
  ident: 10.1016/j.patcog.2025.111718_b18
  article-title: Effectively learning spatial indices
  publication-title: Proc. VLDB Endow.
  doi: 10.14778/3407790.3407829
– ident: 10.1016/j.patcog.2025.111718_b32
– start-page: 4609
  year: 2022
  ident: 10.1016/j.patcog.2025.111718_b21
  article-title: Hilbert space filling curve based scan-order for point cloud attribute compression
  publication-title: IEEE Trans. Image Process.
  doi: 10.1109/TIP.2022.3186532
– volume: 16
  issue: 10
  year: 2023
  ident: 10.1016/j.patcog.2025.111718_b19
  article-title: LMSFC: A novel multidimensional index based on learned monotonic space filling curves
  publication-title: Proc. VLDB Endow.
  doi: 10.14778/3603581.3603598
– start-page: 1
  year: 2020
  ident: 10.1016/j.patcog.2025.111718_b16
  article-title: Packing R-trees with space-filling curves: Theoretical optimality, empirical efficiency, and bulk-loading parallelizability
  publication-title: ACM Trans. Database Syst.
  doi: 10.1145/3397506
– start-page: 729
  year: 2003
  ident: 10.1016/j.patcog.2025.111718_b34
  article-title: Contour detection based on nonclassical receptive field inhibition
  publication-title: IEEE Trans. Image Process.
  doi: 10.1109/TIP.2003.814250
– start-page: 2130
  year: 2007
  ident: 10.1016/j.patcog.2025.111718_b1
  article-title: Efficient algorithms for coding Hilbert curve of arbitrary-sized image and application to window query
  publication-title: Inform. Sci.
  doi: 10.1016/j.ins.2006.12.003
– volume: 114
  year: 2021
  ident: 10.1016/j.patcog.2025.111718_b12
  article-title: An efficient computational algorithm for Hausdorff distance based on points-ruling-out and systematic random sampling
  publication-title: Pattern Recognit.
  doi: 10.1016/j.patcog.2021.107857
– ident: 10.1016/j.patcog.2025.111718_b23
– start-page: 26655
  year: 2023
  ident: 10.1016/j.patcog.2025.111718_b4
  article-title: Improving image classification of one-dimensional convolutional neural networks using Hilbert space-filling curves
  publication-title: Appl. Intell.
  doi: 10.1007/s10489-023-04945-2
– volume: 175
  year: 2024
  ident: 10.1016/j.patcog.2025.111718_b3
  article-title: Applying convolutional neural networks to data on unstructured meshes with space-filling curves
  publication-title: Neural Netw.
  doi: 10.1016/j.neunet.2024.106198
– ident: 10.1016/j.patcog.2025.111718_b11
  doi: 10.1109/CVPR52733.2024.00985
– volume: 16
  issue: 9
  year: 2023
  ident: 10.1016/j.patcog.2025.111718_b20
  article-title: Towards designing and learning piecewise space-filling curves
  publication-title: Proc. VLDB Endow.
  doi: 10.14778/3598581.3598589
– start-page: 3714
  year: 2020
  ident: 10.1016/j.patcog.2025.111718_b14
  article-title: Distributed density peaks clustering revisited
  publication-title: IEEE Trans. Knowl. Data Eng.
– ident: 10.1016/j.patcog.2025.111718_b13
  doi: 10.1007/978-3-031-02444-3_42
– year: 2024
  ident: 10.1016/j.patcog.2025.111718_b15
  article-title: Achieving local differential location privacy protection in 3D space via Hilbert encoding and optimized random response
  publication-title: J. King Saud Univ.- Comput. Inf. Sci.
  doi: 10.1016/j.jksuci.2024.102085
– start-page: 1494
  year: 2020
  ident: 10.1016/j.patcog.2025.111718_b29
  article-title: State view based efficient Hilbert encoding and decoding algorithms (in Chinese)
  publication-title: J. Electron. Inf. Technol.
– start-page: 905
  year: 1996
  ident: 10.1016/j.patcog.2025.111718_b37
SSID ssj0017142
Score 2.4899132
Snippet Promoting Hilbert curve encoding and decoding efficiency is crucial for many Hilbert curve based applications. The current state-view based algorithms usually...
SourceID crossref
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 111718
SubjectTerms Grouping
Hilbert curve
K-order state-views
Virtual filling
Title Efficient group based Hilbert encoding and decoding algorithms
URI https://dx.doi.org/10.1016/j.patcog.2025.111718
Volume 167
WOSCitedRecordID wos001498292900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  issn: 0031-3203
  databaseCode: AIEXJ
  dateStart: 19950101
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: false
  ssIdentifier: ssj0017142
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELag5cCFN6K85AO3lStvnMT2BamCRaWqqkoU2Fvk-LHdqiSrbQrtv2cc2wlVES-Ji5VYcRLNN5pMxjPfIPQqy4QxheYERkry0tVEmYITV6oCnDnnRB_v-LTPDw7EfC4PYw_3s76dAG8acXEhV_8VapgDsH3p7F_APdwUJuAYQIcRYIfxj4Cf9aQQfou_r9iY-O-UmewuPZlVN_G8lSYVJhqbTk4X7XrZHUfq8uisHvbcm77eJSYZjVv2eyHHdh-U63I5zH5Owee2WVyej_tNIcZ6rNpvY-HZ29hMBe70JWpoDD5kRazCGyJiqSpmTEHqrSybEpZRdsXKhq4b1yx2CB6cbK_gy9Mutv1DvBnn0Spf5cL-EKgmKQPHjTIu8ptoM-OFBHO2ufN-Nt8bNpD4NA9E8fFVUtVkn9p3_Vk_90p-8DSO7qE78RcB7wRo76MbtnmA7qb2Gzha44fo9YA07pHGPdI4Io0T0hiQxglpPCL9CH18Nzt6s0tiOwyiGRUdEcwwqWThFGdmKmxhLDNG2pzm1ripUrV01EjDVFnrmpc1taq0ZS4FAx-_VOwx2mjaxj5BWHFNSyqUzsFf9ouos3lhtXMmy3WhtxBL4qh05Ir3LUtOq5QUeFIFIVZeiFUQ4hYiw6pV4Er5zfU8SbqK_l7w4ypQjl-ufPrPK5-h26MeP0cb3frcvkC39NduebZ-GbXoO5MMfXE
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Efficient+group+based+Hilbert+encoding+and+decoding+algorithms&rft.jtitle=Pattern+recognition&rft.au=Jia%2C+Lianyin&rft.au=Wang%2C+Songyu&rft.au=Sun%2C+Shaowen&rft.au=Ding%2C+Jiaman&rft.date=2025-11-01&rft.pub=Elsevier+Ltd&rft.issn=0031-3203&rft.volume=167&rft_id=info:doi/10.1016%2Fj.patcog.2025.111718&rft.externalDocID=S0031320325003784
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0031-3203&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0031-3203&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0031-3203&client=summon