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.632027
Helge B. D. Sørensen, K. Jakobsen, Ole Nymann
A computational efficient approach to identify very small mine-shaped plastic objects, e.g. M56 Anti-Personnel (AP) mines buried in the ground, is presented. The size of the objects equals the smallest AP-mines in use today, i.e., the most difficult mines to detect with respect to humanitarian mine clearance. Our approach consists of three stages, the phase stepped-frequency radar method, generation of a quarternary image and template crosscorrelation. The phase stepped-frequency radar method belongs to the class of stepped-frequency radar methods. In a two-dimensional mesh-grid above the ground a radar probe is moved automatically to measure in each grid point a set of reflection coefficients from which phase and amplitude information are extracted. Based on a simple processing of the phase information, quarternary image and template cross-correlation a successful detection of metal- and non-metal mine-shaped objects is possible. Measurements have been performed on loamy soil containing different mine-shaped objects.
{"title":"Identification of mine-shaped objects based on an efficient phase stepped-frequency radar approach","authors":"Helge B. D. Sørensen, K. Jakobsen, Ole Nymann","doi":"10.1109/ICIP.1997.632027","DOIUrl":"https://doi.org/10.1109/ICIP.1997.632027","url":null,"abstract":"A computational efficient approach to identify very small mine-shaped plastic objects, e.g. M56 Anti-Personnel (AP) mines buried in the ground, is presented. The size of the objects equals the smallest AP-mines in use today, i.e., the most difficult mines to detect with respect to humanitarian mine clearance. Our approach consists of three stages, the phase stepped-frequency radar method, generation of a quarternary image and template crosscorrelation. The phase stepped-frequency radar method belongs to the class of stepped-frequency radar methods. In a two-dimensional mesh-grid above the ground a radar probe is moved automatically to measure in each grid point a set of reflection coefficients from which phase and amplitude information are extracted. Based on a simple processing of the phase information, quarternary image and template cross-correlation a successful detection of metal- and non-metal mine-shaped objects is possible. Measurements have been performed on loamy soil containing different mine-shaped objects.","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":"6 1","pages":"142-145 vol.3"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72904125","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.648084
T. Kite, B. Evans, A. Bovik, T. L. Sculley
The error diffusion algorithm for digital halftoning is equivalent in form to a noise-shaping feedback coder, a class of delta-sigma modulator. The white noise assumption of the quantizer error is known to be false; in fact, the quantizer error is seen to be highly correlated with the input image. To account for this correlation, we use a gain model for the quantizer. This model accurately predicts the edge sharpening and noise shaping caused by all error diffusion schemes. It also permits an extension of error diffusion to oversampled imagery.
{"title":"Digital halftoning as 2-D delta-sigma modulation","authors":"T. Kite, B. Evans, A. Bovik, T. L. Sculley","doi":"10.1109/ICIP.1997.648084","DOIUrl":"https://doi.org/10.1109/ICIP.1997.648084","url":null,"abstract":"The error diffusion algorithm for digital halftoning is equivalent in form to a noise-shaping feedback coder, a class of delta-sigma modulator. The white noise assumption of the quantizer error is known to be false; in fact, the quantizer error is seen to be highly correlated with the input image. To account for this correlation, we use a gain model for the quantizer. This model accurately predicts the edge sharpening and noise shaping caused by all error diffusion schemes. It also permits an extension of error diffusion to oversampled imagery.","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":"13 1","pages":"799-802 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72905724","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.631996
Y. Altunbasak
This paper presents an object-based image coding scheme, where each image object is encoded individually, provided that their boundaries are specified. This allows object-based quality scalability, in addition to mixing lossy and lossless coding modes depending on the requirements of each image object. Furthermore, we propose a new object coding method using 2-D mesh-based image sampling in which the quadrilateral mesh patches are warped into square blocks, and encoded by traditional data/waveform coding methods. Experimental results on test images are provided.
{"title":"Object-scalable mesh-based coding of synthetic and natural image objects","authors":"Y. Altunbasak","doi":"10.1109/ICIP.1997.631996","DOIUrl":"https://doi.org/10.1109/ICIP.1997.631996","url":null,"abstract":"This paper presents an object-based image coding scheme, where each image object is encoded individually, provided that their boundaries are specified. This allows object-based quality scalability, in addition to mixing lossy and lossless coding modes depending on the requirements of each image object. Furthermore, we propose a new object coding method using 2-D mesh-based image sampling in which the quadrilateral mesh patches are warped into square blocks, and encoded by traditional data/waveform coding methods. Experimental results on test images are provided.","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":"9 1","pages":"94-97 vol.3"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73297008","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.632090
M. Soumekh
This paper addresses the problem of fusing the information content of two uncalibrated sensors. This problem arises in registering images of a scene when it is viewed via two different sensory systems, or detecting change in a scene when it is viewed at two different time points by a sensory system, or via two different sensory systems or observation channels. We are concerned with sensory systems which have not only a relative shift, scaling and rotational calibration error, but also an unknown point spread function (that is time-varying for a single sensor, or different for two sensors). By modeling one image in terms of an unknown linear combination of the other image, its powers and their spatially-transformed (shift, rotation and scaling) versions, a signal subspace processing is developed for fusing uncalibrated sensors. The proposed method is shown to be applicable in moving target detection (MTD) using monopulse synthetic aperture radar (SAR) with uncalibrated radars. Results are shown for video, magnetic resonance images of a human brain, moving target detector monopulse SAR, and registration of SAR images of a target obtained via two different radars or at different coordinates by the same radar for automatic target recognition (ATR).
{"title":"Signal subspace fusion of uncalibrated sensors with application in SAR, diagnostic medicine and video processing","authors":"M. Soumekh","doi":"10.1109/ICIP.1997.632090","DOIUrl":"https://doi.org/10.1109/ICIP.1997.632090","url":null,"abstract":"This paper addresses the problem of fusing the information content of two uncalibrated sensors. This problem arises in registering images of a scene when it is viewed via two different sensory systems, or detecting change in a scene when it is viewed at two different time points by a sensory system, or via two different sensory systems or observation channels. We are concerned with sensory systems which have not only a relative shift, scaling and rotational calibration error, but also an unknown point spread function (that is time-varying for a single sensor, or different for two sensors). By modeling one image in terms of an unknown linear combination of the other image, its powers and their spatially-transformed (shift, rotation and scaling) versions, a signal subspace processing is developed for fusing uncalibrated sensors. The proposed method is shown to be applicable in moving target detection (MTD) using monopulse synthetic aperture radar (SAR) with uncalibrated radars. Results are shown for video, magnetic resonance images of a human brain, moving target detector monopulse SAR, and registration of SAR images of a target obtained via two different radars or at different coordinates by the same radar for automatic target recognition (ATR).","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":"280-283 vol.3"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79895929","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.632216
Jincheng Huang, Yao Wang, E. Wong
An emerging trend in the banking industry is to digitize checks for storage and transmission. An immediate requirement for efficient storage and transmission is check image compression. General purpose compression algorithms such as JPEG and wavelet-based methods produce annoying ringing and blocking artifacts at high compression ratios. A layered approach to check image compression is proposed, based on which a check image is represented in several layers. The first layer describes the foreground map; the second layer specifies the gray levels of foreground pixels; the third layer is a lossy representation of the background image; and the fourth layer describes the error between the original and the reconstructed image based on the first three layers. The layered coding approach produces images of better quality than traditional JPEG and wavelet coding methods, especially in the foreground, i.e., the text and graphics. In addition, this approach allows progressive retrieval or transmission of different image layers.
{"title":"Check image compression: a comparison of JPEG, wavelet and layered coding methods","authors":"Jincheng Huang, Yao Wang, E. Wong","doi":"10.1109/ICIP.1997.632216","DOIUrl":"https://doi.org/10.1109/ICIP.1997.632216","url":null,"abstract":"An emerging trend in the banking industry is to digitize checks for storage and transmission. An immediate requirement for efficient storage and transmission is check image compression. General purpose compression algorithms such as JPEG and wavelet-based methods produce annoying ringing and blocking artifacts at high compression ratios. A layered approach to check image compression is proposed, based on which a check image is represented in several layers. The first layer describes the foreground map; the second layer specifies the gray levels of foreground pixels; the third layer is a lossy representation of the background image; and the fourth layer describes the error between the original and the reconstructed image based on the first three layers. The layered coding approach produces images of better quality than traditional JPEG and wavelet coding methods, especially in the foreground, i.e., the text and graphics. In addition, this approach allows progressive retrieval or transmission of different image layers.","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":"51 1","pages":"694-697 vol.3"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79988916","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.647404
G. Sankar, Sumana Gupta
It is known that the convolution back-projection (CBP) operator used for reconstruction of images from its 1D projections has a non-local filter that requires global projection data. The exposure time of the object to harmful radiation is thereby increased. It has been proved that the filtering operation done on a chosen wavelet function instead of the projections leads to a localised filter and minimises the number of projections needed to reconstruct the region of interest (ROI) in the image. This concept was extended using two dimensional and one dimensional multiresolution analysis filter banks, in which the filters are combined with the non-local CBP filter to get short length filters. In this paper it is proved that the presence of unwanted information in all previous algorithms is due to aliasing and a new algorithm is proposed for reconstruction without any aliasing. The proposed scheme is implemented using Shepp-Logon phantom head and the performance is compared.
{"title":"A new technique for region of interest tomographic image reconstruction and a comparison of the related algorithms","authors":"G. Sankar, Sumana Gupta","doi":"10.1109/ICIP.1997.647404","DOIUrl":"https://doi.org/10.1109/ICIP.1997.647404","url":null,"abstract":"It is known that the convolution back-projection (CBP) operator used for reconstruction of images from its 1D projections has a non-local filter that requires global projection data. The exposure time of the object to harmful radiation is thereby increased. It has been proved that the filtering operation done on a chosen wavelet function instead of the projections leads to a localised filter and minimises the number of projections needed to reconstruct the region of interest (ROI) in the image. This concept was extended using two dimensional and one dimensional multiresolution analysis filter banks, in which the filters are combined with the non-local CBP filter to get short length filters. In this paper it is proved that the presence of unwanted information in all previous algorithms is due to aliasing and a new algorithm is proposed for reconstruction without any aliasing. The proposed scheme is implemented using Shepp-Logon phantom head and the performance is compared.","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":"39 1","pages":"141-144 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80311606","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.647798
Yuan Zou, W. Dunsmuir
Generalized max/median filtering is defined as an extension of max/median filtering. Properties for these extensions are given. The output distribution of generalized max/median filtering with independent but not identical inputs is derived and applied to the special case of regular max/median filtering thereby providing a new result. Based on these distribution results, it is shown that max/median and generalized max/median filtering can preserve image details.
{"title":"Generalized max/median filtering","authors":"Yuan Zou, W. Dunsmuir","doi":"10.1109/ICIP.1997.647798","DOIUrl":"https://doi.org/10.1109/ICIP.1997.647798","url":null,"abstract":"Generalized max/median filtering is defined as an extension of max/median filtering. Properties for these extensions are given. The output distribution of generalized max/median filtering with independent but not identical inputs is derived and applied to the special case of regular max/median filtering thereby providing a new result. Based on these distribution results, it is shown that max/median and generalized max/median filtering can preserve image details.","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":"28 1","pages":"428-431 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80450443","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.638606
A. R. Mirhosseini, Hong Yan, K. Lam, Catherine Chen
An automatic algorithm to extract mouth boundaries in human face images is proposed. The algorithm is based on a hierarchical model adaptation scheme using deformable models. The knowledge about the shape of the object is used to define its initial deformable template. Each mouth boundary curve is initially formed based on three control points whose locations are found through an optimization process using a suitable cost functional. The cost functional captures the essential knowledge about the shape for perceptual organization. Two control points are the mouth corners, which are used as the initial location of the mouth after an approximate mouth window is found based on locating the head boundary. The model is hierarchically improved in the second stage of the algorithm. Each boundary curve is finely tuned using more control points. An old model is adaptively replaced by a new model only if a secondary cost is further reduced. The results show that the model adaptation technique satisfactorily enhances the mouth boundary model in an automated fashion.
{"title":"A hierarchical and adaptive deformable model for mouth boundary detection","authors":"A. R. Mirhosseini, Hong Yan, K. Lam, Catherine Chen","doi":"10.1109/ICIP.1997.638606","DOIUrl":"https://doi.org/10.1109/ICIP.1997.638606","url":null,"abstract":"An automatic algorithm to extract mouth boundaries in human face images is proposed. The algorithm is based on a hierarchical model adaptation scheme using deformable models. The knowledge about the shape of the object is used to define its initial deformable template. Each mouth boundary curve is initially formed based on three control points whose locations are found through an optimization process using a suitable cost functional. The cost functional captures the essential knowledge about the shape for perceptual organization. Two control points are the mouth corners, which are used as the initial location of the mouth after an approximate mouth window is found based on locating the head boundary. The model is hierarchically improved in the second stage of the algorithm. Each boundary curve is finely tuned using more control points. An old model is adaptively replaced by a new model only if a secondary cost is further reduced. The results show that the model adaptation technique satisfactorily enhances the mouth boundary model in an automated fashion.","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":"756-759 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82548697","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.638665
D. Lin, Jiann-Jone Chen
We consider optimal coding of video sequences in the sense of employing an optimal selection of quantization scales under buffer and channel constraints. As a result of the delayed-coding framework, multiple rate constraints emerge, leading to the appearance of multiple Lagrange multipliers in a Lagrangian solution approach. We review the applicable Lagrangian optimization theory developed to-date, and present an efficient new solution algorithm.
{"title":"Efficient optimal rate-distortion coding of video sequences under multiple rate constraints","authors":"D. Lin, Jiann-Jone Chen","doi":"10.1109/ICIP.1997.638665","DOIUrl":"https://doi.org/10.1109/ICIP.1997.638665","url":null,"abstract":"We consider optimal coding of video sequences in the sense of employing an optimal selection of quantization scales under buffer and channel constraints. As a result of the delayed-coding framework, multiple rate constraints emerge, leading to the appearance of multiple Lagrange multipliers in a Lagrangian solution approach. We review the applicable Lagrangian optimization theory developed to-date, and present an efficient new solution algorithm.","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":"33 1","pages":"29-32 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76244543","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.632148
S. Regunathan, K. Rose
We focus on the design of robust video compression schemes for transmission over noisy channels. A multimode video coding framework is introduced, which enables optimizing the tradeoff between the conflicting objectives of high compression efficiency and error resilience. The starting point is a simple block-based predictive coder, with no motion compensation, for which we develop the robust multimode video compression scheme. The proposed iterative design algorithm for multimode video coders directly minimizes the overall rate-distortion cost. We show that several conventional joint source-channel coding mechanisms can be incorporated within a multimode scheme to further enhance the video coder performance. Simulation results of compressing benchmark video sequences for transmission over noisy channel conditions are presented. They demonstrate that multimode coders outperform conventional fixed length approaches and can achieve substantial gains of more than 6 dB in PSNR of the reconstructed picture.
{"title":"Multimode video coding for noisy channels","authors":"S. Regunathan, K. Rose","doi":"10.1109/ICIP.1997.632148","DOIUrl":"https://doi.org/10.1109/ICIP.1997.632148","url":null,"abstract":"We focus on the design of robust video compression schemes for transmission over noisy channels. A multimode video coding framework is introduced, which enables optimizing the tradeoff between the conflicting objectives of high compression efficiency and error resilience. The starting point is a simple block-based predictive coder, with no motion compensation, for which we develop the robust multimode video compression scheme. The proposed iterative design algorithm for multimode video coders directly minimizes the overall rate-distortion cost. We show that several conventional joint source-channel coding mechanisms can be incorporated within a multimode scheme to further enhance the video coder performance. Simulation results of compressing benchmark video sequences for transmission over noisy channel conditions are presented. They demonstrate that multimode coders outperform conventional fixed length approaches and can achieve substantial gains of more than 6 dB in PSNR of the reconstructed picture.","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":"56 1","pages":"432-435 vol.3"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86826035","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
扫码关注我们
求助内容：
应助结果提醒方式：