Sugarcane nodes identification algorithm based on sum of local pixel of minimum points of vertical projection function

2021 ◽  
Vol 182 ◽  
pp. 105994
Author(s):  
Jiqing Chen ◽  
Jiahua Wu ◽  
Hu Qiang ◽  
Bobo Zhou ◽  
Guanwen Xu ◽  
...  
Keyword(s):  
Identification Algorithm ◽  
Projection Function ◽  
Vertical Projection ◽  
Minimum Points

scholarly journals Sugarcane stem nodes based on the maximum value points of the vertical projection function

2020 ◽  
Vol 50 (12) ◽  
Author(s):  
Jiqing Chen ◽  
Hu Qiang ◽  
Guanwen Xu ◽  
Jiahua Wu ◽  
Xu Liu ◽  
...  
Keyword(s):  
Standard Deviation ◽  
Color Image ◽  
Recognition Rate ◽  
Binary Image ◽  
Projection Function ◽  
Vertical Projection ◽  
Stem Node ◽  
Simultaneous Identification ◽  
Sugarcane Stem ◽  
Component Image

ABSTRACT: In order to solve the problem that the stem nodes are difficult to identify in the process of sugarcane seed automatic cutting, a method of identifying the stem nodes of sugarcane based on the extreme points of vertical projection function is proposed in this paper. Firstly, in order to reduce the influence of light on image processing, the RGB color image is converted to HSI color image, and the S component image of the HSI color space is extracted as a research object. Then, the S component image is binarized by the Otsu method, the hole of the binary image is filled by morphology closing algorithm, and the sugarcane and the background are initially separated by the horizontal projection map of the binary image. Finally, the position of sugarcane stem is preliminarily determined by continuously taking the derivative of the vertical projection function of the binary image, and the sum of the local pixel value of the suspicious pixel column is compared to further determine the sugarcane stem node. The experimental results showed that the recognition rate of single stem node is 100%, and the standard deviation is less than 1.1 mm. The accuracy of simultaneous identification of double stem nodes is 98%, and the standard deviation is less than 1.7 mm. The accuracy of simultaneous identification of the three stem nodes is 95%, and the standard deviation is less than 2.2 mm. Compared with the other methods introduced in this paper, the proposed method has higher recognition and accuracy.

Tire Rolling Kinematics Model for an Intelligent Tire Based on an Accelerometer

2020 ◽  
Vol 48 (4) ◽  
pp. 287-314
Author(s):  
Yan Wang ◽  
Zhe Liu ◽  
Michael Kaliske ◽  
Yintao Wei
Keyword(s):  
Elastic Deformation ◽  
Estimation Algorithm ◽  
Force Sensor ◽  
Euler Method ◽  
Rolling Contact ◽  
Body Motion ◽  
Identification Algorithm ◽  
Active Perception ◽  
Kinematics Model ◽  
Ring Model

ABSTRACT The idea of intelligent tires is to develop a tire into an active perception component or a force sensor with an embedded microsensor, such as an accelerometer. A tire rolling kinematics model is necessary to link the acceleration measured with the tire body elastic deformation, based on which the tire forces can be identified. Although intelligent tires have attracted wide interest in recent years, a theoretical model for the rolling kinematics of acceleration fields is still lacking. Therefore, this paper focuses on an explicit formulation for the tire rolling kinematics of acceleration, thereby providing a foundation for the force identification algorithms for an accelerometer-based intelligent tire. The Lagrange–Euler method is used to describe the acceleration field and contact deformation of rolling contact structures. Then, the three-axis acceleration vectors can be expressed by coupling rigid body motion and elastic deformation. To obtain an analytical expression of the full tire deformation, a three-dimensional tire ring model is solved with the tire–road deformation as boundary conditions. After parameterizing the ring model for a radial tire, the developed method is applied and validated by comparing the calculated three-axis accelerations with those measured by the accelerometer. Based on the features of acceleration, especially the distinct peak values corresponding to the tire leading and trailing edges, an intelligent tire identification algorithm is established to predict the tire–road contact length and tire vertical load. A simulation and experiments are conducted to verify the accuracy of the estimation algorithm, the results of which demonstrate good agreement. The proposed model provides a solid theoretical foundation for an acceleration-based intelligent tire.

Localization and Non-Localization Node Identification Using Dream in MANET

2016 ◽  
Vol 2 (2) ◽  
Author(s):  
Amit Singh ◽  
Nitin Mishra ◽  
Angad Singh
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Fundamental Problem ◽  
Identification Algorithm ◽  
Mobile Nodes ◽  
Position Information ◽  
Location Services ◽  
Wireless Router ◽  
Mobile Ad Hoc

 A Wireless Mobile Ad-hoc Network consists of variety of mobile nodes that temporally kind a dynamic infrastructure less network. To modify communication between nodes that don’t have direct radio contact, every node should operate as a wireless router and potential forward knowledge traffic of behalf of the opposite node. In MANET Localization is a fundamental problem. Current localization algorithm mainly focuses on checking the localizability of a network and/or how to localize as many nodes as possible. It could provide accurate position information foe kind of expanding application. Localization provide information about coverage, deployment, routing, location, services, target tracking and rescue If high mobility among the mobile nodes occurs path failure breaks. Hence the location information cannot be predicted. Here we have proposed a localization based algorithm which will help to provide information about the localized and non-localized nodes in a network. In the proposed approach DREAM protocol and AODV protocol are used to find the localizability of a node in a network. DREAM protocol is a location protocol which helps to find the location of a node in a network whereas AODV is a routing protocol it discover route as and when necessary it does not maintain route from every node to every other. To locate the mobile nodes in a n/w an node identification algorithm is used. With the help of this algorithm localized and non-localized node can be easily detected in respect of radio range. This method helps to improve the performance of a module and minimize the location error and achieves improved performance in the form of UDP packet loss, received packet and transmitted packets, throughput, routing overhead, packet delivery fraction. All the simulation done through the NS-2 module and tested the mobile ad-hoc network.

An Efficient Genuine-Video Identification Algorithm: TDIA

2010 ◽  
Vol 33 (1) ◽  
pp. 175-183 ◽  
Author(s):  
Guo-Rui ZHOU ◽  
Wen-Jiang WANG ◽  
Shi-Xin SUN
Keyword(s):  
Identification Algorithm ◽  
Video Identification

Target Localization and Identification Algorithm for Ultra Wideband Through-wall Radar

2010 ◽  
Vol 32 (11) ◽  
pp. 2624-2629 ◽  
Author(s):  
Shi-you Wu ◽  
Qiong Huang ◽  
Jie Chen ◽  
Sheng-wei Meng ◽  
Guang-you Fang ◽  
...  
Keyword(s):  
Target Localization ◽  
Ultra Wideband ◽  
Identification Algorithm

scholarly journals Cut-Edge Detection Method for Rice Harvesting Based on Machine Vision

Agronomy ◽  
2020 ◽  
Vol 10 (4) ◽  
pp. 590
Author(s):  
Zhenqian Zhang ◽  
Ruyue Cao ◽  
Cheng Peng ◽  
Renjie Liu ◽  
Yifan Sun ◽  
...  
Keyword(s):  
Machine Vision ◽  
Edge Detection ◽  
Detection Method ◽  
Region Of Interest ◽  
Average Error ◽  
Vertical Projection ◽  
Cut Edge ◽  
Fitting Method ◽  
Combine Harvester ◽  
Edge Detection Method

A cut-edge detection method based on machine vision was developed for obtaining the navigation path of a combine harvester. First, the Cr component in the YCbCr color model was selected as the grayscale feature factor. Then, by detecting the end of the crop row, judging the target demarcation and getting the feature points, the region of interest (ROI) was automatically gained. Subsequently, the vertical projection was applied to reduce the noise. All the points in the ROI were calculated, and a dividing point was found in each row. The hierarchical clustering method was used to extract the outliers. At last, the polynomial fitting method was used to acquire the straight or curved cut-edge. The results gained from the samples showed that the average error for locating the cut-edge was 2.84 cm. The method was capable of providing support for the automatic navigation of a combine harvester.

Sign in / Sign up

Export Citation Format

Share Document