{"title":"Adaptive quantization of image subbands with efficient overhead rate selection","authors":"Y. Yoo, Antonio Ortega, Bin Yu","doi":"10.1109/ICIP.1996.560833","DOIUrl":"https://doi.org/10.1109/ICIP.1996.560833","url":null,"abstract":"Subband image coding techniques owe much of their success to an effective use of adaptive quantization and adaptive entropy coding. It is often the case that adaptive quantization is achieved by defining a discrete set of quantizers from which one is chosen for a given set of coefficients. This type of forward adaptation thus requires that overhead information (the choice of quantizer) be sent to the decoder. Then, the quantized coefficients are transmitted using adaptive entropy coding, typically through backward adaptive arithmetic coding. We show that a combination of forward and backward adaptation methods can be used to update the quantizers thus reducing the overhead requirements while still providing good performance. Specifically, we present an algorithm where each coefficient is classified into several classes based on the past quantized data and where the quantizer to be used for each class can itself be adapted on the fly.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"179 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":"115485772","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":"Direct processing of EZW compressed image data","authors":"A. Dorrell","doi":"10.1109/ICIP.1996.560914","DOIUrl":"https://doi.org/10.1109/ICIP.1996.560914","url":null,"abstract":"A method is presented for the processing of EZW encoded image data. Operations of the type expected to be performed by a graphics server-pixel-wise arithmetic, offset, scaling and convolution-are considered specifically. We implement the algorithms within the framework of the EZW codec-suggesting that the codec may in fact be used as an image co-processor. The algorithms that result offer similar scalability to the EZW decoder in that processing may be terminated at an arbitrary point to yield an approximation to the full result.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"36 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":"115537477","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 novel interpolative codec for low bit rate applications","authors":"P. Tsang, W. T. Lee","doi":"10.1109/ICIP.1996.559589","DOIUrl":"https://doi.org/10.1109/ICIP.1996.559589","url":null,"abstract":"Interpolative vector quantization (IVQ) has been developed by Hang and Haskell [1988] and further enhanced by Tsang and Tsang [1995] and Yuen et al. [1995]. However there are some problems in the existing IVQ systems such as complex construction and low fidelity in the approximated image. In this paper, a novel interpolative scheme called \"variable searching boundary interpolative coding\" VSBIC is suggested to simplify the system and raise the fidelity of the decoded image. After applying the new scheme on the interpolative coding (IC) system, a high perception approximated image is obtained. Hence \"no\" codebook is necessary to enhanced the complex signal in the new IC system. The complexity of the encoder in the new system is greatly decreased and the improvement in pictorial quality is significant.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"7 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":"115839791","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":"Estimation of affine transformations between images pairs via Fourier transform","authors":"L. Lucchese, G. Cortelazzo, C. M. Monti","doi":"10.1109/ICIP.1996.560780","DOIUrl":"https://doi.org/10.1109/ICIP.1996.560780","url":null,"abstract":"This article presents an original algorithm operating in the frequency domain for estimating the affine transformation between a pair of images. The affine matrix is estimated by the relationships between companion stretched slices of the Fourier transforms magnitudes of the two images. The translational vector is estimated by phase-correlation after compensating for the contribution of the affine matrix. This approach is \"global\" in the sense that it uses the whole images information and it does not rest upon features extraction and matching. It can be efficiently implemented via FFT and it is suited to unsupervised estimation of affine transformations. Experimental evidence of the effectiveness and robustness of the proposed method is reported.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"102 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":"124166867","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 fuzzy region-growing segmentation","authors":"A. Steudel, M. Glesner","doi":"10.1109/ICIP.1996.561063","DOIUrl":"https://doi.org/10.1109/ICIP.1996.561063","url":null,"abstract":"A fuzzy rule-based system is presented that can be used to segment an image completely into disjoint regions. Coding the contours of these regions by an advanced chain code leads to an efficient compression scheme that can be utilized, where high compression rates and an acceptable reconstruction quality are needed.","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":"124347252","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 hybrid codec for very low bit rate video coding","authors":"K. Zhang, M. Bober, J. Kittler","doi":"10.1109/ICIP.1996.559578","DOIUrl":"https://doi.org/10.1109/ICIP.1996.559578","url":null,"abstract":"In segmentation based video compression algorithms, the quality of the segmentation and the efficiency of the boundary coding have strong influence on the coding efficiency and image quality. We propose a hybrid codec using motion segmentation and employing a variable size block structure. The image is segmented based on motion and grey level information and represented by variable size blocks combined with an inner block partition. A method of partitioning using fixed patterns is developed to encode the motion boundaries inside a block. This approach improves the boundary coding efficiency by a factor of three as compared with the straight line approximation used in our earlier approach. The experimental results show that the proposed algorithm decreases the bit rate and preserves good image quality.","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":"114711969","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":"Smoothness-constrained wavelet image compression","authors":"W. K. Carey, S. Hemami, P. Heller","doi":"10.1109/ICIP.1996.560923","DOIUrl":"https://doi.org/10.1109/ICIP.1996.560923","url":null,"abstract":"The uniform quantizers used in typical wavelet image compression algorithms can introduce perceptually disturbing artifacts by decreasing visual smoothness. In this paper, we use local Holder regularity to quantify changes in visual smoothness and propose a modified quantization scheme which constrains local regularity decreases. The reconstructed images show a significant perceptual improvement as well as an increased PSNR.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"23 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":"115046019","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":"Human face classification for security system","authors":"T. Iso, Yasuhiko Watanabe, K. Shimohara","doi":"10.1109/ICIP.1996.560535","DOIUrl":"https://doi.org/10.1109/ICIP.1996.560535","url":null,"abstract":"We propose a method for classifying faces that uses only simple image processing. The method can rapidly judge whether the person detected by a monitor camera is masked or not. Our algorithm has two stages. The first stage detects the facial pattern by template matching with a new similarity assessment. The second stage judges whether the face is masked or not by using optimal features in the spatial frequency domain. Indeed, experiments show that our algorithm can form an effective security system.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"20 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":"116989139","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":"Smoothing of SAR image speckle noise by multiplicative point estimation filters","authors":"C. Moloney","doi":"10.1109/ICIP.1996.560940","DOIUrl":"https://doi.org/10.1109/ICIP.1996.560940","url":null,"abstract":"This paper investigates the smoothing of speckle noise in synthetic aperture radar (SAR) images using the multiplicative point estimator, a locally adaptive form of the homomorphic filter. The filter adaptation is based on an assumed probability model for speckle noise. Speckle smoothing results for mixed terrain airborne SAR images are presented.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"133 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":"117276347","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}
P. Koulibaly, P. Charbonnier, L. Blanc-Féraud, I. Laurette, J. Darcourt, M. Barlaud
{"title":"Poisson statistic and half-quadratic regularization for emission tomography reconstruction algorithm","authors":"P. Koulibaly, P. Charbonnier, L. Blanc-Féraud, I. Laurette, J. Darcourt, M. Barlaud","doi":"10.1109/ICIP.1996.560997","DOIUrl":"https://doi.org/10.1109/ICIP.1996.560997","url":null,"abstract":"In emission computerized tomography, the use of realistic constraints such as edge-preserving smoothing lead to nonlinear regularisation. Charbonnier et al. (see IEEE Trans. on Image Processing, 1994) used the half-quadratic regularization in order to solve this problem. Applied together with a Gaussian likelihood, it formed the ARTUR algorithm. We propose a new regularized algorithm called MOISE which takes into account the Poisson nature of the statistical noise and uses this half-quadratic regularization. For that reason, MOISE differ from the MAP EM (maximum a posteriori expectation maximization) algorithm developed by P.J. Green (1990) which uses the one step late technique. We tested MOISE and compared it with ARTUR, on numerical simulation and real data. The results show that, despite the slowness of convergence, the half-quadratic regularization can be applied in the case of a Poisson statistic.","PeriodicalId":192947,"journal":{"name":"Proceedings of 3rd IEEE International Conference on Image Processing","volume":"79 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":"115998439","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}