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.638660
G. Schuster, A. Katsaggelos
A major problem in object oriented video coding is the efficient encoding of the shape information of arbitrarily shaped objects. Efficient shape coding schemes are also needed in encoding the shape information of video object planes (VOP) in the MPEG-4 standard. In this paper, we present an efficient method for the lossy encoding of object shapes which are given as 8-connect chain codes (Meier et al., 1997). We approximate the object shape by a second order B-spline curve and consider the problem of finding the curve with the lowest bit rate for a given distortion. The presented scheme is optimal, efficient and offers complete control over the trade-off between bit-rate and distortion. We present results with the proposed scheme using objects shapes of different sizes.
面向对象视频编码的一个主要问题是对任意形状物体的形状信息进行有效的编码。在MPEG-4标准中，对视频对象平面(VOP)的形状信息进行编码也需要高效的形状编码方案。在本文中，我们提出了一种对物体形状进行有损编码的有效方法，这些形状以8连接链编码的形式给出(Meier et al.， 1997)。我们用二阶b样条曲线来近似物体的形状，并考虑在给定的失真情况下寻找具有最低比特率的曲线的问题。所提出的方案是最优的，高效的，并提供了完全控制比特率和失真之间的权衡。我们使用不同大小的物体形状给出了该方案的结果。
{"title":"An efficient boundary encoding scheme which is optimal in the rate distortion sense","authors":"G. Schuster, A. Katsaggelos","doi":"10.1109/ICIP.1997.638660","DOIUrl":"https://doi.org/10.1109/ICIP.1997.638660","url":null,"abstract":"A major problem in object oriented video coding is the efficient encoding of the shape information of arbitrarily shaped objects. Efficient shape coding schemes are also needed in encoding the shape information of video object planes (VOP) in the MPEG-4 standard. In this paper, we present an efficient method for the lossy encoding of object shapes which are given as 8-connect chain codes (Meier et al., 1997). We approximate the object shape by a second order B-spline curve and consider the problem of finding the curve with the lowest bit rate for a given distortion. The presented scheme is optimal, efficient and offers complete control over the trade-off between bit-rate and distortion. We present results with the proposed scheme using objects shapes of different sizes.","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":"158 1","pages":"9-12 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74878005","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.638713
N. Paragios, R. Deriche
This paper presents a framework for detecting multiple moving moving objects in a sequence of images. Using a statistical approach, where the inter-frame difference is modeled by a mixture of two Laplacian distributions and a deformable contour-based energy minimization approach, we reformulate the motion detection problem as a front propagation problem. Following the work of geodesic active contours, we transform the moving objects detection problem into an equivalent problem of geodesic computation, which is solved using a level set formulation scheme. To reduce the computational cost required by a direct implementation of the formulation scheme the narrow band technique is used. In order to further reduce the CPU time, a multi-scale approach has also been considered. Very promising experimental results are provided using real video sequences.
{"title":"Detecting multiple moving targets using deformable contours","authors":"N. Paragios, R. Deriche","doi":"10.1109/ICIP.1997.638713","DOIUrl":"https://doi.org/10.1109/ICIP.1997.638713","url":null,"abstract":"This paper presents a framework for detecting multiple moving moving objects in a sequence of images. Using a statistical approach, where the inter-frame difference is modeled by a mixture of two Laplacian distributions and a deformable contour-based energy minimization approach, we reformulate the motion detection problem as a front propagation problem. Following the work of geodesic active contours, we transform the moving objects detection problem into an equivalent problem of geodesic computation, which is solved using a level set formulation scheme. To reduce the computational cost required by a direct implementation of the formulation scheme the narrow band technique is used. In order to further reduce the CPU time, a multi-scale approach has also been considered. Very promising experimental results are provided using real video sequences.","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":"30 1","pages":"183-186 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73229704","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.631984
R. Queiroz, R. Eschbach
We present a novel technique for segmentation of a JPEG-compressed document based on block activity. The activity is measured as the number of bits spent to encode each block. Each number is mapped to a pixel brightness value in an auxiliary image which is then used for segmentation. We introduce the use of such an image and show an example of a simple segmentation algorithm, which was successfully applied to test documents. The desired region can be identified and cropped (or replaced) from the compressed data without decompressing the image.
{"title":"Segmentation of compressed documents","authors":"R. Queiroz, R. Eschbach","doi":"10.1109/ICIP.1997.631984","DOIUrl":"https://doi.org/10.1109/ICIP.1997.631984","url":null,"abstract":"We present a novel technique for segmentation of a JPEG-compressed document based on block activity. The activity is measured as the number of bits spent to encode each block. Each number is mapped to a pixel brightness value in an auxiliary image which is then used for segmentation. We introduce the use of such an image and show an example of a simple segmentation algorithm, which was successfully applied to test documents. The desired region can be identified and cropped (or replaced) from the compressed data without decompressing the 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":"3 1","pages":"70-73 vol.3"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75587237","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.647988
M. Effros
We consider the problem of optimal, data-dependent zerotree design for use in weighted universal zerotree codes for image compression. A weighted universal zerotree code (WUZC) is a data compression system that replaces the single, data-independent zerotree of Said and Pearlman (see IEEE Transactions on Circuits and Systems for Video Technology, vol.6, no.3, p.243-50, 1996) with an optimal collection of zerotrees for good image coding performance across a wide variety of possible sources. We describe the weighted universal zerotree encoding and design algorithms but focus primarily on the problem of optimal, data-dependent zerotree design. We demonstrate the performance of the proposed algorithm by comparing, at a variety of target rates, the performance of a Said-Pearlman style code using the standard zerotree to the performance of the same code using a zerotree designed with our algorithm. The comparison is made without entropy coding. The proposed zerotree design algorithm achieves, on a collection of combined text and gray-scale images, up to 4 dB performance improvement over a Said-Pearlman zerotree.
我们考虑了用于图像压缩的加权通用零树编码的最优、数据相关的零树设计问题。加权通用零树码(WUZC)是一种数据压缩系统，它取代了Said和Pearlman的单一的、与数据无关的零树(参见IEEE Transactions on Circuits and Systems for Video Technology, vol.6, no. 6)。3, p.243- 50,1996)，并在各种可能的源中提供最佳的零树集合，以获得良好的图像编码性能。我们描述了加权通用零树编码和设计算法，但主要关注最优的问题，数据相关的零树设计。我们通过比较在各种目标速率下，使用标准零树的Said-Pearlman风格代码的性能与使用用我们的算法设计的零树的相同代码的性能来证明所提出算法的性能。在不使用熵编码的情况下进行比较。所提出的零树设计算法在文本和灰度图像的组合上，比Said-Pearlman零树的性能提高了4db。
{"title":"Zerotree design for image compression: toward weighted universal zerotree coding","authors":"M. Effros","doi":"10.1109/ICIP.1997.647988","DOIUrl":"https://doi.org/10.1109/ICIP.1997.647988","url":null,"abstract":"We consider the problem of optimal, data-dependent zerotree design for use in weighted universal zerotree codes for image compression. A weighted universal zerotree code (WUZC) is a data compression system that replaces the single, data-independent zerotree of Said and Pearlman (see IEEE Transactions on Circuits and Systems for Video Technology, vol.6, no.3, p.243-50, 1996) with an optimal collection of zerotrees for good image coding performance across a wide variety of possible sources. We describe the weighted universal zerotree encoding and design algorithms but focus primarily on the problem of optimal, data-dependent zerotree design. We demonstrate the performance of the proposed algorithm by comparing, at a variety of target rates, the performance of a Said-Pearlman style code using the standard zerotree to the performance of the same code using a zerotree designed with our algorithm. The comparison is made without entropy coding. The proposed zerotree design algorithm achieves, on a collection of combined text and gray-scale images, up to 4 dB performance improvement over a Said-Pearlman zerotree.","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":"237 1","pages":"616-619 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75751383","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.638712
F. Coat, E. Pissaloux, P. Bonnin, T. Garié, F. Durbin, A. Tissot
This paper proposes a parallel algorithm based upon dynamic programming, for velocity field estimation. It has O(N) complexity, N being the number of element involved in the process. This low complexity is very interesting for many real time applications (autonomous robot navigation, trajectory matching etc.). The algorithm has been implemented on the CM-5, therefore functional specifications of our parallel dynamic programming circuit have been validated.
{"title":"A parallel algorithm for a very fast 2D velocity field estimation","authors":"F. Coat, E. Pissaloux, P. Bonnin, T. Garié, F. Durbin, A. Tissot","doi":"10.1109/ICIP.1997.638712","DOIUrl":"https://doi.org/10.1109/ICIP.1997.638712","url":null,"abstract":"This paper proposes a parallel algorithm based upon dynamic programming, for velocity field estimation. It has O(N) complexity, N being the number of element involved in the process. This low complexity is very interesting for many real time applications (autonomous robot navigation, trajectory matching etc.). The algorithm has been implemented on the CM-5, therefore functional specifications of our parallel dynamic programming circuit have been validated.","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":"37 10 1","pages":"179-182 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78660359","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.632125
V. Caselles, J. Morel, Catalina Sbert
We discuss possible algorithms for interpolating data given in a set of curves and/or points in the plane. We propose a set of basic assumptions to be satisfied by the interpolation algorithms which lead to a set of models in terms of possibly degenerate elliptic partial differential equations. The absolute minimal Lipschitz extension model (AMLE) is singled out and studied in more detail. We show experiments suggesting a possible application, the restoration of images with poor dynamic range.
{"title":"An axiomatic approach to image interpolation","authors":"V. Caselles, J. Morel, Catalina Sbert","doi":"10.1109/ICIP.1997.632125","DOIUrl":"https://doi.org/10.1109/ICIP.1997.632125","url":null,"abstract":"We discuss possible algorithms for interpolating data given in a set of curves and/or points in the plane. We propose a set of basic assumptions to be satisfied by the interpolation algorithms which lead to a set of models in terms of possibly degenerate elliptic partial differential equations. The absolute minimal Lipschitz extension model (AMLE) is singled out and studied in more detail. We show experiments suggesting a possible application, the restoration of images with poor dynamic range.","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":"35 1","pages":"376-379 vol.3"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78701491","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.648075
K. Jinzenji, S. Ishibashi, H. Kotera
We clarify the relationship between motion vectors (two parameters) and all camera motion, namely scaling, rotation and translation. All camera motions are described as Hermart transform coefficients. After all scaling and rotation factors of camera motion are removed, translation factors represent the depth of real three dimensional world. So we proposed a new sprite model, which is consist of planes vertical towards the depth direction. Using this sprite model, any background reflecting any camera motion creates sprites. Our simulation results show clear sprites and a clear synthesized image. The correlation between the original image and the synthesized image is more than 0.7. That indicates that the created sprites are suitable for prediction.
{"title":"Algorithm for automatically producing layered sprites by detecting camera movement","authors":"K. Jinzenji, S. Ishibashi, H. Kotera","doi":"10.1109/ICIP.1997.648075","DOIUrl":"https://doi.org/10.1109/ICIP.1997.648075","url":null,"abstract":"We clarify the relationship between motion vectors (two parameters) and all camera motion, namely scaling, rotation and translation. All camera motions are described as Hermart transform coefficients. After all scaling and rotation factors of camera motion are removed, translation factors represent the depth of real three dimensional world. So we proposed a new sprite model, which is consist of planes vertical towards the depth direction. Using this sprite model, any background reflecting any camera motion creates sprites. Our simulation results show clear sprites and a clear synthesized image. The correlation between the original image and the synthesized image is more than 0.7. That indicates that the created sprites are suitable for prediction.","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 2 1","pages":"767-770 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78452607","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.638767
Seungjoon Yang, Y. Hu
Biased anisotropic diffusion is applied to the coding artifacts removal of the DCT based codec. It is formulated as a cost minimization problem. The weighting factors of the cost function are controlled such that the solution removes the blocking effect and conceals the block losses. It has an advantage over other postprocessing schemes because it handles the discontinuity of the image, smoothes the image selectively, and takes the visual masking in to account. Features needed for the weighting factors are extracted directly from the DCT coefficients to reduce the computational complexity.
{"title":"Coding artifacts removal using biased anisotropic diffusion","authors":"Seungjoon Yang, Y. Hu","doi":"10.1109/ICIP.1997.638767","DOIUrl":"https://doi.org/10.1109/ICIP.1997.638767","url":null,"abstract":"Biased anisotropic diffusion is applied to the coding artifacts removal of the DCT based codec. It is formulated as a cost minimization problem. The weighting factors of the cost function are controlled such that the solution removes the blocking effect and conceals the block losses. It has an advantage over other postprocessing schemes because it handles the discontinuity of the image, smoothes the image selectively, and takes the visual masking in to account. Features needed for the weighting factors are extracted directly from the DCT coefficients to reduce the computational complexity.","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":"131 1","pages":"346-349 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75917190","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.638753
M. Ruhl, H. Hartenstein, D. Saupe
In fractal image compression a partitioning of the image into ranges is required. Saupe and Ruhl (1996) proposed to find good partitionings by means of a split-and-merge process guided by evolutionary computing. In this approach ranges are connected sets of small square image blocks. Far better rate-distortion curves can be obtained as compared to traditional quadtree partitionings, however, at the expense of an increase of computing time. In this paper we show how conventional acceleration techniques and a deterministic version of the evolution reduce the time-complexity of the method without degrading the encoding quality. Furthermore, we report on techniques to improve the rate-distortion performance and evaluate the results visually.
{"title":"Adaptive partitionings for fractal image compression","authors":"M. Ruhl, H. Hartenstein, D. Saupe","doi":"10.1109/ICIP.1997.638753","DOIUrl":"https://doi.org/10.1109/ICIP.1997.638753","url":null,"abstract":"In fractal image compression a partitioning of the image into ranges is required. Saupe and Ruhl (1996) proposed to find good partitionings by means of a split-and-merge process guided by evolutionary computing. In this approach ranges are connected sets of small square image blocks. Far better rate-distortion curves can be obtained as compared to traditional quadtree partitionings, however, at the expense of an increase of computing time. In this paper we show how conventional acceleration techniques and a deterministic version of the evolution reduce the time-complexity of the method without degrading the encoding quality. Furthermore, we report on techniques to improve the rate-distortion performance and evaluate the results visually.","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":"25 1","pages":"310-313 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75105950","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.648100
M. W. Castelloe, D. Munson
We explore 3-D image reconstruction from limited synthetic aperture radar (SAR) data, using a previously developed approach, based on high-resolution spectral estimation. Existing 3-D SAR imaging techniques, such as stereo and interferometry, present difficulties that may be overcome by this method. We use XPATCH to generate simulated SAR data of a military tank and an aircraft, and we then show image reconstructions using both conventional Fourier inversion and high-resolution spectral estimation. The latter approach is seen to provide superior imagery.
{"title":"3-D SAR imaging via high-resolution spectral estimation methods: experiments with XPATCH","authors":"M. W. Castelloe, D. Munson","doi":"10.1109/ICIP.1997.648100","DOIUrl":"https://doi.org/10.1109/ICIP.1997.648100","url":null,"abstract":"We explore 3-D image reconstruction from limited synthetic aperture radar (SAR) data, using a previously developed approach, based on high-resolution spectral estimation. Existing 3-D SAR imaging techniques, such as stereo and interferometry, present difficulties that may be overcome by this method. We use XPATCH to generate simulated SAR data of a military tank and an aircraft, and we then show image reconstructions using both conventional Fourier inversion and high-resolution spectral estimation. The latter approach is seen to provide superior 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":"10 3 1","pages":"853-856 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1997-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72662778","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
扫码关注我们
求助内容：
应助结果提醒方式：