Search

Standard deviation of average run length (SDARL) is recently used to study the performance of control charts with estimated parameters. In this paper, the performance of the Run Rules median chart with estimated parameters is analyzed based on the SDARL metric. It is shown that the Run Rules median chart requires a larger amount of Phase I data set to sufficiently reduce the variation in the in-control ARL values of the Run Rules median chart. Due to the limitation of the amount of the Phase I data set in practice, the adjusted control limit based on the bootstrap approach is suggested as a good alternative to the traditional control limit of the Run Rules median chart. Some conclusions and recommendations are made finally.

Network connectivity is a key index for designing of a vehicular ad hoc network(VANET). Road messages are propagated by V2X(includes V2V: vehicles to vehicles and V2I:vehicle to infrastructure) communications. Therefore, the access probability and connectivity probability play important roles for message dissemination. In this paper, we take the minimum safety distance between vehicles into consideration for designing of VANET. More over, we analyze the effects of the different distances between adjacent BSs, coverage radius of a vehicle and the vehicle density, respectively. The performance results get a conclusion that the safety distance has a certain effect in a VANET model.

The identification algorithm for a multiple-input and multiple-output system employing the Spatial Multiplexing (SM) and Alamouti (AL) space-time block codes (STBC) is investigated under the assumption of unknown parameters of the coding scheme, the received signal and noise variance. The order statistic of the cross-correlation spectrum between different received antennas is utilized as a feature to discriminate the coding type, and the tests threshold is selected based on the constant false alarm rate criterion. We proposed two methods to compute the threshold, one is based on the exact cumulative distribution function (CDF) of the maximum of the cross-correlation spectrum, and the other relies on the extreme value distribution. Simulations show that the proposed algorithms are effective and the performances of them are both superior to the convention cyclostationarity-based algorithm.

Based on the comprehensive analysis and comparison in the characteristic of acoustics between the sample speaker and the case sample speaker, we can get the identification of identity. The identification can be used in many cases like providing clues, directions and ranges to investigate and solve a case. In addition, it can also provide independent evidence for litigation. As one of the main features of speaker, fundamental frequency curve plays an important role in the identification of identity. In this passage, we create an improved pitch period extraction algorithm based on the traditional way of detection method of pitch period. This experiment has proved that the method in this passage works more accurately than the traditional way in the noise circumstance and it can provide more convincing evidence for judicial expertise.

α-stable distribution is a sort of non-Gaussian random distribution and is widely applied to radar, sonar, atmosphere and biomedicine process field and so on. The salient feature of these random signals or noises are that the spike pulse is more significant than conventional Gaussian signal or noise. When dealing with non-Gaussian noises, the time delay algorithm using fractional lower order covariance (FLOC) can achieve better results, but it requests usually the previous estimation of characteristic exponent. In this paper, an adaptive time delay estimation algorithm using asinh transform is proposed. Compare with FLOC algorithm, the new aproach doesn't need the previous estimation of characteristic exponent, through changing the signal into a Gaussian with inverse hyperbolic sine transform under α-stable distributed noise condition, the new method can reliably converge and has got a good estimated precision.

In recent years, traffic congestion, traffic accidents, environmental pollution and other issues are particularly prominent with the rapid development of urbanization, motorization. It is extremely important to send the road information to the user promptly so that the user can fully understand the road situation and make safer and smarter decisions on the road. Internet of Vehicle (IOV) as a typical application of the technology of Internet of Things (IOT) in the field of transportation system promotes the transportation system to move closer to the intelligent. This paper first introduces the basic concepts of IOV and the hierarchical architecture based on perception layer, network layer and application layer. Secondly, it points out several key technologies in the development of IOV. Finally, the related applications of the technology of IOV are briefly described.

To address the problem of low precision and pour robustness, this paper will introduce deep learning into visual tracking field and propose an object tracking algorithm based on depth sparse learning. The algorithm first constructs a deep network based on the auto-encoder and then adding the sparsity constraint in the deep network to sparse connection matrix between the hidden layer and the output layer. As a result, the algorithm optimizes the parameters of the deep network and improve its efficiency. It means that more essential features of the target will be extracted with this network. In the prediction of the target, the algorithm introduces the difference between target and background into the particle filter and design a scoring device based on support vector machine, so that particle performance is enhanced and the risk of drift in the process of tracking target is reduced. Experiments on different video sequences have been carried out for many times. According to the results of experiments, we can come to a conclusion that our algorithm has higher accuracy and better robustness, especially under the circumstance of illumination change, similar background and occlusion.

Semantic image segmentation plays a central role in image understanding and could be applied in various applications. With the development of deep learning techniques, great progress has been made in recent years. However, it is still very challenging to produce accurate segmentation results especially near object boundaries. Furthermore, all the methods with top performances are contributed by pixel-level annotations which needs expensive human effort and tremendous labeling time. In this paper, we explore a simple semantic segmentation approach using region-based object detector which only needs bounding box annotations. The main idea is using object detector to classify region proposals and then applying saliency detection method to segment such classified proposals. Experimental results on PASCAL VOC 2012 validation dataset show its comparable performance with fully supervised methods by masks.

In this paper, an algorithm for recognizing BPSK/QPSK signal is proposed. Extreme value theory is introduced, and an exceedance sequence is built from the modified spectrum obtained by the squaring operation of the observed signal, and the problem of recognizing the BPSK/QPSK signal is transformed to the problem of whether the distribution of the exceedance sequence approximately follows its standard generalized Pareto distribution or not. Finally, the Kolmogorov — Smirnov test is applied to perform the goodness-of-fit test of the generalized Pareto distribution of the exceedance sequence to complete the task of BPSK/QPSK signal recognition. Computer simulation results show that the recognition performance is good when the signal-to-noise ratio is moderate and does not require prior information such as noise variance.

This paper introduces the realization method of Beidou anti-jamming antenna hardware and software, theory analysis and MATLAB simulation of antenna array and adaptive algorithm. The space time joint anti-jamming algorithm based on the linear constraint minimum variance criterion is adopted as the core of the anti-jamming processor. It is designed and implemented successfully. the anti-jamming ability of the antenna is tested and verified. The antenna has the capability of resisting single jam 75 dB and resisting three jam 60 dB. Finally, the difference between theoretical simulation and practical implementation is analyzed, and future work is prospected.

A covariance matrix denoising based Direction-of-arrive (DOA) estimation approach for spherical array is developed in this paper. Firstly, based on the spherical phase mode transformation, a spherical harmonic (SH) domain covariance matrix model of the spherical array is presented as multiple measurement vectors, where the atomic norm minimization approach is extended to SH domain and is applied for covariance matrix denoising. Then the spherical ESPRIT method is used to DOA estimation. Unlike the conventional approaches, the proposed method not only requires no prior knowledge of the noise statistic property, but also has the capability of dealing with the coherent signals. Simulations show the out performance of out method compared with the conventional ones.

In order to solve the problem of compressive tracking algorithm which cannot adapt to the scale change in object tracking, a scale adaptive compressed object tracking algorithm is proposed. Firstly, we extract the low-dimensional gray and texture features of the target and its surrounding region by sparse measurement matrix which reduces the complexity of compute. Then the tracking task is formulated as a binary classification via support vector machine (SVM) classifier with online update in the compressed domain. Meanwhile, we utilize the classifier to obtain the target's position in new frame. In addition, we build the hamming distance between hash values of current target and original one to match the template to achieve adaptive template size. Numerous experimental results show the proposed algorithm can keep tracking effectively when the tracked object is under the situation of scale variation and illumination change.

Salient object detection is a significant part of a great deal of vision tasks and a large number of saliency detection measures have been presented of late, and omong them are complementary reciprocally. A majority of the works in computer vision concentrates on the next two particular assignments of saliency: eye fixation prediction and salient object segmentation. In this paper, we divides saliency detection into two sub tasks: salient object localization and segmentation, which can achieve more precise results of significant object detection, and also can obtain more accurate segmentation results directly. The results are validated on publicly available ECSSD and PASCAL datasets, which are superior to current state-of-the-art methods.

In the existing exemplar based image inpainting algorithms, the most similar match patches are used to inpaint the destroyed region, and they are searched in the whole source region in a fixed size. However, sometimes it would decrease the connectivity of structure and clearness of texture while increases the time complexity of this algorithm. To solve these problems, firstly it proposed an adaptive sample algorithm based on patch sparsity, it calculates the patch sparsity and through it dividing the patches location into three types. And then the size of the sample patch would be adaptively changed according to the type. Secondly it proposed a candidate patch system to improve the patch matching rate. From the result, we can see that the proposed method can match more significant patches than the traditional method, and it can give a better texture inpainting effect, especially when processing the images with complex and regular textures, and the image with large destroyed region.

Recently, more and more researchers focus on compressive tracking due to its simple and efficient performance. However, performance of classical compressive tracking algorithms are very weak in illumination change, rotation and motion blur, which produce the drift problems easily in object tracking. Therefore, we present a kind of compressive tracking algorithm based on SURF. Firstly, we extract the features for the appearancemodel from foreground and background of the target as the positive and negative samples using SURF; then, we compress the high-dimensional feature space to low-dimensional space on the basis of compressive sensing theory. Secondly, we classify the positive and negative samples according to naive Bayes classifier with online update. The experiments show that the method we proposed performs effective and efficient and runs in real time with an average of 27 fps on challenging test sequences.

Generic object level saliency detection is important for many vision tasks, such as object detection, compression, recognition, segmentation and so on‥ A variety of saliency detection methods have been proposed in recently, which often complement each other. In order to combine them, we propose a Hard-voting Evolution saliency aggregation algorithm in this paper. Specially, it is consist of three stages. First, we integrate each individual map to get a reference map by linear summation. Second, each of the individual maps is updated in Bayes framework based on the obtained reference map. Third, we use our proposed approach to get the aggregated saliency map. Finally, we do iterative operation to further improve performance. Experiments on three publicly available datasets demonstrate that the proposed algorithm performs favorably against the state-of-the-art methods.

The establishment of electronic file for modern poultry production and breeding represents the new trend in the industry. At the same time, every step of poultry production has significant effect on the safety of poultry products, and as a result, technical methods need to be taken to ensure safety management, identify who is responsible and protect the brand reputation. This paper uses Yangzhou Goose as an example in studying the establishment of a standardized goose breeding basic database, design of RFID-based smart foot ring that can collect various kinds of information, in an effort to develop a smart goose breeding system. This smart goose breeding system can track information during breeding and production, which can offer individual production information and guarantee the safety of goose products while traditional recording system merely records pedigree information.

An alpha stable distribution and its fractional lower order statistics (FLOS) are introduced in this paper. Meanwhile the non-Gauss characteristics of some signals are considered in the practical applications. The method based on FLOS is the important method of signal analysis and processing under the signal and/or noise condition of non-Gauss alpha stable distribution. The medicine images are taken as the example. The FLOS in company with wavelet transform is introduced, and two parameters of wavelet coefficients for the images: alpha and gamma are estimated. It is explained that when in the practical image processing, we must consider the non-Gauss characteristics of signal to avoid performance degeneration with conventional signal processing methods. The proposed algorithm builds the foundation for the following image processing such as using Bayes wavelet to remove the noise.

Semantic-based image retrieval bridges the gap between visual features and human understanding of image in the field of image retrieval. Image annotation is one important technology of image retrieval based on the semantic. This paper proposed one method to realize semi-automatic image annotation with the tool Support Vector Machine (SVM). The image collection was divided into two parts, one for manual annotation and the other for testing. After being classified by SVM, the output was changed into a probability, and K-NN algorithm was applied to get the keywords for unlabeled images. The experiments show that the approach is feasible.

This paper addresses an effective issue of content-based image retrieval (CBIR) by presenting fuzzy Hamming distance (FHD). Firstly, the theory of FHD is introduced, which includes degree of difference and cardinality of the fuzzy set, and then follows defuzzification of FHD which is used as a fuzzy similarity measure. In the experiment, the image retrieval results show this method can be employed to capture implicitly some semantic contents of the image in addition to other features such as color, texture and shape. Finally, an implemented prototype system demonstrates a promising retrieval performance for a test database, as compared with FUZZYCLUB system.

This paper proposed a cost function in DWT domain, which combines the two most critical properties including the transparency and robustness. Based on the cost function, the optimum location can be found for watermarking. Through modeling to the wavelet coefficient by the GGD (generalized Gaussian density), we proposed the method of estimation of shape parameter, which corresponding to LOD (locally optimum detection) also can be used in watermarking detection. By utilizing the proposed approach, a good compromise between the transparency and robustness can be gotten in experiments.