PL
 |
EN
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 4

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote Eliminating Switching Components in Binary Matrices by 0-1 Flips and Column Permutations
Hantos N., Balázs P.
Fundamenta Informaticae
|
2015
|
Vol. 141, nr 2/3
135--150
EN
Analysis of patterns in binary matrices plays a vital role in numerous applications of computer science. One of the most essential patterns of such matrices are the so called switching components, where the number and location of the components gives valuable information about the binary matrix. One way to measure the effect of switching components in a binary matrix is counting the number of 0-s which have to be replaced with 1-s in order to eliminate the switching components. However, finding the minimal number of 0-1 flips is generally an NP-complete problem. We present two novel-type heuristics for the above problem and show via experiments that they outperform the formerly proposed ones, both in optimality and in running time. We also show how to use those heuristics for determining the so-called nestedness level of a matrix, and how to use the flips for binary image compression.
2
Content available remote A Measure of Directional Convexity Inspired by Binary Tomography
Balázs P., Ozsvár Z., Tasi T. S., Nyúl L. G.
Fundamenta Informaticae
|
2015
|
Vol. 141, nr 2/3
151--167
EN
Inspired by binary tomography, we present a measure of directional convexity of binary images combining various properties of the configuration of 0s and 1s in the binary image. The measure can be supported by proper theory, is easy to compute, and as shown in our experiments, behaves intuitively. The measure can be useful in numerous applications of digital image processing and pattern recognition, and especially in binary tomography. We show in detail an application of this latter one, by providing a novel reconstruction algorithm for almost hv-convex binary images. We also present experimental results and mention some of the possible generalizations of the measure.
3
Content available remote Random Generation of hv-Convex Polyominoes with Given Horizontal Projection
Hantos N., Balázs P.
Fundamenta Informaticae
|
2014
|
Vol. 135, nr 1/2
103--115
EN
We provide a quadratic-time algorithm for generating hv-convex polyominoes according to a given horizontal projection. The method can be used to generate hv-convex polyominoes with the prescribed projection and with a fixed or arbitrary horizontal dimension, from a uniform random distribution.
4
Content available remote The Reconstruction of Polyominoes from Horizontal and Vertical Projections and Morphological Skeleton is NP-complete
Hantos N., Balázs P.
Fundamenta Informaticae
|
2013
|
Vol. 125, nr 3/4
343--359
EN
Reconstruction of binary images from their projections is one of the main tasks in many image processing areas, therefore determining the computational complexity of those problems is essential. The reconstruction complexity is highly dependent on the requirements of the image. In this paper, we will show that the reconstruction is NP-complete if the horizontal and vertical projections and the morphological skeleton of the image are given, and it is supposed that the image is 4-connected.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.