|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Modeling Alzheimer’s Disease with iPSCs Reveals Stress Phenotypes Associated with Intracellular Aβ and Differential Drug Responsiveness显示文摘 | Takayuki Kondo Masashi Asai Kayoko Tsukita Yumiko Kutoku Yutaka Ohsawa Yoshihide Sunada Keiko Imamura Naohiro Egawa Naoki Yahata Keisuke Okita Kazutoshi Takahashi Isao Asaka Takashi Aoi Akira Watanabe Kaori Watanabe Chie Kadoya Rie Nakano Dai Watanabe Kei | 2013 | Cell Stem Cell2013，，4： | 2 |
| 2 | Evidence of immunopathological traces in mucormycosis: an autopsy case显示文摘 | Gaku Kusaba Isao Ohsawa Masaya Ishii Hiroyuki Inoshita Hiroyuki Ohi Satoshi Horikoshi Masaru Takase Yutaka Yamaguchi Yasuhiko Tomino | 2010 | Clinical and Experimental Nephrology2010，，4： | 1 |
| 3 | Shadow free texture acquisition of a large scale scene for city modeling显示文摘Texture acquisition of a large scale scene is one of the critical research areas in computer vision and can be used in other application areas such as computer graphics (CG), the intelligent transportation system (ITS) and the 3D geographic information system (GIS). Moreover, to acquire texture without noise (e.g., a shadow, an obstacle body) is vital for such work. Although obstacles can be removed by using 3D geometric data, shadow elimination is still a difficult problem and strongly required for the CG and ITS community, especially for city modeling and simulation purposes. In this paper, we propose an automatic multiple image fusion technique and an efficient and simple shadow removing technique to retrieve high quality texture images of an urban area. The image fusion can be efficiently achieved by epipolar plane image (EPI) analysis, and the shadow elimination can be successfully carried out by an illumination independent color clustering technique. The strength of this algorithm is that we can successfully fuse multiple images and eliminate shadows from the fused single image, especially in low dynamic range images, which have proven difficult using previous techniques. | Thanda Oo OIKE Jiro MIYAMOTO Mitsunori KAWASAKI Hiroshi OHSAWA Yutaka | 2004 | 重庆邮电学院学报(自然科学版)2004，16，5： | 1 |
| 4 | Discovering Emerg ing Topicsfrom WWW显示文摘 | Matsumur Naohiro Matsumura Yutaka Matsuo Yukio Ohsawa | 2002 | Journal of Contingencies and Crisis Management2002，，2： | 1 |
| 5 | Modeling Alzheimer’s Disease with iPSCs Reveals Stress Phenotypes Associated with Intracellular Aβ and Differential Drug Responsiveness显示文摘 | Takayuki Kondo Masashi Asai Kayoko Tsukita Yumiko Kutoku Yutaka Ohsawa Yoshihide Sunada Keiko Imamura Naohiro Egawa Naoki Yahata Keisuke Okita Kazutoshi Takahashi Isao Asaka Takashi Aoi Akira Watanabe Kaori Watanabe Chie Kadoya Rie Nakano Dai Watanabe Kei | 2013 | Cell Stem Cell2013，，4： | 1 |
| 6 | Nearest neighbor search algorithm for GBD tree spatial data structure显示文摘This paper describes the nearest neighbor (NN) search algorithm on the GBD(generalized BD) tree. The GBD tree is a spatial data structure suitable for two-or three-dimensional data and has good performance characteristics with respect to the dynamic data environment. On GIS and CAD systems, the R-tree and its successors have been used. In addition, the NN search algorithm is also proposed in an attempt to obtain good performance from the R-tree. On the other hand, the GBD tree is superior to the R-tree with respect to exact match retrieval, because the GBD tree has auxiliary data that uniquely determines the position of the object in the structure. The proposed NN search algorithm depends on the property of the GBD tree described above. The NN search algorithm on the GBD tree was studied and the performance thereof was evaluated through experiments. | Yutaka Ohsawa Takanobu Kurihara Ayaka Ohki | 2007 | 重庆邮电大学学报(自然科学版)2007，19，3： | 0 |
| 7 | A fast construction method for spatial index GBD-tree显示文摘This paper proposes a fast initial construction method of the GBD-tree. The GDB tree has proper characteristics for management of large amount of 2 or 3 dimensional data. However, the GBD-tree needs long initial construction time by originally proposed one-by-one insertion method. A fast insertion method has been proposed, but it needs large size of buffer capable to hold index information of all entries. The paper proposes another fast initial construction method. The method requires only limited size of work space (buffer). The experimental results show the initial construction time reduces into a third or a quarter of the one-by-one insertion method. The memory efficiency and retrieval efficiency are also improved than the one-by-one insertion method. | Yukio Negishi Yutaka Ohsawa Satoshi Takazawa | 2007 | 重庆邮电大学学报(自然科学版)2007，19，3： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员