The work aims to improve the robustness and invisibility of digital watermarking and put forward a kind of watermarking algorithm based on the Laplacian Pyramid and LWT-QR decomposition. First, the two layers' Laplacian Pyramid decomposition of host image was conducted. The second layer of Laplacian residual image was taken for a layer of LWT decomposition, and the low frequency subband size was subject to the 4×4 non-overlapping block processing. Then, based on the related properties used to improve the wavelet coefficient, the QR decomposition of each selected line frequency sub-block was done. The watermark was embedded with the first line of the decomposed R matrix as the target. Meanwhile, Arnold scrambling of the watermark was conducted. The scrambled watermark image was embedded into the first-line elements of R matrix. The PSNR of the watermarked images could reach 45 dB, and such scheme had better robustness against the common signal processing attacks with the average NC values all above 0.9. Theoretical analysis and a lot of experimental data show that the scheme can well improve the robustness and invisibility in the operation process of the image.