Pub Date : 2007-11-21DOI: 10.1109/SIPS.2007.4387561
Hui-Yu Huang, W. Shih, W. Hsu
In this paper, we propose an approach to category the film kinds using low-level features and visual effect features. This approach aims to category the films into genres. Our current domain of study is the movie preview. A film preview often emphasizes the theme of a film and hence provides suitable information for classification process. In our approach, we classify films into three broad categories: Action, Dramas, and Thriller films. Four computable video features (average shot length, color variance, motion content and lighting key) and visual effects are combined in our approach to provide the advantage information to demonstrate the movie category. Our approach can also be extended for other potential applications, including browsing and retrieval of videos on the internet, video-on-demand, and video libraries. Experimental results show the visual effect feature play an important role for classifying the film kinds.
{"title":"Movie Classification Using Visual Effect Features","authors":"Hui-Yu Huang, W. Shih, W. Hsu","doi":"10.1109/SIPS.2007.4387561","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387561","url":null,"abstract":"In this paper, we propose an approach to category the film kinds using low-level features and visual effect features. This approach aims to category the films into genres. Our current domain of study is the movie preview. A film preview often emphasizes the theme of a film and hence provides suitable information for classification process. In our approach, we classify films into three broad categories: Action, Dramas, and Thriller films. Four computable video features (average shot length, color variance, motion content and lighting key) and visual effects are combined in our approach to provide the advantage information to demonstrate the movie category. Our approach can also be extended for other potential applications, including browsing and retrieval of videos on the internet, video-on-demand, and video libraries. Experimental results show the visual effect feature play an important role for classifying the film kinds.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"112 1","pages":"295-300"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85367884","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 : 2007-11-21DOI: 10.1109/SIPS.2007.4387513
M. El-Hajjar, O. Alamri, L. Hanzo
This paper presents a novel multifunctional multiple-input multiple-output (MIMO) scheme that combines the benefits of the Vertical Bell Labs Layered Space-Time (V-BLAST) scheme, of Space-Time Codes (STC) as well as of beam-forming. Further system performance improvements can be attained by serially concatenated convolutional encoding combined with a unity-rate code (URC) referred to as a precoder. Then, at the receiver side, iterative decoding is invoked by exchanging extrinsic information between the precoder's decoder as well as the outer Recursive Systematic Convolutional (RSC) code's decoder. Moreover, the convergence behaviour of the proposed system is evaluated with the aid of Extrinsic Information Transfer (EXIT) charts. Finally, we quantify the maximum achievable rate of the system based on EXIT charts and demonstrate that the iterative-detection-aided system is capable of operating within 1 dB from the maximum achievable rate.
{"title":"Layered Steered Space-Time Codes Using Iterative Detection","authors":"M. El-Hajjar, O. Alamri, L. Hanzo","doi":"10.1109/SIPS.2007.4387513","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387513","url":null,"abstract":"This paper presents a novel multifunctional multiple-input multiple-output (MIMO) scheme that combines the benefits of the Vertical Bell Labs Layered Space-Time (V-BLAST) scheme, of Space-Time Codes (STC) as well as of beam-forming. Further system performance improvements can be attained by serially concatenated convolutional encoding combined with a unity-rate code (URC) referred to as a precoder. Then, at the receiver side, iterative decoding is invoked by exchanging extrinsic information between the precoder's decoder as well as the outer Recursive Systematic Convolutional (RSC) code's decoder. Moreover, the convergence behaviour of the proposed system is evaluated with the aid of Extrinsic Information Transfer (EXIT) charts. Finally, we quantify the maximum achievable rate of the system based on EXIT charts and demonstrate that the iterative-detection-aided system is capable of operating within 1 dB from the maximum achievable rate.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"15 1","pages":"35-39"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89284692","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 : 2007-11-21DOI: 10.1109/SIPS.2007.4387588
R. Chaisricharoen, B. Chipipop, B. Sirinaovakul
The novel mathematical bandpass-biquad evaluation model based on poles/zeroes location for computer-based compensation of an OTA-C filter is proposed. In proving of model's validation, the SA algorithm is utilized for searching a compensated circuit's parameters of the most compact version of bandpass OTA-based TT biquad, which is not suitable for classical compensation methods of OTA's nonidealities. A CMOS OTA with non-linear transconductance and low output resistance is chosen as the based OTA for the tested circuit. Through experiments, the proposed pole-zero-based model is proved very suitable for computer-based evaluation of bandpass biquad in compensation process. The comparing experiment is also conducted to measure the performances of the proposed and the existed model. The results provide a conclusion that the proposed model is superior in the requirement of computing power, and the evaluation ability for compensation process.
{"title":"Novel Bandpass-Biquad Evaluation Model for Computer-Based Compensation of an OTA-C Filter","authors":"R. Chaisricharoen, B. Chipipop, B. Sirinaovakul","doi":"10.1109/SIPS.2007.4387588","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387588","url":null,"abstract":"The novel mathematical bandpass-biquad evaluation model based on poles/zeroes location for computer-based compensation of an OTA-C filter is proposed. In proving of model's validation, the SA algorithm is utilized for searching a compensated circuit's parameters of the most compact version of bandpass OTA-based TT biquad, which is not suitable for classical compensation methods of OTA's nonidealities. A CMOS OTA with non-linear transconductance and low output resistance is chosen as the based OTA for the tested circuit. Through experiments, the proposed pole-zero-based model is proved very suitable for computer-based evaluation of bandpass biquad in compensation process. The comparing experiment is also conducted to measure the performances of the proposed and the existed model. The results provide a conclusion that the proposed model is superior in the requirement of computing power, and the evaluation ability for compensation process.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"45 1","pages":"441-446"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85567875","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 : 2007-11-21DOI: 10.1109/SIPS.2007.4387590
K. Ochs
A novel parameterization of band-limited Nyquist pulses is presented, which allows for an elegant classification of such pulses. Besides this, the new parametric representation is used for a deterministic sensitivity analysis of a communication system with almost no inter-symbol interference in the presence of timing jitters. A treatment as a periodically linear time-variant system results in a frequency domain based formulation of Nyquist condition, being advantageously applicable to pulse shaping filters with finite impulse response.
{"title":"A Parameterization of Band-Limited Nyquist Pulses","authors":"K. Ochs","doi":"10.1109/SIPS.2007.4387590","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387590","url":null,"abstract":"A novel parameterization of band-limited Nyquist pulses is presented, which allows for an elegant classification of such pulses. Besides this, the new parametric representation is used for a deterministic sensitivity analysis of a communication system with almost no inter-symbol interference in the presence of timing jitters. A treatment as a periodically linear time-variant system results in a frequency domain based formulation of Nyquist condition, being advantageously applicable to pulse shaping filters with finite impulse response.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"64 1","pages":"452-456"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89953670","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 : 2007-11-21DOI: 10.1109/SIPS.2007.4387530
Jingyu Hua, L. Meng, Xiaojian Xu, Zhijiang Xu, Dongming Wang
Recently, signal-to-noise ratio (SNR) and mobile speed estimations have drawn a great amount of attention due to their comprehensive use in modern adaptive signal processing. Hence after investigating a double sampling rate (DSR) signal processing technique, we propose a joint estimator to estimate these two parameters, where we utilize the fact that the autocorrelation function (ACF) of time-varying wireless channel is related to the SNR and Doppler Shift, the latter of which is also related to mobile speed. We verify the proposed algorithm by computer simulation, and the results have showed a good SNR-independent peformance in a wide range of velocities and SNRs.
{"title":"A Joint Estimator of SNR and Mobile Speed in Wireless Communications","authors":"Jingyu Hua, L. Meng, Xiaojian Xu, Zhijiang Xu, Dongming Wang","doi":"10.1109/SIPS.2007.4387530","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387530","url":null,"abstract":"Recently, signal-to-noise ratio (SNR) and mobile speed estimations have drawn a great amount of attention due to their comprehensive use in modern adaptive signal processing. Hence after investigating a double sampling rate (DSR) signal processing technique, we propose a joint estimator to estimate these two parameters, where we utilize the fact that the autocorrelation function (ACF) of time-varying wireless channel is related to the SNR and Doppler Shift, the latter of which is also related to mobile speed. We verify the proposed algorithm by computer simulation, and the results have showed a good SNR-independent peformance in a wide range of velocities and SNRs.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"8 1","pages":"121-125"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79087886","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 : 2007-11-21DOI: 10.1109/SIPS.2007.4387578
L. Zhiqiang, Ma Hongguang, Wu Xuemei
Direction finding by MUSIC algorithm in noncooperative passive detection system is proposed. Basing on the method the array error is corrected by instrumental sensor method (ISM). In the method, firstly, the correlation signals of array received signals and the frequency-shift signals of direct signal are obtained; secondly, the signals near to estimation delay of correlation signals are selected as new received signals of the array; finally, MUSIC algorithm is used to find object's direction. It is proved that when the new received signals' length is 1, the method has highest estimation precision. Simulation result shows that theoretical derivation is correct and the method is effective.
{"title":"Bearing Finding and Array Error Correction in Noncooperative Passive Detection","authors":"L. Zhiqiang, Ma Hongguang, Wu Xuemei","doi":"10.1109/SIPS.2007.4387578","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387578","url":null,"abstract":"Direction finding by MUSIC algorithm in noncooperative passive detection system is proposed. Basing on the method the array error is corrected by instrumental sensor method (ISM). In the method, firstly, the correlation signals of array received signals and the frequency-shift signals of direct signal are obtained; secondly, the signals near to estimation delay of correlation signals are selected as new received signals of the array; finally, MUSIC algorithm is used to find object's direction. It is proved that when the new received signals' length is 1, the method has highest estimation precision. Simulation result shows that theoretical derivation is correct and the method is effective.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"26 1","pages":"387-390"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79032656","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 : 2007-11-21DOI: 10.1109/SIPS.2007.4387548
R. Maunder, Jin Wang, S. Ng, Lie-liang Yang, L. Hanzo
In this paper we propose a novel Irregular Variable Length Coding (IrVLC) scheme for near-capacity joint source and channel coding. We employ a number of Variable Length Coding (VLC) component codebooks having different coding rates for encoding appropriately chosen fractions of the input source symbols. These fractions may be designed With the aid of EXtrinsic Information Transfer (EXIT) charts so that the EXIT curve shape of the IrVLC codec may be matched to that of a serially concatenated channel codec as closely as possible. In this way, an open EXIT chart tunnel may be created even at low Eb/N0 values that are close to the channel capacity. We detail the proposed serially concatenated and iteratively decoded IrVLC and Trellis Coded Modulation (TCM) designs that are capable of operating within 0.6 dB of the uncorrelated narrowband Rayleigh fading channel's capacity at an effective bandwidth efficiency of 1.56 bit/s/Hz, assuming ideal Nyquist filtering. By contrast, the equivalent-rate VLC-based bench-marker schemes were found to be capable of operating at 1.1 dB from capacity, which is nearly double the discrepancy of the proposed IrVLC-TCM scheme.
{"title":"Iteratively Decoded Irregular Variable Length Coding and Trellis Coded Modulation","authors":"R. Maunder, Jin Wang, S. Ng, Lie-liang Yang, L. Hanzo","doi":"10.1109/SIPS.2007.4387548","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387548","url":null,"abstract":"In this paper we propose a novel Irregular Variable Length Coding (IrVLC) scheme for near-capacity joint source and channel coding. We employ a number of Variable Length Coding (VLC) component codebooks having different coding rates for encoding appropriately chosen fractions of the input source symbols. These fractions may be designed With the aid of EXtrinsic Information Transfer (EXIT) charts so that the EXIT curve shape of the IrVLC codec may be matched to that of a serially concatenated channel codec as closely as possible. In this way, an open EXIT chart tunnel may be created even at low Eb/N0 values that are close to the channel capacity. We detail the proposed serially concatenated and iteratively decoded IrVLC and Trellis Coded Modulation (TCM) designs that are capable of operating within 0.6 dB of the uncorrelated narrowband Rayleigh fading channel's capacity at an effective bandwidth efficiency of 1.56 bit/s/Hz, assuming ideal Nyquist filtering. By contrast, the equivalent-rate VLC-based bench-marker schemes were found to be capable of operating at 1.1 dB from capacity, which is nearly double the discrepancy of the proposed IrVLC-TCM scheme.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"8 1","pages":"222-227"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86455659","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 : 2007-11-21DOI: 10.1016/j.patrec.2008.10.017
Zhaowen Wang, Xiaokang Yang, Yi Xu, Songyu Yu
{"title":"Camshift Guided Particle Filter for Visual Tracking","authors":"Zhaowen Wang, Xiaokang Yang, Yi Xu, Songyu Yu","doi":"10.1016/j.patrec.2008.10.017","DOIUrl":"https://doi.org/10.1016/j.patrec.2008.10.017","url":null,"abstract":"","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"33 1","pages":"301-306"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91221631","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 : 2007-11-21DOI: 10.1109/SIPS.2007.4387626
Jeehoon An, Wonjae Lee, Jaeseok Kim
This paper proposes a defective pixel detection algorithm for CCD/CMOS image sensors and its hardware architecture. In previous algorithms, the characteristics of images have not been considered and normal pixels can be treated as defective pixels with high possibility. In order to make up for those disadvantages, the proposed algorithm detects defective pixels by considering the characteristics of the image and verifies them using several frames while checking scene-changes. Whenever a scene-change is occurred, potentially defective pixels are detected and verified. The proposed algorithm was implemented with Verilog HDL. Total logic gate count was 5.1k using 0.25um CMOS standard cell library.
{"title":"Adaptive Detection and Concealment Algorithm of Defective Pixel","authors":"Jeehoon An, Wonjae Lee, Jaeseok Kim","doi":"10.1109/SIPS.2007.4387626","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387626","url":null,"abstract":"This paper proposes a defective pixel detection algorithm for CCD/CMOS image sensors and its hardware architecture. In previous algorithms, the characteristics of images have not been considered and normal pixels can be treated as defective pixels with high possibility. In order to make up for those disadvantages, the proposed algorithm detects defective pixels by considering the characteristics of the image and verifies them using several frames while checking scene-changes. Whenever a scene-change is occurred, potentially defective pixels are detected and verified. The proposed algorithm was implemented with Verilog HDL. Total logic gate count was 5.1k using 0.25um CMOS standard cell library.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"29 1","pages":"651-656"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91353963","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 : 2007-11-21DOI: 10.1109/SIPS.2007.4387554
S. Tehrani, Shie Mannor, W. Gross
Stochastic decoding is a new alternative method for low complexity decoding of error-correcting codes. This paper presents the first hardware architecture for stochastic decoding of practical Low-Density Parity-Check (LDPC) codes on factor graphs. The proposed architecture makes fully-parallel decoding of (long) state-of-the-art LDPC codes viable on FP-GAs. Implementation results for a (1024, 512) fully-parallel LDPC decoder shows an area requirement of about 36% of a Xilinx Virtex-4 XC4VLX200 device and a throughput of 706 Mbps at a bit-error-rate of about 1-6 with performance loss0 of about 0.1 dB, with respect to the nearly ideal floating-point sum-product algorithm with 32 iterations.
{"title":"An Area-Efficient FPGA-Based Architecture for Fully-Parallel Stochastic LDPC Decoding","authors":"S. Tehrani, Shie Mannor, W. Gross","doi":"10.1109/SIPS.2007.4387554","DOIUrl":"https://doi.org/10.1109/SIPS.2007.4387554","url":null,"abstract":"Stochastic decoding is a new alternative method for low complexity decoding of error-correcting codes. This paper presents the first hardware architecture for stochastic decoding of practical Low-Density Parity-Check (LDPC) codes on factor graphs. The proposed architecture makes fully-parallel decoding of (long) state-of-the-art LDPC codes viable on FP-GAs. Implementation results for a (1024, 512) fully-parallel LDPC decoder shows an area requirement of about 36% of a Xilinx Virtex-4 XC4VLX200 device and a throughput of 706 Mbps at a bit-error-rate of about 1-6 with performance loss0 of about 0.1 dB, with respect to the nearly ideal floating-point sum-product algorithm with 32 iterations.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"17 1","pages":"255-260"},"PeriodicalIF":0.0,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90411347","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
扫码关注我们
求助内容：
应助结果提醒方式：