This work is concerned with the estimate of structure and texture of buildings from a video sequence. The goal includes the recovery of metric information. The results could be conceivably used for many purposes ranging from photogram-metric applications to CAD models that could be applied, for example, for virtual visits of sites of artistic and historical significance. We present an original algorithm to estimate both structure and texture of environments composed by planes like the interiors of most buildings. From a video sequence of a decorated wall the algorithm computes a plane that approximates the wall (structure estimation) and composes a mosaic of the single images to reproduce the decoration (texture estimation). The data are organized so that it is possible to observe the wall from an arbitrary point of view.
{"title":"Reconstruction of structure and texture of planar environments by dynamic vision techniques","authors":"M. Cossi, G. Cortelazzo, R. Frezza","doi":"10.5281/ZENODO.35999","DOIUrl":"https://doi.org/10.5281/ZENODO.35999","url":null,"abstract":"This work is concerned with the estimate of structure and texture of buildings from a video sequence. The goal includes the recovery of metric information. The results could be conceivably used for many purposes ranging from photogram-metric applications to CAD models that could be applied, for example, for virtual visits of sites of artistic and historical significance. We present an original algorithm to estimate both structure and texture of environments composed by planes like the interiors of most buildings. From a video sequence of a decorated wall the algorithm computes a plane that approximates the wall (structure estimation) and composes a mosaic of the single images to reproduce the decoration (texture estimation). The data are organized so that it is possible to observe the wall from an arbitrary point of view.","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133359710","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}
Multiresolution decomposition of signals has been conventionally carried out by the wavelet representation. In this paper, the orthogonal polynomial approximation has been employed for multiresolution analysis. It is demonstrated that the proposed technique based on polynomial approximation has certain distinct advantages over the conventional method employing wavelet representation.
{"title":"Multiresolution analysis using orthogonal polynomial approximation","authors":"Rupendra Kumar, P. Sircar","doi":"10.5281/ZENODO.36014","DOIUrl":"https://doi.org/10.5281/ZENODO.36014","url":null,"abstract":"Multiresolution decomposition of signals has been conventionally carried out by the wavelet representation. In this paper, the orthogonal polynomial approximation has been employed for multiresolution analysis. It is demonstrated that the proposed technique based on polynomial approximation has certain distinct advantages over the conventional method employing wavelet representation.","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130941962","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}
Quadratic Phase Coupling (QPC) can be detected using Higher Order Statistics (HOS) measures. Previously, the bispectrum, biphase and bicoherence have been used as components in two QPC-detection algorithms. In this paper it is shown that the expressions which describe these detectors reduce to the same form for the white Gaussian noise case. The performance of these detectors is discussed, and particular attention is given to false alarms, which occur when QPC is detected in signals which do not exhibit QPC. A simple expression is derived which gives the probability of false alarm (Pfa) for QPC detectors. This expression shows how the Pfa increases as the Signal to Noise Ratio decreases, a relationship which is also observed in a simulation example.
{"title":"Determining the false-alarm performance of HOS-based quadratic phase coupling detectors","authors":"J. Fackrell, S. McLaughlin","doi":"10.5281/ZENODO.36023","DOIUrl":"https://doi.org/10.5281/ZENODO.36023","url":null,"abstract":"Quadratic Phase Coupling (QPC) can be detected using Higher Order Statistics (HOS) measures. Previously, the bispectrum, biphase and bicoherence have been used as components in two QPC-detection algorithms. In this paper it is shown that the expressions which describe these detectors reduce to the same form for the white Gaussian noise case. The performance of these detectors is discussed, and particular attention is given to false alarms, which occur when QPC is detected in signals which do not exhibit QPC. A simple expression is derived which gives the probability of false alarm (Pfa) for QPC detectors. This expression shows how the Pfa increases as the Signal to Noise Ratio decreases, a relationship which is also observed in a simulation example.","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"1100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122912544","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}
In this paper we present a novel method for computing AM-FM expansions for images. Given an image, we show how to compute an appropriate AM-FM representation. We also describe a general class of functions for which this approach gives the best results. Then, we compute the AM-FM representation on a real-life texture, and show that it has a compact AM-FM spectrum.
{"title":"AM-FM expansions for images","authors":"M. Pattichis, A. Bovik","doi":"10.5281/ZENODO.36115","DOIUrl":"https://doi.org/10.5281/ZENODO.36115","url":null,"abstract":"In this paper we present a novel method for computing AM-FM expansions for images. Given an image, we show how to compute an appropriate AM-FM representation. We also describe a general class of functions for which this approach gives the best results. Then, we compute the AM-FM representation on a real-life texture, and show that it has a compact AM-FM spectrum.","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125116669","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}
This paper presents an algorithm for the real-time computation of 2-D statistical moments on binary images on the Scan Line Array Processor (SLAP). The binary images are represented as sets of nonoverlapping rectangular areas. This representation scheme is called Image Block Representation. The real-time computation of moments in block represented images is achieved by exploiting the rectangular structure of the blocks. The algorithms for image block representation and for the real-time computation of moments are implemented on the Scan Line Array Processor (SLAP).
{"title":"Real-time computation of 2-D moments on block represented binary images on the scan line array processor","authors":"Iraklis M. Spiliotis, Basil G. Mertzios","doi":"10.5281/ZENODO.36097","DOIUrl":"https://doi.org/10.5281/ZENODO.36097","url":null,"abstract":"This paper presents an algorithm for the real-time computation of 2-D statistical moments on binary images on the Scan Line Array Processor (SLAP). The binary images are represented as sets of nonoverlapping rectangular areas. This representation scheme is called Image Block Representation. The real-time computation of moments in block represented images is achieved by exploiting the rectangular structure of the blocks. The algorithms for image block representation and for the real-time computation of moments are implemented on the Scan Line Array Processor (SLAP).","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121673839","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}
The classical WKS sampling theorem is a central result in signal processing, but it applies to band-limited signals only. For many purposes, this class of signals is too narrow. For example, the signals that occur in practice are invariably of finite duration, or time-limited, and often have discontinuities. Clearly, such signals cannot be band-limited. We consider the problem of approximating such signals, or other signals not necessarily band-limited, using sampling series. We do not assume that the sampling instants are regularly distributed, in order to account for errors due to jitter. To the best of our knowledge, the problem of obtaining nonuniform sampling approximations for signals not necessarily band-limited, despite its practical interest, has not been addressed in the literature. In this work we introduce a method that leads to sampling approximations with the required properties. It is shown that the sampling sums considered are capable of approximating a wide class of signals, with arbitrarily small L2 and L∞ errors.
{"title":"On the approximation of nonbandlimited signals by nonuniform sampling series","authors":"P. Ferreira","doi":"10.5281/ZENODO.36209","DOIUrl":"https://doi.org/10.5281/ZENODO.36209","url":null,"abstract":"The classical WKS sampling theorem is a central result in signal processing, but it applies to band-limited signals only. For many purposes, this class of signals is too narrow. For example, the signals that occur in practice are invariably of finite duration, or time-limited, and often have discontinuities. Clearly, such signals cannot be band-limited. We consider the problem of approximating such signals, or other signals not necessarily band-limited, using sampling series. We do not assume that the sampling instants are regularly distributed, in order to account for errors due to jitter. To the best of our knowledge, the problem of obtaining nonuniform sampling approximations for signals not necessarily band-limited, despite its practical interest, has not been addressed in the literature. In this work we introduce a method that leads to sampling approximations with the required properties. It is shown that the sampling sums considered are capable of approximating a wide class of signals, with arbitrarily small L2 and L∞ errors.","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114357509","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}
This paper describes an extension of a dynamic video coding scheme to provide object scalable functionalities. As a particular instance of the dynamic coding concept, the coding scheme considered here jointly optimizes video data partition and representation modes. Indeed, as there exists no universal video coding method, dynamic coding insures the choice of the most efficient technique (for instance DCT, fractal or motion compensation) for each data segment. These data segments are themselves optimally partitioned within the original frame (respectively region of interest). An optimization algorithm achieves this joint data partition/representation modes selection to yield the best rate/distortion compromise within the available set of possible solutions, under a rate or distortion constraint. Such a dynamic coding algorithm designed for low bitrates was proposed to MPEG-4 first set of tests in November 1995. This paper describes the corresponding object scalable coding scheme.
{"title":"Object-scalable dynamic coding of visual information","authors":"C. Jordan, E. Reusens, T. Ebrahimi","doi":"10.5281/ZENODO.36233","DOIUrl":"https://doi.org/10.5281/ZENODO.36233","url":null,"abstract":"This paper describes an extension of a dynamic video coding scheme to provide object scalable functionalities. As a particular instance of the dynamic coding concept, the coding scheme considered here jointly optimizes video data partition and representation modes. Indeed, as there exists no universal video coding method, dynamic coding insures the choice of the most efficient technique (for instance DCT, fractal or motion compensation) for each data segment. These data segments are themselves optimally partitioned within the original frame (respectively region of interest). An optimization algorithm achieves this joint data partition/representation modes selection to yield the best rate/distortion compromise within the available set of possible solutions, under a rate or distortion constraint. Such a dynamic coding algorithm designed for low bitrates was proposed to MPEG-4 first set of tests in November 1995. This paper describes the corresponding object scalable coding scheme.","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130681686","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}
An Acoustic Echo Canceller (AEC) based on the Decoupled Partitioned Block Frequency Domain Adaptive Filter (DPBFDAF) [3, 4] is implemented on a single Digital Signal Processor (DSP), the TMS320C30. This flexible setup makes it possible to choose the sample frequency (fs), the number of coefficients (N) of the adaptive filter and the processing delay independent of one another (only limited by the total complexity). Two implementation examples are given: one with N = 2016 and fs=7 kHz with a processing delay of 1.6 msec, the other one with N = 2560 and fs = 13kHz with a processing delay of 6.5 msec. It is shown that the setup works both for a white noise input signal and a real speech signal.
{"title":"Realization of an acoustic echo canceller on a single DSP","authors":"G.P.M. Egelmeers, P. Sommen, J. D. Boer","doi":"10.5281/ZENODO.35922","DOIUrl":"https://doi.org/10.5281/ZENODO.35922","url":null,"abstract":"An Acoustic Echo Canceller (AEC) based on the Decoupled Partitioned Block Frequency Domain Adaptive Filter (DPBFDAF) [3, 4] is implemented on a single Digital Signal Processor (DSP), the TMS320C30. This flexible setup makes it possible to choose the sample frequency (fs), the number of coefficients (N) of the adaptive filter and the processing delay independent of one another (only limited by the total complexity). Two implementation examples are given: one with N = 2016 and fs=7 kHz with a processing delay of 1.6 msec, the other one with N = 2560 and fs = 13kHz with a processing delay of 6.5 msec. It is shown that the setup works both for a white noise input signal and a real speech signal.","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129308935","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}
Arithmetic coding is usually implemented in fixed precision. Such an implementation cannot efficiently code sources, such as image coding algorithms, that locally produce a small fraction of a large alphabet of symbols. In this paper, we propose a novel approach to overcome this inefficiency. The proposed algorithm uses dual symbol sets: a primary symbol set that contains the symbols that have occurred in the recent past and a secondary symbol set that contains all other symbols. Both sets are dynamically adapted to the local statistics. We summarize an analysis of the proposed approach and describe the results that we have obtained by applying it to images.
{"title":"Dual set arithmetic coding and its applications to image coding","authors":"B. Zhu, E. Yang, A. Tewfik","doi":"10.5281/ZENODO.36231","DOIUrl":"https://doi.org/10.5281/ZENODO.36231","url":null,"abstract":"Arithmetic coding is usually implemented in fixed precision. Such an implementation cannot efficiently code sources, such as image coding algorithms, that locally produce a small fraction of a large alphabet of symbols. In this paper, we propose a novel approach to overcome this inefficiency. The proposed algorithm uses dual symbol sets: a primary symbol set that contains the symbols that have occurred in the recent past and a secondary symbol set that contains all other symbols. Both sets are dynamically adapted to the local statistics. We summarize an analysis of the proposed approach and describe the results that we have obtained by applying it to images.","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127781155","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}
When transmultiplexers with overlapping frequency bands are used for the transmission of data over non-ideal channels, intersymbol interference and crosstalk between different data channels will arise. This paper addresses the design of optimal linear networks that reduce the effects mentioned above. A receiver structure based on a combination of crosstalk reduction, memory truncation and Viterbi detection will be proposed. The filter design method presented here is based on the maximization of a signal-to-noise ratio (SNR) at the detector input. The SNR will be defined for channel memories being truncated to arbitrary lengths. Thus, low-complexity Viterbi detectors working independently for all data channels can be used. The design of minimum mean squares error (MMSE) equalizer networks is included in the framework.
{"title":"Crosstalk cancellation and memory truncation in transmultiplexer filter banks — Transmission over non-ideal channels","authors":"A. Mertins","doi":"10.5281/ZENODO.36083","DOIUrl":"https://doi.org/10.5281/ZENODO.36083","url":null,"abstract":"When transmultiplexers with overlapping frequency bands are used for the transmission of data over non-ideal channels, intersymbol interference and crosstalk between different data channels will arise. This paper addresses the design of optimal linear networks that reduce the effects mentioned above. A receiver structure based on a combination of crosstalk reduction, memory truncation and Viterbi detection will be proposed. The filter design method presented here is based on the maximization of a signal-to-noise ratio (SNR) at the detector input. The SNR will be defined for channel memories being truncated to arbitrary lengths. Thus, low-complexity Viterbi detectors working independently for all data channels can be used. The design of minimum mean squares error (MMSE) equalizer networks is included in the framework.","PeriodicalId":282153,"journal":{"name":"1996 8th European Signal Processing Conference (EUSIPCO 1996)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129700340","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
扫码关注我们
求助内容：
应助结果提醒方式：