2019
DOI: 10.1109/tip.2018.2882926
|View full text |Cite
|
Sign up to set email alerts
|

Moving Object Detection in Video via Hierarchical Modeling and Alternating Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
28
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 26 publications
(28 citation statements)
references
References 50 publications
0
28
0
Order By: Relevance
“…This method is the underlying principle of the HOG (Histogram of Oriented Gradients) feature descriptor. The other commonly used method to count objects is through background subtraction [38]. It works on the principle of assuming that the background is static and thus the comparison of two frames can be used to identify differences.…”
Section: Artycul Prototypementioning
confidence: 99%
“…This method is the underlying principle of the HOG (Histogram of Oriented Gradients) feature descriptor. The other commonly used method to count objects is through background subtraction [38]. It works on the principle of assuming that the background is static and thus the comparison of two frames can be used to identify differences.…”
Section: Artycul Prototypementioning
confidence: 99%
“…Then, structural features of pixel-wise or region-wise spatiotemporal relationships of adjacent pixels are generally considered robust enough to video noises: temporal information that contained in object motion are extracted to assist background subtraction in [44] and the framework is then improved in [45]; in [46], spatial descriptors produced by saliency detectors are integrated with shape constraint to constrain the moving objects; a spatiotemporal slice-based SVD is proposed by Kajo et al to produce more effective tensor completion in 2018 [47]; in 2019, [20] proposes a pixel-wise short term temporal quantization way to extract detail background patches.…”
Section: Spatiotemporal Solutionsmentioning
confidence: 99%
“…These sparsity based background modeling ways have attracted more attentions in the past few years, as the sparsity constraint usually results in algorithms with stable performance and high generalization ability. Common constraints for background includes low-rank [19], rank-1 [20] and sparse coding [21]. Comparisons of the above two unsupervised ways can be queried in [22].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Thus, before the comparison between the proposed approach and other compared algorithms, the training data and pre-trained networks utilized in algorithms are discussed. The proposed approach is compared [87] 0.8200 N/A 0.6300 0.7200 0.8600 0.8400 0.7900 0.6000 0.3600 N/A 0.4600 N/A B-SSSR [26] 0.9700 0.9500 0.9300 0.7400 0.9300 0.8600 0.9200 N/A N/A N/A 0.8700 N/A MSCL-FL [25] 0.9400 0.9000 0.8600 0.8400 0.8600 0.8600 0.8800 VI, the proposed approach achieves better results in almost all these videos compared to D-DPDL [78], since the proposed approach learns the entire histogram rather than an expected value of the histogram. Unfortunately, the proposed ADNN-IBRM does not work very well for the videos "I IL 01" and "I IL 02."…”
Section: Evaluation Of Arithmetic Distribution For Background Subtractionmentioning
confidence: 99%