Real-Time ImagingPub Date : 2005-02-01DOI: 10.1016/j.rti.2005.04.002
Ruigang Yang , Marc Pollefeys
{"title":"A versatile stereo implementation on commodity graphics hardware","authors":"Ruigang Yang , Marc Pollefeys","doi":"10.1016/j.rti.2005.04.002","DOIUrl":"10.1016/j.rti.2005.04.002","url":null,"abstract":"<div><p><span>This paper presents a detailed description of a real-time correlation-based stereo algorithm running completely on the graphics processing unit (GPU). This is important since it allows to free up the main processor for other tasks including high-level interpretation of the stereo results. We first introduce a two-view stereo algorithm that includes some advanced features such as adaptive windows and cross-checking. Then we extend it using a plane-sweep approach to allow multiple frames without </span>rectification.</p><p>By taking advantage of advanced features of recent GPUs the proposed algorithm runs in real-time. Our implementation running on an ATI Radeon 9800 graphics card achieves up to 289 million disparity evaluations per second including all the overhead to download images and read-back the disparity map, which is several times faster than commercially available CPU-based implementations.</p></div>","PeriodicalId":101062,"journal":{"name":"Real-Time Imaging","volume":"11 1","pages":"Pages 7-18"},"PeriodicalIF":0.0,"publicationDate":"2005-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.rti.2005.04.002","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83732735","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}
Real-Time ImagingPub Date : 2005-02-01DOI: 10.1016/j.rti.2005.01.003
Li-Wei Kang, Jin-Jang Leou
{"title":"An error resilient coding scheme for H.263 video transmission based on data embedding","authors":"Li-Wei Kang, Jin-Jang Leou","doi":"10.1016/j.rti.2005.01.003","DOIUrl":"https://doi.org/10.1016/j.rti.2005.01.003","url":null,"abstract":"<div><p>For entropy-coded H.263 video frames, a transmission error in a codeword will not only affect the underlying codeword but may also affect subsequent codewords, resulting in a great degradation of the received video frames. In this study, an error resilient coding scheme for real-time H.263 video transmission is proposed. The objective of the proposed scheme is to recover high-quality H.263 video frames from the corresponding corrupted video frames.</p><p><span>At the encoder, for an H.263 intra-coded I frame, the important data (the codebook index) for each macroblock (MB) are extracted and embedded into another MB within the I frame by the proposed data embedding scheme for I frames. For an H.263 inter-coded P frame, the important data (the coding mode and </span>motion vector<span> information) for each group of blocks (GOB) are extracted and embedded into the next frame by the proposed MB-interleaving GOB-based data embedding scheme. At the decoder, after all the corrupted MBs within an H.263 video frame are detected and located, if the important data for a corrupted MB can be extracted correctly, the extracted important data will facilitate the employed error concealment<span> scheme to conceal the corrupted MB. Otherwise, the employed error concealment scheme is simply used to conceal the corrupted MB. As compared with some recent error resilient approaches, in this study the important data selection mechanism for different types of MBs, the detailed data embedding mechanism, and the error detection and concealment scheme performed at the decoder are well developed to design an integrated error resilient coding scheme. Based on the simulation results obtained in this study, the performance of the proposed scheme is better than those of four existing approaches used for comparison. The proposed scheme can recover high-quality H.263 video frames from the corresponding corrupted video frames up to a video packet loss rate of 30% in real time.</span></span></p></div>","PeriodicalId":101062,"journal":{"name":"Real-Time Imaging","volume":"11 1","pages":"Pages 45-58"},"PeriodicalIF":0.0,"publicationDate":"2005-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.rti.2005.01.003","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136850760","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}
Real-Time ImagingPub Date : 2005-02-01DOI: 10.1016/j.rti.2005.02.001
Stuart Meikle , B.P. Amavasai , F. Caparrelli
{"title":"Towards real-time object recognition using pairs of lines","authors":"Stuart Meikle , B.P. Amavasai , F. Caparrelli","doi":"10.1016/j.rti.2005.02.001","DOIUrl":"10.1016/j.rti.2005.02.001","url":null,"abstract":"<div><p><span>This paper presents a description of the “Pairs Of Lines” object recognition algorithm<span> used in the MIMAS Computer Vision toolkit. This toolkit was developed at Sheffield Hallam University and the “Pairs of Lines” method was used in a recent European Union funded project.</span></span><span><sup>1</sup></span></p><p>The algorithm was developed to enable a micro-robot system (Amavasai et al., InstMC Journal of Measurement and Control) to recognize geometric planar objects in real-time, in a noisy environment.</p><p>The method involves using straight line segments which are extracted from both the known object models and from the visual scene that the objects are to be located in. Pairs of these straight lines are then compared. If there is a geometric match between the two pairs an estimate of the possible position, orientation and scale of the model in the scene is made. The estimates are collated, as all possible pairs of lines are compared. The process yields the position, orientation and scale of the known models in the scene. The algorithm has been optimized for speed.</p><p><span>This paper describes the method in detail and presents experimental results which indicate that the technique exhibits robustness to camera noise and partial occlusion and produces recognition in times under 1</span> <span><span>s on a desktop PC. Recognition times are shown to be from 2 to 16 times faster than with the well-studied pairwise geometric histograms method. Recognition rates of up to 80% were achieved with scenes having </span>signal to noise ratios of 2.5.</span></p></div>","PeriodicalId":101062,"journal":{"name":"Real-Time Imaging","volume":"11 1","pages":"Pages 31-43"},"PeriodicalIF":0.0,"publicationDate":"2005-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.rti.2005.02.001","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75938458","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}
Real-Time ImagingPub Date : 2004-12-01DOI: 10.1016/j.rti.2004.10.001
Youngmo Han
{"title":"Relations between bundle-adjustment and epipolar-geometry-based approaches, and their applications to efficient structure from motion","authors":"Youngmo Han","doi":"10.1016/j.rti.2004.10.001","DOIUrl":"10.1016/j.rti.2004.10.001","url":null,"abstract":"<div><p>3D reconstruction<span><span> from image correspondences has been studied in the two respects: one is the unifying framework, often called structure from motion, where motion and structure are estimated simultaneously, and the other is the decoupling framework, often called motion estimation, where motion is estimated separately from structure. The two approaches have both some advantages and disadvantages at the same time. So, in this paper, we first show the relations between structure from motion using bundle-adjustment, a representative approach in the unifying framework, and motion estimation using epipolar geometry<span>, that in the decoupling framework. Based on the results we also present a computationally efficient algorithm solving the bundle-adjustment-based structure from motion problem, where motion and structure are estimated separately. Our research has some significance in the two respects. First, although some researchers have found the relations between the optimization criteria used in epipolar-geometry-based approaches, the results have rarely extended to those in other approaches, e.g. bundle-adjustment approach. Second, our proposed algorithm can take the advantages of the unifying and the decoupling frameworks, e.g., benefit of a low-dimensional search space and prevention of </span></span>performance degradation in the decoupling framework.</span></p></div>","PeriodicalId":101062,"journal":{"name":"Real-Time Imaging","volume":"10 6","pages":"Pages 389-402"},"PeriodicalIF":0.0,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.rti.2004.10.001","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72765260","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}
Real-Time ImagingPub Date : 2004-12-01DOI: 10.1016/j.rti.2004.08.001
Edmund Y. Lam
{"title":"Robust minimization of lighting variation for real-time defect detection","authors":"Edmund Y. Lam","doi":"10.1016/j.rti.2004.08.001","DOIUrl":"10.1016/j.rti.2004.08.001","url":null,"abstract":"<div><p><span>In machine vision applications that involve comparing two images, it is necessary to match the capture conditions, which can affect their graylevels. Illumination and exposure are two important causes for lighting variation that we should compensate for in the resulting images. A standard technique for this purpose is to map one of the images to achieve the smallest </span>mean square error<span> (MSE) between the two. However, applications in defect detection for manufacturing processes are more challenging, because the existence of defects would affect the mapping significantly. In this paper, we present a robust method that is more tolerant to defects, and discuss its formulation as a linear programming to achieve fast implementations. This algorithm is also flexible and capable of incorporating further constraints, such as ensuring non-negativity of the pixel values.</span></p></div>","PeriodicalId":101062,"journal":{"name":"Real-Time Imaging","volume":"10 6","pages":"Pages 365-370"},"PeriodicalIF":0.0,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.rti.2004.08.001","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75052095","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}
Real-Time ImagingPub Date : 2004-12-01DOI: 10.1016/j.rti.2004.10.002
F. Ortiz, F. Torres
{"title":"Vectorial morphological reconstruction for brightness elimination in colour images","authors":"F. Ortiz, F. Torres","doi":"10.1016/j.rti.2004.10.002","DOIUrl":"10.1016/j.rti.2004.10.002","url":null,"abstract":"<div><p>In this paper, we present a new method for brightness elimination in chromatic images by means of the extension of the morphological reconstruction for colour images. We use the HSI colour space for morphological processing, after solving certain inconveniences present in this colour model. We investigate the connected filters of the mathematical morphology and, in particular, the so-called filters by reconstruction. These filters are formally defined for colour images. The power of the morphological reconstruction for brightness elimination in colour images is presented. We also describe a new algorithm to control the over-simplification of images and to reduce the high processing cost of the geodesic operations. Examples of its application are shown. The new method proposed here achieves good results, which are similar to those obtained from other techniques, yet does not require either costly multiple-view systems or stereo images.</p></div>","PeriodicalId":101062,"journal":{"name":"Real-Time Imaging","volume":"10 6","pages":"Pages 379-387"},"PeriodicalIF":0.0,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.rti.2004.10.002","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76841467","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}
Real-Time ImagingPub Date : 2004-12-01DOI: 10.1016/j.rti.2004.07.001
O. Djekoune, K. Achour
{"title":"Incremental Hough transform: an improved algorithm for digital device implementation","authors":"O. Djekoune, K. Achour","doi":"10.1016/j.rti.2004.07.001","DOIUrl":"10.1016/j.rti.2004.07.001","url":null,"abstract":"<div><p><span>Hough Transform<span><span> (HT) is one of the most common methods for detecting shapes (lines, circles, etc.) in binary or edge images. Its advantage is its ability to detect discontinuous patterns in noisy images, but it requires a large amount of computing power. This paper presents a fast and enhanced version for computing the Incremental HT that was developed for digital device implementation. This algorithm does not require any </span>Look Up Table or trigonometric calculations at run time. A number of the </span></span><span><math><mrow><mi>ρ</mi></mrow></math></span> values generated in parallel is defined at the beginning of this algorithm. This algorithm leads to a significant reduction of the HT computation time and can be therefore used in real-time applications. This paper also provides some results obtained by this algorithm on several images.</p></div>","PeriodicalId":101062,"journal":{"name":"Real-Time Imaging","volume":"10 6","pages":"Pages 351-363"},"PeriodicalIF":0.0,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.rti.2004.07.001","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75762090","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}
Real-Time ImagingPub Date : 2004-12-01DOI: 10.1016/S1077-2014(04)00095-6
{"title":"Volume contents and index - autogenerate","authors":"","doi":"10.1016/S1077-2014(04)00095-6","DOIUrl":"https://doi.org/10.1016/S1077-2014(04)00095-6","url":null,"abstract":"","PeriodicalId":101062,"journal":{"name":"Real-Time Imaging","volume":"10 6","pages":"Pages III-VIII"},"PeriodicalIF":0.0,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1077-2014(04)00095-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91970008","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Real-Time ImagingPub Date : 2004-12-01DOI: 10.1016/j.rti.2004.09.002
L. Kotoulas, I. Andreadis
{"title":"Efficient hardware architectures for computation of image moments","authors":"L. Kotoulas, I. Andreadis","doi":"10.1016/j.rti.2004.09.002","DOIUrl":"10.1016/j.rti.2004.09.002","url":null,"abstract":"<div><p><span>Geometric moments are used in numerous image analysis tasks. While several approaches have been proposed, real-time computation is still inefficient. In this paper, a mathematical formulation of the relationship of the all-pole filter output to the geometric moments is discussed. Using this formulation, architectures for implementing in hardware geometric moments of 1, 2 or 3D objects are proposed. Four implementations are programmed in field programmable logic devices (FPGA) devices with typical clock frequencies of 40</span> <!-->MHz. The speed of these devices is adequate for real-time applications, and they can be used to extract local as well as global geometric moments.</p></div>","PeriodicalId":101062,"journal":{"name":"Real-Time Imaging","volume":"10 6","pages":"Pages 371-378"},"PeriodicalIF":0.0,"publicationDate":"2004-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.rti.2004.09.002","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89034021","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}