Pub Date : 2009-08-01DOI: 10.1049/IET-IPR.2008.0142
C. Singh, Ekta Walia
A polar system is used to compute Zernike moments to enhance their accuracy and to improve invariance to rotation. This requires reconfiguration of pixel arrangements that are normally available in rectangular grids in the cartesian coordinate system. This study presents an improved reconfiguration model of pixel arrangements that uses nearly 27.3% less number of pixels compared to the existing model, thus enhancing the computational efficiency of the proposed method by the same percentage. The performance of the proposed model is analysed in detail, which is observed to be at par with the existing method.
{"title":"Computation of Zernike moments in improved polar configuration","authors":"C. Singh, Ekta Walia","doi":"10.1049/IET-IPR.2008.0142","DOIUrl":"https://doi.org/10.1049/IET-IPR.2008.0142","url":null,"abstract":"A polar system is used to compute Zernike moments to enhance their accuracy and to improve invariance to rotation. This requires reconfiguration of pixel arrangements that are normally available in rectangular grids in the cartesian coordinate system. This study presents an improved reconfiguration model of pixel arrangements that uses nearly 27.3% less number of pixels compared to the existing model, thus enhancing the computational efficiency of the proposed method by the same percentage. The performance of the proposed model is analysed in detail, which is observed to be at par with the existing method.","PeriodicalId":13486,"journal":{"name":"IET Image Process.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78296889","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 : 2009-08-01DOI: 10.1049/IET-IPR.2008.0068
K. Liu, Chun-Hsien Chou
In this study, a robust and transparent watermarking scheme for colour images is proposed. The colour features for the human visual system are utilised to design the colour watermarking scheme. Through the exploitation of the perceptual redundancy of colour images, the proposed watermarking scheme is perceptually tuned to embed and detect the watermark in the perceptually significant sub-bands of luminance and chrominance components of colour images in the wavelet domain. The employment of the uniformity in the uniform colour space and the masking effect mainly due to local variations in luminance magnitude leads to that the perceptual redundancy of colour images can be measured. By using the estimated perceptual redundancy in the form of error visibility thresholds of wavelet coefficients of the colour image, high strength watermarks are invisibly embedded into coefficients of the host colour image for resisting compression and malicious attacks. Simulation results show that the estimation of perceptual redundancy is helpful to the design of the watermarking scheme for colour images. The performance in terms of robustness and transparency of the proposed watermarking scheme is superior to that of the existing scheme.
{"title":"Robust and transparent watermarking scheme for colour images","authors":"K. Liu, Chun-Hsien Chou","doi":"10.1049/IET-IPR.2008.0068","DOIUrl":"https://doi.org/10.1049/IET-IPR.2008.0068","url":null,"abstract":"In this study, a robust and transparent watermarking scheme for colour images is proposed. The colour features for the human visual system are utilised to design the colour watermarking scheme. Through the exploitation of the perceptual redundancy of colour images, the proposed watermarking scheme is perceptually tuned to embed and detect the watermark in the perceptually significant sub-bands of luminance and chrominance components of colour images in the wavelet domain. The employment of the uniformity in the uniform colour space and the masking effect mainly due to local variations in luminance magnitude leads to that the perceptual redundancy of colour images can be measured. By using the estimated perceptual redundancy in the form of error visibility thresholds of wavelet coefficients of the colour image, high strength watermarks are invisibly embedded into coefficients of the host colour image for resisting compression and malicious attacks. Simulation results show that the estimation of perceptual redundancy is helpful to the design of the watermarking scheme for colour images. The performance in terms of robustness and transparency of the proposed watermarking scheme is superior to that of the existing scheme.","PeriodicalId":13486,"journal":{"name":"IET Image Process.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85489154","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 : 2009-06-10DOI: 10.1049/IET-IPR.2007.0193
Yuenan Li, Zhang Lu, X.-M. Niu
Video shot boundary detection is the initial and fundamental step towards video indexing, browsing and retrieval. Great efforts have been paid on developing accurate shot boundary detection algorithms. However, the high computational cost in shot detection becomes a bottleneck for real-time applications. The problem of making a balance between detection accuracy and speed is addressed in this paper, and a novel fast detection framework is presented. The general framework that employs pre-processing techniques can improve both detection speed and precision. In the pre-processing stage, adaptive local thresholding is adopted to classify non-boundary segments and candidate segments that may contain shot boundaries. The candidate segments are refined using bisection-based comparisons to eliminate non-boundary frames. Only refined candidate segments are preserved for further detections; hence, the speed of shot detection is improved by reducing detection scope. Moreover, prior knowledge about each possible shot boundary such as its type and duration can be obtained in the pre-processing stage, which can accelerate the consequent hard cut and gradual transition detections. Experimental results indicate that the proposed framework is effective in accelerating the shot detection process, and it can also achieve excellent detection accuracies.
{"title":"Fast video shot boundary detection framework employing pre-processing techniques","authors":"Yuenan Li, Zhang Lu, X.-M. Niu","doi":"10.1049/IET-IPR.2007.0193","DOIUrl":"https://doi.org/10.1049/IET-IPR.2007.0193","url":null,"abstract":"Video shot boundary detection is the initial and fundamental step towards video indexing, browsing and retrieval. Great efforts have been paid on developing accurate shot boundary detection algorithms. However, the high computational cost in shot detection becomes a bottleneck for real-time applications. The problem of making a balance between detection accuracy and speed is addressed in this paper, and a novel fast detection framework is presented. The general framework that employs pre-processing techniques can improve both detection speed and precision. In the pre-processing stage, adaptive local thresholding is adopted to classify non-boundary segments and candidate segments that may contain shot boundaries. The candidate segments are refined using bisection-based comparisons to eliminate non-boundary frames. Only refined candidate segments are preserved for further detections; hence, the speed of shot detection is improved by reducing detection scope. Moreover, prior knowledge about each possible shot boundary such as its type and duration can be obtained in the pre-processing stage, which can accelerate the consequent hard cut and gradual transition detections. Experimental results indicate that the proposed framework is effective in accelerating the shot detection process, and it can also achieve excellent detection accuracies.","PeriodicalId":13486,"journal":{"name":"IET Image Process.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76378142","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 : 2009-06-10DOI: 10.1049/IET-IPR.2009.0023
K. Heidary, H. Caulfield
Engineers have utilised spectral information and have steadily improved its applications in imaging systems for more than a century. The course of technological developments in colour imaging has been dictated by system improvements measured by their efficacy for direct human consumption. It seems reasonable to us to try to emulate nature and boost capabilities of machine vision systems by optimising the way in which they exploit spectral information. This is a two-step process: first step involves using a few spectrally broad detectors to compress the information content of the scene and the second step constructs spectral discriminants for image segmentation based on a small number of spectrally generated features assigned to each pixel. In animals the discriminant value is attributed to the object as what is called colour. Previous papers have concentrated on the final segmentation step. Here we show a straightforward way to design application-specific spectral sensitivity functions to improve image segmentation. The resulting functions can be used for reliable recognition of objects in a hyperspectral image in real time. These functions can also be used to design task-specific specialised cameras that can outperform current hyperspectral systems in terms of sensitivity, size, power consumption, robustness, price and complexity.
{"title":"Spectral sensitivity design for maximum colour separation in artificial colour systems","authors":"K. Heidary, H. Caulfield","doi":"10.1049/IET-IPR.2009.0023","DOIUrl":"https://doi.org/10.1049/IET-IPR.2009.0023","url":null,"abstract":"Engineers have utilised spectral information and have steadily improved its applications in imaging systems for more than a century. The course of technological developments in colour imaging has been dictated by system improvements measured by their efficacy for direct human consumption. It seems reasonable to us to try to emulate nature and boost capabilities of machine vision systems by optimising the way in which they exploit spectral information. This is a two-step process: first step involves using a few spectrally broad detectors to compress the information content of the scene and the second step constructs spectral discriminants for image segmentation based on a small number of spectrally generated features assigned to each pixel. In animals the discriminant value is attributed to the object as what is called colour. Previous papers have concentrated on the final segmentation step. Here we show a straightforward way to design application-specific spectral sensitivity functions to improve image segmentation. The resulting functions can be used for reliable recognition of objects in a hyperspectral image in real time. These functions can also be used to design task-specific specialised cameras that can outperform current hyperspectral systems in terms of sensitivity, size, power consumption, robustness, price and complexity.","PeriodicalId":13486,"journal":{"name":"IET Image Process.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76918540","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 : 2009-06-10DOI: 10.1049/IET-IPR.2008.0173
W. Li, X. Wu
An unaddressed problem with Cheng's design is pointed out from the filter viewpoint: the first few basis functions do not decay smoothly to zero at the end, which may increase blocking artefacts, especially at low bit rates.
{"title":"Comments on 'new family of lapped biorthogonal transform via lifting steps'","authors":"W. Li, X. Wu","doi":"10.1049/IET-IPR.2008.0173","DOIUrl":"https://doi.org/10.1049/IET-IPR.2008.0173","url":null,"abstract":"An unaddressed problem with Cheng's design is pointed out from the filter viewpoint: the first few basis functions do not decay smoothly to zero at the end, which may increase blocking artefacts, especially at low bit rates.","PeriodicalId":13486,"journal":{"name":"IET Image Process.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81581532","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 : 2009-06-10DOI: 10.1049/IET-IPR.2007.0218
P. Shui
The direction-frequency selectivity of two-dimensional (2-D) separable oversampled discrete Fourier transform (DFT) modulated filter banks, showing that such 2-D filter banks can provide fine frequency tiling and efficient image representations with direction-frequency selectivity, is analysed. Moreover, the doubly local Wiener filtering is extended to the case using two 2-D separable oversampled DFT modulated filter banks, where the empirical subband energy distributions of the image are estimated by the two sets of directional windows matching the direction-frequency selectivity of the subband filters. The proposed algorithm is of low computational complexity and exhibits a great capability to preserve inhomogeneous textures, owing to the fact that 2-D separable DFT modulated bases are suited to represent oscillating patterns in images. The experimental results show that the proposed denoising algorithm is competitive with the existing algorithms with comparable computational complexity. Particularly, for images with abundant inhomogenous texture, it gives larger output peak signal-to-noise ratios (PSNRs) and achieves better visual effect in texture regions of images.
{"title":"Image denoising using 2-D separable oversampled DFT modulated filter banks","authors":"P. Shui","doi":"10.1049/IET-IPR.2007.0218","DOIUrl":"https://doi.org/10.1049/IET-IPR.2007.0218","url":null,"abstract":"The direction-frequency selectivity of two-dimensional (2-D) separable oversampled discrete Fourier transform (DFT) modulated filter banks, showing that such 2-D filter banks can provide fine frequency tiling and efficient image representations with direction-frequency selectivity, is analysed. Moreover, the doubly local Wiener filtering is extended to the case using two 2-D separable oversampled DFT modulated filter banks, where the empirical subband energy distributions of the image are estimated by the two sets of directional windows matching the direction-frequency selectivity of the subband filters. The proposed algorithm is of low computational complexity and exhibits a great capability to preserve inhomogeneous textures, owing to the fact that 2-D separable DFT modulated bases are suited to represent oscillating patterns in images. The experimental results show that the proposed denoising algorithm is competitive with the existing algorithms with comparable computational complexity. Particularly, for images with abundant inhomogenous texture, it gives larger output peak signal-to-noise ratios (PSNRs) and achieves better visual effect in texture regions of images.","PeriodicalId":13486,"journal":{"name":"IET Image Process.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74325775","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 : 2009-06-10DOI: 10.1049/IET-IPR.2007.0096
M. Bhuiyan, M. Swamy, M. Ahmad
Ultrasound imaging is widely used for diagnostic purposes among the clinicians. A major problem concerning the ultrasound images is their inherent corruption by the multiplicative speckle noise that hampers the quality of the diagnosis, and reduces the efficiency of the algorithms for automatic image processing. In this paper, we propose a new spatially adaptive wavelet-based method in order to reduce the speckle noise from ultrasound images. A spatially adaptive threshold is introduced for denoising the coefficients of log-transformed ultrasound images. The threshold is obtained from a Bayesian maximum a posteriori estimator that is developed using a symmetric normal inverse Gaussian probability density function (PDF) as a prior for modelling the coefficients of the log-transformed reflectivity. A simple and fast method is provided to estimate the parameters of the prior PDF from the neighbouring coefficients. Extensive simulations are carried out using synthetically speckled and ultrasound images. It is shown that the proposed method outperforms several existing techniques in terms of the signal-to-noise ratio, edge preservation index and structural similarity index and visual quality, and in addition, is able to maintain the diagnostically significant details of ultrasound images.
{"title":"Spatially adaptive thresholding in wavelet domain for despeckling of ultrasound images","authors":"M. Bhuiyan, M. Swamy, M. Ahmad","doi":"10.1049/IET-IPR.2007.0096","DOIUrl":"https://doi.org/10.1049/IET-IPR.2007.0096","url":null,"abstract":"Ultrasound imaging is widely used for diagnostic purposes among the clinicians. A major problem concerning the ultrasound images is their inherent corruption by the multiplicative speckle noise that hampers the quality of the diagnosis, and reduces the efficiency of the algorithms for automatic image processing. In this paper, we propose a new spatially adaptive wavelet-based method in order to reduce the speckle noise from ultrasound images. A spatially adaptive threshold is introduced for denoising the coefficients of log-transformed ultrasound images. The threshold is obtained from a Bayesian maximum a posteriori estimator that is developed using a symmetric normal inverse Gaussian probability density function (PDF) as a prior for modelling the coefficients of the log-transformed reflectivity. A simple and fast method is provided to estimate the parameters of the prior PDF from the neighbouring coefficients. Extensive simulations are carried out using synthetically speckled and ultrasound images. It is shown that the proposed method outperforms several existing techniques in terms of the signal-to-noise ratio, edge preservation index and structural similarity index and visual quality, and in addition, is able to maintain the diagnostically significant details of ultrasound images.","PeriodicalId":13486,"journal":{"name":"IET Image Process.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80110250","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 : 2009-06-01DOI: 10.1049/IET-IPR.2008.0112
Beibei Liu, Z.-M. Lu
A novel colourisation algorithm using graph-based semi-supervised learning (SSL) is presented. We show that the assumption of the colourisation problem is consistent with the fundamental of graph-based SSL methods. Satisfactory results are obtained in the experiments that validate the proposed algorithm. To reduce the time and memory requirements when dealing with large scale images, we further propose a two-stage speedup approach. Comparative results show that the computation complexity is dramatically reduced.
{"title":"Image colourisation using graph-based semi-supervised learning","authors":"Beibei Liu, Z.-M. Lu","doi":"10.1049/IET-IPR.2008.0112","DOIUrl":"https://doi.org/10.1049/IET-IPR.2008.0112","url":null,"abstract":"A novel colourisation algorithm using graph-based semi-supervised learning (SSL) is presented. We show that the assumption of the colourisation problem is consistent with the fundamental of graph-based SSL methods. Satisfactory results are obtained in the experiments that validate the proposed algorithm. To reduce the time and memory requirements when dealing with large scale images, we further propose a two-stage speedup approach. Comparative results show that the computation complexity is dramatically reduced.","PeriodicalId":13486,"journal":{"name":"IET Image Process.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84917659","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 : 2009-03-21DOI: 10.1049/IET-IPR.2007.0213
M. Awad, K. Chehdi, A. Nasri
Image segmentation is an important task in image analysis and processing. Many of the existing methods for segmenting a multi-component image (satellite or aerial) are very slow and require a priori knowledge of the image that could be difficult to obtain. Furthermore, the success of each of these methods depends on several factors, such as the characteristics of the acquired image, resolution limitations, intensity in-homogeneities and the percentage of imperfections induced by the process of image acquisition. Recently, fuzzy C-means (FCM) and Genetic Algorithms were separately used in segmenting multi-component images but neither of them had successfully addressed the above concerns. GA was enhanced using Hill-climbing, randomising, and modified mutation operators, leading to what is called hybrid dynamic genetic algorithm (HDGA). Coupling HDGA and FCM creates an unsupervised segmentation method which could successfully segment two types of multi-component images (Landsat ETM+, and IKONOS II). Comparison with the four different methods FCM, hybrid genetic algorithm (HGA), self-organizing-maps (SOM), and the combination of SOM and HGA (SOM-HGA) reveals that FCM-HDGA segmentation method gives robust and reliable results, and is more time efficient.
{"title":"Multi-component image segmentation using a hybrid dynamic genetic algorithm and fuzzy C-means","authors":"M. Awad, K. Chehdi, A. Nasri","doi":"10.1049/IET-IPR.2007.0213","DOIUrl":"https://doi.org/10.1049/IET-IPR.2007.0213","url":null,"abstract":"Image segmentation is an important task in image analysis and processing. Many of the existing methods for segmenting a multi-component image (satellite or aerial) are very slow and require a priori knowledge of the image that could be difficult to obtain. Furthermore, the success of each of these methods depends on several factors, such as the characteristics of the acquired image, resolution limitations, intensity in-homogeneities and the percentage of imperfections induced by the process of image acquisition. Recently, fuzzy C-means (FCM) and Genetic Algorithms were separately used in segmenting multi-component images but neither of them had successfully addressed the above concerns. GA was enhanced using Hill-climbing, randomising, and modified mutation operators, leading to what is called hybrid dynamic genetic algorithm (HDGA). Coupling HDGA and FCM creates an unsupervised segmentation method which could successfully segment two types of multi-component images (Landsat ETM+, and IKONOS II). Comparison with the four different methods FCM, hybrid genetic algorithm (HGA), self-organizing-maps (SOM), and the combination of SOM and HGA (SOM-HGA) reveals that FCM-HDGA segmentation method gives robust and reliable results, and is more time efficient.","PeriodicalId":13486,"journal":{"name":"IET Image Process.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84832644","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 : 2009-03-21DOI: 10.1049/IET-IPR.2008.0046
H.-M. Wang, C.-W. Chang, J.-F. Yang
The stereo image pairs or two-view video sequences can be captured by two cameras at two horizontally different positions. If the stereo image pairs possess incompatible convergences of vertical parallax and horizontal parallax, human eyes generally cannot properly exhibit stereo visualisation. If the image pairs are taken from single camera or selected from a video sequence, perception of stereo visualisation will become even worse. The authors propose an effective calibration procedure to adjust the image pairs to achieve better stereo visualisation. The proposed calibration procedure contains six steps, including feature point extraction, bidirectional feature point matching, relative distance checking, image transformation, hole-filling and reshaping. Experimental results show that the proposed system can effectively adjust vertical and horizontal parallax such that the calibrated stereo image pairs can properly exhibit stereo scenes in stereoscopic display systems. Experimental results also reveal that the proposed method can achieve less vertical parallax than the existing rectification methods.
{"title":"An effective calibration procedure for correction of parallax unmatched image pairs","authors":"H.-M. Wang, C.-W. Chang, J.-F. Yang","doi":"10.1049/IET-IPR.2008.0046","DOIUrl":"https://doi.org/10.1049/IET-IPR.2008.0046","url":null,"abstract":"The stereo image pairs or two-view video sequences can be captured by two cameras at two horizontally different positions. If the stereo image pairs possess incompatible convergences of vertical parallax and horizontal parallax, human eyes generally cannot properly exhibit stereo visualisation. If the image pairs are taken from single camera or selected from a video sequence, perception of stereo visualisation will become even worse. The authors propose an effective calibration procedure to adjust the image pairs to achieve better stereo visualisation. The proposed calibration procedure contains six steps, including feature point extraction, bidirectional feature point matching, relative distance checking, image transformation, hole-filling and reshaping. Experimental results show that the proposed system can effectively adjust vertical and horizontal parallax such that the calibrated stereo image pairs can properly exhibit stereo scenes in stereoscopic display systems. Experimental results also reveal that the proposed method can achieve less vertical parallax than the existing rectification methods.","PeriodicalId":13486,"journal":{"name":"IET Image Process.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90345725","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
扫码关注我们
求助内容：
应助结果提醒方式：