Electronics and Communications in Japan (Part III: Fundamental Electronic Science)最新文献_第8页

A method of detection of signals corrupted by nonstationary random noise via stationarization of the data 一种通过数据的平稳化来检测被非平稳随机噪声破坏的信号的方法

Electronics and Communications in Japan (Part III: Fundamental Electronic Science) Pub Date : 2007-04-23 DOI: 10.1002/ecjc.20302

Hiroshi Ijima, Akira Ohsumi, Ryo Okui

{"title":"A method of detection of signals corrupted by nonstationary random noise via stationarization of the data","authors":"Hiroshi Ijima, Akira Ohsumi, Ryo Okui","doi":"10.1002/ecjc.20302","DOIUrl":"https://doi.org/10.1002/ecjc.20302","url":null,"abstract":"This paper proposes a method for detecting a signal embedded in nonstationary noise. In most past studies of the signal detection problem, random noise is considered as a stationary stochastic process, since it is mathematically easy to handle. However, the noise observed in practice contains many nonstationary elements with time-varying (evolutionary) statistical properties. In this study, observational noise is modeled as a probability density function with slowly evolving parameters. Then, based on the evolving spectral representation, the nonstationary observation data are transformed to a stationary process. A new method is proposed as follows. It is assumed that nonstationarity remains in the stationarized observation data in the interval containing the signal, due to the effect of the signal. Then the signal is detected by testing for stationarity. In the proposed method, Priestley's evolutionary spectrum is used in the spectral representation of the nonstationary stochastic process, and the method of Okabe and colleagues based on the KM2O-Langevin equation is used for the stationarity test. The effectiveness of the proposed method is verified by a simulation experiment. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(8): 29–38, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20302","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"90 8","pages":"29-38"},"PeriodicalIF":0.0,"publicationDate":"2007-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/ecjc.20302","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71977090","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}

引用次数: 3

Overfitting of boosting and regularized Boosting algorithms boosting和正则boosting算法的过度拟合

Electronics and Communications in Japan (Part III: Fundamental Electronic Science) Pub Date : 2007-04-23 DOI: 10.1002/ecjc.20344

Takashi Onoda

引用次数: 3

A real-valued periodic orthogonal sequence derived from a real-valued shift-orthogonal finite-length sequence and its fast periodic correlation algorithm 由实数移位正交有限长序列导出的实数周期正交序列及其快速周期相关算法

Electronics and Communications in Japan (Part III: Fundamental Electronic Science) Pub Date : 2007-04-23 DOI: 10.1002/ecjc.20294

Takahiro Matsumoto, Yoshihiro Tanada

{"title":"A real-valued periodic orthogonal sequence derived from a real-valued shift-orthogonal finite-length sequence and its fast periodic correlation algorithm","authors":"Takahiro Matsumoto, Yoshihiro Tanada","doi":"10.1002/ecjc.20294","DOIUrl":"https://doi.org/10.1002/ecjc.20294","url":null,"abstract":"This paper proposes a real-valued orthogonal periodic sequence of a period N=2ν derived from a real-valued shift-orthogonal finite-length sequence of length M=2ν+1. This paper also explains the principle of a fast correlation algorithm that efficiently executes periodic correlation processing for this real-valued orthogonal periodic sequence. The sidelobe of an aperiodic autocorrelation function for a real-valued shift-orthogonal finite-length sequence (length of M) is 0 except for the right and left ends of the shift. If the subsequent sequence of first values repeatedly overlap the final values of this sequence, a real-valued orthogonal periodic sequence of a period N=M−1 can be obtained. A real-valued orthogonal periodic sequence of a period N=2ν generated from real-valued shift-orthogonal finite-length sequence of length M=2ν+1 is obtained by convoluting partial sequences and based on that controls the number of multiplications and the number of additions to increment on the order of Nlog2N without using fast Fourier transformation. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(10): 18–28, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20294","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"90 10","pages":"18-28"},"PeriodicalIF":0.0,"publicationDate":"2007-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/ecjc.20294","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71976119","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}

引用次数: 4

Fast aperiodic correlation algorithm for real-valued shift-orthogonal finite-length sequence of length 2ν+1 长度为2μ+1的实数移位正交有限长序列的快速非周期相关算法

Electronics and Communications in Japan (Part III: Fundamental Electronic Science) Pub Date : 2007-04-23 DOI: 10.1002/ecjc.20301

Yoshihiro Tanada, Takahiro Matsumoto

{"title":"Fast aperiodic correlation algorithm for real-valued shift-orthogonal finite-length sequence of length 2ν+1","authors":"Yoshihiro Tanada, Takahiro Matsumoto","doi":"10.1002/ecjc.20301","DOIUrl":"https://doi.org/10.1002/ecjc.20301","url":null,"abstract":"Real-valued shift-orthogonal finite-length sequences are sequences in which the side lobes of the aperiodic autocorrelation function become 0, except for the endpoints of the shift to both sides, and can be applied in pulse compression radar and spread spectrum communications. In this paper, a fast correlation algorithm for efficiently calculating the periodic correlation function is discussed for real-valued shift-orthogonal finite-length sequences with length M=2ν+1. For input data, including a real-valued shift-orthogonal finite-length sequence over a certain range, the value of the aperiodic correlation function is found in a certain shift range. Based on the synthesis of this sequence by the convolution of ν+1 partial sequences, the correlation processing is broken down into correlation processing of the ν+1 stages of partial sequences. As a result, the number of multiplications and the number of additions can be suppressed on the order Mlog2M. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(9): 18– 30, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20301","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"90 9","pages":"18-30"},"PeriodicalIF":0.0,"publicationDate":"2007-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/ecjc.20301","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71976123","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}

引用次数: 0

A proposal and evaluation of a coordinated checkpointing technique using incremental snapshots 使用增量快照的协调检查点技术的建议和评估

Electronics and Communications in Japan (Part III: Fundamental Electronic Science) Pub Date : 2007-04-23 DOI: 10.1002/ecjc.20296

Mamoru Ohara, Masayuki Arai, Satoshi Fukumoto, Kazuhiko Iwasaki

{"title":"A proposal and evaluation of a coordinated checkpointing technique using incremental snapshots","authors":"Mamoru Ohara, Masayuki Arai, Satoshi Fukumoto, Kazuhiko Iwasaki","doi":"10.1002/ecjc.20296","DOIUrl":"https://doi.org/10.1002/ecjc.20296","url":null,"abstract":"Coordinated checkpointing techniques ensure that a consistent global state is maintained by means of coordination between processes. The approach requires that application messages temporarily cease to be exchanged but the rollback procedure when recovering from a fault is consequently simplified and the recovery costs are small. With current reductions in communications costs, the importance of coordinated techniques may be seen to be growing. However, in large-scale systems there is a possibility that performance will be seriously impaired due to the frequent halting of the exchange of messages. In this paper we propose a method whereby coordination is performed at only a subset of the checkpoint generation points that are periodically visited while at the remaining points each process independently generates an incremental snapshot. This method aims to both alleviate the performance degradation incurred from coordination and to realize relatively high-speed recovery. In evaluating the effectiveness of this method we estimate the checkpointing overheads and recovery costs using a probabilistic model and simulations and compare it with existing coordination methods. The results show that the proposed method is more effective than existing coordination methods from the perspective of both performance and reliability in environments with a relatively low frequency of messages. In addition, we perform comparisons of two different delta schemes for representing the incremental snapshots and discuss which environments they are each respectively suited to. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(8): 39– 53, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20296","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"90 8","pages":"39-53"},"PeriodicalIF":0.0,"publicationDate":"2007-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/ecjc.20296","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71977096","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}

引用次数: 1

Utilizing nonlinear behavior of microbubbles in medical ultrasound 微气泡的非线性行为在医学超声中的应用

Electronics and Communications in Japan (Part III: Fundamental Electronic Science) Pub Date : 2007-04-23 DOI: 10.1002/ecjc.20259

Shin-Ichiro Umemura, Ken-Ichi Kawabata, Kazuaki Sasaki

引用次数: 4

Face detection by generating and selecting features based on Kullback-Leibler divergence 基于Kullback-Leibler散度的特征生成和选择人脸检测

Electronics and Communications in Japan (Part III: Fundamental Electronic Science) Pub Date : 2007-04-23 DOI: 10.1002/ecjc.20347

Ken'Ichi Morooka, Junya Arakawa, Hiroshi Nagahashi

{"title":"Face detection by generating and selecting features based on Kullback-Leibler divergence","authors":"Ken'Ichi Morooka, Junya Arakawa, Hiroshi Nagahashi","doi":"10.1002/ecjc.20347","DOIUrl":"https://doi.org/10.1002/ecjc.20347","url":null,"abstract":"Face detection from images is a complex and nonlinear problem due to the various kinds of face images. This problem is solved by conversion of the original feature vectors extracted from images into high-dimension feature vectors using nonlinear mapping, and then finding face/nonface discriminant functions in the mapping space. If such discriminant functions are based on the inner products of high-dimension vectors, such inner products can be easily obtained by substitute calculations of kernel functions in the original feature space. However, in conventional recognition algorithms using kernel functions, numerous features are required to improve recognition accuracy. This paper proposes a new face detection method that uses generation and selection of features on the basis of Kullback-Leibler divergence (KLD). KLD refers to a distance between the distributions of face and nonface data for certain features. Features with large KLD are used for face detection. Moreover, by evaluating the features based on their KLDs, we can generate new features, and deal with different kinds of features concurrently. In experiments, a classifier designed by the proposed method achieved high recognition performance, while using few features. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(10): 29– 39, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20347","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"90 10","pages":"29-39"},"PeriodicalIF":0.0,"publicationDate":"2007-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/ecjc.20347","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71981561","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}

引用次数: 2

The construction of periodically time-variant convolutional codes using binary linear block codes 用二进制线性分组码构造周期时变卷积码

Electronics and Communications in Japan (Part III: Fundamental Electronic Science) Pub Date : 2007-04-23 DOI: 10.1002/ecjc.20271

Naonori Ogasahara, Manabu Kobayashi, Shigeichi Hirasawa

{"title":"The construction of periodically time-variant convolutional codes using binary linear block codes","authors":"Naonori Ogasahara, Manabu Kobayashi, Shigeichi Hirasawa","doi":"10.1002/ecjc.20271","DOIUrl":"https://doi.org/10.1002/ecjc.20271","url":null,"abstract":"In 1996 Rosenthal and York proposed (time-invariant) BCH convolutional codes [4] in which the parity check matrix of a BCH code is used in the construction of the convolutional code. The lower bound on the minimum free distance of a BCH convolutional code is guaranteed by the BCH limit. In this paper we propose a periodically time-variant convolutional code that can be constructed not only using the BCH parity check matrix but using the check matrix of any binary linear block code and show that the lower bound on the minimum free distance is guaranteed by the minimum free distance of the binary linear block code. In addition, taking 12 binary linear block codes as examples, we perform comparisons of the proposed codes with BCH convolutional codes using three evaluation criteria (minimum free distance, number of delay elements, coding rate) and show that there exist proposed codes that are superior to existing ones. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(9): 31– 40, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20271","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"90 9","pages":"31-40"},"PeriodicalIF":0.0,"publicationDate":"2007-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/ecjc.20271","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71976125","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}

引用次数: 3

Secret information distribution 秘密信息分发

Electronics and Communications in Japan (Part III: Fundamental Electronic Science) Pub Date : 2007-04-23 DOI: 10.1002/ecjc.20308

Manabu Okamoto, Yoshiaki Tanaka

引用次数: 2

ε‐separating nonlinear filter bank and its application to face image beautification ε -分离非线性滤波器组及其在人脸图像美化中的应用

Electronics and Communications in Japan (Part III: Fundamental Electronic Science) Pub Date : 2007-04-01 DOI: 10.1002/ECJC.20241

K. Arakawa, Takuya Okada

{"title":"ε‐separating nonlinear filter bank and its application to face image beautification","authors":"K. Arakawa, Takuya Okada","doi":"10.1002/ECJC.20241","DOIUrl":"https://doi.org/10.1002/ECJC.20241","url":null,"abstract":"For the purposes of separating the specific components of nonsteady signals, the e-separating nonlinear filter bank is proposed. Previously, the authors proposed a nonlinear digital filter called the e-filter. This filter effectively eliminates the small signal amplitude random noise superimposed on a signal with a large signal changing component. The e-filter bank proposed in this paper consists of these e-filters and separates the components by taking account of both the signal amplitude and frequency. Further, a filter system for beautifying facial images using this filter bank is proposed. The human facial image consists not only of large-signal components such as the frame, eyes, nose, and mouth, but also of small-signal high-frequency components such as fine wrinkles as well as small-signal medium-frequency components such as large wrinkles and blemishes. Additionally, ultrasmall-amplitude high-frequency components expressing the natural roughness of the skin also exist. The present filter bank can eliminate wrinkles and blemishes while maintaining the natural roughness of the skin, allowing beautification of the skin of facial images to be performed effectively. © 2006 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(4): 52– 62, 2007; Published online in Wiley InterScience (www.interscience. wiley.com). DOI 10.1002/ecjc.20241","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"84 3 1","pages":"52-62"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74350032","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}

引用次数: 28