EMBEDDED IMAGE ENHANCEMENT WITH
SPARSE TENSOR
Ramya P1 , Dr. S N Chandrashekar2
IV SEM, M.Tech, Dept. of CSE, SJCIT, Chickballapur, India,ramyapgowda100@gmail.com
2
HOD, Dept. of CSE, SJCIT, Chickballapur, India, snc_chandru@yahoo.co.in
1
Abstract - The process of obtaining the high resolution
image from one or more low resolution image is called as
Super Resolution. Much technology has been evolved to go
with the super resolution image, but the drawback observed
here is, they are not watching a similar construction in both
the high resolution and low resolution icons. To defeat this
default, bringing forward an approach called a Double
structure
neighbor
embedding
approach.
Tensor
investigation, extension of arithmetic concerned with
relations or laws that stay legitimate paying little regard to
the arrangement of focal points used to limit the sum of
moneys. Such relations are called covariant. Tensors were
concocted as an expansion of vectors to formalize the control
of geometric substances emerging in the investigation of
numerical manifolds. In this undertaking, considering that
fixes are a situated of information with multiview attributes
and spatial association, I propel a Sparse Tensor Based
Image Interpolation approach for single image super
resolution. In STB, multiview gimmicks and neighborhood
spatial neighbors of patches are investigated to discover a
peculiarity spatial complex installing for pictures. I receive a
geometrically persuaded presumption that for each one
patch there exists a little neighborhood in which just the
fixes that originate from the same peculiarity spatial
complex, will lie give or take in low-dimensional relative
subspace planned by inadequate neighbors. Remembering
the final target to come up the lacking neighbors, Sparse
Tensor Based Image Interpolation interest estimation is
advanced to comprehend a joint insufficient coding of
contrivance spatial picture tensors.
considered to be directly spoken to by its k nearest neighbors
in a nearby locale, and the low-dimensional inserting is
ascertained by the closest neighbors and their weights [20]. In
Chang's strategy [4], the creators expected that LR patches and
HR patches structure manifolds with comparable
neighborhood geometry in two different places. At that point
LLE is acquainted with gauge HR fixes by weightedly joining
k hopeful HR patches chose from the prep classes. Contrast
with the customary interjection based Single Image SuperResolution (SISR) approaches, the NE-based SISR system and
its variations have demonstrated better speculation capacity
for an categorization of pictures [4–6], [21–25].
The preservation of the nearby geometry of data in the
implanting space is extremely trying for the inborn poorly
postured trademark of SISR. The huge majority of accessible
NE-based SISR strategies [4] –[6] accept that utilizing firstrequest and second-request inclinations as LR gimmicks can
better safeguard the nearby geometry of HR patches.
However, fixes from true pictures are diverse to the point that
fixes will lie in various manifolds or subspecies of perhaps
distinctive measurements, and thus manifolds may be close to
one another and have subjective measurements and arch [9],
[11–13], [16], [25]. In this style, picture patches don't entirely
get over the comparative structure in a single LR gimmick
space and HR picture space, which prompts an erroneous LLE
and a predisposition to the picture rebuilding. Fig.1 delineates
the befuddle of the complex social system of picture patches
in the LR-to-HR mapping.
Keywords—Double structure neighbor, Sparse Tensor,
gimmick spatial feature, Sparse coding.
I. INTRODUCTION
IN THE most recent decade, there have expanded hobbies
in combining another High-Resolution (HR) picture by
utilizing one Low-Resolution (LR) picture and an arrangement
of cases [1], including k-closest neighbors combination
calculations [2–6], scanty coding calculations [7–11], scanty
relapse calculations [12–14], likeness toward oneself learning
calculations [15] –[19], thus on. Ace of the agent works is the
Neighbors Embedding (NE) strategy [4] that creates HR
patches by means of Locally Linear Embedding (LLE) [20].
LLE is a remarkable complex learning strategy whose aim is
to find a low-dimensional inserting that best jelly the
neighborhood geometry of the picture. Every datum is
Fig. 1. Manifolds near to one another and have subjective measurements
II. RELATED WORK
A few works have been aimed to defeat the confound of
the complex social system of picture fixes in the LR-to-HR
mapping. Case in point, the paper [26] introduced a projection
network learning way to safeguard the natural geometric
complex structure of HR picture patches, by utilizing a by
regional standard smooth limitation as a former learning of
reproduction. Report [27] proposed an enhanced implanting
strategy for face mind, flight by fusing the position earlier of
the typeface and the neighborhood geometry of HR patch
complex, however it is restrained by the position earlier of
face, so it couldn't be specifically exchanged for common
images. It is noteworthy that the arbitrarily created picture
patches are diverse to the peak that they will lie in different
manifolds [9], [11–13], [16], [25].
In the case that the manifolds are near to one another, for
instance, two manifolds M1 and M2 in Fig.1, then the k
nearest neighbors of a picture patch p fits in with M1, will
originate from an alternate complex, M2. At the point when k
closest neighbors are used to blend the HR patch, it will
prompt an undeniable inclination to the facts of life, in light of
the fact that just the neighbors in M1 compass a 1D subspace
around the patch [28].
Fig. 2. Demonstration of the deviation of locally neighbor embedding.
(a) PSNR = 20.37 dB (b) PSNR = 29.40 dB
Fig.2 (a) demonstrates a LR picture patch pLR and its five
1
5
neighbors { NBLR
} found by the main request and
.....NBLR
second-request inclinations in Chang's system, what's more the
second line demonstrates the five comparing HR patches of
the LR neighbors. Fig.2 (b) shows the HR picture patch what's
more its five neighbors {} found in the HR space, furthermore,
the PSNR by utilizing HR neighbors from (a) and (b)
separately are calculated, from which we can understand that
the five HR neighbors in Fig.2 (a) and Fig.2 (b) are extremely
differing, which holds in the irregularity of the complex social
system in a LR-HR mapping.e in a LR-HR mapping.
With a specific end goal to beat this crisscross of complex
construction, numerous changes on NE-based SISR strategies
have been offered, which can be separated into two categories.
III. PROPOSED WORK
3.1 Enhanced Neighbors Embedding and Neighbor
Selection The area issue in SISR also demonstrated that the
luminance quality can better reveal the complex social system
of HR patches and got on a viable learnt picture primitive
model by dissecting the nearby structure in a Mid-Recurrence
(MR) - to - High - Recurrence (HR) function. In utilizing
peculiarity choice to enhance the recuperation precision of LR
patches. With extremely later works, coupled requirements
based joint learning is progressing for better inserting and a
versatile inadequate implanting is introduced.
3.2. Refined Training Data Set
A few works utilized the refined preparing patches to make
the manifolds take after the comparative structure. Here
outlined a Hog peculiarity based subset choice to refine the
dataset by erasing some anomaly fixes, which works
admirably on characteristic pictures. The preparation patches
are refined through edge discovery and bunching calculation is
employed to anticipate class mark in the neighborhood look,
where the preparing patches are partitioned into diverse
gatherings and one and only gathering is embraced for
discovering an implanting. Albeit numerous endeavors have
been tackled discovering the ideal inserting manifolds and
neighbors in these deeds, two issues ought to be tended to for
enhancing accessible NE-based SISR approaches:
3.2.1 Images Patches Have Multiview and
Heterogeneous Representations: It is extraordinary that
fractional representation of fixes just permits discovering
neighbors in a peculiar kind of LR peculiarity space, where
picture patches don't entirely take over the comparable
structure to that of HR patches. In numerous true situations,
every article can be depicted by numerous sets of peculiarities,
where every peculiarity depicts a view of the same system of
basic articles. One peculiarity that condenses a patch can be
reckoned as a perspective of the picture patch, what's more
discovering multiview representation that describes the patch
character heterogeneously and incorporating them into a
bound together representation for ensuing transforming, is a
guaranteeing brand in picture handling [29]. Later, a complete
what's more native representation of patches will assist to
better expose the hidden complex structure. To discover better
installing complex, the corresponding data of different
distinctive features can be decently investigated, to uncover
distinctive physical implications and actual properties of
spells.
3.2.2 Images Patches Are a Collection of Data with
Spatial Association: Images patches are not just a situated of
tests be that as it may likewise information with some spatial
association. A few specialists have demonstrated that a
neighborhood a characteristic picture can be seen as a
stationary methodology, which can be decently demonstrated
via Autoregressive (AR) models [12] –[13]. At that place are
frequently numerous tedious picture structures (or
resemblance toward oneself) in a picture [15], [16]. At the
point when pictures are divided into little fixes, the spells are
self-comparative in a nearby area, that is, a picture patch has
been regularly like its neighbor patches focused around it [17]
–[19]. Thus, these comparative patches have the comparative
neighbors in the complex installing and neighbor look. Despite
the fact that this self-comparative trademark has been every
now and again utilized as a component of other SISR
approaches [15] –[19], it is once in a while investigated in
accessible NE based SISR strategies. Summarily, picture
patches have inalienable geometric structure in both the
hidden motive characteristic space and the spatial arena.
Hence as to identify a low-dimensional inserting that will jam
the nearby geometry of image patches, in this report we
investigate this double geometric structure in the feature
spatial area, to propel another Double Structure Neighbor
Embedding (DSNE) approach for SISR. In DSNE, multiview
peculiarities and neighborhood spatial neighbors of patches
are investigated to find a gimmick spatial complex implanting
for pictures. We utilize the geometrically propelled
presumption that for each fix there exists a little neighborhood
in which just the patches that start from the same peculiarity
spatial complex, will lie give or get in a low-dimensional
relative subspace. In summation, the flex of the composite and
the thickness of pieces may be distinctive in diverse locales,
for example, district 1 what's more locale 2 in M1 in Fig.1.
Subsequent fixes can be meagerly coded to consequently
select a pair of neighbors that compass a low-dimensional
relative subspace passing close the patches, and expose the
natural dimensionality of the fundamental manifolds. In our
study, seeing the presence of the double geometric structure in
both the peculiarity space and spatial space, LR patches and
their spatial neighbors are together coded by native
characteristic lexicons. Patches and coding coefficients are
spoken to by a peculiarity spatial picture tensor and a scanty
coefficient tensor individually [30], and a Sparse Tensor
Based Image Interpolation
calculation is progressing for
discovering the scanty inserting neighbors. The remainder of
this report is organized as takes after. In Section II, we detail
the DSNE system and the examinations what's more test
results are presented in Section III. The finish is at long last
displayed in Section IV.
Also, two new gimmicks are characterized, i.e., Pixel
Deviation (PD) and Laplace Gradient (LG) characteristics,
f5 = 9Z33 -
∑
Z ij ,
i = 2 , 3, 4 j = 2 , 3, 4
f 6 = 4Z 33 - Z 43 - Z 23 - Z 34 - Z 32
The two peculiarities take the inconsistencies of diverse
bearings also, qualities of patches into the book. So the
peculiarities can depict the variety of pixels in a neighborhood
window, also, the variation along the cross heading separately.
The PD peculiarity can recognize smooth patches from
patches with compositions and edges, and the LG peculiarity
can catch the natty gritty data in the flat and vertical headings.
The channels that concentrate these native peculiarities are
indicated in Fig.3 (b) -(g). The peculiarities of every last one
of pixels in a picture patch are victimized to form different
gimmick vectors f i (i = 1, . . . , 6)
IV. DOUBLE STRUCTURE NEIGHBOR EMBEDDING(DSNE) WITH
SPARSE TENSOR
In this region, we first endeavor multiview gimmicks to
make strides the protection of the area relationship between
LR what's more HR patches. At that level the double
geometric structure is investigated in the complex learning, to
plan a Double Structure Neighbor Embedding (DSNE)
through Sparse Tensor Based Image Interpolation calculation,
which is numerically detailed in point of interest.
A. Multiview Features
Every picture patch can be legitimately portrayed by
various visual gimmicks, and numerous perspectives are
available and integral to one another. A perspective of patches
alludes to a kind of peculiarity that compresses a particular
normal for the information. Case in point, Chang's [4]
calculation utilized the first and foremost request and secondrequest slope as the LR characteristics. Su et al. [21]
demonstrated that slope gimmicks couldn't uncover the
information structure, while the illuminance estimation of
pictures can better express fixes structure. Chan et al. [25]
suggested a standard peculiarity for portraying picture patches.
In this country, a multiview peculiarity set of picture patches
is characterized. For the pixel Z 33 in a 5×5 patch in Fig.3 (a),
the first arrangement of peculiarities is made by first-request
inclinations.
f1 = ∇x =Z 34 - Z 32 , f 2 = ∇y =Z 43 - Z 23
which portrays the arched and the sunken trademark around,
Z 33 .
f 3 = ∇2x = Z 35 - 2Z 33 + Z 31 , f 4 = ∇2x = Z 53 - 2Z 33 + Z13
Fig. 3. Multiview features. (a) Pixels Z33. (b) f1. (c) f2. (d) f3.
(e) f4. (f) f5. (g) f6
ALGORITHM
: Sparse Tensor Based Image Interpolation
Inputs:
ILR, D, β, γ, σ, T
Preprocessing:
Gradient computation and edge regions detection:
gx, gy: Gradient in x and y direction
gmag: Normalized magnitude of the gradient in range [0,100]
IE: Image's edge map, using threshold T
Structure tensor computation:
Defining the Gaussian filter using σ;
Computing d , d ⊥ , V , V ⊥
Interpolation:
For i=D+1 to M-D with step=1/2
For j=D+1 to N-D with step=1/2
If [i] = i and [j] = j
IHR (2i-1, 2j-1) =ILR (I, J);
Else if C= ([ms], [ns]) is in uniform region or
is a corner point
Bilinear Interpolation;
Structures can be determined as one of three types:
Else
IHR (2ms-1, 2ns-1)
• Constant areas: d ⊥ ≈ d ≈ 0
End
End
End
• Edges: d ⊥ ≫ d ≈ 0
• Corners: d ⊥ ≈ d ≫ 0
Quirk protecting picture addition is an element run in
picture taking care of the area. In this paper another direct
edge composed picture super-determination figuring in
perspective of structure tensors is proposed. Using an isotropic
Gaussian channel, the structure tensor at each pixel of the data
picture is estimated and the pixels are portrayed to three
separate classes; uniform region, corners and edges, as
indicated by the eigenvalues of the structure tensor. In light of
the use of the isotropic Gaussian channel, the portrayal is
lively to noise showed in the video. In the view of the
diversion eigenvector of the structure tensor, the edge heading
is dead situated and used for contribution along the borders. In
examination to a couple past edge facilitated picture addition
strategies, the proposed procedure finishes higher quality in
both subjective and objective positions. Similarly the proposed
strategy outmaneuvers past schedules in the occasion of
uproarious and JPEG compacted pictures. Likewise, without
the necessity to advance at the same time, the computation can
achieve higher rate.
Local Neighborhood structure tensors have been used as a
part of picture transforming to take care of matters, for
example, anisotropic sifting [21, 22] and movement location
[23]. This technique uses the slope data of a picture so as to
focus the introduction data on the boundaries and recesses.
The structure tensor is defined equally
Tσ =
g x2 * Gσ
g x g y * Gσ
2
y
g y g x * Gσ
g * Gσ
=
T11 T12
T21 T22
Where Gσ is a Gaussian function with standard deviation
σ, and g x and g y are horizontal and vertical components of
the gradient vector at each pixel respectively. Since the matrix
Tσ is symmetric and positive semi-definite, it has two
orthogonal eigenvectors as follows:
V= (T22-T11+ (T22 _ T11 )2 + 4T122 ), and normalized as: V = V
V
V ⊥ =(T22-T11+
(T22 _ T11 )2 + 4T122
⊥
),and normalized as V ⊥ = V ⊥
V
The corresponding eigenvalues for each eigenvector are as
follows:
d = 1 (T22+T11- (T22 _ T11 )2 + 4T122 )
2
d ⊥ = 1 (T22+T11+
2
(T22 _ T11 )2 + 4T122
)
Apparently the eigenvalues d is smaller than d ⊥Based on the
two eigenvalues, local
For edge points, the eigenvector v corresponding to the
smaller eigenvalues is along the edge (tangent direction),
⊥
while the eigenvector v is across the edge (normal
direction).
Albeit utilizing inclination vectors as a portion of a picture
can focus the edge introductions as well, in that respect are
some different favorable circumstances in utilizing structure
tensors contrasted with slope vectors alone. Initially, the edges
in a characterization may not be smooth and nonstop,
particularly in a down-examined the photographs. With the
Gaussian sifting of the inclination vectors in an arena, as
ascertained in the significance of the structure tensor, one can
get more hearty and exact idea of edge introductions. Second,
the structure tensor can order neighborhood highlights into a
few unmistakable sorts, which is nontrivial by utilizing angle
vectors alone. This starts to be more observable when a threedimensional picture or billow of focus is being taken. Also as
a termination of the Gaussian sifting stage, the edge
introduction attained to by structure tensor is more powerful
against clamor.
V. CONCLUSION
In this report, we suggest a novel Double Structure Neighbor
Embedding (DSNE) With Sparse Tensor approach by looking
into the geometric structure in both the specialty area and
spatial distance. Multiview peculiarities of picture patches and
their spatial neighbors are mutually scantily coded, by way of
a tensor-synchronous orthogonal coordinating interest
calculation. DSNE is trademark of basic standard for it doesn't
award any extra regulars in the rebuilding, which is distinctive
with most of the best in class SISR approaches. To boot, it is
moreover normal for doing able acknowledgment for
propelling a Sparse Tensor Based Image Interpolation to
consequently select inserted neighbors. Some examinations
are taking on some benchmark pictures, and the recouped
results show that DSNE is similar to some best in class SISR
approaches without extra regulars. Also, both the motive
gimmick and nearby spatial neighbors of patches can help to
find out more precise installing. Too huge a spatial neighbor
locale will corrupt the recuperation results, while the quantity
of neighbors in the peculiarity space and the quantity of the
greatest cycles in Sparse Tensor Based Image Interpolation
have less shock on the reformation. In DSNE, the degradation
method for test pictures is the same with that of preparing
word reference sets, which is a terminal point of the proposed
technique. In future work, we will further take more efforts on
breaking this impediment and regularizing the recuperation
process, to accomplish exact intensification of lowdetermination pictures.
REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]
[11]
[12]
[13]
[14]
[15]
[16]
[17]
[18]
[19]
[20]
S. C. Park, M. K. Park, and M. G. Kang, “Super-resolution image
reconstruction: A technical overview,” IEEE Signal Process. Mag., vol.
20, no. 3, pp. 21–36, May 2003.
W. T. Freeman, T. R. Jones, and E. C. Pasztor, “Example-based. superresolution,” IEEE Comput. Graph. Appl., vol. 22, no. 2, pp. 56–65,
Mar./Apr. 2002.
I.S. Jac J. Sun, N.-N. Zheng, H. Tao, and H.-Y. Shum, “Image
hallucinationwith primal sketch priors,” in Proc. IEEE Comput. Soc.
Conf. CVPR, Jun. 2003, pp. 729–736.
H. Chang, D.-Y. Yeung, and Y. Xiong, “Super-resolution through
neighbor embedding,” in Proc. IEEE Comput. Soc. Conf. CVPR,
Jun./Jul. 2004, pp. 1– 6.
A. Eftekhari, H. A. Moghaddam, and M. Babaie-Zadeh, “k/Knearestneighborhood criterion for improving locally linear embedding,”
in Proc. 6th Int. Conf. CGIV, Aug. 2009, pp. 392–397.
K. Zhang, X. Gao, D. Tao, and X. Li, “Single image superresolutionwith sparse neighbor embedding,” IEEE Trans. Image
Process., vol. 21,no. 7, pp. 3194–3205, Jul. 2012.
R. Zeyde, M. Elad, and M. Protter, “On single image scale-upusing
sparse-representations,” in Proc. 7th Int. Conf. Curves Surfaces, Jun.
2010, pp. 711–730.
J. Yang, J. Wright, T. S. Huang, and Y. Ma, “Image super-resolution via
sparse representation,” IEEE Trans. Image Process., vol. 19, no. 11,pp.
2861–2873, Nov. 2010.
S. Yang, M. Wang, Y. Chen, and Y. Sun, “Single-image superresolution reconstruction via learned geometric dictionaries and
clustered sparse coding,” IEEE Trans. Image Process., vol. 21, no. 9, pp.
4016–4028, Sep. 2012.
A. Marquinaand and S. J. Osher, “Image super-resolution by TVregularization and Bregman iteration,” J. Sci. Comput., vol. 37, no. 3,pp.
367–382, Dec. 2008.
S. Yang, Z. Liu, M. Wang, F. Sun, and L. Jiao, “Multitask dictionary
learning and sparse representation based single-image super-resolution
reconstruction,” Neurocomputing, vol. 74, no. 17, pp. 3193–3203, 2011.
Y. Tang, Y. Yuan, P. Yan, and X. Li, “Single-image super-resolution via
sparse coding regression,” in Proc. IEEE Int. Conf. Image Graphics,
Aug. 2011, pp. 267–272.
K. I. Kim and Y. Kwon, “Single-image super-resolution using
sparseregression and natural image prior,” IEEE Trans. Pattern Anal.
Mach. Intell., vol. 32, no. 6, pp. 1127–1133, Jun. 2010.
D. Glasner, S. Bagon, and M. Irani, “Super-resolution from a single
image,” in Proc. IEEE Int. Conf. Comput. Vision, Sep./Oct. 2009, pp.
349–356.
K. Zhang, X. Gao, D. Tao, and X. Li, “Single image superresolutionwith multiscale similarity learning,” IEEE Trans. Neural
Netw. Learn. Syst., vol. 24, no. 10, pp. 1648–1659, Oct. 2013.
X. Gao, K. Zhang, X. Li, and D. Tao, “Joint learning for singleimagesuper-resolution via a coupled constraint,” IEEE Trans. Image
Process.,vol. 21, no. 2, pp. 469–480, Feb. 2012.
W. Dong, D. Zhang, G. Shi, and X. Wu, “Image deblurring and superresolution by adaptive sparse domain selection and adaptive
regularization,” IEEE Trans. Image Process., vol. 20, no. 7, pp. 1838–
1857, Jul. 2011.
Z. Wang, A. C. Bovik, H. R. Sheikh, and E. P. Simoncelli, “Image
quality assessment: From error visibility to structural similarity,” IEEE
Trans. Image Process., vol. 13, no. 4, pp. 600–612, Apr. 2004.
K. Zhang, X. Gao, D. Tao, and X. Li, “Single image super-resolution
with non-local means and steering kernel regression,” IEEE Trans.
Image Process., vol. 21, no. 11, pp. 4544–4556, Nov. 2012.
S. T. Roweis and L. K. Saul, “Nonlinear dimensionality reduction by
locally linear embedding,” Science, vol. 290, no. 5500, pp. 2323–2326,
2000.
[21] K. Su, Q. Tian, Q. Xue, N. Sebe, and J. Ma, “Neighborhood issue
insingle-frame image super-resolution,” in Proc. IEEE ICME, Jul. 2005,
pp. 6–8.
[22] W. Fan and D.-Y. Yeung, “Image hallucination using neighbor
embedding over visual primitive manifolds,” in Proc. IEEE Comput.
Soc. Conf. CVPR, Jun. 2007, pp. 1–7.
[23] T. M. Chan, J. Zhang, J. Pu, and H. Huang, “Neighbor embedding based
super-resolution algorithm through edge detection and feature
selection,” Pattern Recognit. Lett., vol. 30, no. 5, pp. 494–502, Apr.
2009.
[24] K. Zhang, X. Gao, X. Li, and D. Tao, “Partially supervised neighbor
embedding for example-based image super-resolution,” IEEE J. Sel.
Topics Signal Process., vol. 5, no. 2, pp. 230–239, Apr. 2011.
[25] T. M. Chan and J. Zhang, “An improved super-resolution with manifold
learning and histogram matching,” in Proc. IAPR Int. Conf. Biometrics,
2006, pp. 756–762.
[26] J. Jiang, R. Hu, Z. Han, and T. Lu, “Efficient single image superresolution via graph-constrained least squares regression,” Multimedia
Tools Appl., pp. 1–24, Jun. 2013, doi: 10.1007/s11042-013-1567-9.
[27] J. Jiang, R. Hu, Z. Han, Z. Wang, T. Lu, and J. Chen, “Localityconstraint iterative neighbor embedding for face hallucination,” in Proc.
IEEE ICME, Jul. 2013, pp. 1–6.
[28] E. Elhamifar and R. Vidal, “Sparse manifold clustering and embedding,”
in Advances in Neural Information Processing Systems. Baltimore, MD,
USA: Johns Hopkins Univ. Press, 2011.
[29] T. Xia, D. Tao, T. Mei, and Y. Zhang, “Multiview spectral embedding,”
IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 40, no. 6, pp. 1438–
1446, Dec. 2010.
[30] T. G. Kolda and W. B. Brett, “Tensor decompositions and applications,”
SIAM Rev., vol. 51, no. 3, pp. 455–500, 2009.