Image is represented by an undirected weighted graph G = (V, E) where vertices i ∈ V = {1, . . . , n} correspond to image features, and edges (i, j) ∈ E have weights w(i, j) : V × V 7→ R that reflect pairwise similarity between features. To segment an image, we wish to partition nodes V into two disjoint coherent sets S and S̄ = V \ S. This means that edges within the same set should have high w...

This article studies a pair of higher order nondifferentiable symmetric fractional programming problem over cones. First, cone convex function is introduced. Then using the properties this function, duality results are set up, which give legitimacy primal dual model.

The low-rank solutions of continuous and discrete Lyapunov equations are of great importance but generally difficult to achieve in control system analysis and design. Fortunately, Mesbahi and Papavassilopoulos [On the rank minimization problems over a positive semidefinite linear matrix inequality, IEEE Trans. Auto. Control, Vol. 42, No. 2 (1997), 239-243] showed that with the semidefinite cone...

In this paper we continue the development of a theoretical foundation for efficient primal-dual interior-point algorithms for convex programming problems expressed in conic form, when the cone and its associated barrier are self-scaled (see [NT97]). The class of problems under consideration includes linear programming, semidefinite programming and convex quadratically constrained quadratic prog...

In this paper, Novikov's inversion formula of the attenuated two-dimensional (2D) Radon transform is applied to the reconstruction of attenuated fan-beam projections acquired with equal detector spacing and of attenuated cone-beam projections acquired with a flat planar detector and circular trajectory. The derivation of the fan-beam algorithm is obtained by transformation from parallel-beam co...

Here we propose a cone-beam composite-circling mode to solve the quasi-short object problem, which is to reconstruct a short portion of a long object from longitudinally truncated cone-beam data involving the short object. In contrast to the saddle curve cone-beam scanning, the proposed scanning mode requires that the X-ray focal spot undergoes a circular motion in a plane facing the short obje...

We describe an affine transformation on the (CIE) color matching functions and map the spectral locus as a circle. We then homogenize the right circular cylinder erected by the circle, with respect to a normalizing plane and develop an analytical equation to the chromaticity cone, for the spectral colors. In the interior of the (CIE) chromaticity diagram, by homogenizing elliptic cylinders with...