Search results

We propose in this paper a novel reliable detection method to recognize forged inpainting images. Detecting potential forgeries and authenticating the content of digital images is extremely challenging and important for many applications. The proposed approach involves developing new probabilistic support vector machines (SVMs) kernels from a flexible generative statistical model named “bounded generalized Gaussian mixture model”. The developed learning framework has the advantage to combine properly the benefits of both discriminative and generative models and to include prior knowledge about the nature of data. It can effectively recognize if an image is a tampered one and also to identify both forged and authentic images. The obtained results confirmed that the developed framework has good performance under numerous inpainted images.

This paper aims to investigate a probabilistic mixture model for the nonrigid point set registration problem in the computer vision tasks. The equations to estimate the mixture model parameters and the constraint items are derived simultaneously in the proposed strategy.

The problem of point set registration is expressed as Laplace mixture model (LMM) instead of Gaussian mixture model. Three constraint items, namely, distance, the transformation and the correspondence, are introduced to improve the accuracy. The expectation-maximization (EM) algorithm is used to optimize the objection function and the transformation matrix and correspondence matrix are given concurrently.

Although amounts of the researchers study the nonrigid registration problem, the LMM is not considered for most of them. The nonrigid registration problem is considered in the LMM with the constraint items in this paper. Three experiments are performed to verify the effectiveness and robustness and demonstrate the validity.

The novel method to solve the nonrigid point set registration problem in the presence of the constraint items with EM algorithm is put forward in this work.

In multi-robot cooperation, the cloud can share sensor data, which can help robots better perceive the environment. For cloud robotics, robot grasping is an important ability that must be mastered. Usually, the information source of grasping mainly comes from visual sensors. However, due to the uncertainty of the working environment, the information acquisition of the vision sensor may encounter the situation of being blocked by unknown objects. This paper aims to propose a solution to the problem in robot grasping when the vision sensor information is blocked by sharing the information of multi-vision sensors in the cloud.

First, the random sampling consensus algorithm and principal component analysis (PCA) algorithms are used to detect the desktop range. Then, the minimum bounding rectangle of the occlusion area is obtained by the PCA algorithm. The candidate camera view range is obtained by plane segmentation. Then the candidate camera view range is combined with the manipulator workspace to obtain the camera posture and drive the arm to take pictures of the desktop occlusion area. Finally, the Gaussian mixture model (GMM) is used to approximate the shape of the object projection and for every single Gaussian model, the grabbing rectangle is generated and evaluated to get the most suitable one.

In this paper, a variety of cloud robotic being blocked are tested. Experimental results show that the proposed algorithm can capture the image of the occluded desktop and grab the objects in the occluded area successfully.

In the existing work, there are few research studies on using active multi-sensor to solve the occlusion problem. This paper presents a new solution to the occlusion problem. The proposed method can be applied to the multi-cloud robotics working environment through cloud sharing, which helps the robot to perceive the environment better. In addition, this paper proposes a method to obtain the object-grabbing rectangle based on GMM shape approximation of point cloud projection. Experiments show that the proposed methods can work well.

In the traffic monitoring system, the detection of stirring vehicles is monitored by fitting static cameras in the traffic scenarios. Background subtraction a commonly used method detaches poignant objects in the foreground from the background. The method applies a Gaussian Mixture Model, which can effortlessly be contaminated through slow-moving or momentarily stopped vehicles.

This paper proposes the Enhanced Gaussian Mixture Model to overcome the addressed issue, efficiently detecting vehicles in complex traffic scenarios.

The model was evaluated with experiments conducted using real-world on-road travel videos. The evidence intimates that the proposed model excels with other approaches showing the accuracy of 0.9759 when compared with the existing Gaussian mixture model (GMM) model and avoids contamination of slow-moving or momentarily stopped vehicles.

The proposed method effectively combines, tracks and classifies the traffic vehicles, resolving the contamination problem that occurred by slow-moving or momentarily stopped vehicles.

This paper aims to inspect solder joint defects of integrated circuit (IC) components on printed circuit boards. Here, an IC solder joint inspection algorithm is developed based on a Gaussian mixture model (GMM).

First, the authors train a GMM using numerous qualified IC solder joints. Then, the authors compare the IC solder joint images with the trained model to inspect the potential defects. Finally, the authors introduce a frequency map and define a metric termed as normalized defect degree to evaluate qualities of the tested IC solder joints.

Experimental results indicate that the proposed method is superior to the state-of-the-art methods on IC solder joint inspection.

The approach is a promising method for IC solder joint inspection, which is quite different from the traditional classifier-based methods.

For the large-scale power grid monitoring system equipment, its working environment is increasingly complex and the probability of fault or failure of the monitoring system is gradually increasing. This paper proposes a fault classification algorithm based on Gaussian mixture model (GMM), which can complete the automatic classification of fault and the elimination of fault sources in the monitoring system.

The algorithm first defines the GMM and obtains the detection value of the fault classification through a method based on the causal Mason Young Tracy (MYT) decomposition under each normal distribution in the GMM. Then, the weight value of GMM is used to calculate weighted classification value of fault detection and separation, and by comparing the actual control limits with the classification result of GMM, the fault classification results are obtained.

The experiment on the defined non-thermostatic continuous stirred-tank reactor model shows that the algorithm proposed in this paper is superior to the traditional algorithm based on the causal MYT decomposition in fault detection and fault separation.

The proposed algorithm fundamentally solves the problem of fault detection and fault separation in large-scale systems and provides support for troubleshooting and identifying fault sources.

This paper aims to propose a robust method for non-rigid point set registration, using the Gaussian mixture model and accommodating non-rigid transformations. The posterior probabilities of the mixture model are determined through the proposed integrated feature divergence.

The method involves an alternating two-step framework, comprising correspondence estimation and subsequent transformation updating. For correspondence estimation, integrated feature divergences including both global and local features, are coupled with deterministic annealing to address the non-convexity problem of registration. For transformation updating, the expectation-maximization iteration scheme is introduced to iteratively refine correspondence and transformation estimation until convergence.

The experiments confirm that the proposed registration approach exhibits remarkable robustness on deformation, noise, outliers and occlusion for both 2D and 3D point clouds. Furthermore, the proposed method outperforms existing analogous algorithms in terms of time complexity. Application of stabilizing and securing intermodal containers loaded on ships is performed. The results demonstrate that the proposed registration framework exhibits excellent adaptability for real-scan point clouds, and achieves comparatively superior alignments in a shorter time.

The integrated feature divergence, involving both global and local information of points, is proven to be an effective indicator for measuring the reliability of point correspondences. This inclusion prevents premature convergence, resulting in more robust registration results for our proposed method. Simultaneously, the total operating time is reduced due to a lower number of iterations.

Prospect theory is now widely accepted as the dominant model of choice under risk, but has not been fully incorporated into applied research because of uncertainty about how to include population-level parameter estimates. The purpose of this paper is to characterize heterogeneity across people to lay a foundation for future applied research.

The paper uses elicitation data from field experiments in Vietnam to fit a finite Gaussian mixture model using the expectation maximization algorithm. Applied results are simulated for investment allocations under myopic loss aversion.

The authors find that about 20 percent of the sample is classified as extremely loss averse, while the rest of the population is only mildly loss averse. This implies a bimodal distribution of loss aversion in the population.

The data set is only moderately sized: 181 subjects. Future research will be needed to extend these results out of sample, and to other regions.

This paper provides empirical evidence that heterogeneity matters in prospect theory modeling. It highlights how policy makers might be misled by assuming that average prospect theory parameters are typical within the population.

Surveillance is the emerging concept in the current technology, as it plays a vital role in monitoring keen activities at the nooks and corner of the world. Among which moving object identifying and tracking by means of computer vision techniques is the major part in surveillance. If we consider moving object detection in video analysis is the initial step among the various computer applications. The main drawbacks of the existing object tracking method is a time-consuming approach if the video contains a high volume of information. There arise certain issues in choosing the optimum tracking technique for this huge volume of data. Further, the situation becomes worse when the tracked object varies orientation over time and also it is difficult to predict multiple objects at the same time. In order to overcome these issues here, we have intended to propose an effective method for object detection and movement tracking. In this paper, we proposed robust video object detection and tracking technique. The proposed technique is divided into three phases namely detection phase, tracking phase and evaluation phase in which detection phase contains Foreground segmentation and Noise reduction. Mixture of Adaptive Gaussian (MoAG) model is proposed to achieve the efficient foreground segmentation. In addition to it the fuzzy morphological filter model is implemented for removing the noise present in the foreground segmented frames. Moving object tracking is achieved by the blob detection which comes under tracking phase. Finally, the evaluation phase has feature extraction and classification. Texture based and quality based features are extracted from the processed frames which is given for classification. For classification we are using J48 ie, decision tree based classifier. The performance of the proposed technique is analyzed with existing techniques k-NN and MLP in terms of precision, recall, f-measure and ROC.

I review the burgeoning literature on applications of Markov regime switching models in empirical finance. In particular, distinct attention is devoted to the ability of Markov Switching models to fit the data, filter unknown regimes and states on the basis of the data, to allow a powerful tool to test hypotheses formulated in light of financial theories, and to their forecasting performance with reference to both point and density predictions. The review covers papers concerning a multiplicity of sub-fields in financial economics, ranging from empirical analyses of stock returns, the term structure of default-free interest rates, the dynamics of exchange rates, as well as the joint process of stock and bond returns.