2019
DOI: 10.3390/app9142808
|View full text |Cite
|
Sign up to set email alerts
|

An Improved Optical Flow Algorithm Based on Mask-R-CNN and K-Means for Velocity Calculation

Abstract: Aiming at enhancing the accuracy and reliability of velocity calculation in vision navigation, an improved method is proposed in this paper. The method integrates Mask-R-CNN (Mask Region-based Convolutional Neural Network) and K-Means with the pyramid Lucas Kanade algorithm in order to reduce the harmful effect of moving objects on velocity calculation. Firstly, Mask-R-CNN is used to recognize the objects which have motions relative to the ground and covers them with masks to enhance the similarity between pix… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 14 publications
(8 citation statements)
references
References 38 publications
0
8
0
Order By: Relevance
“…Considering the fact that the maceral components within each group mostly are not adjacent to each other and the gray scale values are the major difference between maceral groups, we adopt the gray scale values of each pixel as the features. K-means clustering, one of the most favorable clustering techniques, is utilized for its simplicity and computational efficiency [21,22].…”
Section: Image Segmentation Based On Two-level Clusteringmentioning
confidence: 99%
“…Considering the fact that the maceral components within each group mostly are not adjacent to each other and the gray scale values are the major difference between maceral groups, we adopt the gray scale values of each pixel as the features. K-means clustering, one of the most favorable clustering techniques, is utilized for its simplicity and computational efficiency [21,22].…”
Section: Image Segmentation Based On Two-level Clusteringmentioning
confidence: 99%
“…According to the horn&schunck optical ow algorithm of gradient, an improved optical ow method of Gaussian pyramid is proposed in the literature. This method combines the moving target segmentation with the maximum interclass variance and mathematical morphology operation, and carries out HS calculation, which effectively reduces the number of iterations of optical ow calculation, improves the detection e ciency of the algorithm, and basically meets the requirements of real-time [7][8]. Aiming at the problem of slow convergence of Gaussian mixture model, an improved algorithm is proposed to improve the convergence rate without affecting the stability of the model.…”
Section: Related Workmentioning
confidence: 99%
“…K-means clustering is a clustering algorithm whose main objective is to group elements or similar data points in a cluster [2,15,16] where K represents the number of clusters or groups. The algorithm then runs iteratively to assign each data point to one of the k groups based on the functionality already provided.…”
Section: K-means Clusteringmentioning
confidence: 99%