Pub Date : 2000-12-01DOI: 10.1109/ICIP.2000.901064
Y. Bandoh, S. Kamata
The Hilbert curve is a one-to-one mapping between N-dimensional (N-D) space and 1-D space. The Hilbert curve has been applied to image processing as a scanning technique (Hilbert scan). Applications to multi-dimensional image processing are also studied. In this application. We use the N-D Hilbert scan which maps N-D data to 1-D data along the N-D Hilbert curve. However, the N-D Hilbert scan is the application limited to data in a hyper-cube region. In this paper, we present a novel algorithm for generating N-D pseudo-Hilbert curves in a hyper-rectangular parallelepiped region. Our algorithm is suitable for real-time processing and is easy to implement in hardware, since it is a simple and non-recursive computation using look-up tables.
{"title":"An address generator, for an N-dimensional pseudo-Hilbert scan in a hyper-rectangular, parallelepiped region","authors":"Y. Bandoh, S. Kamata","doi":"10.1109/ICIP.2000.901064","DOIUrl":"https://doi.org/10.1109/ICIP.2000.901064","url":null,"abstract":"The Hilbert curve is a one-to-one mapping between N-dimensional (N-D) space and 1-D space. The Hilbert curve has been applied to image processing as a scanning technique (Hilbert scan). Applications to multi-dimensional image processing are also studied. In this application. We use the N-D Hilbert scan which maps N-D data to 1-D data along the N-D Hilbert curve. However, the N-D Hilbert scan is the application limited to data in a hyper-cube region. In this paper, we present a novel algorithm for generating N-D pseudo-Hilbert curves in a hyper-rectangular parallelepiped region. Our algorithm is suitable for real-time processing and is easy to implement in hardware, since it is a simple and non-recursive computation using look-up tables.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129021100","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-12-01DOI: 10.1109/ICIP.2000.899858
S. Kamata, Yu-ichi Hayashi
G. Peano published a paper of space-filling curve in 1890. There are several applications using this curve in the area of image processing, computer graphics, etc. This paper presents a region-based scanning technique for image compression which we call an adaptive space filling scan (ASFS). In order to generate the ASFS, we make use of a minimum spanning tree technique. From several experiments for image compression, it is confirmed that in comparison to JPEG, acceptable quality images can be obtained at the same bit-rates.
{"title":"Region-based scanning for image compression","authors":"S. Kamata, Yu-ichi Hayashi","doi":"10.1109/ICIP.2000.899858","DOIUrl":"https://doi.org/10.1109/ICIP.2000.899858","url":null,"abstract":"G. Peano published a paper of space-filling curve in 1890. There are several applications using this curve in the area of image processing, computer graphics, etc. This paper presents a region-based scanning technique for image compression which we call an adaptive space filling scan (ASFS). In order to generate the ASFS, we make use of a minimum spanning tree technique. From several experiments for image compression, it is confirmed that in comparison to JPEG, acceptable quality images can be obtained at the same bit-rates.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115690924","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-12-01DOI: 10.1109/ICIP.2000.899864
G. Melnikov, A. Katsaggelos
This paper presents an efficient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms of minimizing the shape distortion at full reconstruction subject to the total (for all scalable layers) bit budget constraint. Based on the chosen vertex-based representation, we solve the problem of determining the number and locations of approximating vertices for all scalable layers jointly and optimally. The number of scalable layers is not constrained, but, rather, is a by-product of the proposed optimization. The algorithm employs two different coding strategies: one for the base layer and one for the enhancement layers. By carefully defining scalable layer recursion and base layer segment costs the problem is solved by executing a directed acyclic graph (DAG) shortest path algorithm.
{"title":"Shape approximation through recursive scalable layer generation","authors":"G. Melnikov, A. Katsaggelos","doi":"10.1109/ICIP.2000.899864","DOIUrl":"https://doi.org/10.1109/ICIP.2000.899864","url":null,"abstract":"This paper presents an efficient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms of minimizing the shape distortion at full reconstruction subject to the total (for all scalable layers) bit budget constraint. Based on the chosen vertex-based representation, we solve the problem of determining the number and locations of approximating vertices for all scalable layers jointly and optimally. The number of scalable layers is not constrained, but, rather, is a by-product of the proposed optimization. The algorithm employs two different coding strategies: one for the base layer and one for the enhancement layers. By carefully defining scalable layer recursion and base layer segment costs the problem is solved by executing a directed acyclic graph (DAG) shortest path algorithm.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126866611","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-12-01DOI: 10.1109/ICIP.2000.899329
Tomoko Takahara, M. Okuda, M. Ikehara, Shinichi Takahashi
It has been proposed that resolution progressiveness is one of the most important techniques for image compression. In this paper, we offer a new resolution progressive coding method. The main point stresses how to exploit self-similarity across different scales of wavelet transform by sorting the coefficients. Wavelet transformed images inherently have correlation between subbands at different levels in a spatial decomposition hierarchy, and thus exploiting the correlation of the hierarchy helps to compress the amount of information of images. A number of methods with SNR progressive coding have been presented so far; however, this proposed method concerns resolution progressiveness as well as SNR progressiveness, which can be only applied in each subband, and still be effective and computationally very simple for image compression.
{"title":"A new resolution progressive coding scheme using a sorting algorithm","authors":"Tomoko Takahara, M. Okuda, M. Ikehara, Shinichi Takahashi","doi":"10.1109/ICIP.2000.899329","DOIUrl":"https://doi.org/10.1109/ICIP.2000.899329","url":null,"abstract":"It has been proposed that resolution progressiveness is one of the most important techniques for image compression. In this paper, we offer a new resolution progressive coding method. The main point stresses how to exploit self-similarity across different scales of wavelet transform by sorting the coefficients. Wavelet transformed images inherently have correlation between subbands at different levels in a spatial decomposition hierarchy, and thus exploiting the correlation of the hierarchy helps to compress the amount of information of images. A number of methods with SNR progressive coding have been presented so far; however, this proposed method concerns resolution progressiveness as well as SNR progressiveness, which can be only applied in each subband, and still be effective and computationally very simple for image compression.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134588749","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-12-01DOI: 10.1109/ICIP.2000.899232
R. Dugad, N. Ahuja
We present a scheme for jointly watermarking and compressing digital video. The amount of watermark added is adapted to the expected degradation of the watermark due to compression. This results in a more robust watermark. This is achieved without any appreciable decrease in the quality of the decoded video compared to the case when the watermark is not adaptive. Results are presented for the flower garden sequence.
{"title":"A scheme for joint watermarking and compression of video","authors":"R. Dugad, N. Ahuja","doi":"10.1109/ICIP.2000.899232","DOIUrl":"https://doi.org/10.1109/ICIP.2000.899232","url":null,"abstract":"We present a scheme for jointly watermarking and compressing digital video. The amount of watermark added is adapted to the expected degradation of the watermark due to compression. This results in a more robust watermark. This is achieved without any appreciable decrease in the quality of the decoded video compared to the case when the watermark is not adaptive. Results are presented for the flower garden sequence.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121036463","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-12-01DOI: 10.1109/ICIP.2000.899842
Ying-Jui Chen, S. Oraintara, Truong Q. Nguyen
This paper describes the implementation of the integer discrete cosine transform (IntDCT) using the Walsh-Hadamard transform and the lifting scheme. The implementation is in the forms of shifts and adds, and all internal nodes have finite precision. A general-purpose scheme of 8-pt IntDCT with complexity of 45 adds and 18 shifts is proposed which gives comparable performance to the floating-point DCT (FloatDCT). For this particular scheme with 8-bit input, perfect reconstruction (PR) is preserved even when all the internal nodes are limited to 16-bit words, rendering the Pentium MMX optimization possible. Implementation has been done to incorporate the proposed IntDCT into the H.263+ coder, and the resulting system performs equally well as the original. Further extension to the MPEG coder is straightforward. The proposed IntDCT is reversible, with a low level of power consumption, and is very suitable for source coding, and communication, etc. in a mobile environment.
{"title":"Video compression using integer DCT","authors":"Ying-Jui Chen, S. Oraintara, Truong Q. Nguyen","doi":"10.1109/ICIP.2000.899842","DOIUrl":"https://doi.org/10.1109/ICIP.2000.899842","url":null,"abstract":"This paper describes the implementation of the integer discrete cosine transform (IntDCT) using the Walsh-Hadamard transform and the lifting scheme. The implementation is in the forms of shifts and adds, and all internal nodes have finite precision. A general-purpose scheme of 8-pt IntDCT with complexity of 45 adds and 18 shifts is proposed which gives comparable performance to the floating-point DCT (FloatDCT). For this particular scheme with 8-bit input, perfect reconstruction (PR) is preserved even when all the internal nodes are limited to 16-bit words, rendering the Pentium MMX optimization possible. Implementation has been done to incorporate the proposed IntDCT into the H.263+ coder, and the resulting system performs equally well as the original. Further extension to the MPEG coder is straightforward. The proposed IntDCT is reversible, with a low level of power consumption, and is very suitable for source coding, and communication, etc. in a mobile environment.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116432378","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-12-01DOI: 10.1109/ICIP.2000.899855
Jui-Tai Ko, Sheng-Jyh Wang
A new scheme, which automatically generates a hierarchical mesh from a real image, is proposed. First, three distinct meshes are generated according to a three-layer image pyramid. By eliminating the duplicated mesh nodes between these three meshes, a hierarchical mesh is formed. Because each hierarchy represents the image in different resolutions, this hierarchical structure can achieve progressive coding. Furthermore, to generate a dynamic mesh for an image sequence, this hierarchical structure can help to reduce the computation complexity through the tracking of mesh nodes in the sequence. A method is also proposed to predict the moving direction of mesh nodes and to facilitate the motion estimation.
{"title":"A coarse-to-fine approach for the generation and tracking of mesh objects from a natural image sequence","authors":"Jui-Tai Ko, Sheng-Jyh Wang","doi":"10.1109/ICIP.2000.899855","DOIUrl":"https://doi.org/10.1109/ICIP.2000.899855","url":null,"abstract":"A new scheme, which automatically generates a hierarchical mesh from a real image, is proposed. First, three distinct meshes are generated according to a three-layer image pyramid. By eliminating the duplicated mesh nodes between these three meshes, a hierarchical mesh is formed. Because each hierarchy represents the image in different resolutions, this hierarchical structure can achieve progressive coding. Furthermore, to generate a dynamic mesh for an image sequence, this hierarchical structure can help to reduce the computation complexity through the tracking of mesh nodes in the sequence. A method is also proposed to predict the moving direction of mesh nodes and to facilitate the motion estimation.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133231107","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-12-01DOI: 10.1109/ICIP.2000.899825
Jiann-Jone Chen, C. Chiang, David W. Lin
Several ways of 2D shape (or contour) description in terms of Fourier and wavelet transform coefficients have been proposed. They provide data compression capability, and some of the descriptors are invariant under scaling, rotation, and choice of the starting point for contour tracing. Several methods for 3D shape description also exist. However, they lack either the simplicity, the generality, or the data compression ability comparable to the 2D methods. We propose a generalized sampling method for efficient description of free-form 3D shape surfaces. The key idea is to warp a 3D spherical coordinate system onto the 3D surface, so that the spatial coordinates of each point on the surface may be represented parametrically as {x(/spl alpha/,/spl beta/), y(/spl alpha/,/spl beta/), z(/spl alpha/,/spl beta/)}, where /spl les//spl alpha//spl les/2/spl pi/ and 0/spl les//spl beta//spl les//spl pi/ with /spl alpha/ and /spl beta/ giving normalized arc lengths on the 3D surface. Fourier, wavelet, or other 2D transforms can then be applied to the three coordinate functions for purposes of data compression, database storage, or indexing. Simulations show that wavelet-based method yields efficient 3D shape compression based on this generalized sampling approach.
{"title":"A generalized 3D shape sampling method and file format for storage or indexing","authors":"Jiann-Jone Chen, C. Chiang, David W. Lin","doi":"10.1109/ICIP.2000.899825","DOIUrl":"https://doi.org/10.1109/ICIP.2000.899825","url":null,"abstract":"Several ways of 2D shape (or contour) description in terms of Fourier and wavelet transform coefficients have been proposed. They provide data compression capability, and some of the descriptors are invariant under scaling, rotation, and choice of the starting point for contour tracing. Several methods for 3D shape description also exist. However, they lack either the simplicity, the generality, or the data compression ability comparable to the 2D methods. We propose a generalized sampling method for efficient description of free-form 3D shape surfaces. The key idea is to warp a 3D spherical coordinate system onto the 3D surface, so that the spatial coordinates of each point on the surface may be represented parametrically as {x(/spl alpha/,/spl beta/), y(/spl alpha/,/spl beta/), z(/spl alpha/,/spl beta/)}, where /spl les//spl alpha//spl les/2/spl pi/ and 0/spl les//spl beta//spl les//spl pi/ with /spl alpha/ and /spl beta/ giving normalized arc lengths on the 3D surface. Fourier, wavelet, or other 2D transforms can then be applied to the three coordinate functions for purposes of data compression, database storage, or indexing. Simulations show that wavelet-based method yields efficient 3D shape compression based on this generalized sampling approach.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121314797","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-12-01DOI: 10.1109/ICIP.2000.899288
Jianbo Ma, N. Ahuja, C. Neti, A. Senior
In appearance based face recognition, lip reading, etc., eigen face and eigen lip are used for recognition. The pose changes of the human head in a video sequence often cause errors in the eigen space comparison stage, because the frontal-pose assumption has been violated. We propose a new method to compensate the pose changes by exploiting the general symmetry of human face. From the imaging geometry we show that a frontal pose can be recovered from only one profile view. The resulting pose compensation method has the following advantages: (1) it only requires one profile image; (2) it does not need any 3D model; (3) it does not need accurate feature detection. Experimental results in the context of lip images are given to show the effectiveness of our method.
{"title":"Recovering frontal-pose image from a single profile image","authors":"Jianbo Ma, N. Ahuja, C. Neti, A. Senior","doi":"10.1109/ICIP.2000.899288","DOIUrl":"https://doi.org/10.1109/ICIP.2000.899288","url":null,"abstract":"In appearance based face recognition, lip reading, etc., eigen face and eigen lip are used for recognition. The pose changes of the human head in a video sequence often cause errors in the eigen space comparison stage, because the frontal-pose assumption has been violated. We propose a new method to compensate the pose changes by exploiting the general symmetry of human face. From the imaging geometry we show that a frontal pose can be recovered from only one profile view. The resulting pose compensation method has the following advantages: (1) it only requires one profile image; (2) it does not need any 3D model; (3) it does not need accurate feature detection. Experimental results in the context of lip images are given to show the effectiveness of our method.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121929396","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-12-01DOI: 10.1109/ICIP.2000.899333
Hao Pan, Zhi-Pei Liang, Thomas S. Huang
In this paper, the audio and visual features of speech are integrated using a novel fused-HMM. We assume that the two sets of features may have different data rates and duration. Hidden Markov models (HMMs) are first used to model them separately, and then a general Bayesian fusion method, which is optimal in the maximum entropy sense, is employed to fuse them together. Particularly, an efficient learning algorithm is introduced. Instead of maximizing the joint likelihood of the fuse-HMM, the learning algorithm maximizes the two HMMs separately, and then fuses the HMMs together. In addition, an inference algorithm is proposed. We have tested the proposed method by person verification experiments. Results show that the proposed method significantly reduces the recognition error rates as compared to the unimodal HMMs and the loosely-coupled fusion model.
{"title":"Fusing audio and visual features of speech","authors":"Hao Pan, Zhi-Pei Liang, Thomas S. Huang","doi":"10.1109/ICIP.2000.899333","DOIUrl":"https://doi.org/10.1109/ICIP.2000.899333","url":null,"abstract":"In this paper, the audio and visual features of speech are integrated using a novel fused-HMM. We assume that the two sets of features may have different data rates and duration. Hidden Markov models (HMMs) are first used to model them separately, and then a general Bayesian fusion method, which is optimal in the maximum entropy sense, is employed to fuse them together. Particularly, an efficient learning algorithm is introduced. Instead of maximizing the joint likelihood of the fuse-HMM, the learning algorithm maximizes the two HMMs separately, and then fuses the HMMs together. In addition, an inference algorithm is proposed. We have tested the proposed method by person verification experiments. Results show that the proposed method significantly reduces the recognition error rates as compared to the unimodal HMMs and the loosely-coupled fusion model.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"28 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134441613","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
扫码关注我们
求助内容：
应助结果提醒方式：