2014
DOI: 10.1016/j.patcog.2013.09.026
|View full text |Cite
|
Sign up to set email alerts
|

HEp-2 cells classification via sparse representation of textural features fused into dissimilarity space

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
30
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 56 publications
(30 citation statements)
references
References 31 publications
0
30
0
Order By: Relevance
“…Note that the feature description becomes rotation invariant by construction because the donuts are radially symmetric and because the shape index is based on the eigenvalues of the Hessian matrix. This contrasts the approach taken in [15], [16] where LBPs are made rotation invariant by estimating a canonical orientation and modifying the LBP accordingly. Moreover, we remark that our pooling scheme is not available for only shape index histograms since it is possible to e.g., perform a similar weighting of the contributions to the GLCM, BIF or LBP histograms.…”
Section: Discussionmentioning
confidence: 91%
See 2 more Smart Citations
“…Note that the feature description becomes rotation invariant by construction because the donuts are radially symmetric and because the shape index is based on the eigenvalues of the Hessian matrix. This contrasts the approach taken in [15], [16] where LBPs are made rotation invariant by estimating a canonical orientation and modifying the LBP accordingly. Moreover, we remark that our pooling scheme is not available for only shape index histograms since it is possible to e.g., perform a similar weighting of the contributions to the GLCM, BIF or LBP histograms.…”
Section: Discussionmentioning
confidence: 91%
“…By performing well on two datasets with different image acquisition setups, our method has demonstrated robustness towards changes in laboratory setups which are likely to occur in practice. It should be noted that the two methods that outperform shape index histograms are more complex as they rely on learning a codebook for BOVW [6], [15]; combine multiple features [15]; and learn a dissimilarity measure of features [15]. Rows are actual (true) labels.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…In real signal processing, in order to improve the processing effect and speed, such sparse data expressions are always needed. Replacing the original data by sparse approximation can not only reduce the signal processing cost fundamentally, but also greatly improve the compact efficiency [6,7]. …”
Section: Sparse Decomposition Algorithmmentioning
confidence: 99%
“…In particular, several works rely on the use of local descriptors, like the well-known local binary pattern (LBP) [3] (or its variants) and the SIFT descriptor [4]. This is the case for example of [5] where these descriptors are both used and combined with other ad hoc ones, or of [6] where the Co-occurrence of Adjacent LBP (CoALBP) has been considered in combination with SIFT. It is worth noting that CoALBP was used by the top competitor of the contest [1].…”
Section: Introductionmentioning
confidence: 99%