Találati lista | Tudóstér

001-es BibID:	BIBFORM084299
Első szerző:	Lukic Tibor
Cím:	Deterministic discrete tomography reconstruction by energy minimization method on the triangular grid / Tibor Lukić, Benedek Nagy
Dátum:	2014
ISSN:	0167-8655
Megjegyzések:	In this paper we consider the binary tomography reconstruction problem on the triangular grid. A deterministic energy-minimization method is proposed. The new method is based on the convex-concave regularization approach and uses the Spectral Projected Gradient optimization algorithm. The proposed method shows significant advantages, regarding the quality of the reconstructions and required running time, in comparison with the previously suggested reconstruction method based on the stochastic Simulated Annealing algorithm. Experimental results, using regular hexagon shaped test images, are presented and analyzed.
Tárgyszavak:	Műszaki tudományok Informatikai tudományok idegen nyelvű folyóiratközlemény külföldi lapban folyóiratcikk Discrete tomography Triangular grid Energy-minimization Deterministic optimization Convex-concave regularization Spectral Projected Gradient
Megjelenés:	Pattern Recognition Letters. - 49 (2014), p. 11-16. -
További szerzők:	Nagy Benedek (1973-) (informatikus, matematikus)
Internet cím:	Szerző által megadott URL DOI Intézményi repozitóriumban (DEA) tárolt változat
Borító:
Saját polcon:

001-es BibID:	BIBFORM001999
Első szerző:	Nagy Benedek (informatikus, matematikus)
Cím:	Distances with neighbourhood sequences in cubic and triangular grids / Benedek Nagy
Dátum:	2007
Megjegyzések:	In this paper we compute distances with neighbourhood sequences in the cubic and in the triangular grids. First we give a formula which computes the distance with arbitrary neighbourhood sequence in the three-dimensional digital space. After this, using the injection of the triangular grid to the cubic grid, we modify the formula for Z3 to the triangular plane. The distances in the triangular grid have some properties which are not present on the square and cubic grids. It may be non-symmetric, and it is possible that the distance depends on the ordering of elements of the initial part of the neighbourhood sequence. The distance depends on the ordering of the initial part (up to the kth element) of the neighbourhood sequence if and only if there is a permutation of these elements such that the distance (up to value k) is non-symmetric using the elements in this new order. This dependence means somehow more flexibility of the distances based on neighbourhood sequences on the triangular grid than in Z^n.
Tárgyszavak:	Természettudományok Matematika- és számítástudományok idegen nyelvű folyóiratközlemény külföldi lapban digital geometry
Megjelenés:	Pattern Recognition Letters. - 28 : 1 (2007), p. 99-109. -
Internet cím:	elektronikus változat DOI elektronikus változat
Borító:
Saját polcon: