• Title/Summary/Keyword: CODEBOOK

Search Result 346, Processing Time 0.022 seconds

An Image coding Scheme Using The Correlation of VQ Indices In Wavelet Domain (웨이브렛 영역에서 VQ 인덱스들의 상관도를 이용한 영상 압축기법)

  • 황재호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.9B
    • /
    • pp.1596-1603
    • /
    • 2000
  • In this paper an image coding scheme using the correlation of neighboring VQ indices in wavelet domain is proposed. The codewords in each sub-codebook are reordered in ascending order according to their energy in order to inmcrease the dependency of the indices. And the relative dresses of the reordered indices are transmitted to a receiver instead of to absolute addresses. LBG algorithm is used for obtaining a multiresolution codebool and PNN using k-d tress used for generating its initial values. Our experimental results show that the proposed coding scheme outperforms JPEG and an ordinary wavelet-VQ method at low-bit rates in terms of PSNR.

  • PDF

A New Three-dimensional Integrated Multi-index Method for CBIR System

  • Zhang, Mingzhu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.3
    • /
    • pp.993-1014
    • /
    • 2021
  • This paper proposes a new image retrieval method called the 3D integrated multi-index to fuse SIFT (Scale Invariant Feature Transform) visual words with other features at the indexing level. The advantage of the 3D integrated multi-index is that it can produce finer subdivisions in the search space. Compared with the inverted indices of medium-sized codebook, the proposed method increases time slightly in preprocessing and querying. Particularly, the SIFT, contour and colour features are fused into the integrated multi-index, and the joint cooperation of complementary features significantly reduces the impact of false positive matches, so that effective image retrieval can be achieved. Extensive experiments on five benchmark datasets show that the 3D integrated multi-index significantly improves the retrieval accuracy. While compared with other methods, it requires an acceptable memory usage and query time. Importantly, we show that the 3D integrated multi-index is well complementary to many prior techniques, which make our method compared favorably with the state-of-the-arts.

An Embedded System Design of Collusion Attack Prevention for Multimedia Content Protection on Ubiquitous Network Environment (유비쿼터스 네트워크 환경의 멀티미디어 콘텐츠 보호를 위한 공모공격 방지 임베디드 시스템 설계)

  • Rhee, Kang-Hyeon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.47 no.1
    • /
    • pp.15-21
    • /
    • 2010
  • This paper proposes the multimedia fingerprinting code insertion algorithm when video content is distributed in P2P environment, and designs the collusion codebook SRP(Small RISC Processor) embedded system for the collusion attack prevention. In the implemented system, it is detecting the fingerprinting code inserted in the video content of the client user in which it requests an upload to the web server and in which if it is certified content then transmitted to the streaming server then the implemented system allowed to distribute in P2P network. On the contrary, if it detects the collusion code, than the implemented system blocks to transmit the video content to the streaming server and discontinues to distribute in P2P network. And also it traces the colluders who generate the collusion code and participates in the collusion attack. The collusion code of the averaging attack is generated with 10% of BIBD code v. Based on the generated collusion code, the codebook is designed. As a result, when the insert quantity of the fingerprinting code is 0.15% upper in bitplane 0~3 of the Y(luminance) element of I-frame at the video compression of ASF for a streaming service and MP4 for an offline offer of video content, the correlation coefficient of the inserted original code and the detected code is above 0.15. At the correlation coefficient is above 0.1 then the detection ratio of the collusion code is 38%, and is above 0.2 then the trace ratio of the colluder is 20%.

Enhanced Wavelet Transform-based CELP Coder with Band Selection and Selective VQ (대역 선택 구조와 선택적 벡터 양자화를 이용한 개선된 웨이브릿 변화형 CELP 보호화기)

  • Chang, Dong-Il;Cho, Young-Kwon;Ann, Sou-Guil
    • The Journal of the Acoustical Society of Korea
    • /
    • v.14 no.1E
    • /
    • pp.46-55
    • /
    • 1995
  • In this paper, we present a new wavelet transform-based CELP coder, called band selection wavelet transform CELP (BS-WTCELP) operated at 4.8 kbps. The proposed algorithm uses a band selection scheme of frequency bands of wavelet transform and selective vector quantization (VQ). The band selection and selective VQ structure is implemented by using a classified VQ structure. The proposed algorithm has about 0.5-1.0 dB improvement in segmental SNR compared with the conventional CELP that uses the random codebook search, while is has significantly reduced computational and storage complexity. Many experimental results have shown that the proposed algorithm is more suitable for most real-applications than the conventional CELP and wavelet transform CELP.

  • PDF

Visual Semantic Based 3D Video Retrieval System Using HDFS

  • Ranjith Kumar, C.;Suguna, S.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.8
    • /
    • pp.3806-3825
    • /
    • 2016
  • This paper brings out a neoteric frame of reference for visual semantic based 3d video search and retrieval applications. Newfangled 3D retrieval application spotlight on shape analysis like object matching, classification and retrieval not only sticking up entirely with video retrieval. In this ambit, we delve into 3D-CBVR (Content Based Video Retrieval) concept for the first time. For this purpose we intent to hitch on BOVW and Mapreduce in 3D framework. Here, we tried to coalesce shape, color and texture for feature extraction. For this purpose, we have used combination of geometric & topological features for shape and 3D co-occurrence matrix for color and texture. After thriving extraction of local descriptors, TB-PCT (Threshold Based- Predictive Clustering Tree) algorithm is used to generate visual codebook. Further, matching is performed using soft weighting scheme with L2 distance function. As a final step, retrieved results are ranked according to the Index value and produce results .In order to handle prodigious amount of data and Efficacious retrieval, we have incorporated HDFS in our Intellection. Using 3D video dataset, we fiture the performance of our proposed system which can pan out that the proposed work gives meticulous result and also reduce the time intricacy.

A Single Feedback Based Interference Alignment for Three-User MIMO Interference Channels with Limited Feedback

  • Chae, Hyukjin;Kim, Kiyeon;Ran, Rong;Kim, Dong Ku
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.4
    • /
    • pp.692-710
    • /
    • 2013
  • Conventional interference alignment (IA) for a MIMO interference channel (IFC) requires global and perfect channel state information at transmitter (CSIT) to achieve the optimal degrees of freedom (DoF), which prohibits practical implementation. In order to alleviate the global CSIT requirement caused by the coupled relation among all of IA equations, we propose an IA scheme with a single feedback link of each receiver in a limited feedback environment for a three-user MIMO IFC. The main feature of the proposed scheme is that one of users takes out a fraction of its maximum number of data streams to decouple IA equations for three-user MIMO IFC, which results in a single link feedback structure at each receiver. While for the conventional IA each receiver has to feed back to all transmitters for transmitting the maximum number of data streams. With the assumption of a random codebook, we analyze the upper bound of the average throughput loss caused by quantized channel knowledge as a function of feedback bits. Analytic results show that the proposed scheme outperforms the conventional IA scheme in term of the feedback overhead and the sum rate as well.

Fast Fractal Image Compression Using DCT Coefficients and Its Applications into Video Steganography (DCT계수를 이용한 고속 프랙탈 압축 기법과 화상 심층암호에의 응용)

  • Lee, Hye-Joo;Park, Ji-Hwan
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.1
    • /
    • pp.11-22
    • /
    • 1997
  • The fractal image compression partitions an original image into blocks of equal size and searches a do-main block having self-similarity. This method of compression achieves high compression ratio because it is unnecessary to transmit the additional codebook to receiver and it provides good quality of reconstructed images. In spite of these advantages, this method has a drawback in which encoding time increase due to a complicated linear transformation for determining a similar-domain block. In this paper, a fast fractal image compression method is proposed by decreasing the number of transformation usings AC(alternating current) coefficients of block. The proposed method also has a good quality as compared with the well-known fractal codings. Furthermore, method also has a good quality as apply the video steganography that can conceal an important secret data.

  • PDF

A Codeword Tying Algorithm in Speech Recognition based on Discrete Hidden Markov Model (이산분포 HMM을 이용한 음성인식에서의 코드워드 Tying 알고리즘)

  • Kim, Do-Yeong;Kim, Nam-Soo;Un, Chong-Kwan
    • The Journal of the Acoustical Society of Korea
    • /
    • v.13 no.3
    • /
    • pp.63-70
    • /
    • 1994
  • In this Paper, we propose a new codeword tying algorithm based on a tree structured classfier. The proposed algorithm which can be viewed as a kind of soft decision using statistical properties between codewords and states has an advantage of fast construction, and guarantees a unique optimal solution. Also, it can easily be applied to any speech recognition system based on discrete hidden Markov model (HMM). Experimental results on speaker-independent isolated word recognition show error reduction of $6\%$ for the codebook of size 256 and $9\%$ for 512 size and also HMM parameter reduction of about $20\%$.

  • PDF

Sum-Rate Improvement Method Using Quasi-Orthogonal Beam Pairs for UCA MIMO Transmission (UCA MIMO 전송 시 준직교적 빔 쌍을 활용한 합 전송률 향상 방안)

  • Yang, Jiyeong;Kim, Huiwon;Sung, Wonjin
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.29 no.1
    • /
    • pp.32-35
    • /
    • 2018
  • Massive multiple-input multiple-output (MIMO) transmission is an essential technique for achieving the high bandwidth efficiency required in 5G mobile communication systems. Various forms of arrays can be used as the number of antenna elements increases for massive MIMO transmission. In this letter, we propose a beamforming algorithm applicable to multiuser MIMO transmission using uniform circular arrays. By employing quasi-orthogonal beam pairs obtained from the inter-beam correlation information, we minimize inter-user interference and evaluate the resulting performance gain.

Image Compression with Edge Directions based on DCT-VQ (DCT-VQ를 기반으로 한 에지의 방향성을 갖는 영상압축)

  • 김진태;김동욱;임한규
    • Journal of Korea Multimedia Society
    • /
    • v.1 no.2
    • /
    • pp.194-203
    • /
    • 1998
  • In this paper, a new DCT-VQ method is proposed which can solve the problems of VQ such as the degradation of edge and enormous calculations. VQ is carried in DCT domain but spatial domain in order to protect the degradation of edge. DCT makes high correlated image data decorrelated and the energy concentrated on a few coefficients. In DCT domain, the DC coefficient is quantized with 8 bits uniform scalar quantizer and the AC coefficients are divided to three regions and coded with vector qiantizer for considering edge components. For the decrease of the calculation and memory, the vectors for three region have small dimension of $1{\times}7$ and use the same codebook. Thus, the proposed method can fully express the edge components by considering AC coefficients in DCT domain and decrease the calculation and memory be reducing the dimension of vectors.

  • PDF