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

When synchronization phenomena are analyzed, the phase equations are known to often provide useful qualitative and quantitative information [1]. The target of this paper is to examine through comparisons of the derivation algorithm of the phase equations a realistic system including the case where the equations are not necessarily given explicitly. In other words, the equivalence of two different conventional algorithms [1, 4] is shown, and the advantages and cautions when specific phenomena use both in an example are each explained. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(12): 1– 9, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20284

在分析同步现象时，相方程通常提供有用的定性和定量信息[1]。本文的目的是通过比较相方程的推导算法来检验一个现实系统，包括方程不一定明确给出的情况。换句话说，本文展示了两种不同的传统算法[1,4]的等价性，并分别解释了在实例中使用这两种算法的特定现象时的优点和注意事项。©2007 Wiley期刊公司电子工程学报，2009,29 (1):1 - 9;在线发表于Wiley InterScience (www.interscience.wiley.com)。DOI 10.1002 / ecjc.20284

引用次数: 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

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

现有的数据驱动处理器的优点是能够自然地解决各种并行性粒度所固有的问题，并且能够在没有开销的情况下进行多进程。但是，由于在生成源操作数的指令完成执行之前不会发出指令，因此在执行具有数据依赖关系的指令之前，会出现与管道中阶段数相等的延迟。结果，程序中顺序处理的部分成为瓶颈。因此，作者正在开发一种能够保留传统数据驱动处理器的优点，同时能够有效地执行顺序处理块的LSI处理器。本文给出并评价了该处理器的执行模型和流水线结构的性能。该处理器使用相同的管道来执行基于数据依赖关系发出指令的数据驱动程序和基于程序计数器顺序发出指令的控制驱动程序的指令级多处理。评估了数据驱动程序并行处理的有效性，引入控制驱动程序提高顺序处理的效率，以及当数据驱动和控制驱动程序进行多处理时均匀共享管道的能力。©2007 Wiley期刊公司电子工程学报，2009,29 (3):393 - 398;在线发表于Wiley InterScience (www.interscience.wiley.com)。DOI 10.1002 / ecjc.20358

{"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

In this paper, the authors propose a method of systematically generating 3-colorable (3COL) graph instances for which a great deal of time and effort are required to obtain a solution (or to determine solvability). This method, which differs from the conventional approach of selecting hard instances from among randomly generated instances, aims to reliably generate hard problems by repeatedly embedding 3COL minimal unsolvable structures in the initial graph. The generated instances conform to various conditions of problems for which the solution searches that had been identified conventionally are extremely difficult. Also, the authors use several solution search algorithms to experimentally verify that the required effort is an exponential order of the number of vertices. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(12): 27–35, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20359

在本文中，作者提出了一种系统地生成3色(3COL)图实例的方法，这种方法需要花费大量的时间和精力来获得解(或确定可解性)。该方法与传统的从随机生成的实例中选择困难实例的方法不同，旨在通过在初始图中重复嵌入3COL最小不可解结构来可靠地生成困难问题。生成的实例符合问题的各种条件，对于这些问题，传统方式确定的解决方案搜索非常困难。此外，作者还使用了几种解搜索算法来实验验证所需的努力是顶点数量的指数级。©2007 Wiley期刊公司电子工程学报，2009,29 (3):357 - 357;在线发表于Wiley InterScience (www.interscience.wiley.com)。DOI 10.1002 / ecjc.20359

引用次数: 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

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

需要一种方法来显示从计算机断层扫描(CT)、磁共振成像(MRI)和三维雷达等程序中获得的三维数据(体积数据)，以一种易于被人类解释的形式。通过三维显示呈现此类数据的方法能够直接向人类显示三维图像，并且能够很好地适应于允许识别三维结构。特别是，使用全息技术的三维显示特别适合于帮助人类解释三维信息。本文提出了一种体绘制计算机生成全息图(CGH)方法，该方法使用CGH技术直接从体数据计算全息图，而不使用任何中间图像或摄影程序。由于在这种方法中，全息图是计算生成的，因此在如何显示三维图像方面具有很大的灵活性。除了使图像能够显示阴影外，还可以使用各种不同的三维显示技术;例如，在一种极端情况下，我们可以只显示体积数据中的表面，使内部区域不透明，而通过引入透明度，我们可以使内部结构可见。我们已经通过使用该方法在三维医学MRI数据的基础上创建计算机生成的全息图并进行光学实验，证实了所提出方法的有效性。©2007 Wiley期刊公司电子工程学报，2009,29 (1):1 - 4,2007;在线发表于Wiley InterScience (www.interscience.wiley.com)。DOI 10.1002 / ecjc.20355

{"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

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

本文提出了一种JPEG图像的数据隐藏方法，该方法在选择隐藏位置时具有一定的自由度，并且在提取过程中不需要参考图像或隐藏位置的知识。在传统方法中，必须事先指定隐藏数据的变换系数的位置，并且在提取过程中必须知道该位置。该方法不需要预先指定隐藏位置，并且在选择隐藏位置时提供了一定的自由度。因此，可以为要进行JPEG编码的每个图像和块选择合适的隐藏位置。因此，与传统的压缩方法相比，该方法可以减少图像的退化，提高压缩效率。此外，由于在提取过程中不需要知道隐藏位置，因此在提取过程中信息管理更加简单。通过仿真验证了该方法的有效性。©2007 Wiley期刊公司电子工程学报，2009,29 (1):1 - 3,2007;在线发表于Wiley InterScience (www.interscience.wiley.com)。DOI 10.1002 / ecjc.20356

{"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

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

最近有很多关于MPLS多播方法的讨论。MMT和BLAST-Cast是利用单播LSP建立组播LSP的两种方式。这些技术不仅可以作为引入MPLS组播技术的传输技术，而且可以在已建立的MPLS网络中部署MPLS组播，因为在已建立的MPLS网络中部署MPLS组播可以逐步扩大规模，降低部署和运营成本。然而，对这种方法中使用的详细信令协议或伴随这些技术的问题的研究很少。因此，我们研究了一种可以应用于这些方法的信令协议，并使用RSVP-TE设计了MPLS多播机制。对提议的机制进行了实施和评估。本文讨论了该机制的设计和实现，并对其进行了评价。©2007 Wiley期刊公司电子工程学报，2009,35 (6):1104 - 1104;在线发表于Wiley InterScience (www.interscience.wiley.com)。DOI 10.1002 / ecjc.20354

{"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

Median filters and other nonlinear filters have been investigated for restoration of degraded images with Poisson noise. Recently, subband image restoration using the wavelet transform has been attracting much attention. This method is effective for small-amplitude noise, but in the case of Poisson noise, large-amplitude noise exceeds the preset threshold and is not removed. In this study, we propose a new method of noise removal from degraded images with Poisson noise by using a combination of the M-transformation [5] and the wavelet BayesShrink method. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(11): 11–20, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20357

研究了中值滤波器和其他非线性滤波器用于带泊松噪声的退化图像的恢复。近年来，利用小波变换进行子带图像恢复的研究备受关注。该方法对于小幅度噪声是有效的，但是对于泊松噪声，大幅度噪声超过了预设的阈值而无法去除。在本研究中，我们提出了一种结合m变换[5]和小波贝叶斯收缩方法的泊松噪声退化图像去噪新方法。©2007 Wiley期刊公司电子工程学报，2003,19 (4):444 - 444;在线发表于Wiley InterScience (www.interscience.wiley.com)。DOI 10.1002 / ecjc.20357

引用次数: 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

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

在使用从立体系统、激光测距仪和其他设备获得的三维数据时，合并处理是重要的。本文提出了一种新的基于体的距离图像合并方法。与传统方法相比，该方法根据待重构曲面形状的曲率自适应分割体素。这有助于有效地表示几何形状，有效地利用计算资源。在该融合过程的框架中，可以在三维几何信息中加入颜色和激光反射率等附加特征，从而保持纹理的锐利边缘，有效地进行渲染和纹理映射。通过检查整个框架中几何形状和颜色的一致性，使合并对噪声具有鲁棒性。本文首先介绍了该系统，然后给出了在几种实际数据中的应用结果。©2007 Wiley期刊公司电子工程学报，2003,19 (3):559 - 564;在线发表于Wiley InterScience (www.interscience.wiley.com)。DOI 10.1002 / ecjc.20353

{"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

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

由于人脸图像的种类繁多，从图像中进行人脸检测是一个复杂的非线性问题。该方法通过非线性映射将图像中提取的原始特征向量转换为高维特征向量，然后在映射空间中寻找人脸/非人脸判别函数来解决该问题。如果这种判别函数是基于高维向量的内积，那么这种内积可以很容易地在原始特征空间中通过核函数的代入计算得到。然而，在传统的核函数识别算法中，为了提高识别精度，需要大量的特征。提出了一种基于Kullback-Leibler散度(KLD)的特征生成和选择的人脸检测方法。KLD是指某些特征的人脸和非人脸数据分布之间的距离。具有较大KLD的特征用于人脸检测。此外，通过对特征的kld进行评估，我们可以生成新的特征，并同时处理不同类型的特征。在实验中，采用该方法设计的分类器在使用较少特征的情况下取得了较高的识别性能。©2007 Wiley期刊公司电子工程学报，2009,29 (3):393 - 398;在线发表于Wiley InterScience (www.interscience.wiley.com)。DOI 10.1002 / ecjc.20347

{"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

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

本文提出了由长度为M=2ν+1的实值位移正交有限长序列导出的周期为N=2ν的实值正交周期序列。本文还解释了一种快速相关算法的原理，该算法能有效地对该实值正交周期序列进行周期相关处理。实值移位正交有限长序列(长度为M)的非周期自相关函数的旁瓣除移位的左右两端外均为0。若后续的首值序列重复重叠于该序列的末值，则可得到周期为N=M−1的实值正交周期序列。由长度为M=2ν+1的实值移位-正交有限长序列通过对部分序列进行卷积得到周期为N=2ν的实值正交周期序列，并在此基础上控制乘法次数和加法次数按Nlog2N的数量级递增，而不使用快速傅里叶变换。©2007 Wiley期刊公司电子工程学报，2009,29 (3):393 - 398;在线发表于Wiley InterScience (www.interscience.wiley.com)。DOI 10.1002 / ecjc.20294

{"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

下一页尾页

类型

全部化学•材料生命科学医学物理工程技术环境•农林材料科学地球科学法学管理学化学环境科学与生态学计算机科学教育学经济学农林科学人文科学生物学数学物理与天体物理心理学综合性期刊其他工业工程理学历史学农学文学信息工程

数据库

全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley

期刊

Electronics and Communications in Japan (Part III: Fundamental Electronic Science)

全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.

﹀