{"title":"MAP estimation of a class of morphologically constrained Gibbs random fields","authors":"K. Sivakumar, J. Goutsias","doi":"10.1109/ICIP.1998.723320","DOIUrl":"https://doi.org/10.1109/ICIP.1998.723320","url":null,"abstract":"We revisit the problem of non-linear image filtering by means of maximum-a-posteriori (MAP) estimation and mathematical morphology. Based on \"mild\" modeling assumptions, we bound the optimal MAP estimate from above and below and provide explicit morphological expressions for such bounds. The derived bounds can be easily calculated and effectively used to design a fast MAP algorithm.","PeriodicalId":220168,"journal":{"name":"Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115283512","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":"Covariant-conics decomposition of quartics for 2D object recognition and affine alignment","authors":"Jean-Philippe Tarel, W. Wolovich, D. Cooper","doi":"10.1109/ICIP.1998.723684","DOIUrl":"https://doi.org/10.1109/ICIP.1998.723684","url":null,"abstract":"This paper outlines a geometric parameterization of 2D curves where the parameterization is in terms of geometric invariants and terms that determine an intrinsic coordinate system. Thus, we present a new approach to handle two fundamental problems: single-computation alignment and recognition of 2D shapes under affine transformations. The approach is model-based, and every shape is first fit by an implicit fourth degree (quartic) polynomial. Based on the decomposition of this equation into three covariant conics, we are able to define a unique intrinsic reference system that incorporates usable alignment information contained in the implicit polynomial representation, a complete set of geometric invariants, and thus an associated canonical form for a quartic. This representation permits shape recognition based on 8 affine invariants. This is illustrated in experiments with real data sets.","PeriodicalId":220168,"journal":{"name":"Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115413381","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}
K. Chugg, Xiaopeng Chen, Antonio Ortega, Cheng-Wei Chang
{"title":"An iterative algorithm for two-dimensional digital least metric problems with applications to digital image compression","authors":"K. Chugg, Xiaopeng Chen, Antonio Ortega, Cheng-Wei Chang","doi":"10.1109/ICIP.1998.723631","DOIUrl":"https://doi.org/10.1109/ICIP.1998.723631","url":null,"abstract":"A correspondence between the problem of two-dimensional digital least metric (DLM) fitting and data detection in serially concatenated systems in digital communication theory is described. Nearly optimal detection algorithms based on previous advances in iterative detection/decoding are applied to the DLM problem for two applications in digital image compression. The first application is least squares halftoning of digital images. The second is near-lossless (i.e., error constrained) minimum-entropy image compression. In both applications the use of the iterative algorithm yields significant improvements, measured in terms of residual metric, relative to previously suggested approaches to the DLM problem.","PeriodicalId":220168,"journal":{"name":"Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115417545","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":"B-spline snakes and a JAVA interface: an intuitive tool for general contour outlining","authors":"P. Brigger, Robert Engel, M. Unser","doi":"10.1109/ICIP.1998.723364","DOIUrl":"https://doi.org/10.1109/ICIP.1998.723364","url":null,"abstract":"We present a novel formulation for B-spline snakes that can be used as a tool for fast and intuitive contour outlining. The theory is implemented in a platform independent JAVA interface, which allows real time computation of the snake curve. In this paper, our main focus is on two points. First, we propose a novel B-spline snake formulation, where the intrinsic scale of the spline model is adjusted a priori. It leads to a reduction of the number of parameters to be optimized and eliminates the need for internal energies. The approach solves the two main drawbacks of traditional snakes (slow convergence speed and difficult to adjust weighting factors for internal energy terms). Second, we comment on our experience using JAVA for the implementation of the snake and for the design of the graphical user interface. Our technique provides a very intuitive, user-friendly, and platform independent tool for contour outlining, generally applicable to a vast range of images. Several biomedical examples of applications are included to illustrate the versatility of the method.","PeriodicalId":220168,"journal":{"name":"Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124407860","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}
Jianbo Shi, Serge J. Belongie, T. Leung, Jitendra Malik
{"title":"Image and video segmentation: the normalized cut framework","authors":"Jianbo Shi, Serge J. Belongie, T. Leung, Jitendra Malik","doi":"10.1109/ICIP.1998.723676","DOIUrl":"https://doi.org/10.1109/ICIP.1998.723676","url":null,"abstract":"We propose a segmentation system based on the normalized cut framework proposed by Shi and Malik (see Proc. IEEE Conf. Computer Vision and Pattern Recognition, San Juan, Puerto Rico, p.731-7, 1997). The goal is to partition the image from a big picture point of view. Perceptually significant groups are detected first while small variations and details are treated later. Different image features-intensity, color, texture, contour continuity, motion and stereo disparity are treated in one uniform framework.","PeriodicalId":220168,"journal":{"name":"Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124454745","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 of parametrized quantization matrix for MPEG-2 encoding","authors":"Jungwoo Lee","doi":"10.1109/ICIP.1998.723386","DOIUrl":"https://doi.org/10.1109/ICIP.1998.723386","url":null,"abstract":"An optimal frequency domain bit allocation technique is presented. A Lagrange multiplier based approach is used for the rate-distortion optimization of the quantization matrix in MPEG-2 encoding. Since the optimal quantization matrix is heavily dependent on the choice of the quantizer, the quantizer is also jointly optimized in order to alleviate the interaction between the two. The complexity of the algorithm is analyzed, and it is shown to be directly proportional to the number of quantization matrices and quantization scales. Experimental results comparing the new technique with a conventional MPEG-2 encoding are also presented.","PeriodicalId":220168,"journal":{"name":"Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115734227","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":"Block classification method based on human perception for dynamic bitstream scaling of MPEG video","authors":"A. Ichikawa, Toshiyuki Yoshida, Y. Sakai","doi":"10.1109/ICIP.1998.727234","DOIUrl":"https://doi.org/10.1109/ICIP.1998.727234","url":null,"abstract":"This paper proposes a classification method of blocks in an image for the purpose of dynamic spatial bitstream scaling of MPEG video based on simple characteristics of human perception. First, we classify the blocks based on the relation between the characteristics of distorted blocks difficult to be perceived by human and the characteristics of blocks derived by the moving vectors. Then, based on this relation, we propose the bitstream scaling method for MPEG video by stripping off the DCT coefficients. An experiment using this techniques in an actual media synchronization system has illustrated the usefulness of the proposed approach.","PeriodicalId":220168,"journal":{"name":"Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116857752","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}
C. P. Hess, Zhi-Pei Liang, Andrew G. Webb, P. Lauterbur
{"title":"Maximum cross-entropy generalized series reconstruction","authors":"C. P. Hess, Zhi-Pei Liang, Andrew G. Webb, P. Lauterbur","doi":"10.1109/ICIP.1998.723398","DOIUrl":"https://doi.org/10.1109/ICIP.1998.723398","url":null,"abstract":"This paper addresses the classical image reconstruction problem from limited Fourier data. Here, we assume that a high-resolution reference which provides an initial estimate of the desired image is available. A new algorithm is described which represents the desired image using a family of basis functions derived from the reference image. The selection of the most efficient basis function set from this family is guided by the principle of maximum cross-entropy. Simulation and experimental results have shown that the algorithm can achieve high resolution with a small number of data points and can also account for relative rotation and translation between the reference and the measured data.","PeriodicalId":220168,"journal":{"name":"Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)","volume":"875 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120877268","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":"Minimizing ringing effect on images coded at low bit rates with wavelets","authors":"M.A.M. Rodrigues, E. Silva, P. Diniz","doi":"10.1109/ICIP.1998.727349","DOIUrl":"https://doi.org/10.1109/ICIP.1998.727349","url":null,"abstract":"When designing wavelet transforms for subband coding systems, a problem of concern is to avoid ringing effects in the compressed images. We developed a technique to minimize this effect which enables for coding gain optimization. We design wavelets without sidelobes, a condition which is obtained when certain constraints are met. We compare our results to some previously published wavelets.","PeriodicalId":220168,"journal":{"name":"Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127294571","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":"Multitemporal SAR image compression","authors":"G. Mercier, M. Mouchot, G. Cazuguel","doi":"10.1109/ICIP.1998.723606","DOIUrl":"https://doi.org/10.1109/ICIP.1998.723606","url":null,"abstract":"In this paper, we propose a new method for compressing with loss temporal series of SAR images. The algorithm requires a reference scene used as an input in the compression process. The compression is achieved through affine transformations, comparable to the ones used in fractal coding, but applied here in a non-convergent way. Blocks in the image to be compressed are defined by a non-overlapping recursive partition. They are replaced by blocks taken from the reference image on which affine transformations, containing isometries and grey level adjustments, have been applied. This algorithm is very powerful, and outperforms classical algorithms (such that JPEG, EPIC or fractals) at high compression ratio with poor loss of critical information. Some results are presented with RADARSAT Antarctica and sea ice images which can be compressed at 44:1, and brought on icebreaker via an affordable INMARSAT connection, while still remaining of sufficient quality for ship routing usage.","PeriodicalId":220168,"journal":{"name":"Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125008272","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}