Adaptive Document Image Binarization with Application in Processing Astronomical Logbooks

ACM Computing Classification System (1998): I.7, I.7.5.Recently, the digitalization of the astronomical scientific heritage has been considered an important task that can facilitate much researches in astronomy. The creation of digital libraries and databases of astronomical photographic plates brings up the problem of digitalization astronomical logbooks, since the data contained in them is crucial for the usage of the plates. An optical character recognition (OCR) system for the handwritten numerical data is needed in order to speed up the process of database creation and extension. In this paper document image binarization is considered since it is a critical stage for the subsequent steps in an OCR software system. A specific method is proposed which outmatches the state-of-the-art techniques in the case of the images of interest.This work has been partially supported by Grant No. DO02-275/2008, Bulgarian NSF, Ministry of Education and Science

Computing Naturally in the Billiard Ball Model

Fredkin's Billiard Ball Model (BBM) is considered one of the fundamental models of collision-based computing, and it is essentially based on elastic collisions of mobile billiard balls. Moreover, fixed mirrors or reflectors are brought into the model to deflect balls to complete the computation. However, the use of fixed mirrors is "physically unrealistic" and makes the BBM not perfectly momentum conserving from a physical point of view, and it imposes an external architecture onto the computing substrate which is not consistent with the concept of "architectureless" in collision-based computing. In our initial attempt to reduce mirrors in the BBM, we present a class of gates: the m-counting gate, and show that certain circuits can be realized with few mirrors using this gate. We envisage that our findings can be useful in future research of collision-based computing in novel chemical and optical computing substrates.Comment: 10 pages, 7 figure

Optical waveguides with compound multiperiodic grating nanostructures for refractive index sensing

The spectral characteristics and refractive index sensitivity of compound multiperiodic grating waveguides are investigated in theory and experiment. Compound gratings are formed by superposition of two or more monoperiodic gratings. Compared to monoperiodic photonic crystal waveguides, compound grating waveguides offer more degrees of design freedom by choice of component grating periods and duty cycles. Refractive index sensing is achieved by evaluating the wavelength or intensity of guided mode resonances in the reflection spectrum. We designed, fabricated, and characterized 24 different compound multiperiodic nanostructured waveguides for refractive index sensing. Simulations are carried out with the Rigorous Coupled Wave Algorithm (RCWA). The resulting spectra, resonance sensitivities, and quality factors are compared to monoperiodic as well as to three selected aperiodic nanostructures (Rudin-Shapiro, Fibonacci, and Thue-Morse). The refractive index sensitivity of the TE resonances is similar for all types of investigated nanostructures. For the TM resonances the compound multiperiodic nanostructures exhibit higher sensitivity values compared to the monoperiodic nanostructure and similar values as the aperiodic nanostructures. No significant influence of the compound grating duty cycles on the sensitivity is observed

Secure Quantum Bit Commitment

Bit commitment (BC) is one of the most important fundamental protocols in secure multi-party computation. However, it is generally believed that unconditionally secure bit commitment is impossible even with quantum resources. In this paper, we design a secure non-interactive bit commitment protocol by exploiting the no-communication theorem of the quantum entangled states, whose security relies on the indistinguishability of whether the Bell states are measured or not. The proposed quantum bit commitment (QBC) is secure against classical adversaries with unlimited computing power, and the probability of a successful attack by quantum adversaries decreases exponentially as $n$ (the number of qubits in a group) increases