Modeling IrisCode and Its Variants as Convex Polyhedral Cones and Its Security Implications

Adams Wai-Kin Kong

doi:10.1109/tip.2012.2227770

Modeling IrisCode and Its Variants as Convex Polyhedral Cones and Its Security Implications

IEEE Transactions on Image Processing ◽

10.1109/tip.2012.2227770 ◽

2013 ◽

Vol 22 (3) ◽

pp. 1148-1160 ◽

Cited By ~ 6

Author(s):

Adams Wai-Kin Kong

Keyword(s):

Polyhedral Cones ◽

Convex Polyhedral ◽

Convex Polyhedral Cones

A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation.

Mathematics of Computation ◽

10.2307/2005429 ◽

1976 ◽

Vol 30 (133) ◽

pp. 48 ◽

Cited By ~ 6

Author(s):

Don R. Wilhelmsen

Keyword(s):

Linear Approximation ◽

Polyhedral Cones ◽

Convex Polyhedral ◽

Nearest Point ◽

Convex Polyhedral Cones

Canonical analysis of two convex polyhedral cones and applications

Psychometrika ◽

10.1007/bf02294404 ◽

1988 ◽

Vol 53 (4) ◽

pp. 503-524 ◽

Cited By ~ 13

Author(s):

Michel Tenenhaus

Keyword(s):

Canonical Analysis ◽

Polyhedral Cones ◽

Convex Polyhedral ◽

Convex Polyhedral Cones

Towards an algebraic characterization of convex polyhedral cones

Numerische Mathematik ◽

10.1007/bf02173407 ◽

1968 ◽

Vol 12 (2) ◽

pp. 134-138 ◽

Cited By ~ 5

Author(s):

R. J. -B. Wets ◽

Christoph Witzgall

Keyword(s):

Algebraic Characterization ◽

Polyhedral Cones ◽

Convex Polyhedral ◽

Convex Polyhedral Cones

A nearest point algorithm for convex polyhedral cones and applications to positive linear approximation

Mathematics of Computation ◽

10.1090/s0025-5718-1976-0394439-5 ◽

1976 ◽

Vol 30 (133) ◽

pp. 48-48

Author(s):

Don R. Wilhelmsen

Keyword(s):

Linear Approximation ◽

Polyhedral Cones ◽

Convex Polyhedral ◽

Nearest Point ◽

Convex Polyhedral Cones

Tilings of Convex Polyhedral Cones and Topological Properties of Self-Affine Tiles

Discrete & Computational Geometry ◽

10.1007/s00454-020-00249-1 ◽

2020 ◽

Author(s):

Ya-min Yang ◽

Yuan Zhang

Keyword(s):

Topological Properties ◽

Polyhedral Cones ◽

Convex Polyhedral ◽

Convex Polyhedral Cones

Shrinkage estimation for convex polyhedral cones

Statistics & Probability Letters ◽

10.1016/j.spl.2004.08.007 ◽

2004 ◽

Vol 70 (1) ◽

pp. 87-94 ◽

Cited By ~ 4

Author(s):

Anna Amirdjanova ◽

Michael Woodroofe

Keyword(s):

Shrinkage Estimation ◽

Polyhedral Cones ◽

Convex Polyhedral ◽

Convex Polyhedral Cones

An algorithm to decide if the intersection of convex polyhedral cones has a non empty interior

BIT Numerical Mathematics ◽

10.1007/bf01932729 ◽

1976 ◽

Vol 16 (4) ◽

pp. 459-461 ◽

Cited By ~ 2

Author(s):

Marcel Boyer ◽

Louis Paquette

Keyword(s):

Empty Interior ◽

Polyhedral Cones ◽

Convex Polyhedral ◽

Convex Polyhedral Cones

An algorithm for finding a vector in the intersection of open convex polyhedral cones

BIT Numerical Mathematics ◽

10.1007/bf01933529 ◽

1973 ◽

Vol 13 (1) ◽

pp. 114-119 ◽

Cited By ~ 6

Author(s):

Sverre Storøy

Keyword(s):

Open Convex ◽

Polyhedral Cones ◽

Convex Polyhedral ◽

Convex Polyhedral Cones

Fast algorithms for penetration and contact determination between non-convex polyhedral models

Proceedings of 1995 IEEE International Conference on Robotics and Automation ◽

10.1109/robot.1995.525666 ◽

2002 ◽

Cited By ~ 6

Author(s):

M.C. Lin ◽

D. Manocha ◽

M. Ponamgi

Keyword(s):

Fast Algorithms ◽

Convex Polyhedral

On an application of the complex nonlinear complementarity problem

Bulletin of the Australian Mathematical Society ◽

10.1017/s0004972700036868 ◽

1976 ◽

Vol 15 (1) ◽

pp. 141-148 ◽

Cited By ~ 1

Author(s):

J. Parida ◽

B. Sahoo

Keyword(s):

Minimization Problem ◽

Complementarity Problem ◽

Complex Space ◽

Nonlinear Complementarity Problem ◽

Polyhedral Cone ◽

Convex Minimization ◽

Convex Minimization Problem ◽

Polyhedral Cones ◽

Existence Of A Solution ◽

Nonlinear Complementarity

A theorem on the existence of a solution under feasibility assumptions to a convex minimization problem over polyhedral cones in complex space is given by using the fact that the problem of solving a convex minimization program naturally leads to the consideration of the following nonlinear complementarity problem: given g: Cn → Cn, find z such that g(z) ∈ S*, z ∈ S, and Re〈g(z), z〉 = 0, where S is a polyhedral cone and S* its polar.