Computer analysis of images and patterns : proceedings of the ... International Conference on Automatic Image Processing. International Conference on Automatic Image Processing最新文献
Pub Date : 1997-10-26DOI: 10.1109/ICIP.1997.632200
Eung-Tae Kim, Jong-Ki Han, Hyung-Myung Kim
In this paper, we describe a method for estimating and compensating 3D camera motion in image sequences for applications to the video coding system. To effectively estimate camera motion parameters (zoom, pan, tilt, swing, and focal length) from image sequences, we propose a new linear motion parameter equation and use the Kalman filtering method to solve it. Unlike the existing linear techniques, the proposed linear method accurately estimates the large rotation angles and the focal length. Experimental results show that the proposed method outperforms the conventional linear methods, especially for a large rotation angle.
{"title":"A Kalman-filtering method for 3D camera motion estimation from image sequences","authors":"Eung-Tae Kim, Jong-Ki Han, Hyung-Myung Kim","doi":"10.1109/ICIP.1997.632200","DOIUrl":"https://doi.org/10.1109/ICIP.1997.632200","url":null,"abstract":"In this paper, we describe a method for estimating and compensating 3D camera motion in image sequences for applications to the video coding system. To effectively estimate camera motion parameters (zoom, pan, tilt, swing, and focal length) from image sequences, we propose a new linear motion parameter equation and use the Kalman filtering method to solve it. Unlike the existing linear techniques, the proposed linear method accurately estimates the large rotation angles and the focal length. Experimental results show that the proposed method outperforms the conventional linear methods, especially for a large rotation angle.","PeriodicalId":92344,"journal":{"name":"Computer analysis of images and patterns : proceedings of the ... International Conference on Automatic Image Processing. International Conference on Automatic Image Processing","volume":"126 1","pages":"630-633 vol.3"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73440948","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 : 1997-10-26DOI: 10.1109/ICIP.1997.648021
Y. B. Karasik
A mapping of N-dimensional images to (N-1)-dimensional ones without loss of information is proposed which allows one to reduce N-dimensional image processing to (N-1)-dimensional one.
{"title":"How to implement N-dimensional image processing optically","authors":"Y. B. Karasik","doi":"10.1109/ICIP.1997.648021","DOIUrl":"https://doi.org/10.1109/ICIP.1997.648021","url":null,"abstract":"A mapping of N-dimensional images to (N-1)-dimensional ones without loss of information is proposed which allows one to reduce N-dimensional image processing to (N-1)-dimensional one.","PeriodicalId":92344,"journal":{"name":"Computer analysis of images and patterns : proceedings of the ... International Conference on Automatic Image Processing. International Conference on Automatic Image Processing","volume":"19 1","pages":"715-718 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76749592","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 : 1997-10-26DOI: 10.1109/ICIP.1997.638833
T. Ikenaga, T. Ogura
This paper proposes a real-time morphology processing method based on a highly-parallel 2D cellular automata called CAM/sup 2/ (cellular automata on content addressable memory) that can attain pixel-order parallelism (several hundred thousands) on a single PC board. Evaluation results show that CAM/sup 2/ can perform various types of morphology processing within video rates, indicating it could be a promising platform for processing morphology.
{"title":"Real-time morphology processing using highly parallel 2D cellular automata CAM/sup 2/","authors":"T. Ikenaga, T. Ogura","doi":"10.1109/ICIP.1997.638833","DOIUrl":"https://doi.org/10.1109/ICIP.1997.638833","url":null,"abstract":"This paper proposes a real-time morphology processing method based on a highly-parallel 2D cellular automata called CAM/sup 2/ (cellular automata on content addressable memory) that can attain pixel-order parallelism (several hundred thousands) on a single PC board. Evaluation results show that CAM/sup 2/ can perform various types of morphology processing within video rates, indicating it could be a promising platform for processing morphology.","PeriodicalId":92344,"journal":{"name":"Computer analysis of images and patterns : proceedings of the ... International Conference on Automatic Image Processing. International Conference on Automatic Image Processing","volume":"2 1","pages":"562-565 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76888001","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 : 1997-10-26DOI: 10.1109/ICIP.1997.638696
Toshiyuki Yoshida, H. Katoh, Y. Sakai
This paper proposes a motion estimation technique to improve accuracy and coherence of motion vectors estimated by the standard block matching technique. The proposed technique is based on a matching block integration using a reliability metric of motion vectors. First, the reliability metric is computed for all the matching blocks in the target image and then, based on this value and its dependency on the direction, four neighboring matching blocks are checked whether they should be integrated or not. Finally, motion vectors are estimated for the integrated matching blocks by the block matching technique. Since the block integration is performed only for flat matching blocks or those with a simple edge, the coherence is improved while the performance of motion compensation is kept as far as possible. The examples given show the effectiveness of the proposed approach.
{"title":"Block matching motion estimation using block integration based on reliability metric","authors":"Toshiyuki Yoshida, H. Katoh, Y. Sakai","doi":"10.1109/ICIP.1997.638696","DOIUrl":"https://doi.org/10.1109/ICIP.1997.638696","url":null,"abstract":"This paper proposes a motion estimation technique to improve accuracy and coherence of motion vectors estimated by the standard block matching technique. The proposed technique is based on a matching block integration using a reliability metric of motion vectors. First, the reliability metric is computed for all the matching blocks in the target image and then, based on this value and its dependency on the direction, four neighboring matching blocks are checked whether they should be integrated or not. Finally, motion vectors are estimated for the integrated matching blocks by the block matching technique. Since the block integration is performed only for flat matching blocks or those with a simple edge, the coherence is improved while the performance of motion compensation is kept as far as possible. The examples given show the effectiveness of the proposed approach.","PeriodicalId":92344,"journal":{"name":"Computer analysis of images and patterns : proceedings of the ... International Conference on Automatic Image Processing. International Conference on Automatic Image Processing","volume":"327 1","pages":"152-155 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75048444","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 : 1997-10-26DOI: 10.1109/ICIP.1997.638721
H. Heijmans
Connected morphological operators act on the level of the flat zones of an image, i.e., the connected regions where the grey-level is constant. For binary images, the flat zones are the foreground and background grains (connected components) of the image. The flat zones constitute a partition of the underlying space. A connected operator is an operator that makes this partition coarser. A grain operator is a connected operator that is uniquely specified by two grain criteria, one for the foreground and one for the background components. This paper provides a discussion of connected operators and grain operators with an emphasis on connected filters, all in the context of binary images.
{"title":"Connected morphological operators and filters for binary images","authors":"H. Heijmans","doi":"10.1109/ICIP.1997.638721","DOIUrl":"https://doi.org/10.1109/ICIP.1997.638721","url":null,"abstract":"Connected morphological operators act on the level of the flat zones of an image, i.e., the connected regions where the grey-level is constant. For binary images, the flat zones are the foreground and background grains (connected components) of the image. The flat zones constitute a partition of the underlying space. A connected operator is an operator that makes this partition coarser. A grain operator is a connected operator that is uniquely specified by two grain criteria, one for the foreground and one for the background components. This paper provides a discussion of connected operators and grain operators with an emphasis on connected filters, all in the context of binary images.","PeriodicalId":92344,"journal":{"name":"Computer analysis of images and patterns : proceedings of the ... International Conference on Automatic Image Processing. International Conference on Automatic Image Processing","volume":"94 1","pages":"211-214 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76321398","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 : 1997-10-26DOI: 10.1109/ICIP.1997.647411
J. Ni, K. Ho, K. Tse, J. Ni, M. Shen
Conventional synthesis filters in subband systems lose their optimality when additive noise due, for example, to signal quantization, disturbs the subband components. The multichannel representation of the subband signal is combined with the statistical model of the input signal to derive the multirate state-space model for a filter bank system with additive noise. Thus the signal reconstruction problem in the subband system can be formulated as the process of optimal state estimation in the equivalent multirate state-space model. With the input signal embedded in the state vector, the multirate Kalman filtering provides the minimum-variance reconstruction of the input signal. Using the powerful Kronecker product notation, the results and derivations can then be extended to the 2-D cases. Incorporated with the vector dynamical model, the 2-D multirate state-space model for 2-D Kalman filtering is developed. Computer simulation with the proposed 2-D multirate Kalman filter gives favorable results.
{"title":"Multirate Kalman filtering approach for optimal two-dimensional signal reconstruction from noisy subband systems","authors":"J. Ni, K. Ho, K. Tse, J. Ni, M. Shen","doi":"10.1109/ICIP.1997.647411","DOIUrl":"https://doi.org/10.1109/ICIP.1997.647411","url":null,"abstract":"Conventional synthesis filters in subband systems lose their optimality when additive noise due, for example, to signal quantization, disturbs the subband components. The multichannel representation of the subband signal is combined with the statistical model of the input signal to derive the multirate state-space model for a filter bank system with additive noise. Thus the signal reconstruction problem in the subband system can be formulated as the process of optimal state estimation in the equivalent multirate state-space model. With the input signal embedded in the state vector, the multirate Kalman filtering provides the minimum-variance reconstruction of the input signal. Using the powerful Kronecker product notation, the results and derivations can then be extended to the 2-D cases. Incorporated with the vector dynamical model, the 2-D multirate state-space model for 2-D Kalman filtering is developed. Computer simulation with the proposed 2-D multirate Kalman filter gives favorable results.","PeriodicalId":92344,"journal":{"name":"Computer analysis of images and patterns : proceedings of the ... International Conference on Automatic Image Processing. International Conference on Automatic Image Processing","volume":"1 1","pages":"157-160 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75774711","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 : 1997-10-26DOI: 10.1109/ICIP.1997.638794
N. Redding, R. Whatmough
This paper presents a method for extracting features from images using implicit quartics in two variables. These features have been particularly designed to be appropriate for the image understanding problem involving oblique ionograms, but they are more generally applicable. Attention is given to the problem of choosing a suitable fitting metric, and the paper presents a robust procedure (exact orthogonal distance regression) for achieving a good fit.
{"title":"Fitting implicit quartics for use in feature extraction","authors":"N. Redding, R. Whatmough","doi":"10.1109/ICIP.1997.638794","DOIUrl":"https://doi.org/10.1109/ICIP.1997.638794","url":null,"abstract":"This paper presents a method for extracting features from images using implicit quartics in two variables. These features have been particularly designed to be appropriate for the image understanding problem involving oblique ionograms, but they are more generally applicable. Attention is given to the problem of choosing a suitable fitting metric, and the paper presents a robust procedure (exact orthogonal distance regression) for achieving a good fit.","PeriodicalId":92344,"journal":{"name":"Computer analysis of images and patterns : proceedings of the ... International Conference on Automatic Image Processing. International Conference on Automatic Image Processing","volume":"8 1","pages":"410-413 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74775965","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 : 1997-10-26DOI: 10.1109/ICIP.1997.647396
L. Yin, A. Basu
We present an approach for modeling a person's face for model-based coding (MPEG4) which will cater to very low bit-rate video-conferencing applications. This approach is performed entirely automatically. We utilize two views of a person's face, and the fiducial points defined on a generic facial model, to modify the generic model into a 3D individual model of a face. To deform the generated individual facial model for tracking the expression of a face over time, a new method named the layered force spreading method (LFSM) is proposed which makes the animation of facial expressions looks more natural. The feasibility of our approach is demonstrated using a real facial image.
{"title":"MPEG4 face modeling using fiducial points","authors":"L. Yin, A. Basu","doi":"10.1109/ICIP.1997.647396","DOIUrl":"https://doi.org/10.1109/ICIP.1997.647396","url":null,"abstract":"We present an approach for modeling a person's face for model-based coding (MPEG4) which will cater to very low bit-rate video-conferencing applications. This approach is performed entirely automatically. We utilize two views of a person's face, and the fiducial points defined on a generic facial model, to modify the generic model into a 3D individual model of a face. To deform the generated individual facial model for tracking the expression of a face over time, a new method named the layered force spreading method (LFSM) is proposed which makes the animation of facial expressions looks more natural. The feasibility of our approach is demonstrated using a real facial image.","PeriodicalId":92344,"journal":{"name":"Computer analysis of images and patterns : proceedings of the ... International Conference on Automatic Image Processing. International Conference on Automatic Image Processing","volume":"15 1","pages":"109-112 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73189702","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 : 1997-10-26DOI: 10.1109/ICIP.1997.632033
T. Spisz, N. D'Costa, C. K. Seymour, J. Hoh, R. Reeves, I. Bankman
A processing algorithm was developed to detect and determine the lengths of DNA fragments in atomic force microscope images. The algorithm was designed to account for varying image conditions, fragment sizes, and background contamination, while minimizing the processing time to provide a high throughput. Although a large enough sample of images has not been tested yet to determine precisely the accuracy, we estimate the accuracy to be within 2 pixels based on analysis of an ideal simulated image and an actual image.
{"title":"Length determination of DNA fragments in atomic force microscope images","authors":"T. Spisz, N. D'Costa, C. K. Seymour, J. Hoh, R. Reeves, I. Bankman","doi":"10.1109/ICIP.1997.632033","DOIUrl":"https://doi.org/10.1109/ICIP.1997.632033","url":null,"abstract":"A processing algorithm was developed to detect and determine the lengths of DNA fragments in atomic force microscope images. The algorithm was designed to account for varying image conditions, fragment sizes, and background contamination, while minimizing the processing time to provide a high throughput. Although a large enough sample of images has not been tested yet to determine precisely the accuracy, we estimate the accuracy to be within 2 pixels based on analysis of an ideal simulated image and an actual image.","PeriodicalId":92344,"journal":{"name":"Computer analysis of images and patterns : proceedings of the ... International Conference on Automatic Image Processing. International Conference on Automatic Image Processing","volume":"49 1","pages":"154-157 vol.3"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74196637","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 : 1997-10-26DOI: 10.1109/ICIP.1997.638629
B. Bhanu, Bing Tian
We present a hidden Markov modeling (HMM) based approach for recognition of articulated objects in synthetic aperture radar (SAR) images. We develop multiple models for a given SAR image of an object and integrate these models synergistically using their probabilistic estimates for recognition and estimates of invariance of features as a result of articulation. The models are based on sequentialization of scattering centers extracted from SAR images. Experimental results are presented using 1440 training images and 2520 testing images for 4 classes.
{"title":"Stochastic models for recognition of articulated objects","authors":"B. Bhanu, Bing Tian","doi":"10.1109/ICIP.1997.638629","DOIUrl":"https://doi.org/10.1109/ICIP.1997.638629","url":null,"abstract":"We present a hidden Markov modeling (HMM) based approach for recognition of articulated objects in synthetic aperture radar (SAR) images. We develop multiple models for a given SAR image of an object and integrate these models synergistically using their probabilistic estimates for recognition and estimates of invariance of features as a result of articulation. The models are based on sequentialization of scattering centers extracted from SAR images. Experimental results are presented using 1440 training images and 2520 testing images for 4 classes.","PeriodicalId":92344,"journal":{"name":"Computer analysis of images and patterns : proceedings of the ... International Conference on Automatic Image Processing. International Conference on Automatic Image Processing","volume":"57 1","pages":"847-850 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74568351","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}
Computer analysis of images and patterns : proceedings of the ... International Conference on Automatic Image Processing. International Conference on Automatic Image Processing
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：