Pub Date : 2006-12-01DOI: 10.1109/ISPACS.2006.364725
T. Adachi, K. Kondo, S. Kobashi, Y. Hata
The reconstruction and interpretation of 3D scene from 2D image have been studied. In this paper, we propose a method for the identification of the scene including the buildings by estimating the self-location of a camera. The scene is identified by matching the input image with the projected map corresponding to the estimated pose/position of a camera. The camera motion is dynamically estimated by using the image sequence. In this method, the corners of the building in the image are tracked by projecting the corners with the estimated camera pose/position in the previous frame. The validity of the proposed method is confirmed by evaluation of the estimated camera trajectory and the comparison of the input images with the image generated by estimated camera parameters.
{"title":"Identification of a Scene by Estimating the Position and Pose of a Moving Camera","authors":"T. Adachi, K. Kondo, S. Kobashi, Y. Hata","doi":"10.1109/ISPACS.2006.364725","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364725","url":null,"abstract":"The reconstruction and interpretation of 3D scene from 2D image have been studied. In this paper, we propose a method for the identification of the scene including the buildings by estimating the self-location of a camera. The scene is identified by matching the input image with the projected map corresponding to the estimated pose/position of a camera. The camera motion is dynamically estimated by using the image sequence. In this method, the corners of the building in the image are tracked by projecting the corners with the estimated camera pose/position in the previous frame. The validity of the proposed method is confirmed by evaluation of the estimated camera trajectory and the comparison of the input images with the image generated by estimated camera parameters.","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130419491","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 : 2006-12-01DOI: 10.1109/ISPACS.2006.364833
Yu-Sun Liu, Zeng-Jey Su, Chun-Da Li
This paper investigates the dynamic spectrum management (DSM) problem in mixed asymmetric digital subscriber line (ADSL) CO/RT deployments. A new distributed DSM algorithm is developed with an objective of enlarging the achievable rate region. The results show that the new algorithm achieves significant performance gains over the existing distributed DSM algorithm iterative water-filling (IW). Simulation results also show that the proposed algorithm enlarges the rate region in the upstream transmission of very-high bit-rate digital subscriber lines (VDSL) systems
{"title":"Distributed Dynamic Spectrum Management Algorithm for Mixed ADSL CO/RT Deployments","authors":"Yu-Sun Liu, Zeng-Jey Su, Chun-Da Li","doi":"10.1109/ISPACS.2006.364833","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364833","url":null,"abstract":"This paper investigates the dynamic spectrum management (DSM) problem in mixed asymmetric digital subscriber line (ADSL) CO/RT deployments. A new distributed DSM algorithm is developed with an objective of enlarging the achievable rate region. The results show that the new algorithm achieves significant performance gains over the existing distributed DSM algorithm iterative water-filling (IW). Simulation results also show that the proposed algorithm enlarges the rate region in the upstream transmission of very-high bit-rate digital subscriber lines (VDSL) systems","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121316740","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 : 2006-12-01DOI: 10.1109/ISPACS.2006.364825
V. Patanavijit, S. Jitapunkul
The traditional SRR (super-resolution reconstruction) estimations are based on L1 or L2 statistical norm estimation therefore these SRR methods are usually very sensitive to their assumed model of data and noise that limits their utility. This paper reviews some of these SRR methods and addresses their shortcomings. We propose a novel SRR approach based on the stochastic regularization technique of Bayesian MAP estimation by minimizing a cost function. The Huber norm is used for measuring the difference between the projected estimate of the high-resolution image and each low resolution image, removing outliers in the data and Tikhonov and Huber-Tikhonov regularization are used to remove artifacts from the final answer and improve the rate of convergence. The experimental results confirm the effectiveness of our methods and demonstrate its superiority to other super-resolution methods based on L1 and L2 norm for several noise models such as noiseless, AWGN, Poisson and salt & pepper noise
{"title":"A Robust Iterative Multiframe Super-Resolution Reconstruction using a Huber Bayesian Approach with Huber-Tikhonov Regularization","authors":"V. Patanavijit, S. Jitapunkul","doi":"10.1109/ISPACS.2006.364825","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364825","url":null,"abstract":"The traditional SRR (super-resolution reconstruction) estimations are based on L1 or L2 statistical norm estimation therefore these SRR methods are usually very sensitive to their assumed model of data and noise that limits their utility. This paper reviews some of these SRR methods and addresses their shortcomings. We propose a novel SRR approach based on the stochastic regularization technique of Bayesian MAP estimation by minimizing a cost function. The Huber norm is used for measuring the difference between the projected estimate of the high-resolution image and each low resolution image, removing outliers in the data and Tikhonov and Huber-Tikhonov regularization are used to remove artifacts from the final answer and improve the rate of convergence. The experimental results confirm the effectiveness of our methods and demonstrate its superiority to other super-resolution methods based on L1 and L2 norm for several noise models such as noiseless, AWGN, Poisson and salt & pepper noise","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"700 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122983830","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 : 2006-12-01DOI: 10.1109/ISPACS.2006.364878
Kiyoshi Ishii
This paper describes the circuit design of very-high-performance multiplexer (MUX) ICs for optical communications systems. The sophisticated circuit design includes optimization of collector current density of each transistor to achieve both low-power consumption and high-speed operation. Low-power over-40-Gbit/s 16:1 MUX and high-speed 100-Gbit/s selector-type MUX ICs were successfully designed using InP/InGaAs heterojunction bipolar transistors (HBTs)
{"title":"Very-High-Speed InP/InGaAs HBT Multiplexer ICs for Optical Communication Systems","authors":"Kiyoshi Ishii","doi":"10.1109/ISPACS.2006.364878","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364878","url":null,"abstract":"This paper describes the circuit design of very-high-performance multiplexer (MUX) ICs for optical communications systems. The sophisticated circuit design includes optimization of collector current density of each transistor to achieve both low-power consumption and high-speed operation. Low-power over-40-Gbit/s 16:1 MUX and high-speed 100-Gbit/s selector-type MUX ICs were successfully designed using InP/InGaAs heterojunction bipolar transistors (HBTs)","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"347 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126683153","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 : 2006-12-01DOI: 10.1109/ISPACS.2006.364765
Lu Wei, J. Xi, Yuanguang Yu, J. Chicharo
With an optical feedback interferometry (OFI), a self-mixing signal (SMS) can be observed and employed to determine parameters of the semiconductor laser and metrological quantities of an object. In the cases of the measurement of the movement trace of an external target, phase unwrapping of the SMS must be performed, which remains a challenging issue. We report a technique for achieving phase unwrapping of the SMS signals as follows. Firstly, the behaviour of the phase equation of the OFI is studied, based on which general laws for laser phase change with respect to external target movement is extracted. Secondly, the correlation between the laser phase change and SMS signal is studied. Finally phase unwrapping algorithm is developed based on the relationship. In order to make sure that the proposed approach works well in the cases of noisy SMS data, pre-processing algorithms are also discussed. The proposed techniques have been tested by both computer simulation and experimental data which show that excellent agreement can be achieved and the movement trace of the external target can be retrieved
{"title":"Phase Unwrapping of Self-mixing Signals Observed in Optical Feedback Interferometry for Displacement Measurement","authors":"Lu Wei, J. Xi, Yuanguang Yu, J. Chicharo","doi":"10.1109/ISPACS.2006.364765","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364765","url":null,"abstract":"With an optical feedback interferometry (OFI), a self-mixing signal (SMS) can be observed and employed to determine parameters of the semiconductor laser and metrological quantities of an object. In the cases of the measurement of the movement trace of an external target, phase unwrapping of the SMS must be performed, which remains a challenging issue. We report a technique for achieving phase unwrapping of the SMS signals as follows. Firstly, the behaviour of the phase equation of the OFI is studied, based on which general laws for laser phase change with respect to external target movement is extracted. Secondly, the correlation between the laser phase change and SMS signal is studied. Finally phase unwrapping algorithm is developed based on the relationship. In order to make sure that the proposed approach works well in the cases of noisy SMS data, pre-processing algorithms are also discussed. The proposed techniques have been tested by both computer simulation and experimental data which show that excellent agreement can be achieved and the movement trace of the external target can be retrieved","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"116 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114091366","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 : 2006-12-01DOI: 10.1109/ISPACS.2006.364844
N. Kurata, S. Saruwatari, H. Morikawa
Ubiquitous structural monitoring (USM) of buildings using wireless sensor networks is one of the most promising emerging technologies for mitigation of seismic hazard. This technology has the potential to change fundamentally the traditional monitoring systems. This paper provides an introduction of wireless sensor network technology for USM, and identifies some of opportunities and associated challenges
{"title":"Ubiquitous Structural Monitoring using Wireless Sensor Networks","authors":"N. Kurata, S. Saruwatari, H. Morikawa","doi":"10.1109/ISPACS.2006.364844","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364844","url":null,"abstract":"Ubiquitous structural monitoring (USM) of buildings using wireless sensor networks is one of the most promising emerging technologies for mitigation of seismic hazard. This technology has the potential to change fundamentally the traditional monitoring systems. This paper provides an introduction of wireless sensor network technology for USM, and identifies some of opportunities and associated challenges","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116576907","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 : 2006-12-01DOI: 10.1109/ISPACS.2006.364910
YudaiKato DaigoMuramatsu
A factor known as intersession variability in signatures causes deterioration of authentication performance. We propose a novel algorithm that includes a model updating scheme to correct for this variability. A model was provided for each user to calculate a score using fused multiple distance measures with respect to previous work. The algorithm consisted of an updating phase in addition to a training phase and a testing phase. In the training phase, the model's parameters were sampled using a Markov chain Monte Carlo method for each individual. In the testing phase, the generated model was used to determine whether a test signature was genuine. In the updating phase, the parameters were updated with test data using a sequential Monte Carlo (SMC) algorithm. Adoption of a parameter for automatically adjusting a hyper parameter in SMC improved the authentication performance. Several experiments were performed on signatures from a public database. The proposed algorithm achieved an EER of 7.59%
{"title":"Signature Verification using a Monte Carlo-based Updating Algorithm Adapted to Intersession Variability","authors":"YudaiKato DaigoMuramatsu","doi":"10.1109/ISPACS.2006.364910","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364910","url":null,"abstract":"A factor known as intersession variability in signatures causes deterioration of authentication performance. We propose a novel algorithm that includes a model updating scheme to correct for this variability. A model was provided for each user to calculate a score using fused multiple distance measures with respect to previous work. The algorithm consisted of an updating phase in addition to a training phase and a testing phase. In the training phase, the model's parameters were sampled using a Markov chain Monte Carlo method for each individual. In the testing phase, the generated model was used to determine whether a test signature was genuine. In the updating phase, the parameters were updated with test data using a sequential Monte Carlo (SMC) algorithm. Adoption of a parameter for automatically adjusting a hyper parameter in SMC improved the authentication performance. Several experiments were performed on signatures from a public database. The proposed algorithm achieved an EER of 7.59%","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116635154","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 : 2006-12-01DOI: 10.1109/ISPACS.2006.364795
Yoshihiro Kitaura, M. Muneyasu
JPEG2000 has a feature called region of interest (ROI). This feature can encode a restricted region in an image prior to its background (BG) region. In low bit rate compression, the code of the ROI region occupies the most part of the bit stream for the whole image by the rate control processing. To solve this problem, several progressive image quality control methods between the ROI and BG regions have been proposed. However they cannot realize fine relative image quality control between the ROI and BG region. This paper proposes a fine control method by one-path processing. The standard decoder of JPEG2000 part 1 can decode the coded data
{"title":"A Fine Progressive Image Quality Control method for ROI Image in JPEG2000","authors":"Yoshihiro Kitaura, M. Muneyasu","doi":"10.1109/ISPACS.2006.364795","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364795","url":null,"abstract":"JPEG2000 has a feature called region of interest (ROI). This feature can encode a restricted region in an image prior to its background (BG) region. In low bit rate compression, the code of the ROI region occupies the most part of the bit stream for the whole image by the rate control processing. To solve this problem, several progressive image quality control methods between the ROI and BG regions have been proposed. However they cannot realize fine relative image quality control between the ROI and BG region. This paper proposes a fine control method by one-path processing. The standard decoder of JPEG2000 part 1 can decode the coded data","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124982685","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 : 2006-12-01DOI: 10.1109/ISPACS.2006.364703
Hirokazu Oba, Minseok Kim, Hiroyuki Arai
This paper proposed a fixed-point implementation method of LMS (least mean square) and N-LMS (normalized-LMS) processor. In N-LMS, this paper proposes an efficient method using simple bit-shift operation instead of division. The convergence performance in LMS, N-LMS and RLS (recursive least square) adaptive array antenna is compared by implementation with single large scale FPGA (field programmable gate array) on the same developed hardware platform. It was evaluated by using the actual processing time considering the operation clock speed instead of the number of weight updates. The fixed-point operation with optimized word length and bit-shift operation instead of division are expected to provide faster actual FPGA processing time for LMS families compared with RLS in some specific cases
{"title":"FPGA Implementation of LMS and N-LMS Processor for Adaptive Array Applications","authors":"Hirokazu Oba, Minseok Kim, Hiroyuki Arai","doi":"10.1109/ISPACS.2006.364703","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364703","url":null,"abstract":"This paper proposed a fixed-point implementation method of LMS (least mean square) and N-LMS (normalized-LMS) processor. In N-LMS, this paper proposes an efficient method using simple bit-shift operation instead of division. The convergence performance in LMS, N-LMS and RLS (recursive least square) adaptive array antenna is compared by implementation with single large scale FPGA (field programmable gate array) on the same developed hardware platform. It was evaluated by using the actual processing time considering the operation clock speed instead of the number of weight updates. The fixed-point operation with optimized word length and bit-shift operation instead of division are expected to provide faster actual FPGA processing time for LMS families compared with RLS in some specific cases","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125336895","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 : 2006-12-01DOI: 10.1109/ISPACS.2006.364781
V. Y. Vu, A.B. Delai
This paper presents the measurement results of direction-of-arrival (DOA) in azimuth plan using a uniform linear array (ULA) and an all digital receiver array in which the radio frequency signal is directly digitized by the analog-to-digital converters (ADC). Our further goal is the real-time measurement of DOA devoted to an inter-vehicle in the intelligent transport systems. The DOA of RF signal is estimated using the high resolution method named MUSIC (multiple signal classification). The measurement setup composed of a 4 quasi-Yagi element ULA and of 4 parallel all digital receivers based on a digital oscilloscope is realized. The simulation results using ADS (advanced design system) and the measurement results show that the DOA is accurately determined with this all digital receiver solution.
{"title":"Digital Solution for inter-vehicle localisation system by means of Direction-Of-Arrival","authors":"V. Y. Vu, A.B. Delai","doi":"10.1109/ISPACS.2006.364781","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364781","url":null,"abstract":"This paper presents the measurement results of direction-of-arrival (DOA) in azimuth plan using a uniform linear array (ULA) and an all digital receiver array in which the radio frequency signal is directly digitized by the analog-to-digital converters (ADC). Our further goal is the real-time measurement of DOA devoted to an inter-vehicle in the intelligent transport systems. The DOA of RF signal is estimated using the high resolution method named MUSIC (multiple signal classification). The measurement setup composed of a 4 quasi-Yagi element ULA and of 4 parallel all digital receivers based on a digital oscilloscope is realized. The simulation results using ADS (advanced design system) and the measurement results show that the DOA is accurately determined with this all digital receiver solution.","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125126543","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
扫码关注我们
求助内容：
应助结果提醒方式：