• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.10
• /
• pp.118-128
• /
• 2015

Compressive sensing (CS) has to face with two challenges of computational complexity reconstruction and low coding efficiency. As a solution, this paper presents a novel spatially scalable Kronecker two layer compressive sensing framework which facilitates reconstruction up to three spatial resolutions as well as much improved CS coding performance. We propose a dual-resolution sensing matrix based on the quincunx sampling grid which is applied to the base layer. This sensing matrix can provide a fast-preview of low resolution image at encoder side which is utilized for predictive coding. The enhancement layer is encoded as the residual measurement between the acquired measurement and predicted measurement data. The low resolution reconstruction is obtained from the base layer only while the high resolution image is jointly reconstructed using both two layers. Experimental results validate that the proposed scheme outperforms both conventional single layer and previous multi-resolution schemes especially at high bitrate like 2.0 bpp by 5.75dB and 5.05dB PSNR gain on average, respectively.

• Applied Microscopy
• /
• v.18 no.2
• /
• pp.59-76
• /
• 1988

In order to know the distribution, relative frequencies, types and morphology, endocrine cells in the intestinal tract of the hedgehog(Erinaceus koreanus) were studied by light microscopy, immunohistochemistry and electron microscopy. The results obtained are summarized as follows: 1. Two kinds of endocrine cells were demonstrated with two specific staining methods. Argyrophil cells(reactive cells for Grimelius method) were found most frequently in the intestinal region, and were infrequent in the rectum, whereas argentaffin cells (reactive cells for Masson-Hamperl method) were found most frequently in the rectum and in the other legions were infrequent. These reacting cells were mainly found in the intestinal glands, whereas a small number in the mucosa. 2. Twelve kinds of endocrine cells, gastrin(Gas)-, somatostatin (Som)-, serotonin(5-HT)-, glucagon(Glu)-, bovine pancreatic polypeptide(Bpp)-, cholecystokinin(Cck)-, secretin(Sec)-, motilin(Mot)-, glicentin(Gli)-, gastric inhibitor polypeptide(GIp)-, substance P(Sp)-, and neurotensin(Neu)-immunoreactive cells, were identified by immunohistochemical method. Gas-, Som-, 5-HT-, Glu-, Cck-, Sec-, Mot-, Gli-, Sp-, and Neu-reactive cells were observed in the duodenum, and among these Gas- and 5-HT-reactive cells were moderately found while the others were infrequent. In the jejunoileum Gas-, Som-, 5-HT-, Glu-, Cck-, Mot-, Gli-, GIp-, SP-, and Neu-reactive cells were found, and among these 5-HT- and GIp-reactive cells were moderately found while the others were infrequent. In the colon Sec-reactive cell was not detected. 5-HT-reactive cells were found most frequently and the others were infrequent in this region. 5-HT-, Bpp-, GIi- and Neu-reactive cells were found in the rectum. Among these 5-HT-reactive cells were found most frequently. 3. Electron microscopically, five types of endocrine cells, EC, ECL, D, G, A-like cell, were identified in the intestinal region. EC and ECL cells in the duodenum, EC, D and G cells in the jejuno-ileum, EC and A-like cells in the colon and EC cell in the rectum were observed respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.12
• /
• pp.2313-2327
• /
• 1994

As the communication environment evolves, there is an increasing need for multiresolution image coding. To meet this need, the entrophy constratined vector quantizer(ECVQ) for coding of image pyramids by spline wavelet transform is introduced in this paper. This paper proposes a new scheme for image compression taking into account psychovisual feature both in the space and frequency domains : this proposed method involves two steps. First we use spline wavelet transform in order to obtain a set of biorthogonal subclasses of images ; the original image is decomposed at different scale using a pyramidal algorithm architecture. The decomposition is along the vertical and horizontal directions and maintains constant the number of pixels required the image. Second, according to Shannon's rate distortion theory, the wavelet coefficients are vectored quantized using a multi-resolution ECVQ(entropy-constrained vector quantizer) codebook. The simulation results showed that the proposed method could achieve higher quality LENA image improved by about 2.0 dB than that of the ECVQ using other wavelet at 0.5 bpp and, by about 0.5 dB at 1.0 bpp, and reduce the block effect and the edge degradation.

• The Journal of the Korea Contents Association
• /
• v.12 no.3
• /
• pp.77-83
• /
• 2012

In this paper, a low-complexity embedded compression (EC) Codec algorithm for the wavelet video coder is applied to reduce excessive external memory requirements. The EC algorithm is used to achieve a fixed compression ratio of 50 % under the near-lossless-compression constraint. The EC technique can reduce the 50 % memory requirement for intermediate low-frequency coefficients during multiple discrete wavelet transform stages compared with direct implementation of the wavelet video encoder of this paper. Furthermore, the EC scheme based on a forward adaptive quantization and fixed length coding can save bandwidth and size of buffer between DWT and SPIHT to 50 %. Simulation results show that our EC algorithm present only PSNR degradation of 0.179 and 0.162 dB in average when the target bit-rate of the video coder are 1 and 0.5 bpp, respectively.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.8
• /
• pp.1265-1274
• /
• 1990

A new classified VQ scheme for DCT coefficients(DCT-CVQ) is proposed for still image coding. DCT coefficient matrices are classified into six classes by ac coefficients that well represent edge characteristics and the distribution of ac energy in the DCT domain. To reduce the complexity of, VQ, ac transform coefficients are partitioned into several vectors, and an adaptive method is provided by making different codebook sizes for different classes. Simulation results show that this DCT-CVQ results in good subjective quality at low bit rates, and SNR is increased by about 1.5-4.0 dB in the range 0.2-0.5 bpp, when compared with other DCT-VQ coding schemes.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.7
• /
• pp.70-82
• /
• 1993

In this paper, employing the 3-dimensional discrete cosine transform (DCT) for the utilization of the temporal correlation, an adaptive motion sequence coding technique is proposed. The energy distribution in a 3-D DCT block, due to the nonstationary nature of the image data, varies along the veritical, horizontal and temporal directions. Thus, aiming an adaptive system to local variations, adaptive procedures, such as the 3-D classification, the classified linear scanning technique and the VLC table selection scheme, have been implemented in our approach. Also, a hybrid structure which adaptively combines inter-frame coding is presented, and it is found that the adaptive hybrid frame coding technique shows a significant performance gain for a moving sequence which contains a relatively small moving area. Through an intensive computer simulation, it is demonstrated that, the performance of the proposed 3-D transform coding technique shows a close relation with the temporal variation of the sequence to be code. And the proposed technique has the advantages of skipping the computationally complex motion compensation procedure and improving the performance over the 2-D motion compensated transform coding technique for rates in the range of 0.5 ~ 1.0 bpp.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.9
• /
• pp.3298-3321
• /
• 2021

A lot of data hiding schemes have been proposed to embed secret data in the plain cover images or compressed images of various formats, including JPEG, AMBTC, VQ, etc. In this paper, we propose a production process of mosaic images based on three regular images of coffee beans. A primary image is first mimicked by the process to produce a mosaic cover image. A two-layer steganography is applied to hide secret data in the mosaic image. Based on the low visual quality of the mosaic cover image, its PSNR value can be improved about 1.5 dB after embedding 3 bpp. This is achieved by leveraging the newly proposed polarized search mask and the concepts of strong embedding and weak embedding. Applying steganography to the mosaic cover images is a completely new idea and it is promising.

• The KIPS Transactions:PartB
• /
• v.16B no.5
• /
• pp.403-410
• /
• 2009

The two-dimensional bin packing problem(2D-BPP) has been known to be NP-hard, and it is difficult to solve the problem exactly. Many approximation methods, such as genetic algorithm, simulated annealing and tabu search etc, have been also proposed to gain better solutions. However, the existing approximation algorithms, such as branch-and-bound and tabu search, have shown the low efficiency and the long execution time due to a large of iterations. To solve these problems, we first define the fitness function to simplify and increase the utility of algorithm. The function decides whether an item is packed into a given area, and as an important information for a packing strategy, the number of subarea that can accommodate a given item is obtained from the variant of the fitness function. Then we present a heuristic algorithm BF for 2D bin packing, constructed by the fitness function and subarea. Finally, the effectiveness of the proposed algorithm will be expressed by the comparison experiments with the heuristic and the metaheuristic of the literatures. As comparing with existing heuristic algorithms and metaheuristic algorithms, it has been found that the packing rate of algorithm BP is the same as 97% as existing heuristic algorithms, FFF and FBS, or better than them. Also, it has been shown the same as 86% as tabu search algorithm or better.