Search results

The purpose of this article is to present a new application of pursuit‐based analysis for diagnosing rolling element bearing faults.

Intelligent diagnosis of rolling element bearing faults in rotating machinery involves the procedure of feature extraction using modern signal processing techniques and artificial intelligence technique‐based fault detection and identification. This paper presents a comparative study of both the basis and matching pursuits when applied to fault diagnosis of rolling element bearings using vibration analysis.

Fault features were extracted from vibration acceleration signals and subsequently fed to a feed forward neural network (FFNN) for classification. The classification rate and mean square error (MSE) were calculated to evaluate the performance of the intelligent diagnostic procedure. Results from the basis pursuit fault diagnosis procedure were compared with the classification result of a matching pursuit feature‐based diagnostic procedure. The comparison clearly illustrates that basis pursuit feature‐based fault diagnosis is significantly more accurate than matching pursuit feature‐based fault diagnosis in detecting these faults.

Intelligent diagnosis can reduce the reliance on experienced personnel to make expert judgements on the state of the integrity of machines. The proposed method has the potential to be extensively applied in various industrial scenarios, although this application concerned rolling element bearings only. The principles of the application are directly translatable to other parts of complex machinery.

This work presents a novel intelligent diagnosis strategy using pursuit features and feed forward neural networks. The value of the work is to ease the burden of making decisions on the integrity of plant through a manual program in condition monitoring and diagnostics particularly of complex pieces of plant.

Speech is the primary means of communication for humans. A proper functioning auditory system is needed for accurate cognition of speech. Compressed sensing (CS) is a method for simultaneous compression and sampling of a given signal. It is a novel method increasingly being used in many speech processing applications. The paper aims to use Compressive sensing algorithm for hearing aid applications to reduce surrounding noise.

In this work, the authors propose a machine learning algorithm for improving the performance of compressive sensing using a neural network.

The proposed solution is able to reduce the signal reconstruction time by about 21.62% and root mean square error of 43% compared to default L2 norm minimization used in CS reconstruction. This work proposes an adaptive neural network–based algorithm to enhance the compressive sensing so that it is able to reconstruct the signal in a comparatively lower time and with minimal distortion to the quality.

The use of compressive sensing for speech enhancement in a hearing aid is limited due to the delay in the reconstruction of the signal.

In many digital applications, the acquired raw signals are compressed to achieve smaller size so that it becomes effective for storage and transmission. In this process, even unnecessary signals are acquired and compressed leading to inefficiency.

Hearing loss is the most common sensory deficit in humans today. Worldwide, it is the second leading cause for “Years lived with Disability” the first being depression. A recent study by World health organization estimates nearly 450 million people in the world had been disabled by hearing loss, and the prevalence of hearing impairment in India is around 6.3% (63 million people suffering from significant auditory loss).

The objective is to reduce the time taken for CS reconstruction with minimal degradation to the reconstructed signal. Also, the solution must be adaptive to different characteristics of the signal and in presence of different types of noises.

Persons with disabilities (PWD) are among the largest and most diverse minority groups and among the most disadvantaged in terms of employment. Entrepreneurial pursuit is often advocated as a path toward employment, inclusion, and equality, yet few studies have investigated earning variation among PWD.

The authors draw on social cognitive career theory (SCCT), and the disability employment and entrepreneurship literature to develop hypotheses about who among PWD are likely to earn more (less) from entrepreneurial pursuits. The authors then conduct analyses on the nationally representative sample of the Canadian Survey on Disability (CSD) by including all PWD engaged in entrepreneurial pursuit, and matching each to an organizationally employed counterpart of the same gender and race and of similar age and disability severity (n ≈ 810).

Entrepreneurial pursuit has a stronger negative association with the earnings of PWD who experience earlier disability onset ages, those who report more unmet accommodation needs, and those who are female.

First, this study applies SCCT to help bridge the literature on organizational employment barriers for PWD and entrepreneurs with disabilities. Second, we call into question the logic of neoliberalism about entrepreneurship by showing that barriers to organizational employment impact entrepreneurial pursuit decisions and thereby earnings. Third, we extend the understanding of entrepreneurial earnings among PWD by examining understudied disability attributes and demographic attributes. Lastly, this study is among the first to use a matched sample to empirically test the impact of entrepreneurial pursuit on the earnings of PWD.

The purpose of this paper is to develop an improved compressive sensing algorithm for solder joint imagery compressing and recovery. The improved algorithm can improve the performance in terms of peak signal to noise ratio (PSNR) of solder joint imagery recovery.

Unlike the traditional method, at first, the image was transformed into a sparse signal by discrete cosine transform; then the solder joint image was divided into blocks, and each image block was transformed into a one-dimensional data vector. At last, a block compressive sampling matching pursuit was proposed, and the proposed algorithm with different block sizes was used in recovering the solder joint imagery.

The experiments showed that the proposed algorithm could achieve the best results on PSNR when compared to other methods such as the orthogonal matching pursuit algorithm, greedy basis pursuit algorithm, subspace pursuit algorithm and compressive sampling matching pursuit algorithm. When the block size was 16 × 16, the proposed algorithm could obtain better results than when the block size was 8 × 8 and 4 × 4.

The paper provides a methodology for solder joint imagery compressing and recovery, and the proposed algorithm can also be used in other image compressing and recovery applications.

According to the compressed sensing (CS) theory, a sparse or compressible signal can be represented by a fewer number of bases than those required by the Nyquist theorem. The findings provide fundamental guidelines to improve performance in image compressing and recovery based on compressive sensing.

The purpose of this paper is to develop a compressive sensing (CS) algorithm for noisy solder joint imagery compression and recovery. A fast gradient-based compressive sensing (FGbCS) approach is proposed based on the convex optimization. The proposed algorithm is able to improve performance in terms of peak signal noise ratio (PSNR) and computational cost.

Unlike traditional CS methods, the authors first transformed a noise solder joint image to a sparse signal by a discrete cosine transform (DCT), so that the reconstruction of noisy solder joint imagery is changed to a convex optimization problem. Then, a so-called gradient-based method is utilized for solving the problem. To improve the method efficiency, the authors assume the problem to be convex with the Lipschitz gradient through the replacement of an iteration parameter by the Lipschitz constant. Moreover, a FGbCS algorithm is proposed to recover the noisy solder joint imagery under different parameters.

Experiments reveal that the proposed algorithm can achieve better results on PNSR with fewer computational costs than classical algorithms like Orthogonal Matching Pursuit (OMP), Greedy Basis Pursuit (GBP), Subspace Pursuit (SP), Compressive Sampling Matching Pursuit (CoSaMP) and Iterative Re-weighted Least Squares (IRLS). Convergence of the proposed algorithm is with a faster rate O(k*k) instead of O(1/k).

This paper provides a novel methodology for the CS of noisy solder joint imagery, and the proposed algorithm can also be used in other imagery compression and recovery.

According to the CS theory, a sparse or compressible signal can be represented by a fewer number of bases than those required by the Nyquist theorem. The new development might provide some fundamental guidelines for noisy imagery compression and recovering.

To solve the problem that the traditional received signal strength indicator real-time location method does not test the attenuation characteristics of the electromagnetic wave transmission in the location area, which cannot guarantee the accuracy of the location, resulting in a large location error.

At present, the compressed sensing (CS) reconstruction algorithm can be roughly divided into the following two categories (Zhouzhou and Fubao, 2014; Lagunas et al., 2016): one is the greedy iterative algorithm proposed for combinatorial optimization problems, which includes matching pursuit algorithm (MP), positive cross matching tracking algorithm (OMP), greedy matching tracking algorithm, segmented orthogonal matching tracking algorithm (StOMP) and so on. The second kind is the convex optimization algorithm, which also called the optimization approximation method. The common method is the basic tracking algorithm, which uses the norm instead of the norm to solve the optimization problem. In this paper, based on the piecewise orthogonal MP algorithm, the improved StOMP reconstruction algorithm is obtained.

In this paper, the MP algorithm (OMP), the StOMP and the improved StOMP algorithm are used as simulation reconstruction algorithms to achieve the comparison of location performance. It can be seen that the estimated position of the target is very close to the original position of the target. It is concluded that the CS grid-based target stepwise location method in underground tunnel can accurately locate the target in such specific region.

In this paper, the offline fingerprint database in offline phase of location method is established and the measurement of the electromagnetic noise distribution in different localization areas is considered. Furthermore, the offline phase shares the work of the location process, which greatly reduces the algorithm complexity of the online phase location process and the power consumption of the reference node, meanwhile is easy to implement under the same conditions, as well as conforms to the location environment.

Noise abatement is one of the key techniques for Partial Discharge (PD) on-line measurement and monitoring. However, how to enhance the efficiency of PD signal noise suppression is a challenging work. Hence, this study aims to improve the efficiency of PD signal noise abatement.

In this approach, the time–frequency characteristics of PD signal had been obtained based on fast kurtogram and S-transform time–frequency spectrum, and these characteristics were used to optimize the parameters for the signal matching over-complete dictionary. Subsequently, a self-adaptive selection of matching atoms was realized when using Matching Pursuit (MP) to analyze PD signals, which leading to seldom noise signal element was represented in sparse decomposition.

The de-noising of PD signals was achieved efficiently. Simulation and experimental results show that the proposed method has good adaptability and significant noise abatement effect compared with Empirical Mode Decomposition, Wavelet Threshold and global signal sparse decomposition of MP.

A self-adaptive noise abatement method was proposed to improve the efficiency of PD signal noise suppression based on the signal sparse representation and its MP algorithm, which is significant to on-line PD measurement.

For oil film thickness measurement using ultrasonic spring model, obtaining the isolated reflection from the oil film layer is the key point. While for oil film thickness measurement in thrust bearings with thin liner, the reflection from the substrate-Babbitt interface will overlap with the reflection from the oil film layer. This overlapping will render the ultrasonic spring model invalid. To obtain the isolated reflected signal from the oil film layer accurately, an adaptive method was developed to recover the overlapping echoes.

A genetic-algorithm-based support matching pursuit (GA-based SMP) was developed to provide the optimal echo number and initial parameters guesses automatically and efficiently. Then, the traditional expectation maximization (EM) model was used to fine tune the accurate results.

The developed method was tested using both simulated echoes and the overlapping echoes encountered in the ultrasonic oil film thickness measurement of thrust bearings. The results demonstrated that the developed method performed well on recovering overlapping echoes adaptively.

The work shows an adaptive method to recover the ultrasonic overlapping echoes. When used in ultrasonic oil film thickness measurement, it can help extend the application of traditional ultrasonic spring model to objects with four or more layers.

Customers' co-design behavior is an important source of knowledge for product innovation. Firms can regulate the focus of information interaction with customers to set goals and motivate their co-design behavior. Drawing on regulatory fit theory and construal level theory, the authors build a research model to study whether the fit between the regulatory focus of firms' task invitations (promotion focus vs prevention focus) and their feedback focus (self-focused vs other-focused) can enhance co-design behavior by improving customers' experiences (perceived meaning, active discovery and perceived empowerment).

The authors conducted two online between-subjects experiments to validate the proposed research model.

The two online experiments reveal that customers' experiences are enhanced when the feedback focus is congruent with the regulatory focus of the firm's task invitations. Specifically, self-focused feedback has a stronger positive effect on customers' experiences in the prevention focus context. Other-focused feedback has a stronger positive effect on customers' experiences in the promotion focus context. Moreover, customers' experience significantly and positively affects co-design behavior (i.e. co-design effort and knowledge contribution).

This work provides theoretical and practical implications for firms to improve the effectiveness of information interaction with their customers and eventually ensure the sustainability of co-design.

In the past few decades, the content-based image retrieval (CBIR), which focuses on the exploration of image feature extraction methods, has been widely investigated. The term of feature extraction is used in two cases: application-based feature expression and mathematical approaches for dimensionality reduction. Feature expression is a technique of describing the image color, texture and shape information with feature descriptors; thus, obtaining effective image features expression is the key to extracting high-level semantic information. However, most of the previous studies regarding image feature extraction and expression methods in the CBIR have not performed systematic research. This paper aims to introduce the basic image low-level feature expression techniques for color, texture and shape features that have been developed in recent years.

First, this review outlines the development process and expounds the principle of various image feature extraction methods, such as color, texture and shape feature expression. Second, some of the most commonly used image low-level expression algorithms are implemented, and the benefits and drawbacks are summarized. Third, the effectiveness of the global and local features in image retrieval, including some classical models and their illustrations provided by part of our experiment, are analyzed. Fourth, the sparse representation and similarity measurement methods are introduced, and the retrieval performance of statistical methods is evaluated and compared.

The core of this survey is to review the state of the image low-level expression methods and study the pros and cons of each method, their applicable occasions and certain implementation measures. This review notes that image peculiarities of single-feature descriptions may lead to unsatisfactory image retrieval capabilities, which have significant singularity and considerable limitations and challenges in the CBIR.

A comprehensive review of the latest developments in image retrieval using low-level feature expression techniques is provided in this paper. This review not only introduces the major approaches for image low-level feature expression but also supplies a pertinent reference for those engaging in research regarding image feature extraction.