This paper presents a method for the detection of faces (via skin regions) in images where faces may be low-resolution and no assumptions are made about fine facial features being visible. This type of data is challen...
详细信息
In this paper the linear sparse signal model is extended to allow more general, non-linear relationships and more general measures of approximation error. A greedy gradient based strategy is presented to estimate the ...
详细信息
In this paper the linear sparse signal model is extended to allow more general, non-linear relationships and more general measures of approximation error. A greedy gradient based strategy is presented to estimate the sparse coefficients. This algorithm can be understood as a generalisation of the recently introduced Gradient Pursuit framework. Using the presented approach with the traditional linear model but with a different cost function is shown to outperform OMP in terms of recovery of the original sparse coefficients. A second set of experiments then shows that for the nonlinear model studied and for highly sparse signals, recovery is still possible in at least a percentage of cases. copyright by EURASIP.
Recent research into multi-object filtering for non-standard targets introduced alternative approaches for target group representation. In these approaches a measurement model (likelihood) was suggested that led to a ...
详细信息
ISBN:
(纸本)9780982443811
Recent research into multi-object filtering for non-standard targets introduced alternative approaches for target group representation. In these approaches a measurement model (likelihood) was suggested that led to a representation of the measurements as a spatial point process, namely a Poisson point process. In this paper we take a more traditional approach to extended target tracking. We assume a 'standard' measurement model (at most one measurement generated from a target point), but represent the target group (extended targets) as a spatial cluster process, in particular an independent cluster process with a fixed distribution on the component (daughter) process. With this assumption we are able to derive approximate measurement-update equations for the first order moment density of the extended object Bayes filter in a number of scenarios. Such approximations are Bayes optimal and provide estimates for the number of clusters (extended targets) and their locations.
The number of signals plays an important role in array processing. The performance of direction finding algorithms relies strongly on a correctly specified number of signals. When the number of signals is unknown, con...
详细信息
When sampling signals below the Nyquist rate, efficient and accurate reconstruction is nevertheless possible, whenever the sampling system is well behaved and the signal is well approximated by a sparse vector. This s...
详细信息
When sampling signals below the Nyquist rate, efficient and accurate reconstruction is nevertheless possible, whenever the sampling system is well behaved and the signal is well approximated by a sparse vector. This statement has been formalised in the recently developed theory of compressed sensing, which developed conditions on the sampling system and proved the performance of several efficient algorithms for signal reconstruction under these conditions. In this paper, we prove that a very simple and efficient algorithm, known as Iterative Hard Thresholding, has near optimal performance guarantees rivalling those derived for other state of the art approaches.
In this paper the linear sparse signal model is extended to allow more general, non-linear relationships and more general measures of approximation error. A greedy gradient based strategy is presented to estimate the ...
详细信息
ISBN:
(纸本)9782839904506
In this paper the linear sparse signal model is extended to allow more general, non-linear relationships and more general measures of approximation error. A greedy gradient based strategy is presented to estimate the sparse coefficients. This algorithm can be understood as a generalisation of the recently introduced Gradient Pursuit framework. Using the presented approach with the traditional linear model but with a different cost function is shown to outperform OMP in terms of recovery of the original sparse coefficients. A second set of experiments then shows that for the non-linear model studied and for highly sparse signals, recovery is still possible in at least a percentage of cases.
This paper presents an investigation into the error probability performance for binary phase-shift keying modulation in distributed beamforming with phase errors. The effects of the number of nodes on the beamforming ...
详细信息
This paper presents an investigation into the error probability performance for binary phase-shift keying modulation in distributed beamforming with phase errors. The effects of the number of nodes on the beamforming performance are examined as well as the influences of the cumulative phase errors and the total transmit power. Simulation results show a good match with the mathematical analysis of error probability in both static and time-varying channels.
Sparse signal approximations are approximations that use only a small number of elementary waveforms to describe a signal. In this paper we proof the convergence of an iterative hard thresholding algorithm and show, t...
详细信息
Sparse signal approximations are approximations that use only a small number of elementary waveforms to describe a signal. In this paper we proof the convergence of an iterative hard thresholding algorithm and show, that the fixed points of that algorithm are local minima of the sparse approximation cost function, which measures both, the reconstruction error and the number of elements in the representation. Simulation results suggest that the algorithm is comparable in performance to a commonly used alternative method.
We investigate the base station (BS) downlink transmission energy for a multiple-input multiple-output (MIMO) communication system operating under an inter-cell interference environment with the receiver equipped with...
详细信息
This paper presents an evolutionary approach to estimating upper-body posture from multi-view markerless sequences. We fit a 24-dof skeleton model to sparse 3-D stereo data from an array of cameras. We use a particle ...
详细信息
ISBN:
(纸本)1904410146
This paper presents an evolutionary approach to estimating upper-body posture from multi-view markerless sequences. We fit a 24-dof skeleton model to sparse 3-D stereo data from an array of cameras. We use a particle swarm optimization algorithm which is intrinsically parallel, can incorporate constraints and does not require motion models. We subdivide the high-dimensional search space based on limb dynamics from application sequences and perform hierarchical fitting from the least to the most uncertain body parts. We show experimentally the advantages of this scheme against non-hierarchical optimization in terms of sharper error decrease. We report results with 3-D scanner data of a model human and noisy, calibrated stereo disparity maps of a real videoconferencing scene.
暂无评论