{"title":"Joint wavelet compression and authentication watermarking","authors":"L. Xie, G. Arce","doi":"10.1109/ICIP.1998.723409","DOIUrl":"https://doi.org/10.1109/ICIP.1998.723409","url":null,"abstract":"A blind watermarking technique embedding a digital image signature for authentication is developed. The signature algorithm is first implemented in the discrete wavelet transform (DWT) domain and is later coupled within the SPIHT compression algorithm. The capacity of the watermarking method is determined by the upper bound on the attainable information bit rate that can be hidden in the image using two methods: binary engraving and multi-bit engraving.","PeriodicalId":220168,"journal":{"name":"Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)","volume":"108 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":"125171781","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":"Representation and coding of images with nonseparable two-dimensional wavelets","authors":"D. Wajcer, D. Stanhill, Y. Zeevi","doi":"10.1109/ICIP.1998.723376","DOIUrl":"https://doi.org/10.1109/ICIP.1998.723376","url":null,"abstract":"A method for wavelet image representation, coding and compression, using nonseparable two-dimensional (2D) multiwavelet transform, is presented. The application of this approach results in 2D wavelet functions and filter-banks that are more suitable for coding of two-dimensional signals, such as images, than the traditional separable transform. We deal mainly with the design of multiwavelets. The nonseparable approach permits the design of 2D multiwavelets with preferred orientations. We also present the nonlinear constraints on the polyphase matrix components which must be satisfied while imposing the requirement of vanishing moments.","PeriodicalId":220168,"journal":{"name":"Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)","volume":"92 2 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":"126034777","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":"Investigation of parallel and globally convergent iterative schemes for nonlinear variational image smoothing and segmentation","authors":"J. Heers, C. Schnörr, H. Stiehl","doi":"10.1109/ICIP.1998.727199","DOIUrl":"https://doi.org/10.1109/ICIP.1998.727199","url":null,"abstract":"We consider a nonquadratic convex variational segmentation approach and investigate numerical schemes to allow for an efficient computation of the global minimum on a parallel architecture. We focus on iterative schemes for which we can show global convergence to the unique solution irrespective of the starting point. In the context of (semi-)automated image processing tasks, such a feature is of utmost importance. We characterize various approaches that have been proposed in the literature as special cases of a general iterative scheme. Among these approaches are the linearization technique introduced by Geman and Reynolds (1992) and the half-quadratic regularization scheme proposed by Geman and Yang (see IEEE Trans. Image Proc., no.4, p.932-45, 1995). As a result, we can show global convergence to the unique solution under weaker conditions. Efficient Krylov subspace solvers for the resulting linear systems have been implemented on a parallel architecture to assess the performance of these numerical schemes. Experimental results concerning convergence rates and speed-up are reported. Due to the similarity of the segmentation approach considered here with total variation based image restoration methods, our results are relevant for this latter class of methods as well.","PeriodicalId":220168,"journal":{"name":"Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)","volume":"33 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":"123311984","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":"Very low bit rate wavelet-based scalable video compression","authors":"E. Asbun, P. Salama, K. Shen, E. Delp","doi":"10.1109/ICIP.1998.727407","DOIUrl":"https://doi.org/10.1109/ICIP.1998.727407","url":null,"abstract":"Rate scalable video compression is appealing for low bit rate applications, such as video telephony and wireless communication, where bandwidth available to an application cannot be guaranteed. A technique known as scalable adaptive motion compensated wavelet (SAMCoW) compression is described. SAMCoW is well suited for data rates less than 32 kbps. Several techniques to improve the subjective picture quality of SAMCoW are investigated. These include the use of B frames, half-pixel accuracy, and unrestricted motion vectors.","PeriodicalId":220168,"journal":{"name":"Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)","volume":"23 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":"123773234","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}
Isil Celasun, Erdal Ilgaz, A. Tekalp, P. Beek, N. Zhuang
{"title":"Optimal hierarchical design of 2D dynamic meshes for videos","authors":"Isil Celasun, Erdal Ilgaz, A. Tekalp, P. Beek, N. Zhuang","doi":"10.1109/ICIP.1998.723701","DOIUrl":"https://doi.org/10.1109/ICIP.1998.723701","url":null,"abstract":"This paper proposes methods for designing hierarchical 2D dynamic meshes, for representation of object-based video. This representation consists of a hierarchy of Delaunay meshes, obtained by recursive simplification of the initial fine level-of-detail mesh geometry. Nodes in the initial fine level-of-detail mesh are selected using an edge and corner detector. A dynamic programming-like approach is employed in the mesh simplification procedure to obtain an optimal hierarchical design. Mesh simplification entails removal of mesh nodes to reduce the level of detail. The selection of nodes to be removed is achieved by associating a cost with each mesh node. The hierarchical mesh representation can be applied in object-based video coding, storage and manipulation.","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":"125272775","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":"Towards a telltale watermarking technique for tamper-proofing","authors":"D. Kundur, D. Hatzinakos","doi":"10.1109/ICIP.1998.723403","DOIUrl":"https://doi.org/10.1109/ICIP.1998.723403","url":null,"abstract":"In this paper we present a novel fragile watermarking scheme for the tamper-proofing of multimedia signals. Unlike previously proposed techniques, the novel approach provides spatial and frequency domain information on how the signal is modified. We call such a technique a telltale tamper-proofing method. Our design embeds a fragile watermark in the discrete wavelet domain of the signal by quantizing the corresponding coefficients with user-specified keys. Tamper detection is possible in the localized spatial and frequency regions of the given signal. We provide analysis, simulations and comparisons with two other tamper-proofing methods to show the potential of the proposed approach in detecting and characterizing the distortion imposed on the signal.","PeriodicalId":220168,"journal":{"name":"Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)","volume":"125 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":"126864116","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":"Moving object tracking using active models","authors":"Dae-Sik Jang, Hyung-Il Choi","doi":"10.1109/ICIP.1998.727345","DOIUrl":"https://doi.org/10.1109/ICIP.1998.727345","url":null,"abstract":"We propose a model based tracking algorithm which can extract trajectory information of a target object by detecting and tracking a moving object from a sequence of images. The algorithm constructs a model from the detected moving object and match the model with successive image frames to track the target object. We use an active model which characterizes regional and structural features of a target object such as shape, texture, color, and edge. Our active model can adapt itself dynamically to an image sequence so that it can track a non-rigid moving object. Such an adaptation is made under the framework of energy minimization. We design an energy function so that the function can embody structural attributes of a target as well as its spectral attributes. We applied a Kalman filter to predict motion information. The predicted motion information by Kalman filter was used very efficiently to reduce the search space in the matching process.","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":"115211558","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":"Recognizing surfaces from 3D curves","authors":"D. Keren, E. Rivlin, I. Shimshoni, I. Weiss","doi":"10.1109/ICIP.1998.727325","DOIUrl":"https://doi.org/10.1109/ICIP.1998.727325","url":null,"abstract":"A general paradigm for recognizing 3D objects is offered, and applied to some geometric primitives (spheres, cylinders, cones, and tori). The assumption is that a curve on the surface was measured with high accuracy (for instance, by a sensory robot). Differential properties of curves and surfaces are used to recognize the surface. The motivation is twofold: the output of some devices is not surface range data, but curves. So, surface invariants, which may be simpler in some cases, cannot always be obtained. Also, a considerable speedup is obtained by using curve data, as opposed to surface data which usually contain a much higher number of points.","PeriodicalId":220168,"journal":{"name":"Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)","volume":"7 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":"122730078","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 segmentation of color image based on region coherency","authors":"S. Ji, Heung-Won Park","doi":"10.1109/ICIP.1998.723425","DOIUrl":"https://doi.org/10.1109/ICIP.1998.723425","url":null,"abstract":"A two-step image segmentation algorithm is proposed, which is based on region coherency for the segmentation of color image. The first step is the watershed segmentation, and the next one is the region merging using artificial neural networks. Spatially homogeneous regions are obtained by the first step, but the regions are oversegmented. The second step merges the oversegmented regions. The proposed method exploits the luminance and chrominance difference components of the color image to verify region coherency. The YUV color coordinate system is used in this work.","PeriodicalId":220168,"journal":{"name":"Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)","volume":"131 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":"122766286","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":"Mars Pathfinder image compression compared to a wavelet-coder for future space explorations","authors":"P. Rüffer, B. Fiethe, F. Gliem","doi":"10.1109/ICIP.1998.723368","DOIUrl":"https://doi.org/10.1109/ICIP.1998.723368","url":null,"abstract":"The structure of the software based image data compression scheme of the Imager for Mars Pathfinder (IMP) is introduced. Alternatives to the selected scheme are discussed. The reasons to select the implemented transform scheme are explained. In contrast to the IMP transform coder a software based wavelet-coder is designated for the OSIRIS camera of the Rosetta mission. After a brief discussion of the structure of the wavelet-coder some details concerning the implementation are introduced. It is shown that without output rate control the IMP enhanced transform-coder is a runtime saving alternative to a wavelet-coder.","PeriodicalId":220168,"journal":{"name":"Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)","volume":"35 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":"123012170","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}