We prove the following conjecture of Furstenberg (1969): if 𝐴,𝐵⊂[0,1] are closed and invariant under ×𝑝 mod1 and ×𝑞 mod1, respectively, and if log𝑝/log𝑞∉ℚ, then for all real numbers 𝑢 and 𝑣, dim_H (𝑢𝐴 + 𝑣) ∩ 𝐵 ≤ max {0, dim_H 𝐴 + dim_H 𝐵 − 1}. We obtain this result as a consequence of our study on the intersections of incommensurable self-similar sets on ℝ. Our methods also allow us to give upper bounds for dimensions of arbitrary slices of planar self-similar sets satisfying SSC and certain natural irreducible conditions.

As the barcode becomes more widely used, its applications and data capacity demands grow, increasing the need for barcodes with greater data density. Utilizing the quick response (QR) code–one of the many types of barcodes–we developed two algorithms. The first algorithm creates a color QR code that stores more information than a standard QR code and embeds extra data with limited access privilege. The second algorithm denoises a noisy color QR code. These algorithms consist of three techniques: (1) enlarging the data capacity of a compact QR code image by stacking multiple classical QR codes to form a color barcode, (2) embedding information into the color QR code using pseudo quantum signals in an M-band wavelet domain and selecting the discrete 4-band wavelet transforms to compress the QR images, and (3) applying Discrete M-band Wavelet Transform (DMWT) and Patch Group Prior based Denoising (PGPD) methods to denoise noisy QR code images. The peak-signal-to-noise-ratio (PSNR) summary indicates that information in a color QR code can be efficiently stored and retrieved with these methods. Moreover, it shows that our denoising algorithm effectively removes heavy noise from the noisy color QR code. Our algorithms are implemented in a flexible framework, which allows for further modifications to improve both the data capacity of a color QR code and the effectiveness of signal extraction from noisy data to meet future demands.

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!