• Journal of Ubiquitous Convergence Technology
• /
• v.2 no.1
• /
• pp.18-26
• /
• 2008

The invariance relation existing in the non-negative matrix factorization (NMF) is used for constructing robust image hashes in this work. The image is first re-scaled to a fixed size. Low-pass filtering is performed on the luminance component of the re-sized image to produce a normalized matrix. Entries in the normalized matrix are pseudo-randomly re-arranged under the control of a secret key to generate a secondary image. Non-negative matrix factorization is then performed on the secondary image. As the relation between most pairs of adjacent entries in the NMF's coefficient matrix is basically invariant to ordinary image processing, a coarse quantization scheme is devised to compress the extracted features contained in the coefficient matrix. The obtained binary elements are used to form the image hash after being scrambled based on another key. Similarity between hashes is measured by the Hamming distance. Experimental results show that the proposed scheme is robust against perceptually acceptable modifications to the image such as Gaussian filtering, moderate noise contamination, JPEG compression, re-scaling, and watermark embedding. Hashes of different images have very low collision probability. Tampering to local image areas can be detected by comparing the Hamming distance with a predetermined threshold, indicating the usefulness of the technique in digital forensics.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.3
• /
• pp.91-102
• /
• 1994

For the analysis of textured image, it requires large storage space and computation time to calculate the matrix features such as SGLDM(Spatial Gray Level Dependence Matrix). NGLDM(Neighboring Gray Level Dependence Matrix). NSGLDM(Neighboring Spatial Gray Level Dependence Matrix) and GLRLM(Gray Level Run Length Matrix). In spite of a large amount of information that each matrix contains, a set of several correlated scalar features calculated from the matrix is not sufficient to approximate it. In this paper, we propose a new classifier for textured images based on these matrices in which the projected vectors of each matrix on the meaningful directions are used as features. In the proposed method, an unknown image is classified to the class of a known image that gives the maximum similarity between the projected model vector from the known image and the vector from the unknown image. In the experiment to classify images of agricultural products, the proposed method shows good performance as much as 85-95% of correct classification ratio.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.2
• /
• pp.471-485
• /
• 2023

As data sharing increases explosively, such information encoded in QR code is completely public as private messages are not securely protected. This paper proposes a new 'PROMISE' framework for hiding information based on the QR code projection matrix by using image segmentation without modifying the essential QR code characteristics. Projection matrix mapping, matrix scrambling, fusion image segmentation and steganography with SEL(secret embedding logic) are part of the PROMISE framework. The QR code could be mapped to determine the segmentation site of the fusion image as a binary information matrix. To further protect the site information, matrix scrambling could be adopted after the mapping phase. Image segmentation is then performed on the fusion image and the SEL module is applied to embed the secret message into the fusion image. Matrix transformation and SEL parameters should be uploaded to the server as the secret key for authorized users to decode the private message. And it was possible to further obtain the private message hidden by the framework we proposed. Experimental findings show that when compared to some traditional information hiding methods, better anti-detection performance, greater secret key space and lower complexity could be obtained in our work.

• Journal of Korea Multimedia Society
• /
• v.17 no.8
• /
• pp.953-960
• /
• 2014

In Shamir's (t,n)-threshold based secret image sharing schemes, there exists a problem that the secret image can be reconstructed when an arbitrary attacker becomes aware of t secret image pieces, or t participants are malicious collusion. It is because that utilizes linear combination polynomial arithmetic operation. In order to overcome the problem, we propose a secret image sharing scheme using matrix decomposition and adversary structure. In the proposed scheme, there is no reconstruction of the secret image even when an arbitrary attacker become aware of t secret image pieces. Also, we utilize a simple matrix decomposition operation in order to improve the security of the secret image. In experiments, we show that performances of embedding capacity and image distortion ratio of the proposed scheme are superior to previous schemes.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1983.10a
• /
• pp.68-72
• /
• 1983

The Hadamard matrix is a symmetric matrix made of plus and minus ones as entries. There fore the use of Hadamard transform in the image processing requires only the real number operations and results in the computational advantages. Recently, However, certain degradation aspects have been reported. In this paper we propose a WH matrix which retains the main properties of Hadamard matrix. The actual improvement of the image transmission in the inner part of the picture has been demonstrated by the computer simulated image developments. The orthogonal transform offers a useful facility in the digital signal processing. As the size of the transmission block increases, however, the assigment of bits for each data must increase exponentially. Thus the SNR of the image tends to decline accordingly. As an attempt to increase the SNR, we propose the WH matrix whose elements are made of $\pm$1, $\pm$2, $\pm$3, and the unitform is 8$\times$8 matrix.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.5
• /
• pp.52-62
• /
• 2008

In this paper, we develop a method that changes the resolutions of images in an arbitrary block transform domain by using a filter that suits to the characteristics of the underlying images. To accomplish this, we represent each procedure resizing images in an arbitrary transform domain as matrix multiplications and we derive the matrix that scales the image resolutions from the matrix multiplications. The resolution scaling matrix is also designed to be able to select the up/down-sampling filter that suits the characteristics of the image. Experiments show that the proposed method produces the reliable performances when it is applied to various transforms and to images that are mixed with predicted and non-predicted blocks which are generated during video coding.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.227-230
• /
• 2002

In this paper, we propose an algorithm to decode Data Matrix two dimensional barcode symbology. We employ hough transform and bilinear image warping to extract the barcode region from the image scanned using a CMOS digital camera. The location of barcode can be found by applying Hough transform. However, barcode image should be warped due to the nonlinearity of lens and the viewing angle of camera. In this paper, bilinear warping transform is adopted to wa게 and align the barcode region of the scanned image. Codeword can be detected from the aligned barcode region.

• Current Optics and Photonics
• /
• v.5 no.6
• /
• pp.686-698
• /
• 2021

A camouflaged encryption scheme based on Hadamard matrix and ghost imaging is proposed. In the process of the encryption, an orthogonal matrix is used as the projection pattern of ghost imaging to improve the definition of the reconstructed images. The ciphertext of the secret image is constrained to the camouflaged image. The key of the camouflaged image is obtained by the method of sparse decomposition by principal component orthogonal basis and the constrained ciphertext. The information of the secret image is hidden into the information of the camouflaged image which can improve the security of the system. In the decryption process, the authorized user needs to extract the key of the secret image according to the obtained random sequences. The real encrypted information can be obtained. Otherwise, the obtained image is the camouflaged image. In order to verify the feasibility, security and robustness of the encryption system, binary images and gray-scale images are selected for simulation and experiment. The results show that the proposed encryption system simplifies the calculation process, and also improves the definition of the reconstructed images and the security of the encryption system.

• ETRI Journal
• /
• v.39 no.6
• /
• pp.841-850
• /
• 2017

We investigate neural network image reconstruction for magnetic particle imaging. The network performance strongly depends on the convolution effects of the spectrum input data. The larger convolution effect appearing at a relatively smaller nanoparticle size obstructs the network training. The trained single-layer network reveals the weighting matrix consisting of a basis vector in the form of Chebyshev polynomials of the second kind. The weighting matrix corresponds to an inverse system matrix, where an incoherency of basis vectors due to low convolution effects, as well as a nonlinear activation function, plays a key role in retrieving the matrix elements. Test images are well reconstructed through trained networks having an inverse kernel matrix. We also confirm that a multi-layer network with one hidden layer improves the performance. Based on the results, a neural network architecture overcoming the low incoherence of the inverse kernel through the classification property is expected to become a better tool for image reconstruction.

• ETRI Journal
• /
• v.37 no.6
• /
• pp.1251-1258
• /
• 2015

We investigate an image recovery method for sparse-view computed tomography (CT) using an iterative shrinkage algorithm based on a second-order approach. The two-step iterative shrinkage-thresholding (TwIST) algorithm including a total variation regularization technique is elucidated to be more robust than other first-order methods; it enables a perfect restoration of an original image even if given only a few projection views of a parallel-beam geometry. We find that the incoherency of a projection system matrix in CT geometry sufficiently satisfies the exact reconstruction principle even when the matrix itself has a large condition number. Image reconstruction from fan-beam CT can be well carried out, but the retrieval performance is very low when compared to a parallel-beam geometry. This is considered to be due to the matrix complexity of the projection geometry. We also evaluate the image retrieval performance of the TwIST algorithm -sing measured projection data.