Pub Date : 2004-12-01DOI: 10.1109/ICIP.2000.899300
J. Nascimento, J. Marques
Kalman filtering has been extensively used in object tracking. However, the tracker performance is severely affected in the presence of multiple objects and cluttered background. The reason is simple. Feature detection produces many outliers and the Kalman filter is not able to discriminate valid data from the clutter. This paper overcome this difficulty and describes a robust algorithm for object tracking denoted as S-PDAF (shape-probabilistic data association filter). Experimental tests show that significant robustness improvement is achieved by the S-PDAF algorithm.
{"title":"Robust shape tracking in the presence of cluttered background","authors":"J. Nascimento, J. Marques","doi":"10.1109/ICIP.2000.899300","DOIUrl":"https://doi.org/10.1109/ICIP.2000.899300","url":null,"abstract":"Kalman filtering has been extensively used in object tracking. However, the tracker performance is severely affected in the presence of multiple objects and cluttered background. The reason is simple. Feature detection produces many outliers and the Kalman filter is not able to discriminate valid data from the clutter. This paper overcome this difficulty and describes a robust algorithm for object tracking denoted as S-PDAF (shape-probabilistic data association filter). Experimental tests show that significant robustness improvement is achieved by the S-PDAF algorithm.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133891626","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 : 2003-09-01DOI: 10.1109/ICIP.2000.899236
Shu-Yen Wan, W. Higgins
The goal of image segmentation is to partition a digital image into disjoint regions of interest. Of the many proposed image segmentation methods, region growing has been one of the most popular. Research on region growing, however, has focused primarily on the design of feature measures and on growing and merging criteria. Most of these methods have an inherent dependence on the order in which the points and regions are examined. This weakness implies that a desired segmented result is sensitive to the selection of the initial growing points. We define a set of theoretical criteria for a subclass of region-growing algorithms that are insensitive to the selection of the initial growing points. This class of algorithms, referred to as symmetric region growing (SymRG), leads to a single-pass region-growing approach applicable to any dimensionality of images. Furthermore, they lead to region-growing algorithms that are both memory- and computation-efficient. Finally, by-products of this general paradigm are algorithms for fast connected-component labeling and cavity deletion. The paper gives theoretical results and 3-D image examples.
{"title":"Symmetric region growing","authors":"Shu-Yen Wan, W. Higgins","doi":"10.1109/ICIP.2000.899236","DOIUrl":"https://doi.org/10.1109/ICIP.2000.899236","url":null,"abstract":"The goal of image segmentation is to partition a digital image into disjoint regions of interest. Of the many proposed image segmentation methods, region growing has been one of the most popular. Research on region growing, however, has focused primarily on the design of feature measures and on growing and merging criteria. Most of these methods have an inherent dependence on the order in which the points and regions are examined. This weakness implies that a desired segmented result is sensitive to the selection of the initial growing points. We define a set of theoretical criteria for a subclass of region-growing algorithms that are insensitive to the selection of the initial growing points. This class of algorithms, referred to as symmetric region growing (SymRG), leads to a single-pass region-growing approach applicable to any dimensionality of images. Furthermore, they lead to region-growing algorithms that are both memory- and computation-efficient. Finally, by-products of this general paradigm are algorithms for fast connected-component labeling and cavity deletion. The paper gives theoretical results and 3-D image examples.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114174517","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 : 2003-04-01DOI: 10.1109/ICIP.2000.899228
Dhiraj Kacker, J. Allebach
A spread spectrum watermarking algorithm for hardcopy imaging applications using a human visual system model based halftoning technique called direct binary search (DBS) is presented. DBS is used to design a halftone that jointly optimizes a human visual system based error metric and correlation watermark detector output. The original image is required for the correlation watermark detector.
{"title":"Joint halftoning and watermarking","authors":"Dhiraj Kacker, J. Allebach","doi":"10.1109/ICIP.2000.899228","DOIUrl":"https://doi.org/10.1109/ICIP.2000.899228","url":null,"abstract":"A spread spectrum watermarking algorithm for hardcopy imaging applications using a human visual system model based halftoning technique called direct binary search (DBS) is presented. DBS is used to design a halftone that jointly optimizes a human visual system based error metric and correlation watermark detector output. The original image is required for the correlation watermark detector.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127940947","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.900937
R. Radke, P. Ramadge, T. Echigo, S. Iisaku
The estimation of the parameters of a projective transformation that relates the coordinates of two image planes is a standard problem that arises in image and video mosaicking, virtual video, and problems in computer vision. This problem is often posed as a least squares minimization problem based on a finite set of noisy point samples of the underlying transformation. While in some special cases this problem can be solved using a linear approximation, in general, it results in an 8-dimensional nonquadratic minimization problem that is solved numerically using an 'off-the-shelf' procedure such as the Levenberg-Marquardt algorithm. We show that the general least squares problem for estimating a projective transformation can be analytically reduced to a 2-dimensional nonquadratic minimization problem. Moreover, we provide both analytical and experimental evidence that the minimization of this function is computationally attractive. We propose a particular algorithm that is a combination of a projection and an approximate Gauss-Newton scheme, and experimentally verify that this algorithm efficiently solves the least squares problem.
{"title":"Efficiently estimating projective transformations","authors":"R. Radke, P. Ramadge, T. Echigo, S. Iisaku","doi":"10.1109/ICIP.2000.900937","DOIUrl":"https://doi.org/10.1109/ICIP.2000.900937","url":null,"abstract":"The estimation of the parameters of a projective transformation that relates the coordinates of two image planes is a standard problem that arises in image and video mosaicking, virtual video, and problems in computer vision. This problem is often posed as a least squares minimization problem based on a finite set of noisy point samples of the underlying transformation. While in some special cases this problem can be solved using a linear approximation, in general, it results in an 8-dimensional nonquadratic minimization problem that is solved numerically using an 'off-the-shelf' procedure such as the Levenberg-Marquardt algorithm. We show that the general least squares problem for estimating a projective transformation can be analytically reduced to a 2-dimensional nonquadratic minimization problem. Moreover, we provide both analytical and experimental evidence that the minimization of this function is computationally attractive. We propose a particular algorithm that is a combination of a projection and an approximate Gauss-Newton scheme, and experimentally verify that this algorithm efficiently solves the least squares problem.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"17 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":"127277120","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.899411
Takehito Kuroko, Toshichika Urushibara, M. Ikehara
We present a design and implementation of M-channel linear-phase paraunitary filter banks (LPPUFB) with unequal length filters and same center points. Our main motivation is the application in effective image coding. For low-frequency signals, long basis functions should be used to avoid the blocking effect. While, short basis functions should be used to reduce the ringing noise for high-frequency signals. LPPUFB with such characteristics can be achieved structurally by taking account of the lattice structure. Finally some design examples are shown.
{"title":"Linear-phase paraunitary filter banks with unequal length","authors":"Takehito Kuroko, Toshichika Urushibara, M. Ikehara","doi":"10.1109/ICIP.2000.899411","DOIUrl":"https://doi.org/10.1109/ICIP.2000.899411","url":null,"abstract":"We present a design and implementation of M-channel linear-phase paraunitary filter banks (LPPUFB) with unequal length filters and same center points. Our main motivation is the application in effective image coding. For low-frequency signals, long basis functions should be used to avoid the blocking effect. While, short basis functions should be used to reduce the ringing noise for high-frequency signals. LPPUFB with such characteristics can be achieved structurally by taking account of the lattice structure. Finally some design examples are shown.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"40 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":"132736463","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.899342
R. Radke, P. Ramadge, S. Kulkarni, T. Echigo, S. Iisaku
This paper is concerned with the efficient temporal propagation of correspondences between frames of two video sequences, an integral component of many video processing tasks. The main contribution is a framework for the recursive propagation of these correspondences. The propagation consists of a time update step and a measurement update step. The time update depends only on the dynamics of the rotating source cameras, while the measurement update can be tailored to any member of a general class of image correspondence algorithms. Using these results, the correspondence between points of each frame pair can be propagated and updated in a fraction of the time required to estimate correspondences anew at every frame. We discuss an application of the recursive correspondence propagation framework to the creation of virtual video. Previous virtual view algorithms have been used to generate synthetic video of a static scene, in which objects seem frozen in time. In contrast, the algorithms described here allow the creation of "true" virtual video, in the sense that the synthetic video evolves dynamically along with the scene. While virtual video is our motivating application, the recursive correspondence propagation framework applies to any two-camera video application in which correspondence is difficult and prohibitively time-consuming to estimate by processing frame pairs independently.
{"title":"Recursive propagation of correspondences with applications to the creation of virtual video","authors":"R. Radke, P. Ramadge, S. Kulkarni, T. Echigo, S. Iisaku","doi":"10.1109/ICIP.2000.899342","DOIUrl":"https://doi.org/10.1109/ICIP.2000.899342","url":null,"abstract":"This paper is concerned with the efficient temporal propagation of correspondences between frames of two video sequences, an integral component of many video processing tasks. The main contribution is a framework for the recursive propagation of these correspondences. The propagation consists of a time update step and a measurement update step. The time update depends only on the dynamics of the rotating source cameras, while the measurement update can be tailored to any member of a general class of image correspondence algorithms. Using these results, the correspondence between points of each frame pair can be propagated and updated in a fraction of the time required to estimate correspondences anew at every frame. We discuss an application of the recursive correspondence propagation framework to the creation of virtual video. Previous virtual view algorithms have been used to generate synthetic video of a static scene, in which objects seem frozen in time. In contrast, the algorithms described here allow the creation of \"true\" virtual video, in the sense that the synthetic video evolves dynamically along with the scene. While virtual video is our motivating application, the recursive correspondence propagation framework applies to any two-camera video application in which correspondence is difficult and prohibitively time-consuming to estimate by processing frame pairs independently.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"60 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":"132587272","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.900953
Z. Xue, Dinggang Shen, E. Teoh
A deformable template model for object extraction is proposed based on the fuzzy alignment algorithm (FAA). This object matching algorithm is partitioned into two iterative processes, the first is to estimate the pose relationship (point correspondence and transform parameters) between the current template and the prototype using FAA, the second is to adjust the current template under the exertion of internal energy and external energy functions. An affine-invariant internal energy function of the deformable template is utilized to deal with the transformation of the templates between different domains. Comparative studies with G-Snake model demonstrate the effectiveness of the proposed algorithm and show that it outperforms G-Snake in matching objects with large shearing of shapes.
{"title":"A deformable template model based on fuzzy alignment algorithm","authors":"Z. Xue, Dinggang Shen, E. Teoh","doi":"10.1109/ICIP.2000.900953","DOIUrl":"https://doi.org/10.1109/ICIP.2000.900953","url":null,"abstract":"A deformable template model for object extraction is proposed based on the fuzzy alignment algorithm (FAA). This object matching algorithm is partitioned into two iterative processes, the first is to estimate the pose relationship (point correspondence and transform parameters) between the current template and the prototype using FAA, the second is to adjust the current template under the exertion of internal energy and external energy functions. An affine-invariant internal energy function of the deformable template is utilized to deal with the transformation of the templates between different domains. Comparative studies with G-Snake model demonstrate the effectiveness of the proposed algorithm and show that it outperforms G-Snake in matching objects with large shearing of shapes.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"77 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":"114844242","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.899791
C. A. Segall, A. Katsaggelos
The enhancement of compressed video is considered. We present a general algorithm for processing the compressed data, with three variants of the algorithm having practical application. We then consider the algorithm within the context of MPEG-2. Assuming complete knowledge of the compressed bitstream, experiments compare the different realizations of the enhancement algorithm. Our comparisons stress improvements in visual quality, measured by models of the human visual system. Quantitative and qualitative results are provided.
{"title":"Enhancement of compressed video using visual quality measurements","authors":"C. A. Segall, A. Katsaggelos","doi":"10.1109/ICIP.2000.899791","DOIUrl":"https://doi.org/10.1109/ICIP.2000.899791","url":null,"abstract":"The enhancement of compressed video is considered. We present a general algorithm for processing the compressed data, with three variants of the algorithm having practical application. We then consider the algorithm within the context of MPEG-2. Assuming complete knowledge of the compressed bitstream, experiments compare the different realizations of the enhancement algorithm. Our comparisons stress improvements in visual quality, measured by models of the human visual system. Quantitative and qualitative results are provided.","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":"126158599","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.899243
Po-Chin Hu, Zhi-Li Zhang, M. Kaveh
Many emerging applications involve real-time packet video transmission over noisy wireless networks. To ensure reliable video transmission, an automatic repeat request (ARQ) scheme is used for repairing packet loss over a channel by retransmitting corrupted packets. However, an ARQ resolves the problem of packet loss at the expense of varying an effective channel rate as well as introducing extra latency. These properties increase the difficulty of rate control for real-time wireless video when the buffer overflow and underflow are taken into account. Therefore, we propose a novel ARQ-based rate control scheme, called "channel condition ARQ rate control" by using embedded coding to design an efficient retransmission policy for wireless video. This scheme achieves both maximal channel utilization and smooth video quality perceived at an end-host, which has a low implementation complexity under buffer constraints. We have conducted extensive simulations to verify the efficiency and robustness of the proposed scheme.
{"title":"Channel condition ARQ rate control for real-time wireless video under buffer constraints","authors":"Po-Chin Hu, Zhi-Li Zhang, M. Kaveh","doi":"10.1109/ICIP.2000.899243","DOIUrl":"https://doi.org/10.1109/ICIP.2000.899243","url":null,"abstract":"Many emerging applications involve real-time packet video transmission over noisy wireless networks. To ensure reliable video transmission, an automatic repeat request (ARQ) scheme is used for repairing packet loss over a channel by retransmitting corrupted packets. However, an ARQ resolves the problem of packet loss at the expense of varying an effective channel rate as well as introducing extra latency. These properties increase the difficulty of rate control for real-time wireless video when the buffer overflow and underflow are taken into account. Therefore, we propose a novel ARQ-based rate control scheme, called \"channel condition ARQ rate control\" by using embedded coding to design an efficient retransmission policy for wireless video. This scheme achieves both maximal channel utilization and smooth video quality perceived at an end-host, which has a low implementation complexity under buffer constraints. We have conducted extensive simulations to verify the efficiency and robustness of the proposed scheme.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"38 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":"126979375","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.899247
Sanghoon Lee, C. Podilchuk, Vidhya Krishnan, A. Bovik
In this paper, we introduce an unequal error protection technique for foveation-based error resilience over highly error-prone mobile networks. For point-to-point visual communications, visual quality can be significantly increased by using foveation-based error resilience where each frame is divided into foveated and background layers according to the gaze direction of the human eye, and two bitstreams are generated. In an effort to increase the source throughput of the foveated layer, we employ unequal delay-constrained ARQ and RCPC (rate compatible punctured convolutional) codes in H.223 Annex C. In the simulation, the visual quality is increased in the range of 0.3 dB to 1 dB over channel SNR 5 dB to 15 dB.
{"title":"Unequal error protection for foveation-based error resilience over mobile networks","authors":"Sanghoon Lee, C. Podilchuk, Vidhya Krishnan, A. Bovik","doi":"10.1109/ICIP.2000.899247","DOIUrl":"https://doi.org/10.1109/ICIP.2000.899247","url":null,"abstract":"In this paper, we introduce an unequal error protection technique for foveation-based error resilience over highly error-prone mobile networks. For point-to-point visual communications, visual quality can be significantly increased by using foveation-based error resilience where each frame is divided into foveated and background layers according to the gaze direction of the human eye, and two bitstreams are generated. In an effort to increase the source throughput of the foveated layer, we employ unequal delay-constrained ARQ and RCPC (rate compatible punctured convolutional) codes in H.223 Annex C. In the simulation, the visual quality is increased in the range of 0.3 dB to 1 dB over channel SNR 5 dB to 15 dB.","PeriodicalId":193198,"journal":{"name":"Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)","volume":"5 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":"131226513","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
扫码关注我们
求助内容：
应助结果提醒方式：