{"title":"Enhanced Motion Compensation Using Elastic Image Registration","authors":"M. Pickering, M. Frater, J. Arnold","doi":"10.1109/ICIP.2006.312738","DOIUrl":"https://doi.org/10.1109/ICIP.2006.312738","url":null,"abstract":"In this paper we propose a method for extending the standard motion estimation algorithms used in video compression algorithms, to incorporate motion parameters that describe non-translational motion. This method uses an elastic image registration algorithm with two-dimensional discrete cosine basis functions to estimate the motion between block partitions in two video frames. A rate and a distortion are then determined for the elastic motion compensation and these are included in the mode decision calculations of the encoder algorithm. This allows the encoder to trade off bits to describe a more complex motion with bits to describe a larger residual error from a simpler translational motion model. Experimental results show an improvement in compression efficiency of 10-20% can be obtained with this enhanced motion compensation algorithm.","PeriodicalId":299355,"journal":{"name":"2006 International Conference on Image Processing","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122663859","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Wavelet Principal Component Analysis and its Application to Hyperspectral Images","authors":"M. Gupta, Nathaniel P. Jacobson","doi":"10.1109/ICIP.2006.312611","DOIUrl":"https://doi.org/10.1109/ICIP.2006.312611","url":null,"abstract":"We investigate reducing the dimensionality of image sets by using principal component analysis on wavelet coefficients to maximize edge energy in the reduced dimension images. Large image sets, such as those produced with hyperspectral imaging, are often projected into a lower dimensionality space for image processing tasks. Spatial information is important for certain classification and detection tasks, but popular dimensionality reduction techniques do not take spatial information into account. Dimensionality reduction using principal components analysis on wavelet coefficients is investigated. Equivalences and differences to conventional principal components analysis are shown, and an efficient workflow is given. Experiments on AVIRIS images show that the wavelet energy in any given subband of the reduced dimensionality images can be increased with this method.","PeriodicalId":299355,"journal":{"name":"2006 International Conference on Image Processing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122964137","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Public Key Watermarking for Reversible Image Authentication","authors":"Sang-Kwang Lee, Young-Ho Suh, Yo-Sung Ho","doi":"10.1109/ICIP.2006.312690","DOIUrl":"https://doi.org/10.1109/ICIP.2006.312690","url":null,"abstract":"In this paper, we propose a new public key watermarking scheme for reversible image authentication where if the image is authentic, the distortion due to embedding can be completely removed from the watermarked image after the hidden data has been extracted. This technique utilizes histogram characteristics of the difference image and modifies pixel values slightly to embed more data than other lossless data hiding algorithm. We show that the lower bound of the PSNR (peak-signal-to-noise-ratio) values of watermarked images are 51.14 dB. Moreover, the proposed scheme is quite simple and the execution time is rather short. Experimental results demonstrate that the proposed scheme can detect any modifications of the watermarked image.","PeriodicalId":299355,"journal":{"name":"2006 International Conference on Image Processing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114048106","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Adaptive Block-Size Transform Based on Extended Integer 8×8/4×4 Transforms for H.264/AVC","authors":"H. Qi, Wen Gao, Siwei Ma, Debin Zhao","doi":"10.1109/ICIP.2006.312582","DOIUrl":"https://doi.org/10.1109/ICIP.2006.312582","url":null,"abstract":"In this paper, a low-complexity adaptive block-size transform (ABT) scheme is proposed for the H.264/AVC. The integer 8x8/4x4 discrete cosine transforms with an extended relation are applied to the proposed ABT scheme for reducing the implementation complexities. In the proposed scheme, the 8x8/4x4 transforms can be merged together and share the same scale matrix. As a result, the transform units and storage resources can be effectively saved in both encoder and decoder. The 8x8 transform extended from the 4x4 transform of H.264/AVC can be easily implemented with several simple arithmetic operators, and its intermediate results can be strictly limited within 16-bit. The experimental results show that the proposed ABT scheme based on extended transforms achieves a similar coding performance to the original ABT scheme for H.264/AVC.","PeriodicalId":299355,"journal":{"name":"2006 International Conference on Image Processing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114101893","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Matthew Gaubatz, Stephanie Kwan, Bobbie Chern, D. Chandler, S. Hemami
{"title":"Spatially-Adaptivewavelet Image Compression via Structural Masking","authors":"Matthew Gaubatz, Stephanie Kwan, Bobbie Chern, D. Chandler, S. Hemami","doi":"10.1109/ICIP.2006.313107","DOIUrl":"https://doi.org/10.1109/ICIP.2006.313107","url":null,"abstract":"Wavelet-based spatial quantization is a technique to compress image data that adapts the compression to the data in each region of an image. This approach is motivated because quantization with a single step-size does not result in a uniform visual effect across each spatial location; different types of image content mask quantization errors in different ways. While many spatial quantization techniques determine step-sizes via local activity measures, the proposed method induces local quantization distortion based on experiments that quantify human detection of this distortion as function of both the contrast and the type of the image data. Three types in particular, textures, structures and edges, are considered. A classifier is utilized to detect to which of these three categories a local region of image data belongs, and step-sizes are then derived based on the contrast and class of each region. Class and contrast data are conveyed to the coder with explicit side information. For images compressed at threshold, the proposed method requires 3-10 % less rate than a similar previous approach without classification, and on average produces images that are preferred by 2/3 of tested viewers.","PeriodicalId":299355,"journal":{"name":"2006 International Conference on Image Processing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122073487","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Robust Motion-Based Segmentation in Video Sequences using Entropy Estimator","authors":"A. Herbulot, S. Boltz, E. Debreuve, M. Barlaud","doi":"10.1109/ICIP.2006.312841","DOIUrl":"https://doi.org/10.1109/ICIP.2006.312841","url":null,"abstract":"This paper deals with motion estimation and segmentation in video sequences. Some methods of motion computation between two consecutive frames of a video sequence are based on the minimization of the square error of the prediction error. More robust estimators such as absolute value or M-estimators were proposed but these estimators loose their efficiency when the data do not have parametric distributions. We relax the parametric assumption on the prediction error distribution and propose to use a nonparametric estimator for the motion estimation : the entropy of the prediction error. We use the same criterion to perform a spatio-temporal segmentation of the sequence using an active contour algorithm. Segmentation and tracking tests on a textured synthetic and a real sequence, compared to a standard method in motion segmentation, tends to show that our method is more stable and accurate.","PeriodicalId":299355,"journal":{"name":"2006 International Conference on Image Processing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122162003","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Segmenting Multiple Familiar Objects Under Mutual Occlusion","authors":"Qilong Zhang, Robert Pless","doi":"10.1109/ICIP.2006.312454","DOIUrl":"https://doi.org/10.1109/ICIP.2006.312454","url":null,"abstract":"We address the problem of segmenting multiple similar objects by optimizing a Chan-Vese-like functional with respect to a mixture of level set functions. We solve the variational formulation under this model allowing for similarity transforms. This allows shape priors to be enforced even in the presence of mutual occlusion, lifting the limitation. We show numerical results on example images to demonstrate the promise of our approach.","PeriodicalId":299355,"journal":{"name":"2006 International Conference on Image Processing","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117280833","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Rate-Distortion Optimization in Dynamic Mesh Compression","authors":"K. Müller, A. Smolic, M. Kautzner, T. Wiegand","doi":"10.1109/ICIP.2006.312394","DOIUrl":"https://doi.org/10.1109/ICIP.2006.312394","url":null,"abstract":"Recent developments in the compression of dynamic meshes or mesh sequences have shown that the statistical dependencies within a mesh sequence can be exploited well by predictive coding approaches. Coders introduced so far use experimentally determined or heuristic thresholds for tuning the algorithms. In video coding rate-distortion (RD) optimization is often used to avoid fixing of thresholds and to select a coding mode. We applied these ideas and present here an RD-optimized mesh coder. It includes different prediction modes as well as an RD cost computation that controls the mode selection across all possible spatial partitions of a mesh to find the clustering structure together with the associated prediction modes. The structure of the RD-optimized D3DMC coder is presented, followed by comparative results with mesh sequences at different resolutions.","PeriodicalId":299355,"journal":{"name":"2006 International Conference on Image Processing","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117317138","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Color Image Segmentation Using Watersheds and Joint Homogeneity-Edge Integrity Region Merging Criteria","authors":"Yu Yuan, K. Barner","doi":"10.1109/ICIP.2006.312752","DOIUrl":"https://doi.org/10.1109/ICIP.2006.312752","url":null,"abstract":"Watershed algorithms were originally developed as gray-level dedicated transformations. However, well known scalar watershed algorithms can be easily adapted to include multispectral information, producing color segmentations in agreement with the human perception. The multispectral watershed algorithm introduced in this paper includes the use of a vector gradient for calculating the gradient magnitude image (GMI) and the choice of a uniform color space, such as the L*a*6*, for adapting the dissimilarity measures utilized in the merging stage. Experimental results are presented showing the advantages of the proposed adaptation method as well as advantages of combined homogeneity-edge integrity region merging criterion.","PeriodicalId":299355,"journal":{"name":"2006 International Conference on Image Processing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129525362","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Y. Shkvarko, J. L. Montiel, I. Villalón-Turrubiates
{"title":"Unifying the Experiment Design and Constrained Regularization Paradigms for Reconstructive Imaging with Remote Sensing Data","authors":"Y. Shkvarko, J. L. Montiel, I. Villalón-Turrubiates","doi":"10.1109/ICIP.2006.312914","DOIUrl":"https://doi.org/10.1109/ICIP.2006.312914","url":null,"abstract":"In this paper, the problem of estimating from a finite set of measurements of the radar remotely sensed complex data signals, the power spatial spectrum pattern (SSP) of the wavefield sources distributed in the environment is cast in the framework of Bayesian minimum risk (MR) paradigm unified with the experiment design (ED) regularization technique. The fused MR-ED regularization of the ill-posed nonlinear inverse problem of the SSP reconstruction is performed via incorporating into the MR estimation strategy the projection-regularization ED constraints. The simulation examples are incorporated to illustrate the efficiency of the proposed unified MR-ED technique.","PeriodicalId":299355,"journal":{"name":"2006 International Conference on Image Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128780635","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}