Features From Accelerated Segment Test Research Articles

Detection of Face-Mask in Real Time: A Cascaded Bi-Level Feature Extraction Technique Approach

Due to COVID-19's rapid spread, millions of people around the world have been affected and there has been extensive destruction. One of the most effective ways of preventing its spread and transmission during the pandemic period wearing of a mask and was required then in most public areas. As a result, this necessitate the use of programmed real-time mask detection devices in place of manual reminders. Face mask detection requires real-time processing of a huge amount of data with constrained processing resources, hence local descriptors that are quick to calculate, quick to match, and cheap to store are highly sought after. To achieve improved matching and reduction in memory use and computational complexity, the study offers a combination of Features from Accelerated Segment Test (FAST) corner detector with Histogram of Oriented Gradient (HOG) feature descriptor to allow faster matching and minimize memory usage and computation cost. The features obtained were then classified into face mask present and face mask absent using SVM, NB and CNN. Results obtained gives an accuracy of 99.41% which was higher than that previous results of 99.27% and 95% accuracy. Furthermore, it took the system only 48secs to extract the features obtained from face for training and testing. This outcome confirmed the suitability of the suggested method for real-time face mask detection.

A Binary Fast Image Registration Method Based on Fusion Information

In the field of airborne aerial imaging, image stitching is often used to expand the field of view. Registration is the foundation of aerial image stitching and directly affects its success and quality. This article develops a fast binary image registration method based on the characteristics of airborne aerial imaging. This method first integrates aircraft parameters and calculates the ground range of the image for coarse registration. Then, based on the characteristics of FAST (Features from Accelerated Segment Test), a new sampling method, named Weighted Angular Diffusion Radial Sampling (WADRS), and matching method are designed. The method proposed in this article can achieve fast registration while ensuring registration accuracy, with a running speed that is approximately four times faster than SURF (Speed Up Robust Features). Additionally, there is no need to manually select any control points before registration. The results indicate that the proposed method can effectively complete remote sensing image registration from different perspectives.

Fast Automatic Registration of UAV Images via Bidirectional Matching.

Image registration plays a vital role in the mosaic process of multiple UAV (Unmanned Aerial Vehicle) images acquired from different spatial positions of the same scene. Aimed at the problem that many fast registration methods cannot provide both high speed and accuracy simultaneously for UAV visible light images, this work proposes a novel registration framework based on a popular baseline registration algorithm, ORB-the Oriented FAST (Features from Accelerated Segment Test) and Rotated BRIEF (Binary Robust Independent Elemental Features) algorithm. First, the ORB algorithm is utilized to extract image feature points fast. On this basis, two bidirectional matching strategies are presented to match obtained feature points. Then, the PROSRC (Progressive Sample Consensus) algorithm is applied to remove false matches. Finally, the experiments are carried out on UAV image pairs about different scenes including urban, road, building, farmland, and forest. Compared with the original version and other state-of-the-art registration methods, the bi-matching ORB algorithm exhibits higher accuracy and faster speed without any training or prior knowledge. Meanwhile, its complexity is quite low for on-board realization.

FPGA-Based Feature Extraction and Tracking Accelerator for Real-Time Visual SLAM.

Due to its advantages of low latency, low power consumption, and high flexibility, FPGA-based acceleration technology has been more and more widely studied and applied in the field of computer vision in recent years. An FPGA-based feature extraction and tracking accelerator for real-time visual odometry (VO) and visual simultaneous localization and mapping (V-SLAM) is proposed, which can realize the complete acceleration processing capability of the image front-end. For the first time, we implement a hardware solution that combines features from accelerated segment test (FAST) feature points with Gunnar Farneback (GF) dense optical flow to achieve better feature tracking performance and provide more flexible technical route selection. In order to solve the scale invariance and rotation invariance lacking problems of FAST features, an efficient pyramid module with a five-layer thumbnail structure was designed and implemented. The accelerator was implemented on a modern Xilinx Zynq FPGA. The evaluation results showed that the accelerator could achieve stable tracking of features of violently shaking images and were consistent with the results from MATLAB code running on PCs. Compared to PC CPUs, which require seconds of processing time, the processing latency was greatly reduced to the order of milliseconds, making GF dense optical flow an efficient and practical technical solution on the edge side.

Development of a Hybrid Method for Multi-Stage End-to-End Recognition of Grocery Products in Shelf Images

Product recognition on grocery shelf images is a compelling task of object detection because of the similarity between products, the presence of the different scale of product sizes, and the high number of classes, in addition to constantly renewed packaging and added new products’ difficulty in data collection. The use of conventional methods alone is not enough to solve a number of retail problems such as planogram compliance, stock tracking on shelves, and customer support. The purpose of this study is to achieve significant results using the suggested multi-stage end-to-end process, including product detection, product classification, and refinement. The comparison of different methods is provided by a traditional computer vision approach, Aggregate Channel Features (ACF) and Single-Shot Detectors (SSD) are used in the product detection stage, and Speed-up Robust Features (SURF), Binary Robust Invariant Scalable Key points (BRISK), Oriented Features from Accelerated Segment Test (FAST), Rotated Binary Robust Independent Elementary Features (BRIEF) (ORB), and hybrids of these methods are used in the product classification stage. The experimental results used the entire Grocery Products dataset and its different subsets with a different number of products and images. The best performance was achieved with the use of SSD in the product detection stage and the hybrid use of SURF, BRISK, and ORB in the product classification stage, respectively. Additionally, the proposed approach performed comparably or better than existing models.

An Improved and Efficient Content-Based Medical Image Retrieval Technique vs State-of-Art Texture Feature Extraction Techniques

Areas in the health sector such as X-rays, Dermatology, High-resolution Computed Tomography – HRCT, Endoscopy, Radiology, Cardiology and Magnetic Resonance Imaging – MRI heavily depend on medical images for their activities hence it has become complex for managing and accessing these images from their repositories. As a matter of concern content-based medical image retrieval-CBMIR has been the system proposed by many researchers for handling access to similar medical image(s) as the input image, yet there is a caveat that has to be addressed with respect to which technique best suits CBMIR system with respect to a given performance metric. Medical images are mostly of grayscale and therefore color feature extraction techniques may not work effectively on them. Since there is no clear indication of which of the various texture feature extraction techniques is best suited for a given performance metric, this work seeks to comparatively evaluate the performance of the following state-of-the-art texture feature extraction techniques; Local Binary Pattern (LBP), Gabor Filter, Gray-Level Co-occurrence Matrix (GLCM), Haralick Descriptor, Features from Accelerated Segment Test (FAST) and a Proposed Technique using the metrics; Precision, Recall, F1-score, Mean Squared Error (MSE), Accuracy and Time. The results showed that the proposed technique is best suited for systems focusing on precision with an average precision score of 100% over 10.5k of raw medical images (dataset) using an appreciable minimum time with time complexity of 0(n).

Performance Evaluation of State-of-the-Art Texture Feature Extraction Techniques on Medical Imagery Tasks

Interpreting medical images is certainly a complex task which requires extensive knowledge [1]. According to Computer Aided Diagnosis (CAD) serves as a second opinion that will help radiologists in diagnosis and on the other hand Content-based Image Retrieval uses visual content to help users browse, search and retrieve similar medical images from a database based on the user’s interest [2-4]. The competency of the CBMIR system depends on feature extraction methods [5]. The textural features are very important to determine the content of a medical image. Textural features provide scenic depth, the spatial distribution of tonal variation, and surface orientation [6]. Therefore, this study seeks to compare and evaluate some of the hand-crafted texture feature extraction techniques in CBMIR. This is to help those concerned in enhancing CBIR systems to make informed decisions concerning the selection of the best textural feature extraction techniques. Since there is no clear indication of which of the various texture feature extraction techniques is best suited for a given performance metric when considering which of the techniques to choose for a particular study in CBMIR systems. The objective of this work, therefore, is to comparatively evaluate the performance of the following texture feature extraction techniques; Local Binary Pattern (LBP), Gabor Filter, Gray-Level Co-occurrence Matrix (GLCM), Haralick Descriptor, Features from Accelerated Segment Test (FAST) and Features from Accelerated Segment Test and Binary Robust Independent Elementary Features (FAST &BRIEF) using the metrics; precision, recall, f1-score, mean squared error (MSE), accuracy and time. These techniques are coupled with specific similarity measure to obtain results. The results showed that LBP, Haralick Descriptor, FAST, and GLCM had the best results in terms of (Precision and Accuracy), Time, F1-Score, and Recall respectively. LBP had 82.05% and 88.23% scores for precision and accuracy respectively. The following scores represent the performance of the Haralick descriptor, FAST, and GLCM models respectively; 0.88s, 38.7%, and 44.82%. These test scores are obtained from datasets ranging from 1k-10.5k. Aside from LBP outperforming the other 5 models mentioned, it still outperformed the following proposed models ' [7]’, ‘Tamura texture feature and wavelet transform combined with Hausdorff distance - [8]’, ‘ [9]’ in terms of (precision, accuracy, and recall) and (precision and recall) respectively and probably f1-score (since f1-score is the weighted average of precision and recall). It is believed that an ensemble of LBP, Haralick descriptors, and Support Vector Machine (SVM) can represent a robust system for both medical image retrieval and classification.

Hybrid Bag-of-Visual-Words and FeatureWiz Selection for Content-Based Visual Information Retrieval.

Recently, content-based image retrieval (CBIR) based on bag-of-visual-words (BoVW) model has been one of the most promising and increasingly active research areas. In this paper, we propose a new CBIR framework based on the visual words fusion of multiple feature descriptors to achieve an improved retrieval performance, where interest points are separately extracted from an image using features from accelerated segment test (FAST) and speeded-up robust features (SURF). The extracted keypoints are then fused together in a single keypoint feature vector and the improved RootSIFT algorithm is applied to describe the region surrounding each keypoint. Afterward, the FeatureWiz algorithm is employed to reduce features and select the best features for the BoVW learning model. To create the codebook, K-means clustering is applied to quantize visual features into a smaller set of visual words. Finally, the feature vectors extracted from the BoVW model are fed into a support vector machines (SVMs) classifier for image retrieval. An inverted index technique based on cosine distance metric is applied to sort the retrieved images to the similarity of the query image. Experiments on three benchmark datasets (Corel-1000, Caltech-10 and Oxford Flower-17) show that the presented CBIR technique can deliver comparable results to other state-of-the-art techniques, by achieving average accuracies of 92.94%, 98.40% and 84.94% on these datasets, respectively.

Point Cloud Plane Segmentation-Based Robust Image Matching for Camera Pose Estimation

The mainstream image matching method for recovering the motion of the camera is based on local feature matching, which faces the challenges of rotation, illumination, and the presence of dynamic objects. In addition, local feature matching relies on the distance between descriptors, which easily leads to lots of mismatches. In this paper, we propose a new robust image matching method for camera pose estimation, called IM_CPE. It is a novel descriptor matching method combined with 3-D point clouds for image matching. Specifically, we propose to extract feature points based on a pair of matched point cloud planes, which are generated and segmented based on depth images. Then, the feature points are matched based on the distance between their corresponding 3-D points on the point cloud planes and the distance between their descriptors. Moreover, the robustness of the matching can be guaranteed by the centroid distance of the matched point cloud planes. We evaluate the performance of IM_CPE using four well-known key point extraction algorithms, namely Scale-Invariant Feature Transform (SIFT), Speed Up Robust Feature (SURF), Features from Accelerated Segment Test (FAST), and Oriented FAST and Rotated Brief (ORB), with four sequences from the TUM RGBD dataset. According to the experimental results, compared to the original SIFT, SURF, FAST, and ORB algorithms, the NN_mAP performance of the four key point algorithms has been improved by 11.25%, 13.98%, 16.63%, and 10.53% on average, respectively, and the M.Score has also been improved by 25.15%, 23.05%, 22.28%, and 11.05% on average, respectively. The results show that the IM_CPE can be combined with the existing key points extraction algorithms and the IM_CPE can significantly improve the performance of these key points algorithms.

Improved FAST algorithm for non-uniform rotational distortion correction in OCT endoscopic imaging.

Optical Coherence Tomography (OCT) is widely used for endoscopic imaging in endoluminal organs because of its high imaging accuracy and resolution. However, OCT endoscopic imaging suffers from Non-Uniform Rotational Distortion (NURD), which can be caused by many factors, such as irregular motor rotation and changes in friction between the probe and the sheath. Correcting this distortion is essential to obtaining high-quality Optical Coherence Tomography Angiography (OCTA) images. There are two main approaches for correcting NURD: hardware-based methods and algorithm-based methods. Hardware-based methods can be costly, challenging to implement, and may not eliminate NURD. Algorithm-based methods, such as image registration, can be effective for correcting NURD but can also be prone to the problem of NURD propagation. To address this issue, we process frames by coarse and fine registration, respectively. The new reference frame is generated by filtering out the A-scan that may have the NURD problem by coarse registration. And the fine registration uses this frame to achieve the final NURD correction. In addition, we have improved the Features from Accelerated Segment Test (FAST) algorithm and put it into coarse and fine registration process. Four evaluation functions were used for the experimental results, including signal-to-noise ratio (SNR), peak signal-to-noise ratio (PSNR), mean squared error (MSE), and structural similarity index measure (SSIM). By comparing with Scale-invariant feature transform (SIFT), Speeded up robust features (SURF), Oriented FAST and Rotated BRIEF (ORB), intensity-based (Cross-correlation), and Optical Flow algorithms, our algorithm has a higher similarity between the corrected frames. Moreover, the noise in the OCTA data is better suppressed, and the vascular information is well preserved. Our image registration-based algorithm reduces the problem of NURD propagation between B-scan frames and improves the imaging quality of OCT endoscopic images.

A Novel Subpixel Industrial Chip Detection Method Based on the Dual-Edge Model for Surface Mount Equipment

Vision-based location of industrial chips is crucial for high-speed and high-precision mounting in surface mount technology (SMT) applications. The conventional general location method requires numerous details of the chips’ physical characteristics, making it unsuitable for unknown chip locations and offline learning. In this article, we propose a general chip detection algorithm based on subpixel features from accelerated segment test (FAST) points that offers strong applicability, high precision, and high speed. The core part of our method is the extraction of subpixel boundary FAST points. The conventional subpixel calculation method uses a single-edge model that results in large deviations between calculated and actual positions when applied to actual FAST points. We propose a dual-edge subpixel model containing two groups of edges to reduce this error. Compared with the iterative calculation method in OpenCV, this method has a closing solution and faster performance. We determine model parameters using spatial moments, and present the relationship between the model and subpixel positions. Our experiments on the SMT hardware platform demonstrate that our method is robust to noise, illumination, position, and chip type, and is faster, more accurate, and more reliable than the Hanwha SM481-Plus placement machine and point registration method.

A monocular SLAM system based on SIFT features for gastroscope tracking

During flexible gastroscopy, physicians have extreme difficulties to self-localize. Camera tracking method such as simultaneous localization and mapping (SLAM) has become a research hotspot in recent years, allowing tracking of the endoscope. However, most of the existing solutions have focused on tasks in which sufficient texture information is available, such as laparoscope tracking, and cannot be applied to gastroscope tracking since gastroscopic images have fewer textures than laparoscopic images. This paper proposes a new monocular SLAM framework based on scale-invariant feature transform (SIFT) and narrow-band imaging (NBI), which extracts SIFT features instead of oriented features from accelerated segment test (FAST) and rotated binary robust independent elementary features (BRIEF) features from gastroscopic NBI images, and performs feature retention based on the response sorting strategy for achieving more matches. Experimental results show that the root mean squared error of the proposed algorithm can reach a minimum of 2.074mm, and the pose accuracy can be improved by up to 25.73% compared with oriented FAST and rotated BRIEF (ORB)-SLAM. SIFT features and response sorting strategy can achieve more accurate matching in gastroscopic NBI images than other features and homogenization strategy, and the proposed algorithm can also run successfully on real clinical gastroscopic data. The proposed algorithm has the potential clinical value to assist physicians in locating the gastroscope during gastroscopy.

Automated segmentation and classification of hand thermal images in rheumatoid arthritis using machine learning algorithms: A comparison with quantum machine learning technique

The aims and objectives of the study were to i) perform image segmentation using a color-based k-means clustering algorithm and feature extraction using binary robust invariant scalable key points (BRISK), maximum stable extremal regions (MSER), features from accelerated segment test (FAST), Harris, and orientated FAST and rotated BRIEF (ORB); ii) compare the performance of classical machine learning techniques such as LogitBoost, Bagging, and SVM with a quantum machine learning technique. For the proposed study, 240 hand thermal images were acquired in the dorsal view and ventral view of both the right and left-hand regions of RA and normal subjects. The hot spot regions from the thermograms were segmented using a color-based k-means clustering technique. The features from the segmented hot spot region were extracted using different feature extraction methods. Finally, normal and RA groups were categorized using LogitBoost, Bagging, and support vector machine (SVM) classifiers. The proposed study used two testing methods, such as 10-fold cross-validation and a percentage split of 80–20%. The LogitBoost classifier outperformed with an accuracy of 93.75% using the 10-fold cross-validation technique compared to other classifiers. Also, the quantum support vector machine (QSVM) obtained a prediction accuracy of 92.7%. Furthermore, the QSVM model reduces the computational cost and training time of the model to classify the RA and normal subjects. Thus, thermograms with classical machine learning and quantum machine learning algorithms could be considered a feasible technique for classifying normal and RA groups.

A malware detection system using a hybrid approach of multi-heads attention-based control flow traces and image visualization

Android is the most widely used mobile platform, making it a prime target for malicious attacks. Therefore, it is imperative to effectively circumvent these attacks. Recently, machine learning has been a promising solution for malware detection, which relies on distinguishing features. While machine learning-based malware scanners have a large number of features, adversaries can avoid detection by using feature-related expertise. Therefore, one of the main tasks of the Android security industry is to consistently propose cutting-edge features that can detect suspicious activity. This study presents a novel feature representation approach for malware detection that combines API-Call Graphs (ACGs) with byte-level image representation. First, the reverse engineering procedure is used to obtain the Java programming codes and Dalvik Executable (DEX) file from Android Package Kit (APK). Second, to depict Android apps with high-level features, we develop ACGs by mining API-Calls and API sequences from Control Flow Graph (CFG). The ACGs can act as a digital fingerprint of the actions taken by Android apps. Next, the multi-head attention-based transfer learning method is used to extract trained features vector from ACGs. Third, the DEX file is converted to a malware image, and the texture features are extracted and highlighted using a combination of FAST (Features from Accelerated Segment Test) and BRIEF (Binary Robust Independent Elementary Features). Finally, the ACGs and texture features are combined for effective malware detection and classification. The proposed method uses a customized dataset prepared from the CIC-InvesAndMal2019 dataset and outperforms state-of-the-art methods with 99.27% accuracy.

Detection of the patient with COVID-19 relying on ML technology and FAST algorithms to extract the features

COVID-19 is unquestionably one of the most hazardous health issues of our century, and it is a significant cause of mortality for both men and women throughout the globe. Even with the most advanced pharmacological and technical innovations, cancer oncologists, and biologists still have a substantial problem treating COVID-19. For patients with COVID-19, it is critical to offer initial, precise, and effective indicative procedures to increase their survival and minimize morbidity and mortality, which is currently lacking. A COVID-19 detection method has been presented in this paper for the initial identification of COVID-19 hazard factors. Features from accelerated segment test (FAST), a robust feature was used to extract features in this suggested method. The experiments show that it is possible to identify FAST traits efficiently. A consequence was a high success rate (98%) for accuracy performance.

Fusing hand-crafted and deep-learning features in a convolutional neural network model to identify prostate cancer in pathology images.

Prostate cancer can be diagnosed by prostate biopsy using transectal ultrasound guidance. The high number of pathology images from biopsy tissues is a burden on pathologists, and analysis is subjective and susceptible to inter-rater variability. The use of machine learning techniques could make prostate histopathology diagnostics more precise, consistent, and efficient overall. This paper presents a new classification fusion network model that was created by fusing eight advanced image features: seven hand-crafted features and one deep-learning feature. These features are the scale-invariant feature transform (SIFT), speeded up robust feature (SURF), oriented features from accelerated segment test (FAST) and rotated binary robust independent elementary features (BRIEF) (ORB) of local features, shape and texture features of the cell nuclei, the histogram of oriented gradients (HOG) feature of the cavities, a color feature, and a convolution deep-learning feature. Matching, integrated, and fusion networks are the three essential components of the proposed deep-learning network. The integrated network consists of both a backbone and an additional network. When classifying 1100 prostate pathology images using this fusion network with different backbones (ResNet-18/50, VGG-11/16, and DenseNet-121/201), we discovered that the proposed model with the ResNet-18 backbone achieved the best performance in terms of the accuracy (95.54%), specificity (93.64%), and sensitivity (97.27%) as well as the area under the receiver operating characteristic curve (98.34%). However, each of the assessment criteria for these separate features had a value lower than 90%, which demonstrates that the suggested model combines differently derived characteristics in an effective manner. Moreover, a Grad-CAM++ heatmap was used to observe the differences between the proposed model and ResNet-18 in terms of the regions of interest. This map showed that the proposed model was better at focusing on cancerous cells than ResNet-18. Hence, the proposed classification fusion network, which combines hand-crafted features and a deep-learning feature, is useful for computer-aided diagnoses based on pathology images of prostate cancer. Because of the similarities in the feature engineering and deep learning for different types of pathology images, the proposed method could be used for other pathology images, such as those of breast, thyroid cancer.

Real-time detection of crop rows in maize fields based on autonomous extraction of ROI

The current crop rows detection based on machine vision generally has the problems of low detection accuracy and poor real-time performance. Moreover, crop rows detection remains a challenging problem in complex field conditions, such as high weeds pressure, poor illumination conditions, and vegetation foliage shading. We propose a crop rows detection algorithm based on autonomous extraction of ROI (Region of interest). The prior method computes the feature points of the entire image and groups them into the crop rows which they belong to. Instead, we consider the core of crop rows detection problem to be the extraction of the travelling area of agricultural machinery in maize fields. A YOLO (You Only Look Once) neural network is employed to predict the travelling area of the agricultural machinery end-to-end. The prediction boxes are unified into ROI and the crop and soil background are segmented in the ROI by Excess Green operator and Otsu’s method. Then, the feature points of crops are extracted using FAST (Features from Accelerated Segment Test) corner point detection, and finally the detection lines of crop rows are fitted with least squares method. Because image recognition is limited to a valid region after the ROI is extracted, the processing speed of our algorithm is remarkably fast. It takes only about 25 ms to process a single image (640*360 pixels) and the frame rate of video stream exceeds 40FPS. Meanwhile, it can achieve high accuracy and robust extraction of ROI in various maize fields. The average error angle of the detection lines is 1.88°, which can meet the real-time and accuracy requirements of field navigation. The proposed algorithm can provide a new solution to the current machine vision-based navigation technology for agricultural machinery. Code is available at: https://github.com/WoodratTradeCo/crop-rows-detection.

Computer-Vision-Based Vibration Tracking Using a Digital Camera: A Sparse-Optical-Flow-Based Target Tracking Method.

Computer-vision-based target tracking is a technology applied to a wide range of research areas, including structural vibration monitoring. However, current target tracking methods suffer from noise in digital image processing. In this paper, a new target tracking method based on the sparse optical flow technique is introduced for improving the accuracy in tracking the target, especially when the target has a large displacement. The proposed method utilizes the Oriented FAST and Rotated BRIEF (ORB) technique which is based on FAST (Features from Accelerated Segment Test), a feature detector, and BRIEF (Binary Robust Independent Elementary Features), a binary descriptor. ORB maintains a variety of keypoints and combines the multi-level strategy with an optical flow algorithm to search the keypoints with a large motion vector for tracking. Then, an outlier removal method based on Hamming distance and interquartile range (IQR) score is introduced to minimize the error. The proposed target tracking method is verified through a lab experiment—a three-story shear building structure subjected to various harmonic excitations. It is compared with existing sparse-optical-flow-based target tracking methods and target tracking methods based on three other types of techniques, i.e., feature matching, dense optical flow, and template matching. The results show that the performance of target tracking is greatly improved through the use of a multi-level strategy and the proposed outlier removal method. The proposed sparse-optical-flow-based target tracking method achieves the best accuracy compared to other existing target tracking methods.

Explainable Malware Detection System Using Transformers-Based Transfer Learning and Multi-Model Visual Representation.

Android has become the leading mobile ecosystem because of its accessibility and adaptability. It has also become the primary target of widespread malicious apps. This situation needs the immediate implementation of an effective malware detection system. In this study, an explainable malware detection system was proposed using transfer learning and malware visual features. For effective malware detection, our technique leverages both textual and visual features. First, a pre-trained model called the Bidirectional Encoder Representations from Transformers (BERT) model was designed to extract the trained textual features. Second, the malware-to-image conversion algorithm was proposed to transform the network byte streams into a visual representation. In addition, the FAST (Features from Accelerated Segment Test) extractor and BRIEF (Binary Robust Independent Elementary Features) descriptor were used to efficiently extract and mark important features. Third, the trained and texture features were combined and balanced using the Synthetic Minority Over-Sampling (SMOTE) method; then, the CNN network was used to mine the deep features. The balanced features were then input into the ensemble model for efficient malware classification and detection. The proposed method was analyzed extensively using two public datasets, CICMalDroid 2020 and CIC-InvesAndMal2019. To explain and validate the proposed methodology, an interpretable artificial intelligence (AI) experiment was conducted.

Evaluation of Several Computer Vision Feature Detectors/Extractors on Ahuna Mons Region in Ceres and Its Implications for Technosignatures Search.

Ahuna Mons is a 4 km particular geologic feature on the surface of Ceres, of possibly cryovolcanic origin. The special characteristics of Ahuna Mons are also interesting in regard of its surrounding area, especially for the big crater beside it. This crater possesses similarities with Ahuna Mons including diameter, age, morphology, etc. Under the cognitive psychology perspective and using current computer vision models, we analyzed these two features on Ceres for comparison and pattern-recognition similarities. Speeded up robust features (SURF), oriented features from accelerated segment test (FAST), rotated binary robust independent elementary features (BRIEF), Canny edge detector, and scale invariant feature transform (SIFT) algorithms were employed as feature-detection algorithms, avoiding human cognitive bias. The 3D analysis of images of both features’ (Ahuna Mons and Crater B) characteristics is discussed. Results showed positive results for these algorithms about the similarities of both features. Canny edge resulted as the most efficient algorithm. The 3D objects of Ahuna Mons and Crater B showed good-fitting results. Discussion is provided about the results of this computer-vision-techniques experiment for Ahuna Mons. Results showed the potential for the computer vision models in combination with 3D imaging to be free of bias and to detect potential geoengineered formations in the future. This study also brings forward the potential problem of both human and cognitive bias in artificial-intelligence-based models and the risks for the task of searching for technosignatures.