簡易檢索 / 詳目顯示

研究生: 許哲瑋
HSU,CHE-WEI
論文名稱: 基於本文資料邊緣排列QR碼實現視覺區之美化
QR Code Beautification by Placing HT-Data along the Edge
指導教授: 賴坤財
Kuen-Tsair Lay
口試委員: 方文賢
Wen-Hsien Fang
曾德峰
Der-Feng Tseng
學位類別: 碩士
Master
系所名稱: 電資學院 - 電子工程系
Department of Electronic and Computer Engineering
論文出版年: 2022
畢業學年度: 110
語文別: 中文
論文頁數: 60
中文關鍵詞: QR碼基線QR碼高斯喬登消去法里德-索羅門碼
外文關鍵詞: QR code, baseline QR code, Gauss-Jordan elimination, Reed-Solomon code
相關次數: 點閱:179下載:5
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報

QR碼一般被用於嵌入訊息,使民眾可以很方便地用手機捕捉QR碼就能獲取需要的訊息 ,在過去設計QR碼為了能夠提高解碼的成功率,所以QR碼的樣子看起來會像是隨機的黑白格子,從外觀看沒有任何視覺效果,近年來設計QR碼不僅只是為了能夠獲取訊息,在視覺上也必須兼顧美觀卻不失解碼的能力,本論文探討系統性QR碼美化的方法。
我們依據兩個方法來生成具有高視覺性的QR碼,第一種方法,利用同位檢測矩陣(parity check matrix),我們由QR碼中心向外挑選具視覺區塊,然後再以同位檢測矩陣進行編碼,即可得到美化後的QR碼,第二種方法,利用生成矩陣(generator matrix),選擇好視覺區塊後經由高斯喬登消去法處理,再利用里德-索羅門碼(Reed-Solomon code,簡稱RS code)的特性做運算,其結果也會是一個合法的里德-索羅門碼,使得編碼出來的QR碼也會和第一種方法效果一樣,我們將這種QR碼統稱為基線QR碼(baseline QR code)。
而在訊息回填QR碼的規則我們也做了一些調整,原本標準的方法是從第一個RS方塊(RS block)開始回填,而我們的方法則是沿著QR碼的邊緣做回填,這樣的好處是可以將中間視覺的部分最大化保留,不過因此在解碼的時候也需要利用我們邊緣回填的規則將我們需要的文字取出來,之後進一步利用亮度公式去調整基線QR碼的整體亮度,使得基線QR碼經過渲染之後在視覺上是彩色的,且利用一般的解碼器(例如ZXing或是手機上的QR解碼App)也能解出來。


QR codes, wherein the underlying technique is the Reed-Solomon (RS) codes, are generally used to embed messages so that people can easily capture the embedded message with their mobile phones. In the past, QR codes were designed to improve the success rate of decoding, so the QR code looks like random black and white grids with no visual effect by the eyes. In recent years, the design of QR codes aims not only to obtain information but also to be visually beautiful (without losing the ability of decoding). This thesis addresses methods for systematic QR code beautification.
We propose two methods to generate QR codes with high visual quality The first method uses the parity check matrix. We select the visual blocks outward from the center of the QR code, and then use the parity check matrix to perform the encoding. Then, the beautified QR code can be obtained. The second method is to use the generator matrix, which is obtained by the Gaussian Jordan elimination method. The QR codes obtained from the two methods are identical. We refer to this QR code as the baseline QR code.
We have also made some adjustments to the rules for backfilling QR codes. The standard method is to start backfilling from the first RS block, while our method is to backfill along the edge of the QR code. The advantage of our method is that we can retain the most visual areas. In the meantime, we also need to use our edge backfilling rules to extract the text we need when decoding. Moreover, we use the brightness formula to adjust the overall brightness of the baseline QR code, so that the baseline QR code is rendered close to the original image. The proposed beautified QR codes, wherein the central area is emphasized to the maximum extent, can be decoded by the standard QR decoders, such as ZXing or QR decoding APPs for smart phones.

摘要 i ABSTRACT ii 誌謝 iv 目錄 v 圖索引 viii 表索引 xi 符號索引 xii 中英文對照表 xiii 第一章 緒論 1 1.1 前言 1 1.2 QR碼 1 1.3 研究動機 1 1.4 論文章節 2 第二章 相關技術介紹 3 2.1 QR碼基本結構 3 2.1.1 外觀特徵 3 2.1.2 QR碼架構 4 2.1.3 錯誤更正能力 6 2.2 QR碼編碼 6 2.2.1 編碼模式 6 2.2.2 里德-所羅門碼編碼 8 2.2.3 QR碼填入方式及遮罩 10 第三章 基線QR碼編碼機制 12 3.1 基線QR碼編碼 – 同位檢測矩陣法 12 3.1.1 圖像與遮罩進行XOR運算 13 3.1.2 挑選視覺碼字 14 3.1.3 QR碼在伽羅瓦場中以碼字建構的本原元素 17 3.1.4 以同位檢測矩陣產生基線QR碼 18 3.1.5 除去定時圖示及校正圖塊 20 3.2 基線QR碼編碼 – 高斯喬登消去法 21 3.2.1 里德所羅門碼編碼特性 21 3.2.2 XOR運算 22 3.2.3 產生生成矩陣(G) 23 3.2.4 高斯喬登消去法 25 3.2.5 基線QR碼編碼流程圖 30 第四章 基線QR碼訊息回填方式與亮度 31 4.1 訊息邊緣排列基線QR碼編碼 31 4.1.1 邊緣排列法 31 4.1.2 訊息邊緣排列基線QR碼 34 4.2 調整基線QR碼的亮度 36 4.2.1 RGB to HSL and HSL to RGB 36 4.2.2 亮度公式 39 4.2.3 Cost Function 42 4.2.4 利用橢圓梯度函數去限制亮度的分布 45 4.2.5 基線QR碼渲染流程圖 47 4.3 訊息邊緣排列QR碼解碼 48 4.3.1 標準解碼 48 4.3.2 再經過一次編碼 49 4.3.3 利用邊緣排列的順序進行解碼 50 4.3.4 基線QR碼解碼流程圖 52 第五章 實驗結果與討論 53 5.1 邊緣排列法與標準回填訊息外觀上的差異 53 5.2 彩色邊緣排列基線QR碼實驗結果 56 第六章 結論與未來展望 60 參考文獻 62

[1] Gonzalo J. Garateguy; Gonzalo R. Arce; Daniel L. Lau; Ofelia P. Villarreal, “QR Images: Optimized Image Embedding in QR Codes,” IEEE Transactions on Image Processing, vol. 23, no. 7, pp. 2842 – 2853, Jul. 2014.
[2] 陳亭君,“內嵌無失真標誌之高度視覺性QR碼,” 國立台灣科技大學電子工程所,2017。
[3] K. Lay, T. Chen, “Visual QR codes with lossless picture embedding,” 2018 3rd International Conference on Intelligent Green Building and Smart Grid (IGBSG), pp. 1-4, Apr. 2018.
[4] R. Cox, “Qart codes,” Apr. 2012 [Online]. Available:
http://research.swtch.com/qart, Accessed on: Oct. 2012.
[5] R. Cox, “Finite field arithmetic and Reed-Solomon coding,” Apr. 2012
[Online]. Available: http://research.swtch.com/field, Accessed on: Oct. 2012.
[6] Karelia Pena-Pena; Gonzalo R. Arce, “Channel Coding Optimization for Visually Pleasant QR Codes: Invited Presentation,” 2019 53rd Annual Conference on Information Sciences and Systems (CISS), pp. 1-4, Mar. 2019.
[7] Jianfeng Lu, Weiling Cheng, Shanqing Zhang, Li Li, Zaorang Yang, Chin-Chen Chang, “A Novel Aesthetic QR Code Algorithm Based on Hybrid Basis Vector Matrices,” Symmetry in Computing Theory and Application, pp. 1-16, Oct. 2018.
[8] Shih-Syun Lin; Min-Chun Hu; Chien-Han Lee; Tong-Yee Lee, “Efficient QR Code Beautification With High Quality Visual Content,” IEEE Transactions on Multimedia vol. 17, no. 9, pp. 1515 – 1524, Sep. 2015. 
[9] ISO, “Information technology Automatic identification and data capture techniques QR Code bar code symbology specification,” International Organization for Standardization, Geneva, Switzerland, ISO/IEC 18004:2015.
[10] H.-K. Chu, C.-S. Chang, R.-R. Lee, and N. J. Mitra, “Halftone QR
codes,” ACM Trans. Graph., vol. 32, no. 6, pp. 217:1–217:8, 2013.
[11] Sean Owen, Daniel Switkin, ZXing Team, Barcode Scanner(aka ZXing or Zebra Crossing), Sep. 2018 [Online]. Available: https://github.com/ZXing/ZXing, Accessed on: Jan. 2020.

QR CODE