# Multimedia Motion of Picking Robot Based on Cooperative Relationship of Matching Gradient Algorithm

Authors: Jinghai Han
Journal: Advances in Multimedia
 (2021)

---

## Abstract

With the continuous development of social economy, robots gradually replace human beings in many aspects of auxiliary work, but it is worth noting that orderly, accurate, and safe operation is the reasonable form of robot movement. In view of the existing limitations, this study combines the gradient matching algorithm, by using a high-precision motion matching for the visual system, improves the automation precision, and, at the same time, picking fruit image smoothing and enhancement, achieves fruit edge feature extraction; the simulation experiments proved that matching the gradient algorithm is effective and can realize the visual and actions match together and support picking robot movement.


---

## Body

## 1. Introduction

With the continuous development of artificial intelligence, computer technology, and Internet of Things technology, more and more technologies have been introduced into various industries to improve work efficiency and change operation mode [1]. In terms of hardware development, robots can also be used to replace operations in previously unoperable environments. On the one hand, robots can be used to replace manpower for business operations, such as in extremely hot or cold environments. On the other hand, the robot can be integrated into the visual recognition system and endowed with corresponding artificial intelligence to achieve automatic operation with certain functions [2, 3]. Picking robot is a rapidly developing application. However, due to the complex environment faced by the picking, the image of the fruit is easily affected by external factors; more interference and positioning errors are brought to the robot, which increases the difficulty of picking and reduces the precision of picking [4–6].For the traditional picking robot, it integrates the robot mechanical operation through visual analysis to realize the image discrimination first and then the process of picking. By using the robot's robot arm, the multicooperative operation is realized. Fruit-picking process of this way was affected by the image to obtain the factors of interference [7, 8]. In view of these limitations, this paper attempts to fuse the matching gradient algorithm, through the fusion of visual recognition and the picking robot, realize the image edge feature recognition, better cooperate with the robot for multiarm cooperative picking, achieve accurate and fast picking movement, and improve the precision and efficiency of picking.


## 2. Matching Gradient Algorithm

### 2.1. Matching Cost Calculation

For the matching gradient algorithm, the calculation of matching cost needs to be clarified first. Matching cost is the measure of similarity between the points with the same name relative to two images, and the definition of matching cost function can distinguish different images [9, 10]. Gradient is introduced into the calculation of matching cost, which can make the illumination influence little and has obvious and stable distinction to the noise of the image, so it can be widely used.The gradient of the image is the first-order partial derivative of the image from the horizontal axisX and the vertical axis Y direction, which can be calculated by(1)gx,y,t0,gx,y,t1,…,gx,y,tN−1,where the gray value of the image is represented by I and the gradient vector of the image can be calculated using the corresponding template. Therefore, for the two images, the corresponding gradient value can be obtained, which can be expressed by the corresponding formula, such as ti−ti−1 and Gx,y=1/2πδ2exp−x2+y2/2δ2.As for the matching cost, it carries out quantitative calculation for the two images as follows:(2)Gm=∂G∂n=n∇G.The gradient matching cost function only considers the amplitude attribute of the image, but it cannot completely replace the basic information of the image. Therefore, phase information and amplitude information can be introduced at the same time to further improve the gradient matching cost function [11–13].The corresponding gradient vector is expanded and defined in the horizontal and vertical axis directions to calculate the phase and amplitude of the image gradient vector, as shown in formulas (3) and (4):(3)n=cosθsinθ,(4)∇G=∂G∂x∂G∂y,where the gradient amplitude is expressed by m and the phase angle is expressed by φ. The function of matching cost can be obtained by fusion of amplitude value and phase angle as follows:(5)∇G.In the formula,Gn and Gn⋅fx,y, respectively, represent the gradient vector modules and phase angles corresponding to the color image channels R, G, and B, and a is the weighting coefficient. Further normalization to a single period, the specific calculation is shown as follows:(6)fx=x,if0≤x≤π,2π−x,ifπ<x<2π.For the treatment of outliers, formula (7) is used in this paper for specific calculation and treatment:(7)ρx=x2x2+σ2.As shown in Figure1, when the input x is greater than the threshold range, the influence of the output value will decrease, and the matching cost gradually converges until it reaches 1. At the same time, parameter control is realized. In conclusion, no matter what the matching cost of the original input is, the output value is still less than 1 after the calculation of the quantitative function [14–16].Figure 1
Geman–McClure function histogram.


### 2.2. Adaptive Window Generation

For an object, the recognition and matching of a single pixel are not enough, and its surrounding pixels need to be processed according to the matching cost function to improve the recognition degree and increase the recognition efficiency [17, 18]. Under the traditional matching algorithm, the recognition window is often fixed, and it is difficult to obtain high matching accuracy. Therefore, the core of the matching gradient algorithm in this paper is to set the adaptive window according to the spatial position of the adjacent pixels of the window. According to the matching pixels, it expands to form a cross region on the horizontal and vertical axis, and the length of the four arms of the robot is also adaptively adjusted according to the window.TakingEy=∂G/∂y⋅fx,y as an example, its discriminant criteria are as follows:(1)
Ax,y=Ex2+Ey2(2)
θ=arctanEx/Eyxnl,ynl,znl is the spatial distance difference between pixel xnf,ynf,znf and p, xnl,ynl,znl is the color difference, which is defined as xnf,ynf,znf. τ and L are the preset color threshold and distance threshold.Therefore, it can be calculated by(8)τlp=−τmaxLmax×lp+τmax,where Jλqq=vJaqq=u and Jλql+Lqlq˙l−Jλqfq˙f=0 are the preset maximum color and distance thresholds, respectively, and Lql=∂O0nqlr/∂ql is the value of the current arm length. According to the above equation, ul=uf is a linear function of Jaqlq˙l=Jaqfq˙f and decreases with the increase of qf=JλqfJaqf−1−1Jλql+LqlJaqlql: when lp=0, the maximum value τmax is obtained. When lp=Lmax, we take the minimum value 0.The above determination criteria can be used to obtain the arm lengthhp−,hp+,vp−,vp+ size of pixel P, and then, we obtain the orthogonal cross region H(p) and V(p):(9)Hp=x,y|x∈xp−hp−,xp+hp+,y=yp,Vp=x,y|x∈xp,y∈yp−vp−,yp+vp+.Repeat the above process for each pixelQ in V(p) along the vertical axis, obtain the horizontal support region H(q) of Q, and combine all H(q) to obtain the adaptive region of any pixel P in the image:(10)Up=∪q∈VpHq.


### 2.3. Cost Aggregation

For traditional matching, which only consider the local area of the target graphics, in order to be able to obtain more reliable aggregation range, we need two images, respectively, for the consideration of local scope; the first is the function of the matching point corresponding definition, using the correlation method for adaptive region function, corresponding to generate the corresponding area. The superposed region is defined as the final local region, and the specific calculation can be obtained as(11)Udp=x,y|x,y∈Up,x−d,y∈U′pd.On this basis, the original single pixel is matched and aggregated accordingly according to the superimposed region, and the total consumption within the region is calculated:(12)Ep,d=1N∑q∈Udpeq,d,where the total number of pixels in the aggregation region is represented by N, and the point with the smallest matching cost is selected as the matching point within the parallax interval to select the parallax of point P and calculate the parallax:(13)dp0=argmin0≤d≤dmaxEp,d.


### 2.4. Parallax Elaboration

The parallax value corresponding to the maximum number of parallax occurrence is the optimal parallax value in statistical sensedp∗; this optimal value is used to replace the initial parallax dp0 of pixel P; the specific calculation is as follows:(14)dp∗=argmax0≤d≤dmaxφpd.


## 2.1. Matching Cost Calculation

For the matching gradient algorithm, the calculation of matching cost needs to be clarified first. Matching cost is the measure of similarity between the points with the same name relative to two images, and the definition of matching cost function can distinguish different images [9, 10]. Gradient is introduced into the calculation of matching cost, which can make the illumination influence little and has obvious and stable distinction to the noise of the image, so it can be widely used.The gradient of the image is the first-order partial derivative of the image from the horizontal axisX and the vertical axis Y direction, which can be calculated by(1)gx,y,t0,gx,y,t1,…,gx,y,tN−1,where the gray value of the image is represented by I and the gradient vector of the image can be calculated using the corresponding template. Therefore, for the two images, the corresponding gradient value can be obtained, which can be expressed by the corresponding formula, such as ti−ti−1 and Gx,y=1/2πδ2exp−x2+y2/2δ2.As for the matching cost, it carries out quantitative calculation for the two images as follows:(2)Gm=∂G∂n=n∇G.The gradient matching cost function only considers the amplitude attribute of the image, but it cannot completely replace the basic information of the image. Therefore, phase information and amplitude information can be introduced at the same time to further improve the gradient matching cost function [11–13].The corresponding gradient vector is expanded and defined in the horizontal and vertical axis directions to calculate the phase and amplitude of the image gradient vector, as shown in formulas (3) and (4):(3)n=cosθsinθ,(4)∇G=∂G∂x∂G∂y,where the gradient amplitude is expressed by m and the phase angle is expressed by φ. The function of matching cost can be obtained by fusion of amplitude value and phase angle as follows:(5)∇G.In the formula,Gn and Gn⋅fx,y, respectively, represent the gradient vector modules and phase angles corresponding to the color image channels R, G, and B, and a is the weighting coefficient. Further normalization to a single period, the specific calculation is shown as follows:(6)fx=x,if0≤x≤π,2π−x,ifπ<x<2π.For the treatment of outliers, formula (7) is used in this paper for specific calculation and treatment:(7)ρx=x2x2+σ2.As shown in Figure1, when the input x is greater than the threshold range, the influence of the output value will decrease, and the matching cost gradually converges until it reaches 1. At the same time, parameter control is realized. In conclusion, no matter what the matching cost of the original input is, the output value is still less than 1 after the calculation of the quantitative function [14–16].Figure 1
Geman–McClure function histogram.


## 2.2. Adaptive Window Generation

For an object, the recognition and matching of a single pixel are not enough, and its surrounding pixels need to be processed according to the matching cost function to improve the recognition degree and increase the recognition efficiency [17, 18]. Under the traditional matching algorithm, the recognition window is often fixed, and it is difficult to obtain high matching accuracy. Therefore, the core of the matching gradient algorithm in this paper is to set the adaptive window according to the spatial position of the adjacent pixels of the window. According to the matching pixels, it expands to form a cross region on the horizontal and vertical axis, and the length of the four arms of the robot is also adaptively adjusted according to the window.TakingEy=∂G/∂y⋅fx,y as an example, its discriminant criteria are as follows:(1)
Ax,y=Ex2+Ey2(2)
θ=arctanEx/Eyxnl,ynl,znl is the spatial distance difference between pixel xnf,ynf,znf and p, xnl,ynl,znl is the color difference, which is defined as xnf,ynf,znf. τ and L are the preset color threshold and distance threshold.Therefore, it can be calculated by(8)τlp=−τmaxLmax×lp+τmax,where Jλqq=vJaqq=u and Jλql+Lqlq˙l−Jλqfq˙f=0 are the preset maximum color and distance thresholds, respectively, and Lql=∂O0nqlr/∂ql is the value of the current arm length. According to the above equation, ul=uf is a linear function of Jaqlq˙l=Jaqfq˙f and decreases with the increase of qf=JλqfJaqf−1−1Jλql+LqlJaqlql: when lp=0, the maximum value τmax is obtained. When lp=Lmax, we take the minimum value 0.The above determination criteria can be used to obtain the arm lengthhp−,hp+,vp−,vp+ size of pixel P, and then, we obtain the orthogonal cross region H(p) and V(p):(9)Hp=x,y|x∈xp−hp−,xp+hp+,y=yp,Vp=x,y|x∈xp,y∈yp−vp−,yp+vp+.Repeat the above process for each pixelQ in V(p) along the vertical axis, obtain the horizontal support region H(q) of Q, and combine all H(q) to obtain the adaptive region of any pixel P in the image:(10)Up=∪q∈VpHq.


## 2.3. Cost Aggregation

For traditional matching, which only consider the local area of the target graphics, in order to be able to obtain more reliable aggregation range, we need two images, respectively, for the consideration of local scope; the first is the function of the matching point corresponding definition, using the correlation method for adaptive region function, corresponding to generate the corresponding area. The superposed region is defined as the final local region, and the specific calculation can be obtained as(11)Udp=x,y|x,y∈Up,x−d,y∈U′pd.On this basis, the original single pixel is matched and aggregated accordingly according to the superimposed region, and the total consumption within the region is calculated:(12)Ep,d=1N∑q∈Udpeq,d,where the total number of pixels in the aggregation region is represented by N, and the point with the smallest matching cost is selected as the matching point within the parallax interval to select the parallax of point P and calculate the parallax:(13)dp0=argmin0≤d≤dmaxEp,d.


## 2.4. Parallax Elaboration

The parallax value corresponding to the maximum number of parallax occurrence is the optimal parallax value in statistical sensedp∗; this optimal value is used to replace the initial parallax dp0 of pixel P; the specific calculation is as follows:(14)dp∗=argmax0≤d≤dmaxφpd.


## 3. Basketball Motion Capture System and Its Application in Motion Training of Picking Robot

The picking robot first needs to determine the location of the fruit, capture the corresponding fruit from the multimedia video, realize the autonomous positioning of the fruit, and then pick the fruit to realize the autonomous operation. The specific process is shown in Figure2.Figure 2
Basketball motion capture flowchart.When designing the vision system of the picking robot, the target features of the fruit can be extracted according to the motion extraction technology of the basketball real-time video, and finally, the robot can realize the autonomous fruit positioning and autonomous operation.


### 3.1. Multimedia Motion and Image Edge Detection Matching of Picking Robot

For automatic fruit picking by the robot, the key lies in automatic positioning of fruit picking. Multimedia video motion feature acquisition and autonomous positioning are integrated to make clear that when picking targets, the picking robot will use features to acquire target features of fruit and complete the work of autonomous picking. Formula (15) is the relationship between multimedia image acquisition and time change in time series, which can be calculated specifically:(15)gx,y,t0,gx,y,t1,…,gx,y,tN−1.In the formula,ti−ti−1, B, T, and Gx,y=1/2πδ2exp−x2+y2/2δ2, respectively, represent the image, the total number of frames, and the corresponding real-time moment and time interval when the image is collected.When multimedia image collection is carried out, there will be strong interference in the process of image acquisition due to the fast movement. Therefore, it is necessary to reduce the noise of these images and use gradient algorithm to perform gradient processing on the image to enhance the edge features of the image and obtain the clear part. Therefore, it is necessary to set the corresponding gradient threshold to extract edge features, complete detection, and make clear the accurate positioning of image edges, as shown in Figure3:Figure 3
Flowchart of edge detection.In the process of edge detection, the image needs to be processed, and the derivative is obtained. The specific calculation formula is shown as(16)Gm=∂G∂n=n∇G,where σ is the change of Gauss.The first-order directional reciprocal calculation of the two-dimensional function is carried out according to the specific directionM. The specific calculation is shown in formulas (17)–(19):(17)n=cosθsinθ,(18)∇G=∂G∂x∂G∂y,(19)∇G,where m and Gn represent direction vector and gradient vector and Theta is the angle of change.The specific calculation of edge gradient is shown in formulas (20)–(23):(20)Ex=∂G∂x⋅fx,y,(21)Ey=∂G∂y⋅fx,y,(22)Ax,y=Ex2+Ey2,(23)θ=arctanExEy.In the formula,S(x,y) and ϕ are the edge strength and the normal vector at points in the real-time image (x,y), respectively, and a threshold is set for H(x,y) to determine the maximum point of the local gradient of the image.For picking on the edge of the target detection and recognition processes, as shown in Figure4, the first is to obtain maximum fruit image edge extraction; secondly, set the corresponding threshold, save the value greater than the threshold, and set the saved value less than the threshold to 0. So far, the recognition of the edge of fruit images has provided a theoretical basis for the target positioning of fruit picking robots.Figure 4
Picking robot edge detection and recognition process of the picking target.


### 3.2. Motion Control Algorithm of Picking Robot Based on Constraint under Cooperative Relationship

After the picking robot completes the target picking, it is necessary to set the motion chain to carry out the collaborative processing of both arms. The specific process is as follows.The two arms of the picking robot are divided into the active arm and the driven arm.xnl,ynl,znl and xnf,ynf,znf are used to represent the coordinate system at the end of the active arm and the driven arm, respectively. The vector from origin xnl,ynl,znl to origin xnf,ynf,znf is represented by K. Therefore, the position constraints and attitude constraints between the active arm and the driven arm are shown in formulas (24) and (25), respectively:(24)cql+O0nqlk−cqf=0,(25)nql,sql,aqlTnqf,sqf,aqf=W.Based on the correlation between JacobianJq=JλTqJaTq and Jqq=vw, formula (26) is shown as(26)Jλqq=v,Jaqq=u.By the relationship of linear velocity, the ends of the two arms of the picking robot move together is shown as(27)Jλql+Lqlq˙l−Jλqfq˙f=0,where Lql=∂O0nqlr/∂ql.When the picking robot moves in coordination, the angular velocity of the two arms is the same. Since there is no relative displacement at the ends of the two arms, that is,ul=uf, the calculation combined with formula (26) is shown as(28)Jaqlq˙l=Jaqfq˙f.By combining equation (13) with equation (14), the correlation between the joint velocities of master and slave arms during cooperative movement is obtained:(29)qf=JλqfJaqf−1−1Jλql+LqlJaqlql.


## 3.1. Multimedia Motion and Image Edge Detection Matching of Picking Robot

For automatic fruit picking by the robot, the key lies in automatic positioning of fruit picking. Multimedia video motion feature acquisition and autonomous positioning are integrated to make clear that when picking targets, the picking robot will use features to acquire target features of fruit and complete the work of autonomous picking. Formula (15) is the relationship between multimedia image acquisition and time change in time series, which can be calculated specifically:(15)gx,y,t0,gx,y,t1,…,gx,y,tN−1.In the formula,ti−ti−1, B, T, and Gx,y=1/2πδ2exp−x2+y2/2δ2, respectively, represent the image, the total number of frames, and the corresponding real-time moment and time interval when the image is collected.When multimedia image collection is carried out, there will be strong interference in the process of image acquisition due to the fast movement. Therefore, it is necessary to reduce the noise of these images and use gradient algorithm to perform gradient processing on the image to enhance the edge features of the image and obtain the clear part. Therefore, it is necessary to set the corresponding gradient threshold to extract edge features, complete detection, and make clear the accurate positioning of image edges, as shown in Figure3:Figure 3
Flowchart of edge detection.In the process of edge detection, the image needs to be processed, and the derivative is obtained. The specific calculation formula is shown as(16)Gm=∂G∂n=n∇G,where σ is the change of Gauss.The first-order directional reciprocal calculation of the two-dimensional function is carried out according to the specific directionM. The specific calculation is shown in formulas (17)–(19):(17)n=cosθsinθ,(18)∇G=∂G∂x∂G∂y,(19)∇G,where m and Gn represent direction vector and gradient vector and Theta is the angle of change.The specific calculation of edge gradient is shown in formulas (20)–(23):(20)Ex=∂G∂x⋅fx,y,(21)Ey=∂G∂y⋅fx,y,(22)Ax,y=Ex2+Ey2,(23)θ=arctanExEy.In the formula,S(x,y) and ϕ are the edge strength and the normal vector at points in the real-time image (x,y), respectively, and a threshold is set for H(x,y) to determine the maximum point of the local gradient of the image.For picking on the edge of the target detection and recognition processes, as shown in Figure4, the first is to obtain maximum fruit image edge extraction; secondly, set the corresponding threshold, save the value greater than the threshold, and set the saved value less than the threshold to 0. So far, the recognition of the edge of fruit images has provided a theoretical basis for the target positioning of fruit picking robots.Figure 4
Picking robot edge detection and recognition process of the picking target.


## 3.2. Motion Control Algorithm of Picking Robot Based on Constraint under Cooperative Relationship

After the picking robot completes the target picking, it is necessary to set the motion chain to carry out the collaborative processing of both arms. The specific process is as follows.The two arms of the picking robot are divided into the active arm and the driven arm.xnl,ynl,znl and xnf,ynf,znf are used to represent the coordinate system at the end of the active arm and the driven arm, respectively. The vector from origin xnl,ynl,znl to origin xnf,ynf,znf is represented by K. Therefore, the position constraints and attitude constraints between the active arm and the driven arm are shown in formulas (24) and (25), respectively:(24)cql+O0nqlk−cqf=0,(25)nql,sql,aqlTnqf,sqf,aqf=W.Based on the correlation between JacobianJq=JλTqJaTq and Jqq=vw, formula (26) is shown as(26)Jλqq=v,Jaqq=u.By the relationship of linear velocity, the ends of the two arms of the picking robot move together is shown as(27)Jλql+Lqlq˙l−Jλqfq˙f=0,where Lql=∂O0nqlr/∂ql.When the picking robot moves in coordination, the angular velocity of the two arms is the same. Since there is no relative displacement at the ends of the two arms, that is,ul=uf, the calculation combined with formula (26) is shown as(28)Jaqlq˙l=Jaqfq˙f.By combining equation (13) with equation (14), the correlation between the joint velocities of master and slave arms during cooperative movement is obtained:(29)qf=JλqfJaqf−1−1Jλql+LqlJaqlql.


## 4. Visual Image Edge Detection of Picking Robot

According to the corresponding robot picking motion capture, multimedia video sequence analysis is realized. The specific image analysis is shown as follows:(30)gx,y,t0,gx,y,t1,…,gx,y,tN−1.In the process of image capture, the most important thing is the detection of the image edge. Through the edge detection of the image, the relevant hidden information is mined. The specific steps include(1)
Image filtering: through the collection of multimedia images, multimedia images need to be filtered because of the existence of various noise interferences(2)
Image enhancement: based on the gradient algorithm, the sharpness of the local blur of the image is processed and the edge of the image is detected(3)
Edge detection: by setting the edge points, the corresponding features are found, and then, the edge detection is carried out(4)
Fruit positioning: the precise position of the fruit edge is determinedDuring detection, the image is smoothed first, and then, the derivative of the image is obtained. The two-dimensional Gaussian function is shown as(31)Gx,y=12πδ2exp−x2+y22δ2.The first directional derivative ofG(x,y) in a certain direction N is shown in formulas (32)–(34):(32)Gm=∂G∂n=n∇G,(33)n=cosθsinθ,(34)∇G=∂G∂x∂G∂y,where n is the direction vector and ∇G is the gradient vector. The image f(x,y) is convolved with Gn, and the direction of n is changed at the same time. When Gn⋅fx,y is maximized, the direction of edge detection is orthogonal to n. As shown in formulas (35)–(38),(35)Ex=∂G∂x⋅fx,y,(36)Ey=∂G∂y⋅fx,y,(37)Ax,y=Ex2+Ey2,(38)θ=arctanExEy.


## 5. Simulation Experiment and Analysis

In order to verify the match gradient algorithm, the multimedia sports feasibility of picking robot more collaborative relationships, choose an orchard of apple picking; the result is shown in Figure5. From the results, the gradient matching algorithm is 10 times of picking graphics recognition accuracy of the mean, and the mean location accuracy reached 98.15% and 98.22%, respectively. It is proved that the matching gradient algorithm can recognize and locate the image effectively, and the matching gradient algorithm is feasible to control the picking robot.Figure 5
Picking performance test of picking robot (%).To test the efficiency and accuracy of gradient matching algorithm, simulation experiments in the same environment, the contrast gradient matching algorithm, and the other two kinds of the efficiency of the algorithm for image recognition, the result is shown in Figure6. From the results, this paper identifies the fruit image and the time taken for an average of 2.46 seconds, while the other two methods of the consumed time is an average of more than 5.1 seconds. Therefore, in general, the matching gradient algorithm consumes less than half the time of the other two methods. Therefore, the matching gradient algorithm can effectively improve the image recognition efficiency of the picking robot.Figure 6
Time comparison results of image recognition with different methods (s).By comparing Figures7–9, the control accuracy under the same simulation environment is verified, respectively. The gradient matching algorithm only needs about 10 operations to minimize the error, while the other two methods need at least 30 operations. Therefore, the residual control of the gradient matching algorithm in this paper is significantly lower than the other two methods.Figure 7
Control error test of the encoder-based control method.Figure 8
Control error test of the control method based on parallel rope traction.Figure 9
Control error test of this method.In order to verify the picking efficiency of this method, three different methods were used to test the picking efficiency.As can be seen from Figure10, the average time required by the matching gradient algorithm is about 30 seconds, while the other two methods are more than 40 seconds. Therefore, the matching gradient algorithm in this paper can greatly improve the efficiency of picking.Figure 10
Comparison of picking efficiency of different methods.


## 6. Conclusions

The picking robot is a breakthrough attempt to replace artificial application in the field of agriculture, but precision and efficiency have always been the focus and difficulty of industry research. In this paper, in view of the limitations of the recognition accuracy of the picking robot, the matching gradient algorithm is fused, and the multimedia motion capture detection and feature extraction technology are referred to. The vision system of the picking robot is modified accordingly, and the accurate and fast fruit image recognition ability is obtained. The simulation results show that the matching gradient algorithm is effective and can identify the fruit target quickly, achieve the harvesting, and meet the requirements of high precision.



---

*Source: 4335552-2021-12-09.xml*