ダウンロード数: 50
このアイテムのファイル:
ファイル | 記述 | サイズ | フォーマット | |
---|---|---|---|---|
j.sigpro.2023.108997.pdf | 3.22 MB | Adobe PDF | 見る/開く |
完全メタデータレコード
DCフィールド | 値 | 言語 |
---|---|---|
dc.contributor.author | Ju, Hanqiu | en |
dc.contributor.author | Honda, Naoki | en |
dc.contributor.author | Yoshimura, Shige H. | en |
dc.contributor.author | Kaneko, Miki | en |
dc.contributor.author | Shigematsu, Taiki | en |
dc.contributor.author | Kiyono, Ken | en |
dc.contributor.alternative | 本田, 直樹 | ja |
dc.contributor.alternative | 吉村 成弘 | ja |
dc.contributor.alternative | 清野, 健 | ja |
dc.date.accessioned | 2024-01-15T08:12:39Z | - |
dc.date.available | 2024-01-15T08:12:39Z | - |
dc.date.issued | 2023-07 | - |
dc.identifier.uri | http://hdl.handle.net/2433/286622 | - |
dc.description.abstract | The detrending moving average (DMA) analysis demonstrates excellent performance for the characterization of long-range correlations and fractal scaling and is performed in various research fields. The conventional DMA with a simple moving average can remove linear trends embedded in the observed time series. To improve the detrending ability of the DMA, higher-order DMA including a higher order polynomial detrending was also introduced using the Savitzky-Golay filter and its fast implementation algorithm was developed. However, the higher-order DMA applicable to higher dimensional data is yet to be well established. As the data dimension increases, an increase in the computational cost becomes a problem that needs to be resolved. Further, the implementation of the higher order DMA is a time-consuming procedure. To resolve this problem, we here proposed a fast algorithm for multidimensional DMA with higher order polynomial detrending. In the proposed algorithm, to reduce the computational complexity, parallel translation and recurrence techniques are introduced. Monte Carlo experiments for two-dimensional data show that the computational time of the proposed algorithm is approximately proportional to the cubic of the data length, whereas the computational time of the conventional implementation is approximately proportional to the quartic of the data length. Moreover, we evaluate the estimation accuracy of the Hurst exponent of the proposed method. Finally, we demonstrate the possible application of the proposed method by estimating the Hurst exponent of images. | en |
dc.language.iso | eng | - |
dc.publisher | Elsevier BV | en |
dc.rights | © 2023 The Author(s). Published by Elsevier B.V. | en |
dc.rights | This is an open access article under the CC BY-NC-ND license. | en |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | - |
dc.subject | Time-series analysis | en |
dc.subject | High-dimensional fractal | en |
dc.subject | Higher order DMA | en |
dc.subject | Hurst exponent | en |
dc.title | Multidimensional fractal scaling analysis using higher order moving average polynomials and its fast algorithm | en |
dc.type | journal article | - |
dc.type.niitype | Journal Article | - |
dc.identifier.jtitle | Signal Processing | en |
dc.identifier.volume | 208 | - |
dc.relation.doi | 10.1016/j.sigpro.2023.108997 | - |
dc.textversion | publisher | - |
dc.identifier.artnum | 108997 | - |
dcterms.accessRights | open access | - |
datacite.awardNumber | 20K20659 | - |
datacite.awardNumber.uri | https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-20K20659/ | - |
dc.identifier.pissn | 0165-1684 | - |
dc.identifier.eissn | 1872-7557 | - |
jpcoar.funderName | 日本学術振興会 | ja |
jpcoar.awardTitle | 働く高齢者の安全向上と支援のための環境生体データ科学の構築 | ja |
出現コレクション: | 学術雑誌掲載論文等 |
このアイテムは次のライセンスが設定されています: クリエイティブ・コモンズ・ライセンス