![]() I've actually tested all these QR using my phone before uploading and just now and all of them worked, and one of these codes, the one with "POA" on, is used in a real event in my school and most people can scan them properly. Maybe this would be easier to scan due to the newly add correction block on the right-down corner.Īlso, I think I found a better realization using same basic design principle here. (qrd] = & p Īfter this update, the QR code would look like this:Īfter minor manual edition, it could be like: So I initially hypothesize that the QR recognition algorithm would first average the brightness of a segment, turning it into a normal QR and then recognize it. The marker on the corner are three times coarser than the majority of the QR. ![]() So I tried to figure out the principle by myself.Ĭarefully observe the image, one can find out that there's something odd about this QR: In fact, this form of QR code is not my original idea, I came across such type of QR code on internet but failed to find its origin. To begin with, here's three QR code generated with the code, check it by yourself, they are actually scan-able~ It's also amazing that even very fine details of the image can be shown in the QR code (Note that it would better if you view these QR with your glass off XD) I guess a story-telling type post would attract more upvotes and probably give some insight about how to 'solve problems' using Mathematica, so I would go into details and try to explain not only the code but also how I figured out how to write them.
0 Comments
Leave a Reply. |