4 papers · 1 filter
A Scalable and Exact Relaxation for Densest -Subgraph via Error Bounds
Ya Liu, Junbin Liu, Wing-Kin Ma +1
Given an undirected graph and a size parameter , the Densest -Subgraph (DS) problem extracts the subgraph on vertices with the largest number of induced edges. While D…
Extreme Point Pursuit -- Part II: Further Error Bound Analysis and Applications
Junbin Liu, Ya Liu, Wing-Kin Ma +2
In the first part of this study, a convex-constrained penalized formulation was studied for a class of constant modulus (CM) problems. In particular, the error bound techniques wer…
Extreme Point Pursuit -- Part I: A Framework for Constant Modulus Optimization
Junbin Liu, Ya Liu, Wing-Kin Ma +2
This study develops a framework for a class of constant modulus (CM) optimization problems, which covers binary constraints, discrete phase constraints, semi-orthogonal matrix cons…
Multilayer Simplex-structured Matrix Factorization for Hyperspectral Unmixing with Endmember Variability
Junbin Liu, Yuening Li, Wing-Kin Ma
Given a hyperspectral image, the problem of hyperspectral unmixing (HU) is to identify the endmembers (or materials) and the abundance (or endmembers' contributions on pixels) that…