2017 Seventh International Conference on Image Processing Theory, Tools and Applications (IPTA) 2017
DOI: 10.1109/ipta.2017.8310130
|View full text |Cite
|
Sign up to set email alerts
|

Completed local structure patterns on three orthogonal planes for dynamic texture recognition

Abstract: Abstract-Dynamic texture (DT) is a challenging problem in computer vision because of the chaotic motion of textures. We address in this paper a new dynamic texture operator by considering local structure patterns (LSP) and completed local binary patterns (CLBP) for static images in three orthogonal planes to capture spatial-temporal texture structures. Since the typical operator of local binary patterns (LBP), which uses center pixel for thresholding, has some limitations such as sensitivity to noise and near … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
45
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
3
2

Relationship

3
2

Authors

Journals

citations
Cited by 18 publications
(45 citation statements)
references
References 36 publications
0
45
0
Order By: Relevance
“…An another variant, called LBP-TOP [13], has been also presented to overcome the curse of dimensionality of VLBP by addressing LBP on three orthogonal planes. Various extensions based on two above works have been then proposed to advance the discriminative power: CVLBC [21], CVLBP [15], CLSP-TOP [14], HLBP [16].…”
Section: Related Workmentioning
confidence: 99%
See 4 more Smart Citations
“…An another variant, called LBP-TOP [13], has been also presented to overcome the curse of dimensionality of VLBP by addressing LBP on three orthogonal planes. Various extensions based on two above works have been then proposed to advance the discriminative power: CVLBC [21], CVLBP [15], CLSP-TOP [14], HLBP [16].…”
Section: Related Workmentioning
confidence: 99%
“…k-nearest neighbors (k-NN): To be comparable with results of existing methods [14,15,16], we employ the simple of k-nearest neighbors, i.e. k = 1 (1-NN), in which chi-square (χ 2 ) measure as dissimilarity measure.…”
Section: Support Vector Machines (Svms)mentioning
confidence: 99%
See 3 more Smart Citations