|
Project List
| Authors |
Topic |
Contact |
Presentation |
Report |
Mina Makar, Sam Tsai |
Direction-Adaptive Partitioned Block Transform for Color Image Coding
|
Chuo-Ling |
|
|
Ivan Janatra, June Zhang |
Compression of Image-Based Features |
Vijay, Gabe, David C |
|
|
Damien Cerbelaud, Chris Tsai
|
Effects of Image Compression on Quality of Extracted Features |
David C, Vijay, Gabe |
|
|
Zhi Li |
Distortion-Aware Retransmission of Video Packets and Error
Concealment using Thumbnail
|
Yao-Chung, Xiaoqing, David V |
|
|
Scott Cottier, Atanas Petkov |
Image Quality Estimation for JPEG-Compressed Images without the
Original Image
|
David V, Keiichi |
|
|
Ashutosh Garg, Ayichew Hailu, Srinivasa Rangan |
Image Forgery Identification using JPEG Intrinsic Fingerprints
|
David V, Min |
|
|
Course Project Topics
Each group should either select two of the project topics (as 1st and
2nd choices) listed below OR submit their own topic and proposal by
February 7. Please send a single email informing the TA of the
members of your group and your project selections.
Groups usually consist of 3 students. We might combine groups of
2 students and individuals interested in the same topic at our
discretion. Groups with more than 3 students are not encouraged.
Please address your questions pertaining to specific topics to the indicated contacts, who are members of the Image, Video and Multimedia Systems Group. You may contact them for advice before and after making your selections. They may provide you with further references and code. Most papers are available at the IEEE Xplore web site, CiteSeer or Google Scholar.
IMAGE COMPRESSION |
| |
|
| Topic 1 |
Direction-Adaptive Partitioned Block Transform for Color Image Coding |
| Contact |
Chuo-Ling Chang |
| Proposal |
The direction-adaptive partitioned block transform (DA-PBT) recently
proposed in [1] for image coding has been shown to significantly
outperform other block-transform-based coding methods by exploiting
directionality in images, especially around image features such as edges
and lines. In [1], DA-PBT is applied to monochrome images. In this
project, we consider coding of color images. To compress color images
effectively, the students are encouraged to investigate the coding
performance of different color representations and different
rate-allocation schemes [2]. More importantly, for the DA-PBT, an
efficient direction representation across the color components also
needs to be studied.
|
| References |
[1] C.-L. Chang and B. Girod, "Direction-Adaptive Partitioned Block Transform for Image Coding," submitted to IEEE International Conference on Image Processing 2008 (ask the contact above)
[2] D. S. Taubman and M. W. Marcellin, "JPEG2000: Image Compression
Fundamentals, Standards and Practice", Kluwer Academic Publishers, 2002 |
| |
|
| Topic 2 |
Post-Filtering for Image Coding with Direction-Adaptive Partitioned Block Transform |
| Contact |
Yao-Chung Lin and Chuo-Ling Chang |
| Proposal |
Post-filtering of a reconstructed image/video can reduce the coding
artifacts and yield better subjective and objective qualities. For
instance, H.264/AVC [1] applies a deblocking filter to address the
blocking artifacts introduced by quantization of transform
coefficients. For each block, a filter with suitable strength is
selected according to the difference between pixels near the block
boundary, and applied to those pixels. Since only the pixels in block
boundaries are affected, blockiness is reduced, while most edges in
the content are preserved.
In this project, you will design a post-filtering scheme for the
recently proposed direction-adaptive partitioned block
transform (DA-PBT) for images [2]. The DA-PBT exploits directionality in images
to improve the coding performance with non-rectangular partitions and
directional transforms. Therefore, unexplored coding artifacts
due to the novel partitioning scheme may be introduced. You will investigate potential post-filtering schemes to reduce the artifacts with or
without side information, such as the block modes and directions
chosen in the DA-PBT, and statistical
information between the original and the reconstructed images. |
| References |
[1] ITU-T Rec. H.264 & ISO/IEC 14496-10 AVC: "Advanced Video Coding for Generic Audiovisual Services", 2003.
[2] C.-L. Chang and B. Girod, "Direction-Adaptive Partitioned Block
Transform for Image Coding," submitted to IEEE International
Conference on Image Processing 2008 (ask the contacts above) |
| |
|
| Topic 3 |
Compressing the Laplacian Pyramid
|
| Contact |
Aditya Mavlankar and Markus Flierl |
| Proposal |
The Laplacian Pyramid (LP) [1] is a popular method for multiscale
representation of images. As the conventional LP representation uses
more samples than the input image, the LP is called overcomplete.
This results in lower compression efficiency when compared to
critically sampled representations, for example wavelet representations.
Recently, critical representations of the LP with biorthogonal
decimation and interpolation filters have been proposed [2,3].
These representations are based on singular value decompositions
(SVD) or QR factorizations of the operator that calculates the detail
signal of the LP.
For compression applications, the coefficients obtained through SVD or
QR factorization have to be efficiently entropy-coded. The goal of
this project is to develop entropy coding schemes for efficient
critical representation of the detail signal of the LP. Alternatively,
other transforms for critical representation of the detail signal and
their corresponding entropy coding schemes can be explored.
|
| References |
[1] P. J. Burt and E. H. Adelson, "The Laplacian Pyramid as a compact image code," IEEE Transactions on Communications, vol. COM-31, pp. 532–540, Apr. 1983.
[2] G. Rath and C. Guillemot, "Compressing the Laplacian Pyramid,"
in Proc. IEEE MMSP, Victoria, Canada, Oct. 2006.
[3] G. Rath and C. Guillemot, "An SVD Based transform for Critical
Representation of Laplacian Pyramids," in Proc. IEEE ICIP,
Atlanta, GA, Oct. 2006. |
| |
|
COMPRESSED IMAGE QUALITY |
| |
|
| Topic 4 |
Image Quality Estimation for JPEG-Compressed Images without the Original Image |
| Contact |
David Varodayan and Keiichi Chono (kchono@) |
| Proposal |
Reconstructed image quality is frequently measured as peak signal-to-noise ratio (PSNR), a function of both the reconstructed and original images. But the original is not always available; for example, at the receiver of a compressed and transmitted image.
In this project, you will develop algorithms for the estimation of the PSNR of a JPEG-compressed image without reference to the original, under various conditions. In the basic scenario, you will assume that the estimator has access to the JPEG bitstream, which includes the quantization matrix. The problem is more challenging if the estimator only knows the reconstructed image, the quantization information having been lost. A further twist would allow for the original image to be compressed, reconstructed and compressed again at a different quality. Further variations are possible: how can you improve the estimator if it additionally has access to a thumbnail version (uncompressed or compressed) of the original image?
One paper (of many) that discusses statistical analysis of discrete cosine transform (DCT) coefficients for PSNR estimation is [1]. The methods in [2] may be useful for recovering lost quantization information. |
| References |
[1] D.S. Turaga, C. Yingwei and J. Caviedes, “No reference PSNR estimation for compressed pictures,” Proc. IEEE International Conference on Image Processing, vol.3, pp. 61-64, June 2002.
[2] J. Lukas and J. Fridrich. “Estimation of primary quantization matrix in double compressed JPEG images,” in Proceedings of DFRWS, Cleveland, OH, 2003. |
| |
|
COMPRESSION FOR IMAGE RETRIEVAL |
| |
|
| Topic 5 |
Compression of Image-Based Features |
| Contact |
Vijay Chandrasekhar (vijayc@) and Gabriel Takacs (gtakacs@) |
| Proposal |
Image-based features [1,2] are now commonly used to perform matching between objects in a query image and objects in database images. In [3], features are applied in a real-time cell-phone-based mobile augmented reality (MAR) system to recognize buildings. Some preliminary work was also done in [3] to compress the features that are transmitted from the database to the cell phone.
For this project, students should investigate lossy feature compression techniques. Lossy compression techniques should exploit correlations between the different dimensions of feature vectors. A rate-distortion-optimized Lagrangian framework should be developed for compressing the features. Initially, mean-squared error (MSE) can be used as the distortion metric. Other distortion metrics like the L1 norm and Mahanalobis distance should also be considered. Additionally, the impact of compression on the classification rate should be studied.
Feature data sets and feature matching software will be provided at the onset of the project.
|
| References |
[1] Lowe, D. G., “Distinctive Image Features from Scale-Invariant Keypoints”, International Journal of Computer Vision, 60, 2, pp. 91-110, 2004.
[2] H. Bay, T. Tuytelaars, and L. V. Gool, “SURF: Speeded Up Robust Features”, in Proc. ECCV, 2006, pp. 404-417.
[3] G. Takacs, V. Chandrasekhar, N. Gelfand, Y. Xiong, W.-C. Chen, T. Bismpigiannis, R. Grzeszczuk, K. Pulli, and B. Girod, “Outdoors Augmented Reality on Mobile Phone using Loxel-Based Visual Feature Organization,” submitted to IEEE Trans. Pattern Analysis and Machine Intelligence, available online at: http://mars0.stanford.edu/wiki/index.php/Main_Page.
|
| |
|
| Topic 6 |
Effects of Image Compression on Quality of Extracted Features
|
| Contact |
David Chen and Vijay Chandrasekhar (vijayc@) |
| Proposal |
Image-based features [1,2] are now commonly used to perform matching between objects in a query image and objects in database images. For example, cameraphones can use features to identify buildings for mobile augmented reality or to recognize CD covers for music sampling. The ability to accurately extract useful features from an image depends on the quality of the image. It would be interesting to study how degradations in image quality (e.g. as a result of compression) relate to degradations in feature quality.
For this project, students should extract features from (i) uncompressed images and (ii) JPEG-compressed [3] images, and explore how feature quality is affected by JPEG compression. Feature quality is evaluated in terms of the image matching accuracy achievable with the (possibly degraded) features. How does changing the JPEG coding parameters, such as the quantization matrix, affect feature quality? How do JPEG compression artifacts affect feature quality? It is desirable to optimize the JPEG coding parameters to aid feature extraction, as opposed to the original goal of optimizing coding parameters for perceptual image viewing. Since images stored on digital cameras are JPEG-compressed, this project can lead to a new set of JPEG settings that are appropriate for feature extraction rather than typical image viewing.
Feature data sets (e.g. for buildings or for CD covers), feature extraction software, and feature matching software will be provided at the onset of the project.
|
| References |
[1] Lowe, D. G., “Distinctive Image Features from Scale-Invariant Keypoints”, International Journal of Computer Vision, vol. 60, no. 2, pp. 91-110, 2004.
[2] H. Bay, T. Tuytelaars, and L. V. Gool, “SURF: Speeded Up Robust Features”, in Proc. Ninth European Conference on Computer Vision, pp. 404-417, 2006.
[3] ITU-T and ISO/IEC JTC1, “Digital Compression and coding of continuous-tone still images”, ISO/IEC 10918-1, ITU-T Recommendation T.81 (JPEG), Sept. 1992.
|
| |
|
COMPRESSED IMAGE FORENSICS |
| |
|
| Topic 7 |
Image Forgery Identification using JPEG Intrinsic Fingerprints |
| Contact |
David Varodayan |
| Proposal |
A consumer digital camera usually stores a captured image in JPEG format. The compression operation leaves a tell-tale marking (called an intrinsic fingerprint) in the reconstructed image. If the image is subjected to further image editing or forgery (color-balancing, cropping, resizing, blurring, sharpening, rotation, reflection or insertion of other content, to name just a few), the fingerprint is modified in different ways.
In this project, you will develop algorithms that only observe the edited image in order to distinguish between different types of image forgery and to determine the parameters of the forgery method (such as the scaling factor of a resize operation). The task is more challenging if the image is observed after another round of JPEG compression, as would be typical.
A general framework for forgery detection with intrinsic fingerprints is described in [1]. The references in [1] may also useful; for example, [2] discusses a histogram-matching method to discover the original quantization matrix in twice JPEG-compressed images.
|
| References |
[1] Ashwin Swaminathan, Min Wu, and K. J. Ray Liu, “Forensic Analysis via Intrinsic Fingerprints,” IEEE Transactions on Information Forensics and Security, vol. 3, no. 1, March 2008 (ask the contact above).
[2] J. Lukas and J. Fridrich. “Estimation of primary quantization matrix in double compressed JPEG images,” in Proceedings of DFRWS, Cleveland, OH, 2003.
|
|