{"title":"Channel-matched hierarchical table-lookup vector quantization for transmission of video over wireless channels","authors":"H. Jafarkhani, N. Farvardin","doi":"10.1109/ICIP.1996.560805","DOIUrl":"https://doi.org/10.1109/ICIP.1996.560805","url":null,"abstract":"We propose a channel-matched hierarchical table-lookup vector quantizer (CM-HTVQ) which provides some robustness against the channel noise. We use a finite-state channel to model slowly fading channels and propose an adaptive coding scheme to transmit a source over wireless channels. The performance of CM-HTVQ is in general slightly inferior to that of channel-optimized vector quantizer (COVQ) (the performances coincide at some cases); however, the encoder complexity of CM-HTVQ is much less than the encoder complexity of COVQ.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128305753","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":"Multiscale motion estimation for scalable video coding","authors":"R. Krishnamurthy, P. Moulin, J. Woods","doi":"10.1109/ICIP.1996.559661","DOIUrl":"https://doi.org/10.1109/ICIP.1996.559661","url":null,"abstract":"Motion estimation is an important component of video coding systems because it enables us to exploit the temporal redundancy in the sequence. The popular block-matching algorithms (BMAs) produce unnatural, piecewise constant motion fields that do not correspond to \"true\" motion. In contrast, our focus here is on high-quality motion estimates that produce a video representation that is less dependent on the specific frame-rate or resolution. To this end, we present an iterated registration algorithm that extends previous work on multiscale motion models and gradient-based estimation for coding applications. We obtain improved motion estimates and higher overall coding performance. Promising applications are found in temporally-scalable video coding with motion-compensated frame interpolation at the decoder. We obtain excellent interpolation performance and video quality; in contrast, BMA leads to annoying artifacts near moving image edges.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128471045","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":"Removal of impulse noise using a FIRE filter","authors":"F. Russo, G. Ramponi","doi":"10.1109/ICIP.1996.561068","DOIUrl":"https://doi.org/10.1109/ICIP.1996.561068","url":null,"abstract":"FIRE (Fuzzy Inference Ruled by Else-action) operators are a family of nonlinear operators which adopt fuzzy rules to process image data. A new operator, called DS-FIRE filter, is presented in this paper for the enhancement of images corrupted by impulse noise. By performing fuzzy reasoning at two different levels, the operator is able to effectively cancel noise pulses without degrading the quality of fine details and textures. The new fuzzy rulebase and inference mechanism which have been specifically developed for this operator are described in details. Results of computer simulations show that the filter performs better than state-of the-art operators in the literature.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128515455","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":"Signal adaptive postprocessing for blocking effects reduction in JPEG image","authors":"H. C. Kim, H. Park","doi":"10.1109/ICIP.1996.560596","DOIUrl":"https://doi.org/10.1109/ICIP.1996.560596","url":null,"abstract":"A postprocessing algorithm is proposed to reduce the blocking artifacts of joint photographic experts group (JPEG) decompressed images. The reconstructed images from JPEG compression produce noticeable image degradation near the block boundaries, in particular, for highly compressed images because each block is transformed and quantized independently. The reduction of these blocking effects has been an essential issue for high quality visual communications. The proposed postprocessing algorithm reduces these blocking artifacts efficiently. A comparison study between the proposed algorithm and other postprocessing algorithms is made by computer simulation with several JPEG images. These simulation results show that the proposed algorithm reduces the blocking artifacts significantly in the subjective and objective views.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129841591","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":"Provably convergent coordinate descent in statistical tomographic reconstruction","authors":"S. S. Saquib, Jun Zheng, C. Bouman, K. Sauer","doi":"10.1109/ICIP.1996.561002","DOIUrl":"https://doi.org/10.1109/ICIP.1996.561002","url":null,"abstract":"Statistical tomographic reconstruction algorithms generally require the efficient optimization of a functional. An algorithm known as iterative coordinate descent with Newton-Raphson updates (ICD/NR) has been shown to be much more computationally efficient than indirect optimization approaches based on the EM algorithm. However, while the ICD/NR algorithm has experimentally been shown to converge stably, no theoretical proof of convergence is known. We prove that a modified algorithm, which we call ICD functional substitution (ICD/FS), has guaranteed global convergence in addition to the computational efficiency of the ICD/NR. The ICD/FS method works by approximating the log likelihood at each pixel by an alternative quadratic functional. Experimental results show that the convergence speed of the globally convergent algorithm is nearly identical to that of ICD/NR.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130562749","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":"Entropy-based pattern matching for document image compression","authors":"Qin Zhang, J. Danskin","doi":"10.1109/ICIP.1996.560734","DOIUrl":"https://doi.org/10.1109/ICIP.1996.560734","url":null,"abstract":"In this paper, we introduce a pattern matching algorithm used in document image compression. This pattern matching algorithm uses the cross entropy between two patterns as the criterion for a match. We use a physical model which is based on the finite resolution of the scanner (spatial sampling error) to estimate the probability values used in cross entropy calculation. Experimental results show this pattern matching algorithm compares favorably to previous algorithms.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127046776","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":"Multiresolution lossless compression scheme","authors":"P. Piscaglia, B. Macq","doi":"10.1109/ICIP.1996.559435","DOIUrl":"https://doi.org/10.1109/ICIP.1996.559435","url":null,"abstract":"A multiresolution lossless image compression scheme based on several new tools will be presented in this paper. An improved multiresolution Haar transform will be developed, combined with pre- and post-processing and with a new entropy coder, to give the overall compression scheme. This research is mainly useful for image compression in the medical imaging area, where changes between original and decompressed images are to be avoided.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129192397","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 fractal image compression","authors":"D. Saupe, M. Ruhl","doi":"10.1109/ICIP.1996.559449","DOIUrl":"https://doi.org/10.1109/ICIP.1996.559449","url":null,"abstract":"This paper introduces evolutionary computing to fractal image compression. In fractal image compression a partitioning of the image into ranges is required. We propose to use evolutionary computing to find good partitionings. Here ranges are connected sets of small square image blocks. Populations consist of N/sub p/ configurations, each of which is a partitioning with a fractal code. In the evolution each configuration produces /spl sigma/ children who inherit their parent partitionings except for two random neighboring ranges which are merged. From the offspring the best ones are selected for the next generation population based on a fitness criterion (collage error). We show that a far better rate-distortion curve can be obtained with this approach as compared to traditional quad-tree partitionings.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129210852","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":"Symmetry-adapted wavelet analysis","authors":"J. Antoine","doi":"10.1109/ICIP.1996.560413","DOIUrl":"https://doi.org/10.1109/ICIP.1996.560413","url":null,"abstract":"Wavelet analysis comes in two versions: the continuous one, used mostly for signal or image analysis, and the discrete one, originating from multiresolution analysis and particularly efficient in reconstruction and data compression. We review the construction of continuous wavelet transforms adapted to a given symmetry. Then we discuss in detail successively spatial wavelets, wavelets on the sphere and space-time wavelets.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123399262","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":"Spurious effects reduction by the reconstruction of acoustic images from bispectrum","authors":"A. Trucco, C. Ottonello, Vittorio Murino","doi":"10.1109/ICIP.1996.560559","DOIUrl":"https://doi.org/10.1109/ICIP.1996.560559","url":null,"abstract":"A method to improve the quality of acoustic images obtained by systems based on beamforming is described. The specific goal is to eliminate two additive spurious terms present in the beam signals. The first effect is due to side lobes and the second one is due to the nonlinear effects introduced by the modulus extractor present at the output of the beamformer. The relative importance of these two terms is assessed, showing that the term due to modulus extraction has a strong negative incidence on the final image quality. The Gaussian distribution of these spurious terms is discussed and verified in the case of punctiform scenes. Owing to the Gaussianity of the spurious terms, a method to eliminate them from the beam signals, based on higher order spectra analysis, is proposed, resulting in an evident image quality and reliability improvement.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"76 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114087042","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}