Cyclostationary Feature Detection Based Spectrum Sensing Algorithm under Complicated Electromagnetic Environment in Cognitive Radio Networks

This paper focuses on improving the detection performance of spectrum sensing in cognitive radio(CR) networks under complicated electromagnetic environment. Some existing fast spectrum sensing algorithms cannot get specific features of the licensed users'(LUs') signal, thus they cannot be applied in this situation without knowing the power of noise. On the other hand some algorithms that yield specific features are too complicated. In this paper, an algorithm based on the cyclostationary feature detection and theory of Hilbert transformation is proposed. Comparing with the conventional cyclostationary feature detection algorithm, this approach is more flexible i.e. it can flexibly change the computational complexity according to current electromagnetic environment by changing its sampling times and the step size of cyclic frequency. Results of simulation indicate that this approach can flexibly detect the feature of received signal and provide satisfactory detection performance compared to existing approaches in low Signal-to-noise Ratio(SNR) situations.

Wireless distributed computing for cyclostationary feature detection

Recently, wireless distributed computing （WDC） concept has emerged promising manifolds improvements to current wireless technotogies. Despite the various expected benefits of this concept, significant drawbacks were addressed in the open literature. One of WDC key challenges is the impact of wireless channel quality on the load of distributed computations. Therefore, this research investigates the wireless channel impact on WDC performance when the tatter is applied to spectrum sensing in cognitive radio （CR） technology. However, a trade- off is found between accuracy and computational complexity in spectrum sensing approaches. Increasing these approaches accuracy is accompanied by an increase in computational complexity. This results in greater power consumption and processing time. A novel WDC scheme for cyclostationary feature detection spectrum sensing approach is proposed in this paper and thoroughly investigated. The benefits of the proposed scheme are firstly presented. Then, the impact of the wireless channel of the proposed scheme is addressed considering two scenarios. In the first scenario, workload matrices are distributed over the wireless channel

Feature detection on point clouds via Gabriel Triangles creation and l1 normal reconstruction

In this paper, we present a robust subneighborhoods selection technique for feature detection on point clouds scattered over a piecewise smooth surface. The proposed method first identifies all potential features using covariance analysis of the local- neighborhoods. To further extract the accurate features from potential features, Gabriel triangles are created in local neighborhoods of each potential feature vertex. These triangles tightly attach to underlying surface and effectively reflect the local geometry struc- ture. Applying a shared nearest neighbor clustering algorithm on ~ 1 reconstructed normals of created triangle set, we classify the lo- cal neighborhoods of the potential feature vertex into multiple subneighborhoods. Each subneighborhood indicates a piecewise smooth surface. The final feature vertex is identified by checking whether it is locating on the intersection of the multiple surfaces. An advantage of this framework is that it is not only robust to noise, but also insensitive to the size of selected neighborhoods. Ex- perimental results on a variety of models are used to illustrate the effectiveness and robustness of our method.

Absence Importance and Its Application to Feature Detection and Matching

Feature detection and matching play important roles in many fields of computer vision, such as image understanding, feature recognition, 3D-reconstruction, video analysis, etc. Extracting features is usually the first step for feature detection or matching, and the gradient feature is one of the most used selections. In this paper, a new image feature-absence importance （AI） feature, which can directly characterize the local structure information, is proposed. Greatly different from the most existing features, the proposed absence importance feature is mainly based on the consideration that the absence of the important pixel will have a great effect on the local structure. Two absence importance features, mean absence importance （MAI） and standard deviation absence importance （SDAI）, are defined and used subsequently to construct new algorithms for feature detection and matching. Experiments demonstrate that the proposed absence importance features can be used as an important complement of the gradient feature and applied successfully to the fields of feature detection and matching.

Feature detection of triangular meshes via neighbor supporting

We propose a robust method for detecting features on triangular meshes by combining normal tensor voting with neighbor supporting. Our method contains two stages： feature detection and feature refinement. Firsts the normal tensor voting method is modified to detect the initial features, which may include some pseudo features. Then, at the feature refinement stage, a novel salient measure deriving from the idea of neighbor supporting is developed. Benefiting from the integrated reliable salient measure feature, pseudo features can be effectively discriminated from the initially detected features and removed. Compared to previous methods based on the differential geometric property, the main advantage of our method is that it can detect both sharp and weak features. Numerical experiments show that our algorithm is robust, effective, and can produce more accurate results. We also discuss how detected features are incorporated into applications, such as feature-preserving mesh denoising and hole-filling, and present visually appealing results by integrating feature information.

Mismatched feature detection with finer granularity for emotional speaker recognition

The shapes of speakers' vocal organs change under their different emotional states, which leads to the deviation of the emotional acoustic space of short-time features from the neutral acoustic space and thereby the degradation of the speaker recognition performance. Features deviating greatly from the neutral acoustic space are considered as mismatched features, and they negatively affect speaker recognition systems. Emotion variation produces different feature deformations for different phonemes, so it is reasonable to build a finer model to detect mismatched features under each phoneme. However, given the difficulty of phoneme recognition, three sorts of acoustic class recognition—phoneme classes, Gaussian mixture model(GMM) tokenizer, and probabilistic GMM tokenizer—are proposed to replace phoneme recognition. We propose feature pruning and feature regulation methods to process the mismatched features to improve speaker recognition performance. As for the feature regulation method, a strategy of maximizing the between-class distance and minimizing the within-class distance is adopted to train the transformation matrix to regulate the mismatched features. Experiments conducted on the Mandarin affective speech corpus(MASC) show that our feature pruning and feature regulation methods increase the identification rate(IR) by 3.64% and 6.77%, compared with the baseline GMM-UBM(universal background model) algorithm. Also, corresponding IR increases of 2.09% and 3.32% can be obtained with our methods when applied to the state-of-the-art algorithm i-vector.

An Improved Cyclostationary Feature Detection Based on the Selection of Optimal Parameter in Cognitive Radios

Spectrum sensing is an important part of cognitive radio systems to find spectrum hole for transmission which enables cognitive radio systems coexist with the authorized radio systems without harmful interference.In this paper,an improved cyclostationary feature detection method is proposed to reduce computational complexity without loss of good performance based on the optimal parameter selection strategy for choosing detection parameters of cyclic frequency and lag.Taking binary phase shift keying (BPSK) and quadrature phase shift keying (QPSK) signals as examples,the theoretical analyses are presented for choosing the optimal parameters.Simulation results are given to certify the correctness of the proposed parameter selection strategy and show the performance of the proposed method.

Face mask detection algorithm based on HSV+HOG features and SVM

To automatically detecting whether a person is wearing mask properly,we propose a face mask detection algorithm based on hue-saturation-value(HSV)+histogram of oriented gradient(HOG)features and support vector machines(SVM).Firstly,human face and five feature points are detected with RetinaFace face detection algorithm.The feature points are used to locate to mouth and nose region,and HSV+HOG features of this region are extracted and input to SVM for training to realize detection of wearing masks or not.Secondly,RetinaFace is used to locate to nasal tip area of face,and YCrCb elliptical skin tone model is used to detect the exposure of skin in the nasal tip area,and the optimal classification threshold can be found to determine whether the wear is properly according to experimental results.Experiments show that the accuracy of detecting whether mask is worn can reach 97.9%,and the accuracy of detecting whether mask is worn correctly can reach 87.55%,which verifies the feasibility of the algorithm.

Analysis on the Content Features and Their Correlation of Web Pages for Spam Detection

In the global information era,people acquire more and more information from the Internet,but the quality of the search results is degraded strongly because of the presence of web spam.Web spam is one of the serious problems for search engines,and many methods have been proposed for spam detection.We exploit the content features of non-spam in contrast to those of spam.The content features for non-spam pages always possess lots of statistical regularities; but those for spam pages possess very few statistical regularities,because spam pages are made randomly in order to increase the page rank.In this paper,we summarize the regularities distributions of content features for non-spam pages,and propose the calculating probability formulae of the entropy and independent n-grams respectively.Furthermore,we put forward the calculation formulae of multi features correlation.Among them,the notable content features may be used as auxiliary information for spam detection.

Behavioral Feature and Correlative Detection of Multiple Types of Node in the Internet of Vehicles

Undoubtedly,uncooperative or malicious nodes threaten the safety of Internet of Vehicles(IoV)by destroying routing or data.To this end,some researchers have designed some node detection mechanisms and trust calculating algorithms based on some different feature parameters of IoV such as communication,data,energy,etc.,to detect and evaluate vehicle nodes.However,it is difficult to effectively assess the trust level of a vehicle node only by message forwarding,data consistency,and energy sufficiency.In order to resolve these problems,a novel mechanism and a new trust calculating model is proposed in this paper.First,the four tuple method is adopted,to qualitatively describing various types of nodes of IoV;Second,analyzing the behavioral features and correlation of various nodes based on route forwarding rate,data forwarding rate and physical location;third,designing double layer detection feature parameters with the ability to detect uncooperative nodes and malicious nodes;fourth,establishing a node correlative detection model with a double layer structure by combining the network layer and the perception layer.Accordingly,we conducted simulation experiments to verify the accuracy and time of this detection method under different speed-rate topological conditions of IoV.The results show that comparing with methods which only considers energy or communication parameters,the method proposed in this paper has obvious advantages in the detection of uncooperative and malicious nodes of IoV;especially,with the double detection feature parameters and node correlative detection model combined,detection accuracy is effectively improved,and the calculation time of node detection is largely reduced.

On Accurate Detection of Oceanic Features from Satellite IR Data Using ICSED Method

ICSED (Improved Cluster Shade Edge Detection) algorithm and other various methods to accurately and efficiently detect edges on satellite data are presented. Error rate criterion is used to statistically evaluate the performances of these methods in detecting oceanic features for both noise free and noise contaminated AVHRR (Advanced Very High Resolution Radiometer) IR image with Kuroshio. Also, practical experiments in detecting the eddy of Kuroshio with these methods are carried out for comparison. Results show that the ICSED algorithm has more advantages than other methods in detecting mesoscale features of ocean. Finally, the effectiveness of window size of ICSED method to oceanic features detection is quantitatively discussed.

Illumination Adaptive Identification Algorithm of a Reconfigurable Modular Robot

Reconfigurable modular robots feature high mobility due to their unconstrained connection manners.Inspired by the snake multi-joint crawling principle,a chain-type reconfigurable modular robot(CRMR)is designed,which could reassemble into various configurations through the compound joint motion.Moreover,an illumination adaptive modular robot identification(IAMRI)algorithm is proposed for CRMR.At first,an adaptive threshold is applied to detect oriented FAST features in the robot image.Then,the effective detection of features in non-uniform illumination areas is achieved through an optimized quadtree decomposition method.After matching features,an improved random sample consensus algorithm is employed to eliminate the mismatched features.Finally,the reconfigurable robot module is identified effectively through the perspective transformation.Compared with ORB,MA,Y-ORB,and S-ORB algorithms,the IAMRI algorithm has an improvement of over 11.6%in feature uniformity,and 13.7%in the comprehensive indicator,respectively.The IAMRI algorithm limits the relative error within 2.5 pixels,efficiently completing the CRMR identification under complex environmental changes.

A NOVEL SHIP WAKE DETECTION METHOD OF SAR IMAGES BASED ON FREQUENCY DOMAIN

Moving ships produce a set of waves of "V' pattern on the ocean. These waves can often be seen by Synthetic Aperture Radar (SAR). The detection of these wakes can provide important information for surveillance of shipping, such as ship traveling direction and speed. A novel approach to the detection of ship wakes in SAR images based on frequency domain is provided in this letter. Compared with traditional Radon-based approaches, computation is reduced by 20%-40% without losing nearly any of detection performance. The testing results using real data and simulation of synthetic SAR images test the algorithm's feasibility and robustness.

STUDY ON THE TECHNIQUE TO DETECT TEXTURE FEATURES IN SAR IMAGES

This letter studies on the detection of texture features in Synthetic Aperture Radar (SAR) images. Through analyzing the feature detection method proposed by Lopes, an improved texture detection method is proposed, which can not only detect the edge and lines but also avoid stretching edge and suppressing lines of the former algorithm. Experimental results with both simulated and real SAR images verify the advantage and practicability of the improved method.

A New Feature-Based Image Registration Algorithm

IR （Image Registration） is one of the important operation of image processing system which is the process of aligning two or more images into one coordinate system that are taken at different times, from different sensors, or from different viewpoints. It has a lot of applications especially medical imaging and remote sensing. The main purpose of this paper is to provide a comprehensive review of existing literatures available on image registration system and proposed a new feature-based IR technique using edge of images. We used edges as a feature of images for registration. It will be a useful document for researchers who will work on feature-based image registration regardless for specific applications.

NOMA-Based Spectrum Sensing for Satellite-Terrestrial Communication

With the continuous development of wireless communication technology,the number of access devices continues to soar,which poses a grate challenge to the already scarce spectrum resources.Meanwhile,6G will be an era of air-space-terrestrial-sea integration,and satellite spectrum resources are also very tight in the context of giant constellations.In this paper,we propose a Non-Orthogonal Multiple Access(NOMA)based spectrum sensing scheme for the future satellite-terrestrial communication scenarios,and design the transceiver from uplink and downlink scenarios,respectively.In order to better identify the user's transmission status,we obtain the feature values of each user through feature detection to make decision.We combine these two technologies to design the transceiver architecture and deduce the threshold value of feature detection in the satellite-terrestrial communication scenario.Simulations are performed in each scenario,and the results illustrate that the proposed scheme combining NOMA and spectrum sensing can greatly improve the throughput with a similar detection probability as Orthogonal Multiple Access(OMA).

New Perspective to Isogeometric Analysis:Solving Isogeometric Analysis Problem by Fitting Load Function

Isogeometric analysis(IGA)is introduced to establish the direct link between computer-aided design and analysis.It is commonly implemented by Galerkin formulations(isogeometric Galerkin,IGA-G)through the use of nonuniform rational B-splines(NURBS)basis functions for geometric design and analysis.Another promising approach,isogeometric collocation(IGA-C),working directly with the strong form of the partial differential equation(PDE)over the physical domain defined by NURBS geometry,calculates the derivatives of the numerical solution at the chosen collocation points.In a typical IGA,the knot vector of the NURBS numerical solution is only determined by the physical domain.A new perspective on the IGAmethod is proposed in this study to improve the accuracy and convergence of the solution.Solving the PDE with IGA can be regarded as fitting the load function defined on the NURBS geometry(right-hand side)with derivatives of the NURBS numerical solution(left-hand side).Moreover,the design of the knot vector has a close relationship to theNURBS functions to be fitted in the area of data fitting in geometric design.Therefore,the detected feature points of the load function are integrated into the initial knot vector of the physical domainto construct thenewknot vector of thenumerical solution.Then,they are connected seamlessly with the IGA-C framework for its great potential combining the accuracy and smoothness merits with the computational efficiency,which we call isogeometric collocation by fitting load function(IGACL).In numerical experiments,we implement our method to solve 1D,2D,and 3D PDEs and demonstrate the improvement in accuracy by comparing it with the standard IGA-C method.We also verify the superiority in the accuracy of our knot selection scheme when employed in the IGA-G method,which we call isogeometric Galerkin by fitting load function(IGA-GL).

Multi-Embed Nonlinear Scale-Space for Image Trust Root Generation

An image trust root is a special type of soft trust root for trusted computing. However,image trust root generation is difficult,as it needs a corresponding stable logic feature generation model and algorithm for dynamical and sustained authentication. This paper proposes a basic function of constructing new scale-spaces with deep detecting ability and high stability for image features aimed at image root generation. According to the heat distribution and spreading principle of various kinds of infinitesimal heat sources in the space medium,a multi-embed nonlinear diffusion equation that corresponds to the multi-embed nonlinear scale-space is proposed,a HARRIS-HESSIAN scale-space evaluation operator that aims at the structure acceleration characteristics of a local region and can make use of image pixels' relative spreading movement principle was constructed,then a single-parameter global symmetric proportion(SPGSP) operator was also constructed. An authentication test with 3000 to 5000 cloud entities shows the new scale-space can work well and is stable,when the whole cloud has 5%-50% behavior with un-trusted entities. Consequently,it can be used as the corresponding stable logic feature generation model and algorithm for all kinds of images,and logic relationships among image features for trust roots.

Study on the image processing of laser vision seam tracking system

Seam image processing is the basis of the realization of automatic laser vision seam tracking system, and it has become one of the important research directions. Adding windows processing, gray processing, fast median filtering, binary processing and image edge extraction are used to pretreat the seam image. In the post-processing of seam image, the feature points of the target image are succesfully detected by using center line extraction and feature points detection algorithm based on slope analysis. The whole processing time is less than 150 ms, and the real-time processing of seam image can be implemented.

Fatigue driving detection based on Haar feature and extreme learning machine

As the significant branch of intelligent vehicle networking technology, the intelligent fatigue driving detection technology has been introduced into the paper in order to recognize the fatigue state of the vehicle driver and avoid the traffic accident. The disadvantages of the traditional fatigue driving detection method have been pointed out when we study on the traditional eye tracking technology and traditional artificial neural networks. On the basis of the image topological analysis technology, Haar like features and extreme learning machine algorithm, a new detection method of the intelligent fatigue driving has been proposed in the paper. Besides, the detailed algorithm and realization scheme of the intelligent fatigue driving detection have been put forward as well. Finally, by comparing the results of the simulation experiments, the new method has been verified to have a better robustness, efficiency and accuracy in monitoring and tracking the drivers＇ fatigue driving by using the human eye tracking technology.