Search

Sugarcane stem node identification is the core technology required for the intelligence and mechanization of the sugarcane industry. However, detecting stem nodes quickly and accurately is still a significant challenge. In this paper, in order to solve this problem, a new algorithm combining YOLOv3 and traditional methods of computer vision is proposed, which can improve the identification rate during automated cutting. First, the input image is preprocessed, during which affine transformation is used to correct the posture of the sugarcane and a rotation matrix is established to obtain the region of interest of the sugarcane. Then, a dataset is built to train the YOLOv3 network model and the position of the stem nodes is initially determined using the YOLOv3 model. Finally, the position of the stem nodes is further located accurately. In this step, a new gradient operator is proposed to extract the edge of the image after YOLOv3 recognition. Then, a local threshold determination method is proposed, which is used to binarize the image after edge extraction. Finally, a localization algorithm for stem nodes is designed to accurately determine the number and location of the stem nodes. The experimental results show that the precision rate, recall rate, and harmonic mean of the stem node recognition algorithm in this paper are 99.68%, 100%, and 99.84%, respectively. Compared to the YOLOv3 network, the precision rate and the harmonic mean are improved by 2.28% and 1.13%, respectively. Compared to other methods introduced in this paper, this algorithm has the highest recognition rate. [ABSTRACT FROM AUTHOR]

Thermal imaging cameras and infrared (IR) temperature measurement devices act as state-of-the-art techniques for non-contact temperature determination of the skin surface. The former is cost-intensive in many cases for widespread application, and the latter requires manual alignment to the measuring point. Due to this background, this paper proposes a new method for automated, non-contact, and area-specific temperature measurement of the facial skin surface. It is based on the combined use of a low-cost thermopile sensor matrix and a 2D image sensor. The temperature values as well as the 2D image data are fused using a parametric affine transformation. Based on face recognition, this allows temperature values to be assigned to selected facial regions and used specifically to determine the skin surface temperature. The advantages of the proposed method are described. It is demonstrated by means of a participant study that the temperature absolute values, which are achieved without manual alignment in an automated manner, are comparable to a commercially available IR-based forehead thermometer. [ABSTRACT FROM AUTHOR]

Airborne VHR SAR image registration is a challenging task. The number of CPs is a key factor for complex CP-based image registration. This paper presents a two-step matching approach to obtain more CPs for VHR SAR image registration. In the past decade, SIFT and other modifications have been widely used for remote sensing image registration. By incorporating feature point location affine transformation, a two-step matching scheme, which includes global and local matching, is proposed to allow for the determination of a much larger number of CPs. The proposed approach was validated by 0.5 m resolution C-band airborne SAR data acquired in Sichuan after the 2008 Wenchuan earthquake via a SAR system designed by the IECAS. With the proposed matching scheme, even the original SIFT, which is widely known to be unsuitable for SAR images, can achieve a much larger number of high-quality CPs than the one-step SIFT–OCT, which is tailored for SAR images. Compared with the classic one-step matching approach using both the SIFT and SITF–OCT algorithms, the proposed approach can obtain a larger number of CPs with improved precision. [ABSTRACT FROM AUTHOR]

The transfer of graphics to a product's surface is a widely known technology. Printing, engraving, and etching are used every day in production processes with countless types of materials. This paper deals with quality control for laser engraving on surfaces with variable dimensions via optical sensors. The engraving process, apart from colour changes, can induce volume and moisture changes, which lead to dimension changes in some materials. Natural materials and biomaterials are among the ones most affected. Combined with the porous and inhomogeneous structure of such a material, it can be difficult to measure the quality of graphic transfer, especially for shaded products. The quality control of laser-engraved photographs on thin layers of wood veneer was selected as a suitable problem to solve. A complex method for the quality measurement of the specified production was designed and tested. We used an affine transformation to determine the system behaviour and to determine the transfer function of material changes during the production process. Moreover, there is a possibility to compensate the image deformation of the engraved product. [ABSTRACT FROM AUTHOR]

This paper proposes an image augmentation model of limited samples on the mobile platform for object tracking. The augmentation method mainly aims at the detection failure caused by the small number of effective samples, jitter of tracking platform, and relative rotation between camera and object in the tracking process. Aiming at the object tracking problem, we first propose to use geometric projection transformation, multi-directional overlay blurring, and random background filling to improve the generalization ability of samples. Then, selecting suitable traditional augmentation methods as the supplements, an image augmentation model with an adjustable probability factor is provided to simulate various kinds of samples to help the detection model carry out more reliable training. Finally, combined with a spatial localization algorithm based on geometric constraints proposed by the author's previous work, a framework for object tracking with an image augmentation method is proposed. SSD, YOLOv3, YOLOv4, and YOLOx are adopted in the experiment of this paper as the detection models. And a large number of object recognition and object tracking experiments are carried out by combining with common data sets OTB50 and OTB100 as well as the OTMP data set proposed by us for mobile platform. The augmented module proposed in this paper is conducive for the detection model to improve the detection accuracy by at least 10%. Especially for objects with planar characteristics, the affine and projection transformation used in this paper can greatly improve the detection accuracy of the model. Based on the object tracking framework of our augmented model, the RMSE is estimated to be less than 4.21 cm in terms of the actual tracking of indoor objects. [ABSTRACT FROM AUTHOR]

It is difficult to find correct correspondences for infrared and visible image registration because of different imaging principles. Traditional registration methods based on the point feature require designing the complicated feature descriptor and eliminate mismatched points, which results in unsatisfactory precision and much calculation time. To tackle these problems, this paper presents an artful method based on constrained point features to align infrared and visible images. The proposed method principally contains three steps. First, constrained point features are extracted by employing an object detection algorithm, which avoids constructing the complex feature descriptor and introduces the senior semantic information to improve the registration accuracy. Then, the left value rule (LV-rule) is designed to match constrained points strictly without the deletion of mismatched and redundant points. Finally, the affine transformation matrix is calculated according to matched point pairs. Moreover, this paper presents an evaluation method to automatically estimate registration accuracy. The proposed method is tested on a public dataset. Among all tested infrared-visible image pairs, registration results demonstrate that the proposed framework outperforms five state-of-the-art registration algorithms in terms of accuracy, speed, and robustness. [ABSTRACT FROM AUTHOR]

Matching local feature points is an important but crucial step for various optical image processing applications, such as image registration, image mosaicking, and structure-from-motion (SfM). Three significant issues associated with this subject have been the focus for years, including the robustness of the image features detected, the number of matches obtained, and the efficiency of the data processing. This paper proposes a systematic algorithm that incorporates the synthetic-colored enhanced accelerated binary robust invariant scalar keypoints (SC-EABRISK) method and the affine transformation with bounding box (ATBB) procedure to address these three issues. The SC-EABRISK approach selects the most representative feature points from an image and rearranges their descriptors by adding color information for more precise image matching. The ATBB procedure, meanwhile, is an outreach that implements geometric mapping to retrieve more matches from the feature points ignored during SC-EABRISK processing. The experimental results obtained using benchmark imagery datasets, close-range photos (CRPs), and aerial and satellite images indicate that the developed algorithm can perform up to 20 times faster than the previous EABRISK method, achieve thousands of matches, and improve the matching precision by more than 90%. Consequently, SC-EABRISK with the ATBB algorithm can address image matching efficiently and precisely. [ABSTRACT FROM AUTHOR]

Accurate registration is an essential prerequisite for analysis and applications involving remote sensing imagery. It is usually difficult to extract enough matching points for inter-band registration in hyperspectral imagery due to the different spectral responses for land features in different image bands. This is especially true for non-adjacent bands. The inconsistency in geometric distortion caused by topographic relief also makes it inappropriate to use a single affine transformation relationship for the geometric transformation of the entire image. Currently, accurate registration between spectral bands of Zhuhai-1 satellite hyperspectral imagery remains challenging. In this paper, a full-spectrum registration method was proposed to address this problem. The method combines the transfer strategy based on the affine transformation relationship between adjacent spectrums with the differential correction from dense Delaunay triangulation. Firstly, the scale-invariant feature transform (SIFT) extraction method was used to extract and match feature points of adjacent bands. The RANdom SAmple Consensus (RANSAC) algorithm and the least square method is then used to eliminate mismatching point pairs to obtain fine matching point pairs. Secondly, a dense Delaunay triangulation was constructed based on fine matching point pairs. The affine transformation relation for non-adjacent bands was established for each triangle using the affine transformation relation transfer strategy. Finally, the affine transformation relation was used to perform differential correction for each triangle. Three Zhuhai-1 satellite hyperspectral images covering different terrains were used as experiment data. The evaluation results showed that the adjacent band registration accuracy ranged from 0.2 to 0.6 pixels. The structural similarity measure and cosine similarity measure between non-adjacent bands were both greater than 0.80. Moreover, the full-spectrum registration accuracy was less than 1 pixel. These registration results can meet the needs of Zhuhai-1 hyperspectral imagery applications in various fields. [ABSTRACT FROM AUTHOR]

Surveillance of sleeping posture is essential for bed-ridden patients or individuals at-risk of falling out of bed. Existing sleep posture monitoring and classification systems may not be able to accommodate the covering of a blanket, which represents a barrier to conducting pragmatic studies. The objective of this study was to develop an unobtrusive sleep posture classification that could accommodate the use of a blanket. The system uses an infrared depth camera for data acquisition and a convolutional neural network to classify sleeping postures. We recruited 66 participants (40 men and 26 women) to perform seven major sleeping postures (supine, prone (head left and right), log (left and right) and fetal (left and right)) under four blanket conditions (thick, medium, thin, and no blanket). Data augmentation was conducted by affine transformation and data fusion, generating additional blanket conditions with the original dataset. Coarse-grained (four-posture) and fine-grained (seven-posture) classifiers were trained using two fully connected network layers. For the coarse classification, the log and fetal postures were merged into a side-lying class and the prone class (head left and right) was pooled. The results show a drop of overall F1-score by 8.2% when switching to the fine-grained classifier. In addition, compared to no blanket, a thick blanket reduced the overall F1-scores by 3.5% and 8.9% for the coarse- and fine-grained classifiers, respectively; meanwhile, the lowest performance was seen in classifying the log (right) posture under a thick blanket, with an F1-score of 72.0%. In conclusion, we developed a system that can classify seven types of common sleeping postures under blankets and achieved an F1-score of 88.9%. [ABSTRACT FROM AUTHOR]

The human activities in the offshore oil and gas, renewable energy and construction industry require reliable data acquired by different types of hydrographic sensors: DGNSS (Differential Global Navigation Satellite System) positioning, attitude sensors, multibeam sonars, lidars or total stations installed on the offshore vessel, drones or platforms. Each component or sensor that produces information, unique to its position, will have a point that is considered as the reference point of that sensor. The accurate measurement of the offsets is vital to establish the mathematical relation between sensor and vessel common reference point in order to achieve sufficient accuracy of the survey data. If possible, the vessel will be put on a hard stand so that it can be very accurately measured using the standard land survey technique. However, due to the complex environment and sensors being mobilized when the vessel is in service, this may not be possible, and the offsets will have to be measured in sea dynamic conditions by means of a total station from a floating platform. This article presents the method of transformation by similarity with elements of affine transformation, called Q-ST (Quasi-Similarity Transformation). The Q-ST has been designed for measurements on such unstable substrates when it is not possible to level the total station (when the number of adjustment points is small (4–6 points)). Such situation occurs, among others, when measuring before the offshore duties or during the jack up or semi-submersible rig move. The presented calculation model is characterized by zero deviations at the adjustment points (at four common points). The transformation concerns the conversion of points between two orthogonal and inclined reference frames. The method enables the independent calculation of the scale factor, rotation matrix and system translation. Scaling is performed first in real space, and then both systems are shifted to the centroid, which is the center of gravity. The center of gravity is determined for the fit points that meet the criterion of stability of the orthogonal transformation. Then, the rotation matrix is computed, and a translation is performed from the computational (centroid) to real space. In the applied approach, the transformation parameters, scaling, rotation and translation, are determined independently, and the least squares method is applied independently at each stage of the calculations. The method has been verified in laboratory conditions as well as in real conditions. The results were compared to other known methods of coordinate transformation. The proposed approach is a development of the idea of transformation by similarity based on centroids. [ABSTRACT FROM AUTHOR]

Region proposal network (RPN) based trackers employ the classification and regression block to generate the proposals, the proposal that contains the highest similarity score is formulated to be the groundtruth candidate of next frame. However, region proposal network based trackers cannot make the best of the features from different convolutional layers, and the original loss function cannot alleviate the data imbalance issue of the training procedure. We propose the Spatial Cascaded Transformed RPN to combine the RPN and STN (spatial transformer network) together, in order to successfully obtain the proposals of high quality, which can simultaneously improves the robustness. The STN can transfer the spatial transformed features though different stages, which extends the spatial representation capability of such networks handling complex scenarios such as scale variation and affine transformation. We break the restriction though an easy samples penalization loss (shrinkage loss) instead of smooth L1 function. Moreover, we perform the multi-cue proposals re-ranking to guarantee the accuracy of the proposed tracker. We extensively prove the effectiveness of our proposed method on the ablation studies of the tracking datasets, which include OTB-2015 (Object Tracking Benchmark 2015), VOT-2018 (Visual Object Tracking 2018), LaSOT (Large Scale Single Object Tracking), TrackingNet (A Large-Scale Dataset and Benchmark for Object Tracking in the Wild) and UAV123 (UAV Tracking Dataset). [ABSTRACT FROM AUTHOR]

Most 3D point cloud watermarking techniques apply Principal Component Analysis (PCA) to protect the watermark against affine transformation attacks. Unfortunately, they fail in the case of cropping and random point removal attacks. In this work, an alternative approach is proposed that solves these issues efficiently. A point cloud registration technique is developed, based on a 3D convex hull. The scale and the initial rigid affine transformation between the watermarked and the original point cloud can be estimated in this way to obtain a coarse point cloud registration. An iterative closest point algorithm is performed after that to align the attacked watermarked point cloud to the original one completely. The watermark can then be extracted from the watermarked point cloud easily. The extensive experiments confirmed that the proposed approach resists the affine transformation, cropping, random point removal, and various combinations of these attacks. The most dangerous is an attack with noise that can be handled only to some extent. However, this issue is common to the other state-of-the-art approaches. [ABSTRACT FROM AUTHOR]