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

Two computational algorithms for deriving phase equations: Equivalence and some cautions 推导相方程的两种计算算法:等效性和注意事项

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

D. Ohta, Hisa-aki Tanaka, Yusuke Maino

引用次数: 1

A data‐driven processor for alleviating bottlenecks of sequential programs and maintaining multiprocessing capability 一种数据驱动的处理器，用于缓解顺序程序的瓶颈和维持多处理能力

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

R. Kurebayashi, S. Ito, Toru Takahashi, H. Tomiyasu, H. Nishikawa

{"title":"A data‐driven processor for alleviating bottlenecks of sequential programs and maintaining multiprocessing capability","authors":"R. Kurebayashi, S. Ito, Toru Takahashi, H. Tomiyasu, H. Nishikawa","doi":"10.1002/ECJC.20358","DOIUrl":"https://doi.org/10.1002/ECJC.20358","url":null,"abstract":"Existing data-driven processors offer the advantages of being able to naturally resolve the problems inherent in a wide variety of granularities of parallelism, and of being able to multiprocess without overhead. However, because an instruction is not issued until the instruction that generates the source operand finishes executing, a delay equal to the number of stages in the pipeline occurs before an instruction that has a data-dependency relationship can be executed. As a result, portions of sequential processing in a program become a bottleneck. The authors are therefore in the process of developing an LSI processor that is able to retain the advantages of conventional data-driven processors while being able to efficiently execute blocks of sequential processing. This paper presents and evaluates the performance of the proposed execution model and pipeline structure of this processor. This processor uses the same pipeline to perform instruction level multiprocessing of data-driven programs that issue instructions based on the data-dependency relationships and control-driven programs that issue instructions sequentially based on a program counter. The effectiveness of parallel processing by data-driven programs, improvements in the efficiency of sequential processing by introducing control-driven programs, and the ability to evenly share the pipeline when data-driven and control-driven programs are multiprocessing are evaluated. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(12): 36–49, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20358","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"75 1","pages":"36-49"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90223635","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

Toward systematic generation of 3COL instances based on minimal unsolvable structures 基于最小不可解结构的3COL实例系统生成

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

Kazunori Mizuno, S. Nishihara

引用次数: 0

Autostereoscopic visualization of volume data using computer‐generated holograms 利用计算机生成的全息图实现体数据的自动立体可视化

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

Y. Sakamoto, Y. Aoki

{"title":"Autostereoscopic visualization of volume data using computer‐generated holograms","authors":"Y. Sakamoto, Y. Aoki","doi":"10.1002/ECJC.20355","DOIUrl":"https://doi.org/10.1002/ECJC.20355","url":null,"abstract":"There is a need for methods to display 3-dimensional data (volume data) obtained from such procedures as computer tomography (CT), magnetic resonance imaging (MRI), and 3-dimensional radar in a form that can easily be interpreted by humans. Methods that present such data via a 3-dimensional display are able to show the 3-dimensional image directly to humans and are well adapted to allow the recognition of 3-dimensional structure. In particular, 3-dimensional displays using holography are especially suited to assisting humans in interpreting 3-dimensional information. In this paper we propose a volume rendering computer-generated hologram (CGH) method that calculates a hologram directly from volume data using CGH technology without employing any intermediary images or photographic procedures. Since in this method the hologram is generated computationally, there is significant flexibility in how the 3-dimensional image can be displayed. As well as enabling images to be displayed with shading, a whole range of different 3-dimensional display techniques are possible; for example, at one extreme we can display only the surfaces in the volume data making the internal regions opaque, while by introducing transparency we can make the internal structures visible. We have confirmed the effectiveness of the proposed method by using it to create computer-generated holograms on the basis of 3-dimensional medical MRI data and conducting optical experiments. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(11): 31–39, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20355","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"181 1","pages":"31-39"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80205738","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

A data hiding method without specifying embedded positions for JPEG image 不指定JPEG图像嵌入位置的数据隐藏方法

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

Yusuke Seki, H. Kobayashi, M. Fujiyoshi, H. Kiya

{"title":"A data hiding method without specifying embedded positions for JPEG image","authors":"Yusuke Seki, H. Kobayashi, M. Fujiyoshi, H. Kiya","doi":"10.1002/ECJC.20356","DOIUrl":"https://doi.org/10.1002/ECJC.20356","url":null,"abstract":"In this paper the authors propose a data hiding method for JPEG images that has a degree of freedom in selecting the hiding position and does not require a reference image or knowledge of the hiding position during extraction. In conventional methods, the position for the transform coefficients which hide the data must be specified beforehand, and that position must be known during extraction. The proposed method does not require specifying the hiding position beforehand and offers some freedom in selecting the hiding position. Therefore, a hiding position that is appropriate can be selected for each image and block to be subjected to JPEG encoding. Given this, the proposed method can reduce image degradation and improve compression efficiency compared to the conventional methods. Moreover, because knowledge of the hiding position is not required during extraction, information management is thus simpler during extraction. The effectiveness of the proposed method is confirmed through simulations. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(11): 21–30, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20356","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"53 1","pages":"21-30"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87505980","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

Implementation and evaluation of MPLS multicast mechanism considering deployment in established MPLS networks 考虑MPLS网络部署的MPLS组播机制实现与评估

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

Nobuo Ogashiwa, S. Uda, Y. Uo, Y. Shinoda

{"title":"Implementation and evaluation of MPLS multicast mechanism considering deployment in established MPLS networks","authors":"Nobuo Ogashiwa, S. Uda, Y. Uo, Y. Shinoda","doi":"10.1002/ECJC.20354","DOIUrl":"https://doi.org/10.1002/ECJC.20354","url":null,"abstract":"There has recently been much discussion of MPLS multicast approaches. MMT and BLAST-Cast have been proposed as means of establishing multicast LSP using unicast LSP. These techniques are useful not only as transfer techniques in introducing the MPLS multicast technique, but also for the deployment of MPLS multicasting in established MPLS networks, since the scale can be expanded stepwise, and the cost of deployment and operation can be reduced in the deployment of MPLS multicast in established MPLS networks. However, there have been few studies of the detailed signaling protocol to be used in such an approach, or of problems accompanying these techniques. Consequently, we investigated a signaling protocol that can be applied to these approaches, and devised an MPLS multicast mechanism using RSVP-TE. The proposed mechanism was implemented and evaluated. This paper discusses the design and implementation of the proposed mechanism, together with its evaluation. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(11): 40–49, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20354","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"7 1","pages":"40-49"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85307624","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

Noise removal for degraded images with Poisson noise using M-transformation and BayesShrink method 基于m变换和BayesShrink的泊松噪声退化图像去噪

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

Yeqiu Li, Jianming Lu, Ling Wang, T. Yahagi

引用次数: 2

Robust and adaptive merge of multiple range images with photometric attribute 具有光度属性的多距离图像鲁棒自适应融合

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

R. Sagawa, K. Nishino, K. Ikeuchi

{"title":"Robust and adaptive merge of multiple range images with photometric attribute","authors":"R. Sagawa, K. Nishino, K. Ikeuchi","doi":"10.1002/ECJC.20353","DOIUrl":"https://doi.org/10.1002/ECJC.20353","url":null,"abstract":"In the use of the three-dimensional data obtained from a stereo system, laser range finder, and other equipment, merge processing is important. This paper proposes a new merge method for range images, based on the volume-based technique. In the proposed method, in contrast to the conventional method, the voxels are adaptively segmented according to the curvature of the surface shape to be reconstructed. This helps to represent the geometrical shape efficiently, effectively utilizing the computation resources. In the framework of the proposed merge process, additional features such as color and the laser reflectivity can be added to the three-dimensional geometrical information, which helps to maintain sharp edges in the texture and to perform rendering and the texture mapping effectively. By examining the consensus for both the geometrical shape and the color in the whole framework, the merge is made robust to noise. In this paper, the system is described first, and then the results of application to several kinds of actual data are presented. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(11): 50–60, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20353","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"126 1","pages":"50-60"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76554711","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

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-10-01 DOI: 10.1002/ECJC.20347

K. Morooka, Junya Arakawa, H. Nagahashi

{"title":"Face detection by generating and selecting features based on Kullback-Leibler divergence","authors":"K. Morooka, Junya Arakawa, H. 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":"62 1","pages":"29-39"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81485557","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

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-10-01 DOI: 10.1002/ECJC.20294

Takahiro Matsumoto, Y. 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, Y. 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":"58 1","pages":"18-28"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84193210","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