Neset Deniz Turgay

Dr. Neset Deniz Turgay


Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 February 2021 in Pattern Recognition Letters
Verified
Journal Article
Closed access
GKGergely Kovács
Gergely Kovács
BNBenedek Nagy
Benedek Nagy
NTNeset Deniz Turgay
Neset Deniz Turgay

21 April 2021 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
GKGergely Kovács
Gergely Kovács
BNBenedek Nagy
Benedek Nagy
GSGergely Stomfai
Gergely Stomfai
NTNeset Deniz Turgay
Neset Deniz Turgay
BVBéla Vizvári
Béla Vizvári
Linear programming is used to solve optimization problems. Thus, finding a shortest path in a grid is a good target to apply linear programming. In this paper, specific bipartite grids, the square and the body-centered cubic grids are studied. The former is represented as a “diagonal square grid” having points with pairs of either even or pairs of odd coordinates (highlighting the bipartite feature). Therefore, a straightforward generalization of the representation describes the body-centered cubic grid in 3D. We use chamfer paths and chamfer distances in these grids; therefore, weights for the steps between the closest neighbors and steps between the closest same type points are fixed, and depending on the weights, various paths could be the shortest one. The vectors of the various neighbors form a basis if they are independent, and their number is the same as the dimension of the space studied. Depending on the relation of the weights, various bases could give the optimal solution and various steps are used in the shortest paths. This operational research approach determines the optimal paths as basic feasible solutions of a linear programming problem. A directed graph is given containing the feasible bases as nodes and arcs with conditions on the used weights such that the simplex method may step from one feasible basis to another one. Thus, the optimal bases can be determined, and they are summarized in two theorems. If the optimal solution is not integer, then the Gomory cut is applied and the integer optimal solution is reached after only one Gomory iteration. Chamfer distances are frequently used in image processing and analysis as well as graphics-related subjects. The body-centered cubic grid, which is well-known in solid state physics, material science, and crystallography, has various applications in imaging and graphics since less samples are needed to represent the signal in the same quality than on the cubic grid. Moreover, the body-centered cubic grid has also a topological advantage over the cubic grid, namely, the neighbor Voronoi cells always share a full face.

21 June 2013 in Communications in Algebra
Verified
Journal Article
Closed access
MCMartin Crossley
Martin Crossley
NTNeset Deniz Turgay
Neset Deniz Turgay
The Leibniz–Hopf algebra is the free associative algebra on one generator, Sn, in each positive degree, with coproduct . We calculate a basis for the fixed-points of the mod 2 dual of this algebra under the Hopf algebra conjugation operation.

1 January 2014 in TURKISH JOURNAL OF MATHEMATICS
Verified
Journal Article
Closed access
NTNeset Deniz Turgay
Neset Deniz Turgay

20 January 2021 in Mathematics
Verified
Journal Article
Open access
PDF file
GKGergely Kovács
Gergely Kovács
BNBenedek Nagy
Benedek Nagy
GSGergely Stomfai
Gergely Stomfai
NTNeset Deniz Turgay
Neset Deniz Turgay
BVBéla Vizvári
Béla Vizvári
Recently, operations research, especially linear integer-programming, is used in various grids to find optimal paths and, based on that, digital distance. The 4 and higher-dimensional body-centered-cubic grids is the nD (n≥4) equivalent of the 3D body-centered cubic grid, a well-known grid from solid state physics. These grids consist of integer points such that the parity of all coordinates are the same: either all coordinates are odd or even. A popular type digital distance, the chamfer distance, is used which is based on chamfer paths. There are two types of neighbors (closest same parity and closest different parity point-pairs), and the two weights for the steps between the neighbors are fixed. Finding the minimal path between two points is equivalent to an integer-programming problem. First, we solve its linear programming relaxation. The optimal path is found if this solution is integer-valued. Otherwise, the Gomory-cut is applied to obtain the integer-programming optimum. Using the special properties of the optimization problem, an optimal solution is determined for all cases of positive weights. The geometry of the paths are described by the Hilbert basis of the non-negative part of the kernel space of matrix of steps.

29 March 2013 in Journal of Pure and Applied Algebra
Verified
Journal Article
Closed access
MCMartin Crossley
Martin Crossley
NTNeset Deniz Turgay
Neset Deniz Turgay