In this paper we propose an effective and robust approach for detecting corner points on a given binary image. Unlike other corner detection methods the proposed method is non-parametric in nature, that is, it does not require any input parameter. The proposed method is based on mathematical morphology. It makes use of morphological skeleton for detecting corner points. Convex corner points are...

This paper considers a fairly large class of noncooperative games in which strategies are jointly constrained. When what is called the Ky Fan or Nikaidô-Isoda function is convex-concave, selected Nash equilibria correspond to diagonal saddle points of that function. This feature is exploited to design computational algorithms for finding such equilibria. To comply with some freedom of individua...

Computational comparison is made between two feature selection approaches for nding a separating plane that discriminates between two point sets in an n-dimensional feature space that utilizes as few of the n features (dimensions) as possible. In the concave minimization approach [19, 5] a separating plane is generated by minimizing a weighted sum of distances of misclassi ed points to two para...

Computing a polygon defining a set of planar points is a classical problem of modern computational geometry. In laboratory experiments we demonstrate that a concave hull, a connected α-shape without holes, of a finite planar set is approximated by slime mould Physarum polycephalum. We represent planar points with sources of long-distance attractants and short-distance repellents and inoculate a...

Flattening of the preimplantation rod contour in the sagittal plane influences thoracic kyphosis (TK) restoration in adolescent idiopathic scoliosis (AIS) surgery. The effects of multilevel facetectomy and screw density on postoperative changes in spinal rod contour have not been documented. This study aimed to evaluate the effects of multilevel facetectomy and screw density on changes in spina...

We address two problems. In the first, we refine the analysis of a lower bound construction of a point set having many non-crossing spanning trees. We also give more precise upper bounds on the maximum number of non-crossing spanning trees, perfect matchings and simple polygons of a planar point set. In the second, we give an improved lower bound construction for the d-interval problem. 1 Non-c...

in this paper, under the condition that $k$ is concave, we characterize lacunary series in $q_{k}$ spaces. we improve a result due to h. wulan and k. zhu.

We study best response dynamics in continuous time for continuous concave-convex zero-sum games and prove convergence of its trajectories to the set of saddle points, thus providing a dynamical proof of the minmax theorem. Consequences for the corresponding discrete time process with small or diminishing step-sizes are established, including convergence of the fictitious play procedure.