{"title":"Wavelet image coding by dilation-run algorithm","authors":"Wu Zheng, He Mingyi","doi":"10.1109/ICIP.2004.1421785","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1421785","url":null,"abstract":"This paper presents a novel wavelet image coder, dilation-run algorithm, which provides an embedded coder based on bit-plane coding technique. At each bit-plane, morphological dilation is used to extract and encode the clustering significant wavelet coefficients, and a run-length coding method is used to encode the positional information of each cluster. The experiment results show that our coder outperforms the zerotree coder SPIHT and is competitive with the morphology coders MRWD and SLCCA. For wavelet images with strong clustering feature, the new coder outperforms both the morphology coders above.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116285578","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":"High-dimensional mutual information estimation for image registration","authors":"J. Kybic","doi":"10.1109/ICIP.2004.1421419","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1421419","url":null,"abstract":"We present a new algorithm for mutual information estimation for image registration based on the nearest neighbor entropy estimator of Kozachenko and Leonenko. We modify the algorithm to be numerically robust and computationally efficient, with optimal asymptotic complexity O(N/sub pixels/d/sub dim/). We propose two MI-based criteria exploiting the high-dimensionality of the feature space and show their effectiveness in determining the correct alignment even in difficult cases when classical criteria fail.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116492472","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":"Image coding with iterated contourlet and wavelet transforms","authors":"Vivien Chappelier, C. Guillemot, S. Marinkovic","doi":"10.1109/ICIP.2004.1421783","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1421783","url":null,"abstract":"This paper presents a new coding technique based on a mixed contourlet and wavelet transform. The redundancy of the transform is controlled by using the contourlet at fine scales and by switching to a separable wavelet transform at coarse scales. The transform is then optimized through an iterative projection process in the transform domain in order to minimize the quantization error in the image domain. A gain of respectively up to 0.5 dB and to 1 dB over respectively contourlet and wavelet based coding has been observed for images with directional features.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121585085","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":"Evolutionary agents for epipolar geometry estimation","authors":"M. Hu, G. Dodds, Baozong Yuan","doi":"10.1109/ICIP.2004.1421435","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1421435","url":null,"abstract":"This paper presents an evolutionary agent-based approach to epipolar geometry estimation. Each agent stands for a minimum subset for computing fundamental matrix, and evolves autonomously in the vast solution space to get the optimal result. In so doing, the agents rely on some reactive behaviors such as reproduction and diffusion, and collaborate with others with a subset template. Experimental results show that our approach performs better than other typical methods in terms of accuracy and computational efficiency, and is robust to noise and outliers.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"214 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121639449","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":"A partial differential equation approach to image zoom","authors":"Abdelmounim Belahmidi, F. Guichard","doi":"10.1109/ICIP.2004.1418838","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1418838","url":null,"abstract":"We propose a new model for zooming digital images. This model, driven by a partial differential equation, performs a balance between a linear zoom on homogenous zones and an anisotropic diffusion based. zoom near edges. This allows the advantages of linear zoom models and of some nonlinear ones to be combined while leaving out their drawbacks.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121649476","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":"A new algorithm for collusion resistant video watermarking","authors":"P. Vinod, P. Bora","doi":"10.1109/ICIP.2004.1421369","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1421369","url":null,"abstract":"This paper presents a new algorithm for collusion resistant multibit video watermarking. Video frames from the same scene of the video sequence are decomposed into wavelet coefficient frames by temporal wavelet transform and the watermark is embedded into the low-pass temporal frames. Embedding is done in the DCT domain of the low-pass temporal wavelet frames by applying the perceptual masking properties of the DCT coefficients. The watermark decoder is a blind statistical decoder. In the decoder, the underlying probability distribution of the mid-frequency DCT coefficients of the temporal low-pass wavelet frames is approximated by the generalized Gaussian distribution. The robustness of the proposed algorithm against different video degradations and distortions is evaluated and presented.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114760438","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":"An attack to BPCS-steganography using complexity histogram and countermeasure","authors":"M. Niimi, T. Ei, H. Noda, E. Kawaguchi, B. Segee","doi":"10.1109/ICIP.2004.1419402","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1419402","url":null,"abstract":"This paper discusses an attack to BPCS-Steganography (Bit-Plane Complexity Segmentation-Steganography) and presents a countermeasure. BPCS is an image-based steganographic method. BPCS embeds secret data by replacing blocks that appear noise-like on bit-planes. Blocks on bit-planes are categorized as a \"noise-like region\" or an \"informative region\" by means of the binary-image feature called complexity. When the complexity distribution of noise-like blocks is different from the complexity distribution of the secret data that replaces those blocks, we can see an unusual shape in the form of a valley in the complexity histogram that represents the relative frequency of occurrence of the various complexities. This would be a signature of BPCS. Because steganography must hide the existence of the secret message, the signature should be removed from steganographic images. We present a method for making embedded binary patterns that quasipreserves the complexity distribution.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124337487","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":"A parallel mediated reality platform","authors":"R. Hill, J. Fung, Steve Mann","doi":"10.1109/ICIP.2004.1421710","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1421710","url":null,"abstract":"Realtime image processing provides a general framework for robust mediated reality problems. This paper presents a realtime mediated reality system that is built upon realtime image processing algorithms. It has been shown that the graphics processing unit (GPU) is capable of efficiently performing image processing tasks. The system presented uses a parallel GPU architecture for image processing that enables realtime mediated reality. Our implementation has many benefits; the graphics hardware has high throughput and low latency; the GPU's are not prone to jitter. Additionally, the CPU is kept available for user applications. The system is easily constructed, consisting of readily available commodity hardware.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124458453","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":"Least-squares mesh model for image compression","authors":"Iciar Alvarez-Cascos, Yongyi Yang","doi":"10.1109/ICIP.2004.1419488","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1419488","url":null,"abstract":"In this work we explore the use of a content-adaptive mesh model for image compression. We first model the image to be compressed by a quadtree mesh representation, in which the nodal values are determined using a least squares fit. The resulting mesh structure is coded using a 4-ary tree and the mesh nodal values are coded using a hierarchical predictive coding scheme. Our experimental results demonstrate that the proposed approach can achieve good compression performance and can significantly outperform JPEG both subjectively and objectively in low bit-rate applications.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"168 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124043146","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}
I. El-Feghi, Songtao Huang, M. Sid-Ahmed, M. Ahmadi
{"title":"Contrast enhancement of radiograph images based on local heterogeneity measures","authors":"I. El-Feghi, Songtao Huang, M. Sid-Ahmed, M. Ahmadi","doi":"10.1109/ICIP.2004.1419467","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1419467","url":null,"abstract":"Contrast enhancement of the lateral skull X-ray images is very important in orthodontic practice, cephalometric evaluation and craniofacial landmarking. In this paper we present computational techniques involving contrast enhancement of two-dimensional digitized X-ray images. The algorithm is developed based on the use of local heterogeneity measures of pixel distribution. Image enhancement is accomplished by an adaptive gray scale pixels transformation depending on results of local heterogeneity contribution measures. The proposed approach was tested on different images and the results prove that the proposed method has better performance the existing conventional methods.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124138865","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}