Box spline

From HandWiki
Revision as of 18:17, 6 February 2024 by WikiEd2 (talk | contribs) (fixing)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Short description: Generalization of basis splines (B-splines) to multiple variables

In the mathematical fields of numerical analysis and approximation theory, box splines are piecewise polynomial functions of several variables.[1] Box splines are considered as a multivariate generalization of basis splines (B-splines) and are generally used for multivariate approximation/interpolation. Geometrically, a box spline is the shadow (X-ray) of a hypercube projected down to a lower-dimensional space.[2] Box splines and simplex splines are well studied special cases of polyhedral splines which are defined as shadows of general polytopes.

Definition

A box spline is a multivariate function [math]\displaystyle{ (\mathbb{R}^d \to \mathbb{R}) }[/math] defined for a set of vectors, [math]\displaystyle{ \xi \in \mathbb{R}^d, }[/math] usually gathered in a matrix [math]\displaystyle{ \mathbf{\Xi} := \left[\xi_1 \dots \xi_N\right]. }[/math]

When the number of vectors is the same as the dimension of the domain (i.e., [math]\displaystyle{ N = d }[/math]) then the box spline is simply the (normalized) indicator function of the parallelepiped formed by the vectors in [math]\displaystyle{ \mathbf{\Xi} }[/math]:

[math]\displaystyle{ M_{\mathbf{\Xi}}(\mathbf{x}) := \frac{1}{\mid{\det{\Xi}}\mid}\chi_{\mathbf{\Xi}}(\mathbf{x}) = \begin{cases} \frac{1}{\mid{\det{\Xi}}\mid} &\text{if } \mathbf{x} = \sum_{n=1}^d{t_n \xi_n} \text{ for some } 0 \le t_n \lt 1 \\ 0 & \text{otherwise}.\end{cases} }[/math]

Adding a new direction, [math]\displaystyle{ \xi, }[/math] to [math]\displaystyle{ \mathbf{\Xi}, }[/math] or generally when [math]\displaystyle{ N \gt d, }[/math] the box spline is defined recursively:[1]

[math]\displaystyle{ M_{\mathbf{\Xi} \cup \xi}(\mathbf{x}) = \int_0^1 M_{\mathbf{\Xi}}(\mathbf{x}- t \xi) \, {\rm d}t. }[/math]
Examples of bivariate box splines corresponding to 1, 2, 3 and 4 vectors in 2-D.

The box spline [math]\displaystyle{ M_{\mathbf{\Xi}} }[/math] can be interpreted as the shadow of the indicator function of the unit hypercube in [math]\displaystyle{ \mathbb{R}^N }[/math] when projected down into [math]\displaystyle{ \mathbb{R}^d. }[/math] In this view, the vectors [math]\displaystyle{ \xi \in \mathbf{\Xi} }[/math] are the geometric projection of the standard basis in [math]\displaystyle{ \mathbb{R}^N }[/math] (i.e., the edges of the hypercube) to [math]\displaystyle{ \mathbb{R}^d. }[/math]

Considering tempered distributions a box spline associated with a single direction vector is a Dirac-like generalized function supported on [math]\displaystyle{ t\xi }[/math] for [math]\displaystyle{ 0 \le t \lt 1 }[/math]. Then the general box spline is defined as the convolution of distributions associated the single-vector box splines:

[math]\displaystyle{ M_{\mathbf{\Xi}} = M_{\xi_1} \ast M_{\xi_2} \ast \dots \ast M_{\xi_N}. }[/math]

Properties

  • Let [math]\displaystyle{ \kappa }[/math] be the minimum number of directions whose removal from [math]\displaystyle{ \Xi }[/math] makes the remaining directions not span [math]\displaystyle{ \mathbb{R}^d }[/math]. Then the box spline has [math]\displaystyle{ \kappa-2 }[/math] degrees of continuity: [math]\displaystyle{ M_{\mathbf{\Xi}} \in C^{\kappa-2}(\mathbb{R}^d) }[/math].[1]
  • When [math]\displaystyle{ N\ge d }[/math] (and vectors in [math]\displaystyle{ \Xi }[/math] span [math]\displaystyle{ \mathbb{R}^d }[/math]) the box spline is a compactly supported function whose support is a zonotope in [math]\displaystyle{ \mathbb{R}^d }[/math] formed by the Minkowski sum of the direction vectors [math]\displaystyle{ \xi \in \mathbf{\Xi} }[/math].
  • Since zonotopes are centrally symmetric, the support of the box spline is symmetric with respect to its center: [math]\displaystyle{ \mathbf{c}_\Xi := \frac{1}{2}\sum_{n=1}^N \xi_n . }[/math]
  • Fourier transform of the box spline, in [math]\displaystyle{ d }[/math] dimensions, is given by
[math]\displaystyle{ \hat{M}_\Xi(\omega) = \exp(-j\mathbf{c}_{\Xi}\cdot\omega) \prod_{n=1}^N \operatorname{sinc}(\xi_n\cdot\omega). }[/math]

Applications

For applications, linear combinations of shifts of one or more box splines on a lattice are used. Such splines are efficient, more so than linear combinations of simplex splines, because they are refinable and, by definition, shift invariant. They therefore form the starting point for many subdivision surface constructions.

Box splines have been useful in characterization of hyperplane arrangements.[3] Also, box splines can be used to compute the volume of polytopes.[4]

In the context of multidimensional signal processing, box splines can provide multivariate interpolation kernels (reconstruction filters) tailored to non-Cartesian sampling lattices,[5] and crystallographic lattices (root lattices) that include many information-theoretically optimal sampling lattices.[6] Generally, optimal sphere packing and sphere covering lattices[7] are useful for sampling multivariate functions in 2-D, 3-D and higher dimensions.[8] In the 2-D setting the three-direction box spline[9] is used for interpolation of hexagonally sampled images. In the 3-D setting, four-direction[10] and six-direction[11] box splines are used for interpolation of data sampled on the (optimal) body-centered cubic and face-centered cubic lattices respectively.[5] The seven-direction box spline[12] has been used for modelling surfaces and can be used for interpolation of data on the Cartesian lattice[13] as well as the body centered cubic lattice.[14] Generalization of the four-[10] and six-direction[11] box splines to higher dimensions[15] can be used to build splines on root lattices.[16] Box splines are key ingredients of hex-splines[17] and Voronoi splines[18] that, however, are not refinable.

Box splines have found applications in high-dimensional filtering, specifically for fast bilateral filtering and non-local means algorithms.[19] Moreover, box splines are used for designing efficient space-variant (i.e., non-convolutional) filters.[20]

Box splines are useful basis functions for image representation in the context of tomographic reconstruction problems as the spline spaces generated by box splines spaces are closed under X-ray and Radon transforms.[21][22] In this application while the signal is represented in shift-invariant spaces, the projections are obtained, in closed-form, by non-uniform translates of box splines.[21]

In the context of image processing, box spline frames have been shown to be effective in edge detection.[23]

References

  1. ↑ 1.0 1.1 1.2 Boor, C.; Höllig, K.; Riemenschneider, S. (1993). Box Splines. Applied Mathematical Sciences. 98. doi:10.1007/978-1-4757-2244-4. ISBN 978-1-4419-2834-4. 
  2. ↑ Prautzsch, H.; Boehm, W.; Paluszny, M. (2002). "Box splines". Bézier and B-Spline Techniques. Mathematics and Visualization. pp. 239–258. doi:10.1007/978-3-662-04919-8_17. ISBN 978-3-642-07842-2. 
  3. ↑ De Concini, C.; Procesi, C. (2010). Topics in Hyperplane Arrangements, Polytopes and Box-Splines. doi:10.1007/978-0-387-78963-7. ISBN 978-0-387-78962-0. http://swbplus.bsz-bw.de/bsz333462971inh.htm. 
  4. ↑ Xu, Z. (2011). "Multivariate splines and polytopes". Journal of Approximation Theory 163 (3): 377–387. doi:10.1016/j.jat.2010.10.005. 
  5. ↑ 5.0 5.1 Entezari, Alireza. Optimal sampling lattices and trivariate box splines. [Vancouver, BC.]: Simon Fraser University, 2007. <http://summit.sfu.ca/item/8178>.
  6. ↑ Kunsch, H. R.; Agrell, E.; Hamprecht, F. A. (2005). "Optimal Lattices for Sampling". IEEE Transactions on Information Theory 51 (2): 634. doi:10.1109/TIT.2004.840864. https://research.chalmers.se/en/publication/11977. 
  7. ↑ J. H. Conway, N. J. A. Sloane. Sphere packings, lattices and groups. Springer, 1999.
  8. ↑ Petersen, D. P.; Middleton, D. (1962). "Sampling and reconstruction of wave-number-limited functions in N-dimensional euclidean spaces". Information and Control 5 (4): 279. doi:10.1016/S0019-9958(62)90633-2. 
  9. ↑ Condat, L.; Van De Ville, D. (2006). "Three-directional box-splines: Characterization and efficient evaluation". IEEE Signal Processing Letters 13 (7): 417. doi:10.1109/LSP.2006.871852. Bibcode: 2006ISPL...13..417C. http://infoscience.epfl.ch/record/130318/files/condat0601.pdf. 
  10. ↑ 10.0 10.1 Entezari, A.; Van De Ville, D.; Moller, T. (2008). "Practical Box Splines for Reconstruction on the Body Centered Cubic Lattice". IEEE Transactions on Visualization and Computer Graphics 14 (2): 313–328. doi:10.1109/TVCG.2007.70429. PMID 18192712. http://infoscience.epfl.ch/record/130345/files/entezari0801.pdf. 
  11. ↑ 11.0 11.1 Minho Kim, M.; Entezari, A.; Peters, Jorg (2008). "Box Spline Reconstruction on the Face-Centered Cubic Lattice". IEEE Transactions on Visualization and Computer Graphics 14 (6): 1523–1530. doi:10.1109/TVCG.2008.115. PMID 18989005. 
  12. ↑ Peters, Jorg; Wittman, M. (1997). "Box-spline based CSG blends". Proceedings of the fourth ACM symposium on Solid modeling and applications - SMA '97. pp. 195. doi:10.1145/267734.267783. ISBN 0897919467. https://archive.org/details/proceedings0000symp_g3s1/page/195. 
  13. ↑ Entezari, A.; Moller, T. (2006). "Extensions of the Zwart-Powell Box Spline for Volumetric Data Reconstruction on the Cartesian Lattice". IEEE Transactions on Visualization and Computer Graphics 12 (5): 1337–1344. doi:10.1109/TVCG.2006.141. PMID 17080870. 
  14. ↑ Minho Kim (2013). "Quartic Box-Spline Reconstruction on the BCC Lattice". IEEE Transactions on Visualization and Computer Graphics 19 (2): 319–330. doi:10.1109/TVCG.2012.130. PMID 22614329. 
  15. ↑ Kim, Minho. Symmetric Box-Splines on Root Lattices. [Gainesville, Fla.]: University of Florida, 2008. <http://uf.catalog.fcla.edu/permalink.jsp?20UF021643670>.
  16. ↑ Kim, M.; Peters, Jorg (2011). "Symmetric box-splines on root lattices". Journal of Computational and Applied Mathematics 235 (14): 3972. doi:10.1016/j.cam.2010.11.027. 
  17. ↑ Van De Ville, D.; Blu, T.; Unser, M.; Philips, W.; Lemahieu, I.; Van De Walle, R. (2004). "Hex-Splines: A Novel Spline Family for Hexagonal Lattices". IEEE Transactions on Image Processing 13 (6): 758–772. doi:10.1109/TIP.2004.827231. PMID 15648867. Bibcode: 2004ITIP...13..758V. http://miplab.unige.ch/pub/vandeville0402.pdf. 
  18. ↑ Mirzargar, M.; Entezari, A. (2010). "Voronoi Splines". IEEE Transactions on Signal Processing 58 (9): 4572. doi:10.1109/TSP.2010.2051808. Bibcode: 2010ITSP...58.4572M. 
  19. ↑ Baek, J.; Adams, A.; Dolson, J. (2012). "Lattice-Based High-Dimensional Gaussian Filtering and the Permutohedral Lattice". Journal of Mathematical Imaging and Vision 46 (2): 211. doi:10.1007/s10851-012-0379-2. 
  20. ↑ Chaudhury, K. N.; MuñOz-Barrutia, A.; Unser, M. (2010). "Fast Space-Variant Elliptical Filtering Using Box Splines". IEEE Transactions on Image Processing 19 (9): 2290–2306. doi:10.1109/TIP.2010.2046953. PMID 20350851. Bibcode: 2010ITIP...19.2290C. 
  21. ↑ 21.0 21.1 Entezari, A.; Nilchian, M.; Unser, M. (2012). "A Box Spline Calculus for the Discretization of Computed Tomography Reconstruction Problems". IEEE Transactions on Medical Imaging 31 (8): 1532–1541. doi:10.1109/TMI.2012.2191417. PMID 22453611. http://bigwww.epfl.ch/publications/entezari1201.pdf. 
  22. ↑ Entezari, A.; Unser, M. (2010). "A box spline calculus for computed tomography". 2010 IEEE International Symposium on Biomedical Imaging: From Nano to Macro. pp. 600. doi:10.1109/ISBI.2010.5490105. ISBN 978-1-4244-4125-9. http://infoscience.epfl.ch/record/211450. 
  23. ↑ Guo, W.; Lai, M. J. (2013). "Box Spline Wavelet Frames for Image Edge Analysis". SIAM Journal on Imaging Sciences 6 (3): 1553. doi:10.1137/120881348. https://zenodo.org/record/894468. 



Retrieved from "https://handwiki.org/wiki/index.php?title=Box_spline&oldid=3371554"