Page 1 Next

Displaying 1 – 20 of 49

Showing per page

Parallel implementation of local thresholding in Mitrion-C

Tomasz Kryjak, Marek Gorgoń (2010)

International Journal of Applied Mathematics and Computer Science

Mitrion-C based implementations of three image processing algorithms: a look-up table operation, simple local thresholding and Sauvola's local thresholding are described. Implementation results, performance of the design and FPGA logic utilization are discussed.

Parametric logarithmic type image processing for contrast based auto-focus in extreme lighting conditions

Corneliu Florea, Laura Florea (2013)

International Journal of Applied Mathematics and Computer Science

While most of state-of-the-art image processing techniques were built under the so-called classical linear image processing, an alternative that presents superior behavior for specific applications comes in the form of Logarithmic Type Image Processing (LTIP). This refers to mathematical models constructed for the representation and processing of gray tones images. In this paper we describe a general mathematical framework that allows extensions of these models by various means while preserving...

Parity codes

Paulo E. D. Pinto, Fábio Protti, Jayme L. Szwarcfiter (2005)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Motivated by a problem posed by Hamming in 1980, we define even codes. They are Huffman type prefix codes with the additional property of being able to detect the occurrence of an odd number of 1-bit errors in the message. We characterize optimal even codes and describe a simple method for constructing the optimal codes. Further, we compare optimal even codes with Huffman codes for equal frequencies. We show that the maximum encoding in an optimal even code is at most two bits larger than the maximum...

Parity codes

Paulo E. D. Pinto, Fábio Protti, Jayme L. Szwarcfiter (2010)

RAIRO - Theoretical Informatics and Applications

Motivated by a problem posed by Hamming in 1980, we define even codes. They are Huffman type prefix codes with the additional property of being able to detect the occurrence of an odd number of 1-bit errors in the message. We characterize optimal even codes and describe a simple method for constructing the optimal codes. Further, we compare optimal even codes with Huffman codes for equal frequencies. We show that the maximum encoding in an optimal even code is at most two bits larger than the maximum...

Currently displaying 1 – 20 of 49

Page 1 Next