Now showing items 1-6 of 6
Alternating Direction Augmented Lagrangian Methods for Semidefinite Programming
We present an alternating direction method based on an augmented Lagrangian framework for solving semidefinite programming (SDP) problems in standard form. At each iteration, the algorithm, also known as a two-splitting ...
Copula Density Estimation by Total Variation Penalized Likelihood with Linear Equality Constraints
A copula density is the joint probability density function (PDF) of a random vector with uniform marginals. An approach to bivariate copula density estimation is introduced that is based on a maximum penalized likelihood ...
Sparse Signal Reconstruction via Iterative Support Detection
We present a novel sparse signal reconstruction method "ISD", aiming to achieve fast reconstruction and a reduced requirement on the number of measurements compared to the classical L1 minimization approach. ISD addresses ...
Image-Based Face Illumination Transferring Using Logarithmic Total Variation Models
In this paper, we present a novel image-based technique that transfers illumination from a source face image to a target face image based on the Logarithmic Total Variation (LTV) model. Our method does not require any prior ...
Collaborative Spectrum Sensing from Sparse Observations Using Matrix Completion
In cognitive radio, spectrum sensing is a key component to detect spectrum holes (i.e., channels not used by any primary users). Collaborative spectrum sensing among the cognitive radio nodes is expected to improve the ...
A Matlab Implementation of a Flat Norm Motivated Polygonal Edge Matching Method using a Decomposition of Boundary into Four 1-Dimensional Currents
We describe and provide code and examples for a polygonal edge matching method.