Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where C.-C. Jay Kuo is active.

Publication


Featured researches published by C.-C. Jay Kuo.


Journal of Visual Communication and Image Representation | 2011

Perceptual visual quality metrics: A survey

Weisi Lin; C.-C. Jay Kuo

Visual quality evaluation has numerous uses in practice, and also plays a central role in shaping many visual processing algorithms and systems, as well as their implementation, optimization and testing. In this paper, we give a systematic, comprehensive and up-to-date review of perceptual visual quality metrics (PVQMs) to predict picture quality according to human perception. Several frequently used computational modules (building blocks of PVQMs) are discussed. These include signal decomposition, just-noticeable distortion, visual attention, and common feature and artifact detection. Afterwards, different types of existing PVQMs are presented, and further discussion is given toward feature pooling, viewing condition, computer-generated signal and visual attention. Six often-used image metrics(namely SSIM, VSNR, IFC, VIF, MSVD and PSNR) are also compared with seven public image databases (totally 3832 test images). We highlight the most significant research work for each topic and provide the links to the extensive relevant literature.


IEEE Signal Processing Letters | 1994

A new initialization technique for generalized Lloyd iteration

Ioannis Katsavounidis; C.-C. Jay Kuo; Zhen Zhang

The generalized Lloyd algorithm plays an important role in the design of vector quantizers (VQ) and in feature clustering for pattern recognition. In the VQ context, this algorithm provides a procedure to iteratively improve a codebook and results in a local minimum that minimizes the average distortion function. We propose an efficient method to obtain a good initial codebook that can accelerate the convergence of the generalized Lloyd algorithm and achieve a better local minimum as well.<<ETX>>


Journal of Visual Communication and Image Representation | 2005

Technologies for 3D mesh compression: A survey

Jingliang Peng; Chang Su Kim; C.-C. Jay Kuo

Three-dimensional (3D) meshes have been widely used in graphic applications for the representation of 3D objects. They often require a huge amount of data for storage and/or transmission in the raw data format. Since most applications demand compact storage, fast transmission, and efficient processing of 3D meshes, many algorithms have been proposed to compress 3D meshes efficiently since early 1990s. In this survey paper, we examine 3D mesh compression technologies developed over the last decade, with the main focus on triangular mesh compression technologies. In this effort, we classify various algorithms into classes, describe main ideas behind each class, and compare the advantages and shortcomings of the algorithms in each class. Finally, we address some trends in the 3D mesh compression technology development.


Signal Processing-image Communication | 2015

Image database TID2013

Nikolay N. Ponomarenko; Lina Jin; Oleg Ieremeiev; Vladimir V. Lukin; Karen O. Egiazarian; Jaakko Astola; Benoit Vozel; Kacem Chehdi; Marco Carli; Federica Battisti; C.-C. Jay Kuo

This paper describes a recently created image database, TID2013, intended for evaluation of full-reference visual quality assessment metrics. With respect to TID2008, the new database contains a larger number (3000) of test images obtained from 25 reference images, 24 types of distortions for each reference image, and 5 levels for each type of distortion. Motivations for introducing 7 new types of distortions and one additional level of distortions are given; examples of distorted images are presented. Mean opinion scores (MOS) for the new database have been collected by performing 985 subjective experiments with volunteers (observers) from five countries (Finland, France, Italy, Ukraine, and USA). The availability of MOS allows the use of the designed database as a fundamental tool for assessing the effectiveness of visual quality. Furthermore, existing visual quality metrics have been tested with the proposed database and the collected results have been analyzed using rank order correlation coefficients between MOS and considered metrics. These correlation indices have been obtained both considering the full set of distorted images and specific image subsets, for highlighting advantages and drawbacks of existing, state of the art, quality metrics. Approaches to thorough performance analysis for a given metric are presented to detect practical situations or distortion types for which this metric is not adequate enough to human perception. The created image database and the collected MOS values are freely available for downloading and utilization for scientific purposes. We have created a new large database.This database contains larger number of distorted images and distortion types.MOS values for all images are obtained and provided.Analysis of correlation between MOS and a wide set of existing metrics is carried out.Methodology for determining drawbacks of existing visual quality metrics is described.


acm multimedia | 2000

Rule-based video classification system for basketball video indexing

Wensheng Zhou; Asha Vellaikal; C.-C. Jay Kuo

Current information and communication technologies provide the infrastructure to send bits anywhere, but do not presume to handle information at the semantic level. This paper investigates the use of video content analysis and feature extraction and clustering techniques for further video semantic classifications and a supervised rule based video classification system is proposed. This system can be applied to the applications such as on-line video indexing, filtering and video summaries, etc. As an experiment, basketball video structure will be examined and categorized into different classes according to distinct visual and motional characteristics features by rule-based classifier. The semantics classes, the visual/motional feature descriptors and their statistical relationship are then studied in detail and experiment results based on basketball video will be provided and analyzed.


Optics Express | 1998

Wavelet-based digital image watermarking.

Houng-Jyh Mike Wang; Po-Chyi Su; C.-C. Jay Kuo

A wavelet-based watermark casting scheme and a blind watermark retrieval technique are investigated in this research. An adaptive watermark casting method is developed to first determine significant wavelet subbands and then select a couple of significant wavelet coefficients in these subbands to embed watermarks. A blind watermark retrieval technique that can detect the embedded watermark without the help from the original image is proposed. Experimental results show that the embedded watermark is robust against various signal processing and compression attacks.


mobile ad hoc networking and computing | 2005

TCP over multihop 802.11 networks: issues and performance enhancement

Kitae Nahm; Ahmed Helmy; C.-C. Jay Kuo

Analyzing TCP operation over 802.11 multihop ad hoc networks involves a cross-layer study. In this work, we investigate the effect of congestion and MAC contention on the interaction between TCP and on-demand ad hoc routing protocol in the 802.11 ad hoc networks. Our study reveals several problems stemming from lack of coordination and sharing in such networks. It is observed that TCP induces the over-reaction of routing protocol and hurts the quality of end-to-end connection. So, one of the critical sources of lowering TCP throughput lies in the TCP window mechanism itself. To fix this problem, we propose a fractional window increment (FeW) scheme for TCP to prevent the over-reaction of the on-demand routing protocol by limiting TCPs aggressiveness. The proposed scheme is applicable to a wide range of transport protocols using the basic TCP mechanism, and the protocol behavior is analytically tractable. Our simulation results demonstrate that the proposed scheme can dramatically improve TCP performance and network stability in a variety of 802.11 multihop networks. For example, in some chain-like topologies, the proposed scheme outperforms basic TCP by over 90%, and recent related variants of TCP (ADTCP, LRED) by over 70%.


international conference on computer graphics and interactive techniques | 2005

Geometry-guided progressive lossless 3D mesh coding with octree (OT) decomposition

Jingliang Peng; C.-C. Jay Kuo

A new progressive lossless 3D triangular mesh encoder is proposed in this work, which can encode any 3D triangular mesh with an arbitrary topological structure. Given a mesh, the quantized 3D vertices are first partitioned into an octree (OT) structure, which is then traversed from the root and gradually to the leaves. During the traversal, each 3D cell in the tree front is subdivided into eight childcells. For each cell subdivision, both local geometry and connectivity changes are encoded, where the connectivity coding is guided by the geometry coding. Furthermore, prioritized cell subdivision is performed in the tree front to provide better rate-distortion (RD) performance. Experiments show that the proposed mesh coder outperforms the kd-tree algorithm in both geometry and connectivity coding efficiency. For the geometry coding part, the range of improvement is typically around 10%~20%, but may go up to 50%~60% for meshes with highly regular geometry data and/or tight clustering of vertices.


Proceedings of SPIE | 2001

Efficient multimedia encryption via entropy codec design

Chung-Ping Wu; C.-C. Jay Kuo

Efficient encryption algorithms are essential to multimedia data security, since the data size is large and real-time processing is often required. After discussing limitations of previous work on multimedia encryption, we propose a novel methodology for confidentiality, which turns entropy coders into encryption ciphers by using multiple statistical models. The choice of statistical models and the order in which they are applied are kept secret as the key Two encryption schemes are constructed by applying this methodology to the Huffman coder and the QM coder. It is shown that security is achieved without sacrificing the compression performance and the computational speed. The schemes can be applied to most modern compression systems such as MPEG audio, MPEG video and JPEG/JPEG2000 image compression.


Storage and Retrieval for Image and Video Databases | 1996

Color distribution analysis and quantization for image retrieval

Xia Wan; C.-C. Jay Kuo

Color space selection and quantization are critical to content-based image retrieval based on color histograms. In this work, we first examine the color distribution in different color spaces including RGB, HSV, YUV and Munsell spaces and discuss the appropriate quantization strategies in these color spaces based on the distribution of colors. Then, we propose a color quantization scheme which applies the Lloyd-Max quantizer along each axis independently. The proposed scheme is simple yet efficient. Retrieval using the proposed quantization scheme on different color spaces are compared through experiments.

Collaboration


Dive into the C.-C. Jay Kuo's collaboration.

Top Co-Authors

Avatar

JongWon Kim

Gwangju Institute of Science and Technology

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Y.-W. Peter Hong

National Tsing Hua University

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Weisi Lin

Nanyang Technological University

View shared research outputs
Top Co-Authors

Avatar

Shang-Ho Tsai

National Chiao Tung University

View shared research outputs
Top Co-Authors

Avatar

Chen Chen

University of Southern California

View shared research outputs
Top Co-Authors

Avatar

Shrikanth Narayanan

University of Southern California

View shared research outputs
Top Co-Authors

Avatar

Lei Huang

University of Southern California

View shared research outputs
Researchain Logo
Decentralizing Knowledge