The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Dalam kajian ini, kami memperkenalkan perwakilan imej jarang invarian anjakan menggunakan kamus berstruktur pokok. Pengekodan jarang ialah model isyarat generatif yang menghampiri isyarat oleh gabungan linear atom dalam kamus. Memandangkan penalti sparsity diperkenalkan semasa penghampiran isyarat dan pembelajaran kamus, kamus mewakili struktur primal isyarat. Di bawah kekangan anjakan-invarian, kamus mengandungi unsur penstrukturan yang diterjemahkan (SE). Kos pengiraan dan bilangan atom dalam kamus meningkat seiring dengan peningkatan bilangan SE. Dalam makalah ini, kami mencadangkan algoritma untuk perwakilan imej jarang invarian anjakan, di mana SE dipelajari dengan pendekatan berstruktur pokok. Dengan menggunakan kamus berstruktur pokok, kita boleh mengurangkan kos pengiraan penguraian imej kepada susunan logaritma bilangan SE. Kami juga membentangkan hasil eksperimen kami pada pembelajaran SE dan penggunaan algoritma kami dalam aplikasi pemulihan imej.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Makoto NAKASHIZUKA, Hidenari NISHIURA, Youji IIGUNI, "Shift-Invariant Sparse Image Representations Using Tree-Structured Dictionaries" in IEICE TRANSACTIONS on Fundamentals,
vol. E92-A, no. 11, pp. 2809-2818, November 2009, doi: 10.1587/transfun.E92.A.2809.
Abstract: In this study, we introduce shift-invariant sparse image representations using tree-structured dictionaries. Sparse coding is a generative signal model that approximates signals by the linear combinations of atoms in a dictionary. Since a sparsity penalty is introduced during signal approximation and dictionary learning, the dictionary represents the primal structures of the signals. Under the shift-invariance constraint, the dictionary comprises translated structuring elements (SEs). The computational cost and number of atoms in the dictionary increase along with the increasing number of SEs. In this paper, we propose an algorithm for shift-invariant sparse image representation, in which SEs are learnt with a tree-structured approach. By using a tree-structured dictionary, we can reduce the computational cost of the image decomposition to the logarithmic order of the number of SEs. We also present the results of our experiments on the SE learning and the use of our algorithm in image recovery applications.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E92.A.2809/_p
Salinan
@ARTICLE{e92-a_11_2809,
author={Makoto NAKASHIZUKA, Hidenari NISHIURA, Youji IIGUNI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Shift-Invariant Sparse Image Representations Using Tree-Structured Dictionaries},
year={2009},
volume={E92-A},
number={11},
pages={2809-2818},
abstract={In this study, we introduce shift-invariant sparse image representations using tree-structured dictionaries. Sparse coding is a generative signal model that approximates signals by the linear combinations of atoms in a dictionary. Since a sparsity penalty is introduced during signal approximation and dictionary learning, the dictionary represents the primal structures of the signals. Under the shift-invariance constraint, the dictionary comprises translated structuring elements (SEs). The computational cost and number of atoms in the dictionary increase along with the increasing number of SEs. In this paper, we propose an algorithm for shift-invariant sparse image representation, in which SEs are learnt with a tree-structured approach. By using a tree-structured dictionary, we can reduce the computational cost of the image decomposition to the logarithmic order of the number of SEs. We also present the results of our experiments on the SE learning and the use of our algorithm in image recovery applications.},
keywords={},
doi={10.1587/transfun.E92.A.2809},
ISSN={1745-1337},
month={November},}
Salinan
TY - JOUR
TI - Shift-Invariant Sparse Image Representations Using Tree-Structured Dictionaries
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2809
EP - 2818
AU - Makoto NAKASHIZUKA
AU - Hidenari NISHIURA
AU - Youji IIGUNI
PY - 2009
DO - 10.1587/transfun.E92.A.2809
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E92-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2009
AB - In this study, we introduce shift-invariant sparse image representations using tree-structured dictionaries. Sparse coding is a generative signal model that approximates signals by the linear combinations of atoms in a dictionary. Since a sparsity penalty is introduced during signal approximation and dictionary learning, the dictionary represents the primal structures of the signals. Under the shift-invariance constraint, the dictionary comprises translated structuring elements (SEs). The computational cost and number of atoms in the dictionary increase along with the increasing number of SEs. In this paper, we propose an algorithm for shift-invariant sparse image representation, in which SEs are learnt with a tree-structured approach. By using a tree-structured dictionary, we can reduce the computational cost of the image decomposition to the logarithmic order of the number of SEs. We also present the results of our experiments on the SE learning and the use of our algorithm in image recovery applications.
ER -