Pub Date : 2000-09-10DOI: 10.1109/ICIP.2000.899601
Noureddine Abbadeni, D. Ziou, Shengrui Wang
Texture is a very important image feature extremely used in various image processing problems. It has been shown that humans use some perceptual textural features to distinguish between textured images or regions. Some of the most important features are coarseness, contrast, direction and busyness. In this paper a new method based on the autocovariance function to estimate quantitatively these features is shown and the correspondence between these computational measures and the psychological ones made by human subjects is shown using some psychometric method.
{"title":"Computational measures corresponding to perceptual textural features","authors":"Noureddine Abbadeni, D. Ziou, Shengrui Wang","doi":"10.1109/ICIP.2000.899601","DOIUrl":"https://doi.org/10.1109/ICIP.2000.899601","url":null,"abstract":"Texture is a very important image feature extremely used in various image processing problems. It has been shown that humans use some perceptual textural features to distinguish between textured images or regions. Some of the most important features are coarseness, contrast, direction and busyness. In this paper a new method based on the autocovariance function to estimate quantitatively these features is shown and the correspondence between these computational measures and the psychological ones made by human subjects is shown using some psychometric method.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123718592","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}
Pub Date : 2000-09-10DOI: 10.1109/ICIP.2000.900983
I. Mora-Jiménez, Á. Navia-Vázquez
Among the many techniques available for information concealment, those based on spread spectrum modulations have proven to yield improved results when robustness against attack is at a premium. In this paper, we propose a new spread spectrum-based watermarking procedure that combines space and frequency marks to provide good robustness properties against both spatial (affine) and transform-based compression attacks, without needing the original image as a reference (blind detection). It provides a mechanism for N-bit concealment and also improves the detection-of-presence process by gathering all the watermark energy into a single value (sufficient statistic for detection). The recovery of every single bit is also improved by taking into account the so-called "watermark-print" or "waterprint" instead of looking at a single correlation value. It additionally provides the means to recover synchronization under affine transformations in the blind detection scenario. These characteristics are analyzed by means of several practical examples.
{"title":"A new spread spectrum watermarking method with self-synchronization capabilities","authors":"I. Mora-Jiménez, Á. Navia-Vázquez","doi":"10.1109/ICIP.2000.900983","DOIUrl":"https://doi.org/10.1109/ICIP.2000.900983","url":null,"abstract":"Among the many techniques available for information concealment, those based on spread spectrum modulations have proven to yield improved results when robustness against attack is at a premium. In this paper, we propose a new spread spectrum-based watermarking procedure that combines space and frequency marks to provide good robustness properties against both spatial (affine) and transform-based compression attacks, without needing the original image as a reference (blind detection). It provides a mechanism for N-bit concealment and also improves the detection-of-presence process by gathering all the watermark energy into a single value (sufficient statistic for detection). The recovery of every single bit is also improved by taking into account the so-called \"watermark-print\" or \"waterprint\" instead of looking at a single correlation value. It additionally provides the means to recover synchronization under affine transformations in the blind detection scenario. These characteristics are analyzed by means of several practical examples.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121224793","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}
Pub Date : 2000-09-10DOI: 10.1109/ICIP.2000.899271
T. Furon, P. Duhamel
Asymmetric schemes belong to second generation of watermarking. Whereas their need and advantage are well understood, many doubts have been raised about their robustness. According to a method presented by Furon and Duhamel (see Proc. of the 3rd Int. Work. on Information Hiding, Dresden, 1999), a very robust symmetric technique is derived into an asymmetric scheme. Tests show that it is as robust as the symmetric version. Yet, asymmetric schemes undergo malicious attacks that confuse the detection process. Tests reveal that the quality loss due to these malicious attacks is too important for the signal to be used after the attack.
{"title":"Robustness of asymmetric watermarking technique","authors":"T. Furon, P. Duhamel","doi":"10.1109/ICIP.2000.899271","DOIUrl":"https://doi.org/10.1109/ICIP.2000.899271","url":null,"abstract":"Asymmetric schemes belong to second generation of watermarking. Whereas their need and advantage are well understood, many doubts have been raised about their robustness. According to a method presented by Furon and Duhamel (see Proc. of the 3rd Int. Work. on Information Hiding, Dresden, 1999), a very robust symmetric technique is derived into an asymmetric scheme. Tests show that it is as robust as the symmetric version. Yet, asymmetric schemes undergo malicious attacks that confuse the detection process. Tests reveal that the quality loss due to these malicious attacks is too important for the signal to be used after the attack.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114542164","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}
Pub Date : 2000-09-10DOI: 10.1109/ICIP.2000.899382
Sanghyuk Woo, A. Dipanda
A new method using genetic algorithms (GAs) is proposed for reconstructing a 3-D shape from an image. This image is obtained by an active stereo vision system composed of a camera and a light system which projects laser rays on the scene to be analyzed. The depth information is provided by matching the laser rays and the corresponding spots appearing in the image. Experimental results demonstrate that the proposed method is effective for 3-D shapes reconstruction.
{"title":"Matching lines and points in an active stereo vision system using genetic algorithms","authors":"Sanghyuk Woo, A. Dipanda","doi":"10.1109/ICIP.2000.899382","DOIUrl":"https://doi.org/10.1109/ICIP.2000.899382","url":null,"abstract":"A new method using genetic algorithms (GAs) is proposed for reconstructing a 3-D shape from an image. This image is obtained by an active stereo vision system composed of a camera and a light system which projects laser rays on the scene to be analyzed. The depth information is provided by matching the laser rays and the corresponding spots appearing in the image. Experimental results demonstrate that the proposed method is effective for 3-D shapes reconstruction.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121525277","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}
Pub Date : 2000-09-10DOI: 10.1109/ICIP.2000.900952
Penio S. Penev, Manuela Gegiu, E. Kaplan
In many functional-imaging scenarios, four sources contribute to the image formation: the intrinsic variability of the object under study, the variability due to the experimentally controlled stimulus, the state of the equipment, and white noise. These sources are presumably independent, and under a multidimensional Gaussian assumption, linear discriminant analysis is typically used to separate them. Here we show that when an initial entropy model of optical imaging data is derived by the Karhunen-Loeve transform (KLT), vector quantization can be used to find KLT subspaces in which the Gaussian assumption does not hold; this results in the characterization of low-dimensional nonlinear manifolds that are embedded in those subspaces, and along which the probability density clusters. Further, this information is utilized to improve the probability model by a factorization into: one nonlinear independent parameter along the manifold and a linear residual.
{"title":"Using vector quantization to build nonlinear factorial models of the low-dimensional independent manifolds in optical imaging data","authors":"Penio S. Penev, Manuela Gegiu, E. Kaplan","doi":"10.1109/ICIP.2000.900952","DOIUrl":"https://doi.org/10.1109/ICIP.2000.900952","url":null,"abstract":"In many functional-imaging scenarios, four sources contribute to the image formation: the intrinsic variability of the object under study, the variability due to the experimentally controlled stimulus, the state of the equipment, and white noise. These sources are presumably independent, and under a multidimensional Gaussian assumption, linear discriminant analysis is typically used to separate them. Here we show that when an initial entropy model of optical imaging data is derived by the Karhunen-Loeve transform (KLT), vector quantization can be used to find KLT subspaces in which the Gaussian assumption does not hold; this results in the characterization of low-dimensional nonlinear manifolds that are embedded in those subspaces, and along which the probability density clusters. Further, this information is utilized to improve the probability model by a factorization into: one nonlinear independent parameter along the manifold and a linear residual.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121559938","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}
Pub Date : 2000-09-10DOI: 10.1109/ICIP.2000.899328
A. Deever, S. Hemami
Many state-of-the-art wavelet image coders use nonorthogonal transforms for both lossy and lossless wavelet image coding. In this paper, a projection prediction is described that capitalizes on the non-orthogonality of wavelet transform basis vectors to improve the prediction of high-frequency coefficients. For lossy wavelet coders, the prediction yields improved context modeling and up to .2 dB coding improvement. For lossless integer wavelet coders, the prediction can be used as an extra lifting step during the transform, and results in a lower first-order entropy of wavelet coefficients and lower subsequent coding rate than current integer wavelet transforms.
{"title":"Scalable image coding with projection-based context modeling","authors":"A. Deever, S. Hemami","doi":"10.1109/ICIP.2000.899328","DOIUrl":"https://doi.org/10.1109/ICIP.2000.899328","url":null,"abstract":"Many state-of-the-art wavelet image coders use nonorthogonal transforms for both lossy and lossless wavelet image coding. In this paper, a projection prediction is described that capitalizes on the non-orthogonality of wavelet transform basis vectors to improve the prediction of high-frequency coefficients. For lossy wavelet coders, the prediction yields improved context modeling and up to .2 dB coding improvement. For lossless integer wavelet coders, the prediction can be used as an extra lifting step during the transform, and results in a lower first-order entropy of wavelet coefficients and lower subsequent coding rate than current integer wavelet transforms.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128146185","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}
Pub Date : 2000-09-10DOI: 10.1109/ICIP.2000.899577
D. Taubman
An algorithm is described for reconstructing images from colour sensor samples, which need not be aligned nor conform to a rectangular sampling geometry. The algorithm has applications in de-mosaicing digital camera color filter array (CFA) data, and processing other imaging modalities such as scanned images and captured video. A unique scale invariant WSS prior model is described for the uncorrupted surface spectral reflectance functions and used to form linear least mean squared error (LLMSE) optimal reconstructions with constrained support operators. Some important results are established concerning the existence and tractability of the solutions based on this prior.
{"title":"Generalized Wiener reconstruction of images from colour sensor data using a scale invariant prior","authors":"D. Taubman","doi":"10.1109/ICIP.2000.899577","DOIUrl":"https://doi.org/10.1109/ICIP.2000.899577","url":null,"abstract":"An algorithm is described for reconstructing images from colour sensor samples, which need not be aligned nor conform to a rectangular sampling geometry. The algorithm has applications in de-mosaicing digital camera color filter array (CFA) data, and processing other imaging modalities such as scanned images and captured video. A unique scale invariant WSS prior model is described for the uncorrupted surface spectral reflectance functions and used to form linear least mean squared error (LLMSE) optimal reconstructions with constrained support operators. Some important results are established concerning the existence and tractability of the solutions based on this prior.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"1246 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125464193","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}
Pub Date : 2000-09-10DOI: 10.1109/ICIP.2000.901092
Jonathan S. Y. Teh, M. Spann
This paper presents a region-based motion estimation algorithm for use in video compression systems. It is based on overlapping block motion estimation with a least-median of squares (LMedS) error measure to estimate the initial motion field. The overlapping blocks improve the motion estimate for each pixel. The block-based motion field is subsequently segmented into various regions of coherent motion and the segmentation is refined in a rate-distortion framework. Region boundaries are then estimated and refined in an iterative procedure. The results show significantly lower prediction errors compared to other block-based approaches.
{"title":"Robust region-based motion estimation for video compression","authors":"Jonathan S. Y. Teh, M. Spann","doi":"10.1109/ICIP.2000.901092","DOIUrl":"https://doi.org/10.1109/ICIP.2000.901092","url":null,"abstract":"This paper presents a region-based motion estimation algorithm for use in video compression systems. It is based on overlapping block motion estimation with a least-median of squares (LMedS) error measure to estimate the initial motion field. The overlapping blocks improve the motion estimate for each pixel. The block-based motion field is subsequently segmented into various regions of coherent motion and the segmentation is refined in a rate-distortion framework. Region boundaries are then estimated and refined in an iterative procedure. The results show significantly lower prediction errors compared to other block-based approaches.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122245196","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}
Pub Date : 2000-09-10DOI: 10.1109/ICIP.2000.901132
Bo Martins, Søren Forchhammer
The quality and the spatial resolution of video can be improved by combining multiple pictures to form a single superresolution picture. We address the special problems associated with pictures of variable but somehow parameterized quality such as MPEG-decoded video. Our algorithm provides a unified approach to restoration, chrominance upsampling, deinterlacing and superresolution as e.g. HDTV. The algorithm is mainly targeted at improving MPEG-2 decoding at high bit rates (4-8 Mbit/s). The mean squared error is reduced, compared to the directly decoded sequence, and annoying ringing artifacts including mosquito noise are effectively suppressed. The superresolution pictures obtained by the algorithm are of much higher visual quality and has lower mean squared error than superresolution pictures obtained by simple spatial interpolation.
{"title":"A unified approach to restoration, deinterlacing and superresolution of MPEG-2 decoded video","authors":"Bo Martins, Søren Forchhammer","doi":"10.1109/ICIP.2000.901132","DOIUrl":"https://doi.org/10.1109/ICIP.2000.901132","url":null,"abstract":"The quality and the spatial resolution of video can be improved by combining multiple pictures to form a single superresolution picture. We address the special problems associated with pictures of variable but somehow parameterized quality such as MPEG-decoded video. Our algorithm provides a unified approach to restoration, chrominance upsampling, deinterlacing and superresolution as e.g. HDTV. The algorithm is mainly targeted at improving MPEG-2 decoding at high bit rates (4-8 Mbit/s). The mean squared error is reduced, compared to the directly decoded sequence, and annoying ringing artifacts including mosquito noise are effectively suppressed. The superresolution pictures obtained by the algorithm are of much higher visual quality and has lower mean squared error than superresolution pictures obtained by simple spatial interpolation.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122247537","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}
Pub Date : 2000-09-10DOI: 10.1109/ICIP.2000.901069
J. Trelewicz
Digital holographic data storage (DHDS) shows promise for next-generation, highly-parallel, random-access, multidimensional data and image storage. Distortion and noise promote detection errors in DHDS systems. Trellis-coded modulation (TCM) combines modulation and error-correction coding to reduce the bit error rate. This paper describes a method of using position-dependent modulation codes with the author's Split TCM architecture for practical TCM in these page memories. Modulation coding with position dependence is shown to provide better resistance to symbol detection errors in high-distortion regions. The architecture provides relative computational efficiency, facilitating high-throughput page access.
{"title":"Multirate, two-dimensional channel coding for optical page memories","authors":"J. Trelewicz","doi":"10.1109/ICIP.2000.901069","DOIUrl":"https://doi.org/10.1109/ICIP.2000.901069","url":null,"abstract":"Digital holographic data storage (DHDS) shows promise for next-generation, highly-parallel, random-access, multidimensional data and image storage. Distortion and noise promote detection errors in DHDS systems. Trellis-coded modulation (TCM) combines modulation and error-correction coding to reduce the bit error rate. This paper describes a method of using position-dependent modulation codes with the author's Split TCM architecture for practical TCM in these page memories. Modulation coding with position dependence is shown to provide better resistance to symbol detection errors in high-distortion regions. The architecture provides relative computational efficiency, facilitating high-throughput page access.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127941535","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：