Journal of ISSN: 2572-8466 JABB

Applied Biotechnology & Bioengineering
Research Article
Volume 3 Issue 6 - 2017
A Method for Identification and Matching of the Picking Point for Mature Litchi under Structural Environment
Chen Xiong, Cao Xiaoman and Zou Xiangjun*
Key Lab of Key Technology on Agricultural Machine and Equipment, South China Agricultural University, China
Received: July 26, 2017 | Published: September 11, 2017
*Corresponding author: Zou Xiangjun, Key Lab of Key Technology on Agricultural Machine and Equipment, College of Engineering, South China Agricultural University, Guangdong, China, Email: ; ;
Citation: Xiong C, Xiaoman C, Xiangjun Z (2017) A Method for Identification and Matching of the Picking Point for Mature Litchi under Structural Environment. J Appl Biotechnol Bioeng 3(6): 00085. DOI: 10.15406/jabb.2017.03.00085

Abstract

A method to identify the picking point of the whole mature litchi fruit and its matching method based on binocular stereo vision under the structural environment is proposed in this paper. The mature litchi clusters in the extracted image were segmented by using the improved K-means clustering algorithm. The region of interest (ROI) of the Litchi stems is set based on the characteristics of the center of the litchi fruit region and the minimum circumscribed rectangle. Corner extraction from the main fruit bearing branch of litchi was carried out by Harris algorithm. The customized function of circle distance is used to determine the optimal corner, and then cumulative probability Hough linear detection of the Litchi stems is used to determine the straight line of the picking point. Finally, the two-dimensional pixel coordinates of the picking point are determined. Then the three-dimensional coordinates of litchi picking points are obtained by SGBM stereo matching algorithm. The experimental results show that the matching success rate of picking points can reach 86.63%. It provides the foundation for litchi harvesting robot to pick litchi fruit successful.

Keywords: K-means clustering algorithm; Litchi harvesting robot; Harris algorithm; Hough, SGBM algorithm; ROI

Introduction

In recent years, fruit and vegetable harvesting robots have become a research hotspot. Among them, [1] South China Agricultural University of China on litchi harvesting robot done a lot of research and developed a litchi picking robot which mainly divided into visual systems and execution systems from the structural point of view [2]. The visual system captures the scene in the real world through two industrial cameras just like the human eye, and then uses the developed software algorithm to identify the litchi fruit and its picking point. Finally, the three-dimensional coordinates of the point are calculated on the basis of the picking point in the matching left and right images [3,4]. The execution system picks up the litchi fruit by controlling the end-effector after acquiring the three-dimensional coordinates of the picking point from the visual system [5]. It can be seen that the identification of litchi fruit and the matching of picking points by binocular vision system are the primary steps to pick litchi fruit successful.

The shape of litchi is a string of fruit, therefore it cannot be directly stereo matched by using the centroid or edge characteristics of circular fruit [6,7]. Based on the characteristics of the hue information of the litchi color image, the three-dimensional matching method based on the hue space is adopted to study the litchi picking point. Because the color information of the scene in the color image of litchi has the same characteristics, the method of stereo matching for the picking point of litchi was carried out by using the method of region stereo matching based on hue space. The method is not only computationally intensive, but also has good effect only on the calculation and matching research of picking point whose parent branch is regular and linear [8]. A scheme of combined algorithms of Harris and improved SIFT to compute picking point of litchi and achieve its stereo matching was proposed. Corner extraction from the branch of litchi was carried out by Harris method.

The two-dimensional pixel coordinates of the picking point are calculated by combining with the centroid of litchi fruit area identified and the minimum circumscribed rectangle. Then, the computed picking point was described with a characteristic vector of SIFT, and its binocular stereo matching based on cosine distance similarity of SIFT was also proposed. In this paper, combined with K-means clustering algorithm, cumulative probability Hough linear detection, SGBM stereo matching algorithm and the usually used Harris algorithm which can quickly and effectively extract a large number of useful feature points in the region of rich texture [9-11], a method to calculate and match picking points of litchi is proposed to solve the calculation and stereo matching of picking points on the litchi whose parent branch have complex shape.

Results

Calculation of the picking points of litchi image

Identification of litchi fruit: After the S component of HSV color space is extracted, the S-component graph is segmented by improved K-means clustering algorithm which selects the gray value of the two highest peaks of the S component histogram to initialize the cluster centre in order to reduce the iteration times and time of the algorithm [12,13]. After the segmentation is completed, the function of area threshold is used to remove the small area background, and the voids are filled to obtain the binary image of litchi fruit as shown in Figure 1a.

The solution of the external rectangle of litchi image: The maximum connected domain is extracted from the identified litchi fruit image. The litchi outline image area is set to 1 (white), the remaining area pixel value is set to 0 (black), (0 for the background, 1 for the litchi fruit target). In order to solve the coordinates of litchi centroid [14], according to the definition of image centroid, the coordinates of litchi centroid can be solved by the following formula:

{ x ¯ = (x,y)ϵR x / (x,y)ϵR f(x,y) y ¯ = (x,y)ϵR y / (x,y)ϵR f(x,y) MathType@MTEF@5@5@+= feaagKart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr 4rNCHbGeaGWj0Jf9crFfpeea0xh9v8qiW7rqqrFfpeea0xe9Lq=Jc9 vqaqpepm0xbba9pwe9Q8fs0=yqaqpepae9pg0FirpepeKkFr0xfr=x fr=xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaqdqaaaaaaaaa Wdbmaaceaak8aabaqcLbsafaqabeGabaaakeaajugib8qaceWG4bGb aebacqGH9aqpnmaaqababaqcLbsacaWG4baajqaibaqcLbmacaGGOa GaamiEaiaacYcacaWG5bGaaiykamrr1ngBPrwtHrhAXaqeguuDJXwA KbstHrhAG8KBLbacfiGae8x9diVaamOuaaGdbeqcLbsacqGHris5ai aac+canmaaqababaqcLbsacaWGMbGaaiikaiaadIhacaGGSaGaamyE aiaacMcaaKabGeaajugWaiaacIcacaWG4bGaaiilaiaadMhacaGGPa Gae8x9diVaamOuaaGdbeqcLbsacqGHris5aaGcpaqaaKqzGeGabmyE ayaaraGaeyypa0tddaaeqaGcbaqcLbsacaWG5baajeaqbaqcLbmaca GGOaGaamiEaiaacYcacaWG5bGaaiyka8qacqWF1pG8caWGsbaal8aa beqcLbsacqGHris5aiaac+canmaaqabakeaajugibiaadAgacaGGOa GaamiEaiaacYcacaWG5bGaaiykaaqcbauaaKqzadGaaiikaiaadIha caGGSaGaamyEaiaacMcapeGae8x9diVaamOuaaWcpaqabKqzGeGaey yeIuoaaaaak8qacaGL7baaaaa@859A@ . (1)

Where ( x ¯ , y ¯ ) MathType@MTEF@5@5@+= feaagKart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr 4rNCHbGeaGWj0Jf9crFfpeea0xh9v8qiW7rqqrFfpeea0xe9Lq=Jc9 vqaqpepm0xbba9pwe9Q8fs0=yqaqpepae9pg0FirpepeKkFr0xfr=x fr=xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaqcLbsacaGGOa aeaaaaaaaaa8qaceqG4bGbaebacaGGSaGabeyEayaaraGaaiykaaaa @3CE6@ is the coordinates of Centroid (x, y) is the coordinates of the pixel, f( x,y ) MathType@MTEF@5@5@+= feaagKart1ev2aqatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr 4rNCHbGeaGWj0Jf9crFfpeea0xh9v8qiW7rqqrFfpeea0xe9Lq=Jc9 vqaqpepm0xbba9pwe9Q8fs0=yqaqpepae9pg0FirpepeKkFr0xfr=x fr=xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaqcLbsaqaaaaa aaaaWdbiaabAganmaabmaak8aabaqcLbsapeGaaeiEaiaacYcacaqG 5baakiaawIcacaGLPaaaaaa@3E9F@ is the pixel value of the image at the point (x, y).

The coordinates of litchi centroid are shown in Figure 1b. After obtaining the coordinates of centroid, the minimum circumscribed rectangle of the maximum connected domain is obtained, where the width of the rectangle is w and the height is h. In order to reduce the interference of the environment to locate the picking point, [15] ROI of the branch was set according to the minimum circumscribed rectangle of the litchi centroid and the litchi profile where the width W of ROI was 0.4w and the height H was 0.3h. As shown in Figure 1c.

Figure 1: Obtaining the image of ROI.

The obtaining of calculation picking points: First, a function C i ( x i , y i ) MathType@MTEF@5@5@+= feaagKart1ev2aqatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr 4rNCHbGeaGWj0Jf9crFfpeea0xh9v8qiW7rqqrFfpeea0xe9Lq=Jc9 vqaqpepm0xbba9pwe9Q8fs0=yqaqpepae9pg0FirpepeKkFr0xfr=x fr=xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaqcLbsaqaaaaa aaaaWdbiaadoean8aadaWgaaqcbauaaKqzadWdbiaadMgaaSWdaeqa a0Wdbmaabmaak8aabaqcLbsapeGaamiEa0WdamaaBaaajeaqbaqcLb mapeGaamyAaaWcpaqabaqcLbsapeGaaiilaiaadMhan8aadaWgaaqc bauaaKqzadWdbiaadMgaaSWdaeqaaaGcpeGaayjkaiaawMcaaaaa@47A8@ named circle distance should be defined, where C i ( x i , y i ) MathType@MTEF@5@5@+= feaagKart1ev2aqatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr 4rNCHbGeaGWj0Jf9crFfpeea0xh9v8qiW7rqqrFfpeea0xe9Lq=Jc9 vqaqpepm0xbba9pwe9Q8fs0=yqaqpepae9pg0FirpepeKkFr0xfr=x fr=xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaqcLbsaqaaaaa aaaaWdbiaadoean8aadaWgaaqcbauaaKqzadWdbiaadMgaaSWdaeqa a0Wdbmaabmaak8aabaqcLbsapeGaamiEa0WdamaaBaaajeaqbaqcLb mapeGaamyAaaWcpaqabaqcLbsapeGaaiilaiaadMhan8aadaWgaaqc bauaaKqzadWdbiaadMgaaSWdaeqaaaGcpeGaayjkaiaawMcaaaaa@47A8@ is the number of all points that satisfy the condition { ( xy )| ( x x i ) 2 + ( y y i ) 2 R } MathType@MTEF@5@5@+= feaagKart1ev2aqatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr 4rNCHbGeaGWj0Jf9crFfpeea0xh9v8qiW7rqqrFfpeea0xe9Lq=Jc9 vqaqpepm0xbba9pwe9Q8fs0=yqaqpepae9pg0FirpepeKkFr0xfr=x fr=xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaqdqaaaaaaaaa Wdbmaacmaak8aabaqdpeWaaeWaaOWdaeaajugib8qacaWG4bWexLMB bXgBd9gzLbvyNv2CaeHbcfgDH52zaGqbaiaa=XW=caqG5baakiaawI cacaGLPaaajugibiaacYhanmaakaaak8aabaqdpeWaaeWaaOWdaeaa jugib8qacaWG4bGaeyOeI0IaamiEa0WdamaaBaaajeaqbaqcLbmape GaamyAaaWcpaqabaaak8qacaGLOaGaayzkaaqdpaWaaWbaaSqabKqa afaajugWa8qacaaIYaaaaKqzGeGaey4kaSsddaqadaGcpaqaaKqzGe WdbiaadMhacqGHsislcaWG5bqdpaWaaSbaaKqaafaajugWa8qacaWG Pbaal8aabeaaaOWdbiaawIcacaGLPaaan8aadaahaaWcbeqcbauaaK qzadWdbiaaikdaaaaaleqaaKqzGeGaeyizImQaamOuaaGccaGL7bGa ayzFaaaaaa@646C@ , ( x i , y i ) MathType@MTEF@5@5@+= feaagKart1ev2aqatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr 4rNCHbGeaGWj0Jf9crFfpeea0xh9v8qiW7rqqrFfpeea0xe9Lq=Jc9 vqaqpepm0xbba9pwe9Q8fs0=yqaqpepae9pg0FirpepeKkFr0xfr=x fr=xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaqdqaaaaaaaaa Wdbmaabmaak8aabaqcLbsapeGaamiEa0WdamaaBaaajeaqbaqcLbma peGaamyAaaWcpaqabaqcLbsapeGaaiilaiaadMhan8aadaWgaaqcba uaaKqzadWdbiaadMgaaSWdaeqaaaGcpeGaayjkaiaawMcaaaaa@4374@ is the coordinates of each Harris corner detected, ( x,y ) MathType@MTEF@5@5@+= feaagKart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr 4rNCHbGeaGWj0Jf9crFfpeea0xh9v8qiW7rqqrFfpeea0xe9Lq=Jc9 vqaqpepm0xbba9pwe9Q8fs0=yqaqpepae9pg0FirpepeKkFr0xfr=x fr=xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaqdqaaaaaaaaa Wdbmaabmaak8aabaqcLbsapeGaaeiEaiaabYcatCvAUfeBSn0BKvgu HDwzZbqegiuy0fMBNbacfaGaa8xEaaGccaGLOaGaayzkaaaaaa@4559@ is the pixel coordinate whose pixel value is not zero, R is the threshold radius should be set manually [8]. Using the Harris algorithm, combined with the above function, the process of calculation picking point is proposed in this paper as follows: The Harris corners of the litchi branch were detected in the ROI of the branch of litchi, whose coordinates is ( x i , y i ) MathType@MTEF@5@5@+= feaagKart1ev2aqatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr 4rNCHbGeaGWj0Jf9crFfpeea0xh9v8qiW7rqqrFfpeea0xe9Lq=Jc9 vqaqpepm0xbba9pwe9Q8fs0=yqaqpepae9pg0FirpepeKkFr0xfr=x fr=xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaqdqaaaaaaaaa Wdbmaabmaak8aabaqcLbsapeGaaeiEa0WdamaaBaaajeaqbaqcLbma peGaaeyAaaWcpaqabaqcLbsapeGaaiilaiaabMhan8aadaWgaaqcba uaaKqzadWdbiaabMgaaSWdaeqaaaGcpeGaayjkaiaawMcaaaaa@436C@ , the effect is shown in Figure 2a. According to the function definition to calculate the function value of each corners, and using the idea of the extreme value algorithm to obtain the maximum value of the function Ci whose coordinates is set to ( x a ,y a ) MathType@MTEF@5@5@+= feaagKart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr 4rNCHbGeaGWj0Jf9crFfpeea0xh9v8qiW7rqqrFfpeea0xe9Lq=Jc9 vqaqpepm0xbba9pwe9Q8fs0=yqaqpepae9pg0FirpepeKkFr0xfr=x fr=xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaqdqaaaaaaaaa Wdbmaabmaak8aabaqcLbsapeGaaeiEa0WdamaaBaaajeaqbaqcLbma peGaaeyyaaWcpaqabaqcLbsacaqGSaWdbiaabMhan8aadaWgaaqcba uaaKqzadWdbiaabggaaSWdaeqaaaGcpeGaayjkaiaawMcaaaaa@435A@ , the effect is shown in Figure 2b [16]. Then, the litchi branch was detected by using cumulative probability Hough linear detection in the ROI only if the ordinate of the starting point and ending points of the straight line is less than ya, the effect of the test is shown in Figure 2c. And the maximum length of each straight line is obtained. The slope of the longest straight line is K. Finally, ( x a ,y a ) MathType@MTEF@5@5@+= feaagKart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr 4rNCHbGeaGWj0Jf9crFfpeea0xh9v8qiW7rqqrFfpeea0xe9Lq=Jc9 vqaqpepm0xbba9pwe9Q8fs0=yqaqpepae9pg0FirpepeKkFr0xfr=x fr=xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaqdqaaaaaaaaa Wdbmaabmaak8aabaqcLbsapeGaaeiEa0WdamaaBaaajeaqbaqcLbma peGaaeyyaaWcpaqabaqcLbsacaqGSaWdbiaabMhan8aadaWgaaqcba uaaKqzadWdbiaabggaaSWdaeqaaaGcpeGaayjkaiaawMcaaaaa@435A@ as a starting point, the slope of K for a straight line, the picking point is on the straight line. Binarization and Canny edge detection for the litchi branch to extraction the intersection point of the edge of the litchi branch and the line. The intersection point which the ordinate is the smallest is the picking point we need. The result of the picking point is shown in Figure 2d.

Figure 2: Extracting process of the picking point of litchi.

The stereo matching of picking points based on SGBM

The principle of SGBM algorithm: The core step of the SGBM algorithm is as follows: select matching primitives; construct the cost energy and function based on scan lines of multiple directions; [17] obtain the optimal solution of energy cost and function. The basic process of the algorithm is:

  1. Matching pixel-by-pixel. The function d( x i , y i , I L , I R ) MathType@MTEF@5@5@+= feaagKart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr 4rNCHbGeaGWj0Jf9crFfpeea0xh9v8qiW7rqqrFfpeea0xe9Lq=Jc9 vqaqpepm0xbba9pwe9Q8fs0=yqaqpepae9pg0FirpepeKkFr0xfr=x fr=xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaqcLbsaqaaaaa aaaaWdbiaadsgacaGGOaGaaeiEa0WdamaaBaaajuaibaqcLbmapeGa aeyAaaqcfa4daeqaaKqzGeGaaiila8qacaqG5bqdpaWaaSbaaKqbGe aajugWa8qacaqGPbaajuaGpaqabaqcLbsacaGGSaWdbiaabMean8aa daWgaaqcfasaaKqzadWdbiaabYeaaKqba+aabeaajugibiaacYcape Gaaeysa0WdamaaBaaajuaibaqcLbmapeGaaeOuaaqcfa4daeqaaKqz GeGaaiykaaaa@4F97@ defines the possibility of the two points that are the same.
  2. d( x i , y i , I L , I R )= min y i 0.5y y i +0.5 | I L ( x i ) I R ( y i ) | MathType@MTEF@5@5@+= feaagKart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr 4rNCHbGeaGWj0Jf9crFfpeea0xh9v8qiW7rqqrFfpeea0xe9Lq=Jc9 vqaqpepm0xbba9pwe9Q8fs0=yqaqpepae9pg0FirpepeKkFr0xfr=x fr=xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaqcLbsaqaaaaa aaaaWdbiaadsgacaGGOaGaaeiEa0WdamaaBaaajuaibaqcLbmapeGa aeyAaaqcfa4daeqaaKqzGeGaaiila8qacaqG5bqdpaWaaSbaaKqbGe aajugWa8qacaqGPbaajuaGpaqabaqcLbsacaGGSaWdbiaabMean8aa daWgaaqcfasaaKqzadWdbiaabYeaaKqba+aabeaajugibiaacYcape Gaaeysa0WdamaaBaaajuaibaqcLbmapeGaaeOuaaqcfa4daeqaaKqz GeGaaiykaiabg2da9iGac2gacaGGPbGaaiOBa0WaaSbaaKazea2=ba qcLbmapeGaaeyEaKqba+aadaWgaaqceauaaKqzadWdbiaabMgaaKaz ea2=paqabaqcLbmapeGaeyOeI0IaaGimaiaac6cacaaI1aGaeyizIm QaaeyEaiabgsMiJkaabMhajuaGpaWaaSbaaKazea2=baqcLbmapeGa aeyAaaqcKray==aabeaajugWa8qacqGHRaWkcaaIWaGaaiOlaiaaiw daa4Wdaeqaa0WaaqWaaeaajugib8qacaqGjbqdpaWaaSbaaKabGeaa jugWa8qacaqGmbaao8aabeaan8qadaqadaWdaeaajugib8qacaqG4b qdpaWaaSbaaKabGeaajugWa8qacaqGPbaao8aabeaaa0WdbiaawIca caGLPaaajugibiabgkHiTiaabMean8aadaWgaaqceasaaKqzadWdbi aabkfaa4Wdaeqaa0WdbmaabmaapaqaaKqzGeWdbiaabMhan8aadaWg aaqceasaaKqzadWdbiaabMgaa4WdaeqaaaqdpeGaayjkaiaawMcaaa WdaiaawEa7caGLiWoaaaa@89CC@ . (2)

    Where xi and yi are the image points on the left and right scanning lines. The gray scale at the point x on the left scan line is defined as IL(x); IR is obtained by the sample point linear interpolation of the right scanning line.

  3. Using one-dimensional constraint to approximate two-dimensional constraint. Eight paths are set at intervals of 45° near the P. Calculate the minimum cost path Lr (p, d) through the 8 paths in order to approximate the two-dimensional constraint matching calculation.
  4. The calculation of parallax. The calculation of disparity is obtained by the way of iterations. First, using the random parallax image to correct the right image and then match to generate a new parallax image [18]. It is also possible to use a hierarchical calculation method to calculate the parallax image as an initial value in the case of a half resolution and then using the parallax image obtained to calculate recursively.
  5. Delete the mistaken matching. When the matching of the same name point of left and right image is completed, using the point in the right image to match the same name point in the left image. If the two pairs of parallax are different, [19] they are considered invalid.

The stereo matching of picking points: SGBM stereo matching is essentially an improved dynamic programming method, which improves the accuracy of matching results while preserving the high efficiency of dynamic programming. The SGBM algorithm is insensitive to the influence of illumination and has the strong robustness to noise. In this paper, SGBM algorithm is used to solve the three-dimensional coordinates of litchi picking point,which makes a good foundation for Litchi harvesting robot to work in the field. The stereo matching step of picking point is as follows Figure 3.

Figure 3: The stereo matching step of picking point.

Experimental

The acquisition of matching images is based on a laboratory environment. The model of two cameras are the Chinese Microvision EM200C, the camera is installed and debugged as a relatively parallel state. Using Windows7+VS2013+OPENCV3.0 as the test platform [18,19]. It is need to calibrate the left and right camera calibration before taking the picture in order to obtain the camera parameters and distortion parameters, and then stereo calibration should be done to get the rotation matrix and translation matrix between the two cameras. Finally, stereo rectify is to get a complete row alignment image and make stereo matching more simple and reliable. Figure 4a & 4b are imaging situation in the left and right camera of the same litchi string.

Figure 4: The image in left and right camera and the image of picking point.

Select Figure 4a to calculate the picking point. Calculate the minimum circumscribed rectangle of the litchi fruit region and draw an external rectangle, the effect is shown in Figure 1b. Harris algorithm was used to extract the corners of the litchi stems. A total of 79 corners were detected. The effect is shown in Figure 2a. Count the circle distance function value of each corner, and obtain the corner (which is a corner of Harris) with the largest value of the circle distance function is C 9 ( x 9, y 9 ) MathType@MTEF@5@5@+= feaagKart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr 4rNCHbGeaGWj0Jf9crFfpeea0xh9v8qiW7rqqrFfpeea0xe9Lq=Jc9 vqaqpepm0xbba9pwe9Q8fs0=yqaqpepae9pg0FirpepeKkFr0xfr=x fr=xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaqcLbsaqaaaaa aaaaWdbiaadoean8aadaWgaaqcfasaaKqzadWdbiaaiMdaaKqba+aa beaanmaabmaajuaGbaqcLbsapeGaamiEa0WdamaaBaaajuaibaqcLb mapeGaaGyoaiaacYcaaKqba+aabeaajugib8qacaWG5bqdpaWaaSba aKqbGeaajugWa8qacaaI5aaajuaGpaqabaaacaGLOaGaayzkaaaaaa@48A6@ whose coordinates is (337, 146), the effect is shown in Figure 2b, using cumulative probability Hough linear detection to detect the litchi stems, finally obtain the two-dimensional pixel coordinates of litchi picking point (352, 119), the effect of the picking point in the original image is shown in Figure 4c. The calculation of picking points and SGBM stereo matching for the collected 76 images. The rate of matching is up to 86.63%, Which can meet the precision requirement of visual positioning of litchi harvesting robot.

Conclusion

This paper presents a method to Identify the litchi fruit based on K-means clustering algorithm, to detect the line based on cumulative probability Hough linear detection and to detect the corner based on Harris algorithm in the ROI of litchi stems, finally, the two-dimensional pixel coordinates of the picking point is obtained. Then using the SGBM stereo matching to match the picking point of litchi to obtain the three - dimensional coordinates of litchi picking point. The experiment result shows that the recognition success rate of litchi picking point was 86.63%.

Acknowledgement

This work was financially supported by the National Natural Science Foundation of China (No. 31571568), Supported by Science and Technology Planning Project of Guangdong Province.(No.2015A020209111), science and technology project of Huizhou city (No.2014B040008006).

References

  1. Chenglin Wang, Yunchao Tang, Xiangjun Zou, Weiming SiTu, Wenxian Feng (2017) A robust fruit image segmentation algorithm against varying illumination for vision system of fruit harvesting robot. Optik-International Journal for Light and Electron Optics 131: 626-631.
  2.  Xiangjun Zou, Haixin Zou, Jun Lu (2012) Virtual manipulator-based binocular stereo vision positioning system and errors modeling. Machine Vision and Applications 23(1): 43-63.
  3. Xiangjun Zou, Min Ye, Chengyu Luo, Juntao Xiong, Lufeng Luo, et al. (2016) Fault-tolerant design of a limited universal fruit-picking end-effector based on visoin positioning error. Applied Engineering in Agriculture 32(1): 5-18.
  4. Chen Yan, Zou Xiangjun, Xu Dongfeng (2010) Mechanism Design and Kinematics Simulation of Litchi Harvesting Robot. Mechanical Design 27(05): 31-34.
  5. Chenglin Wang, Xiangjun Zou, Yunchao Tang, Lufeng Luo, Wenxian Feng (2016) Localisation of litchi in an unstructured environment using binocular stereo vision. Biosystems Engineering 145: 39-51.
  6. Xiong Juntao, Zou Xiangjun, Chen Lijuan, Peng Hongxing, Wu Dingzhong (2012) Fruit recognition and positioning technology of litchi picking manipulator. Journal of JIangsu University (Natural Science Eidt 33(1): 1-5.
  7. Xiong Juntao (2012) Study on vision position of litchi picking manipulator on complex on complex environment. South China Agricultural University, Guangzhou, China.
  8. Guo Aixia, Xiong Juntao, Xiao Deqin, Zou Xiangjun (2015) Computation of Picking Point of Litchi and Its Binocular Stereo Matching Based on Combined Algorithms of Harris and SIFT. Transactions of the Chinese Society for Agricultural Machinery 46(12): 11-17.
  9.  Krystian Mikolajczyk, Cordelia Schmid (2004) Scale & affine invariant interest point detectors. International Journal of Computer Vision 60(1): 63-86.
  10. Lufeng Luo, Yunchao Tang, Xiangjun Zou, Min Ye, Wenxian Feng, et al. (2016) Vision-based extraction of spatial information in grape clusters for harvesting robots. Biosystems Engineering 151: 90-104.
  11. Liu Jinxin (2012) Research of Camera Calibration and Stereo Matching in Binocular Vision. Guangdong University of Technology, Guangzhou, China.
  12. Xiang Juntao, Zou Xiangjun, Peng Hongxing, Chen Wenguang, Lin Guichao (2014) Real-time Identification and Picking Point Localization of Disturbance Citrus Picking. Journal of Agricultural Mechanization 45(8): 38-43.
  13. Luo L, Tang Y, Zou X, Wang C, Zhang P, et al. (2016) Robust Grape Clusters Detection in a Vineyard by 2 Combining AdaBoost Framework and Multiple Color 3 Components. Sensors (Basel) 16(12): E2098.
  14. Rafael C Gonzalez, Richard E Woods (2012) Digital Image Processing. (3rd edn), Publish House of Ecectronics Industry, Beijing, China, pp. 542-543.
  15. Luo Lufeng, Zou Xiangjun, Juntao Xiong, Zhang Yu, Peng Hongxing, et al. (2015) Automatic positioning for picking point of grape picking robot in natural environment. Transactions of the Chinese Society of Agricultural Engineering 31(2): 14-21.
  16. Matas J, Galambos C, Kittler J (2000) Robust detection of lines using the progressive probabilistic Hough transform. Computer Vision and Image Understanding 78(1): 119-137.
  17. Hirschmuller H (2005) Accurate and Effcient Stereo Processing by Semi-Global Matching and Mutual Information. IEEE San Diego, USA.
  18. Zhou Fang (2013) Research on Stereo Matching in Binocular Vision and its Implementation. Dalian University of Technology, DaLian, China.
  19. Yan Ruomei (2010) Research on the Remote Sensing Stereo Pair Compression Algorithm based on area. Xidian University, Xian, China.
Scholar Awards

At MedCrave we believe that knowledge should be shared. We also believe that   Read more...

Paper of the Year

In regard to the novelty and excellence of the manuscript MedCrave Group (MCG)   Read more...

Financial Support

MedCrave loves to recognize all the outstanding services delivered in the realms   Read more...

Sponsors

MedCrave accelerates the advancement of scientific research by convening   Read more...

MedCrave Reprints

MedCrave Group is ardent to provide article reprints at an instant affordable Read more...

© 2014-2017 MedCrave Group, All rights reserved. No part of this content may be reproduced or transmitted in any form or by any means as per the standard guidelines of fair use.
Creative Commons License Open Access by MedCrave Group is licensed under a Creative Commons Attribution 4.0 International License.
Based on a work at http://medcraveonline.com
Best viewed in Mozilla Firefox | Google Chrome | Above IE 7.0 version | Opera |Privacy Policy