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
본 논문에서는 일정한 간격으로 샘플링된 박스 스플라인을 계산하는 빠른 알고리즘을 제시합니다. 이 알고리즘은 방향 합산에 의한 표현을 기반으로 하는 반면, 스플라인은 종종 컨볼루션으로 표현됩니다. 합 기반 표현은 계산 복잡성을 줄입니다. 제안된 알고리즘은 컨볼루션 기반 알고리즘보다 더 적은 추가와 훨씬 더 적은 곱셈을 필요로 합니다. 제안된 알고리즘은 3방향 및 4방향 박스 스플라인에 대한 덧셈 및 곱셈 횟수 측면에서 평가되어 해당 연산이 얼마나 감소하는지 확인합니다.
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.
부
Takeshi ASAHI, Koichi ICHIGE, Rokuya ISHII, "A New Formulation for Discrete Box Splines Reducing Computational Cost and Its Evaluation" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 3, pp. 884-892, March 2001, doi: .
Abstract: This paper presents a fast algorithm for calculating box splines sampled at regular intervals. This algorithm is based on the representation by directional summations, while splines are often represented by convolutions. The summation-based representation leads less computational complexity: the proposed algorithm requires fewer additions and much fewer multiplications than the algorithm based on convolutions. The proposed algorithm is evaluated in the sense of the number of additions and multiplications for three- and four-directional box splines to see how much those operations are reduced.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_3_884/_p
부
@ARTICLE{e84-a_3_884,
author={Takeshi ASAHI, Koichi ICHIGE, Rokuya ISHII, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A New Formulation for Discrete Box Splines Reducing Computational Cost and Its Evaluation},
year={2001},
volume={E84-A},
number={3},
pages={884-892},
abstract={This paper presents a fast algorithm for calculating box splines sampled at regular intervals. This algorithm is based on the representation by directional summations, while splines are often represented by convolutions. The summation-based representation leads less computational complexity: the proposed algorithm requires fewer additions and much fewer multiplications than the algorithm based on convolutions. The proposed algorithm is evaluated in the sense of the number of additions and multiplications for three- and four-directional box splines to see how much those operations are reduced.},
keywords={},
doi={},
ISSN={},
month={March},}
부
TY - JOUR
TI - A New Formulation for Discrete Box Splines Reducing Computational Cost and Its Evaluation
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 884
EP - 892
AU - Takeshi ASAHI
AU - Koichi ICHIGE
AU - Rokuya ISHII
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2001
AB - This paper presents a fast algorithm for calculating box splines sampled at regular intervals. This algorithm is based on the representation by directional summations, while splines are often represented by convolutions. The summation-based representation leads less computational complexity: the proposed algorithm requires fewer additions and much fewer multiplications than the algorithm based on convolutions. The proposed algorithm is evaluated in the sense of the number of additions and multiplications for three- and four-directional box splines to see how much those operations are reduced.
ER -