Since the introduction of digital and computational pathology as a field, one major problems in clinical application algorithms has been struggle to generalize well examples outside distribution training data. Existing work address this both natural images focused almost exclusively on classification tasks. We explore evaluate robustness 7 best performing nuclear segmentation models from larges...

the mathematical aspect of cartographic mapping is a process which establishes a unique connection between points of the earth’s sphere and their images on a plane. it was proven in differential geometry that an isometric mapping of a sphere onto a plane with all corresponding distances on both surfaces remaining identical can never be achieved since the two surfaces do not possess the same gau...

The paper presents main features of the conic scalarization method in multiobjective optimization. The conic scalarization method guarantee to generate all proper efficient solutions and does not require any kind of cenvexity or boundedness conditions. In addition the preference and reference point information of the decision maker is taken into consideretion by this method. Also in this paper,...

Hough Transform (HT) is a method for shape extraction from images based on accumulator array of the most voted form. This paper introduces a unique methodology to detect any conic equation parameters using HT idea. Based on the analysis of generic conic equation it is observed that is possible to unify its identification on images if some aspects are considered. The bases of the formulation her...

Infinite-dimensional linear conic formulations are described for nonlinear optimal control problems. The primal linear problem consists of finding occupation measures supported on optimal relaxed controlled trajectories, whereas the dual linear problem consists of finding the largest lower bound on the value function of the optimal control problem. Various approximation results relating the ori...

The problem of the generation of homogeneous grids for spherical domains is considered in the class of conformal conic mappings. The equivalence between secant and tangent projections is shown and splitting the set of conformal conic mappings into equivalence classes is presented. The problem of minimization of the mapping factor variation is solved in the class of conformal conic mappings. Obt...

There exist efficient algorithms to project a point onto the intersection of a convex cone and an affine subspace. Those conic projections are in turn the work-horse of a range of algorithms in conic optimization, having a variety of applications in science, finance and engineering. This chapter reviews some of these algorithms, emphasizing the so-called regularization algorithms for linear con...

In this paper we present a new algorithm for finding the unconstrained minimum of a twice–continuously differentiable function f(x) in n variables. This algorithm is based on a conic model function, which does not involve the conjugacy matrix or the Hessian of the model function. The basic idea in this paper is to accelerate the convergence of the conic method choosing more appropriate points x...

In this paper, we present a nonmonotone trust-region method of conic model for unconstrained optimization. The new method combines a new trust-region subproblem of conic model proposed in [Y. Ji, S.J. Qu, Y.J. Wang, H.M. Li, A conic trust-region method for optimization with nonlinear equality and inequality 4 constrains via active-set strategy, Appl. Math. Comput. 183 (2006) 217–231] with a non...