Young-Ho SEO Hyun-Jun CHOI Jin-Woo BAE Hoon-Jong KANG Seung-Hyun LEE Ji-Sang YOO Dong-Wook KIM
In this paper, we proposed an efficient coding method for digital hologram (fringe pattern) acquired with a CCD camera or by computer generation using multi-view prediction and MPEG video compression standard techniques. It processes each R, G, or B color component separately. The basic processing unit is a partial image segmented as the size of MN. Each partial image retains the information of the whole object. This method generates an assembled image for a column of the segmented and frequency-transformed partial images, which is the basis of the coding process. That is, a motion estimation and compensation technique of MPEG is applied between the reconstructed images from the assembled images with the disparities found during generation of assembled image and the original partial images. Therefore the compressed results are the disparity of each partial image to form the assembled image for the corresponding column, assembled image, and the motion vectors and the compensated image for each partial image. The experimental results with the implemented algorithm showed that the proposed method has NC (Normalized Correlation) values about 4% higher than the previous method at the same compression ratios, which convinced us that ours has better compression efficiency. Consequently, the proposed method is expected to be used effectively in the application areas to transmit or store in digital format the digital hologram data.
Providing data availability in a high performance computing environment is very important, especially in this data-intensive world. Most clusters either equip with RAID (Redundant Array of Independent Disks) devices or use redundant nodes to protect data from loss. However, neither of these can really solve the reliability problem incurred in a striped file system. Striping provides an efficient way to increase I/O throughput both in the distributed and parallel paradigms. But it also reduces the overall reliability of a disk system by N fold, where N is the number of independent disks in the system. Parallel Virtual File System (PVFS) is an open source parallel file system which has been widely used in the Linux environment. Its striping structure is good for performance but provides no fault tolerance. We implement Reliable Parallel File System (RPFS) based on PVFS but with reliability support. Our quantitative analysis shows that MTTF (Mean Time To Failure) of our RPFS is better than that of PVFS. Besides, we propose a parity cache table (PCT) to alleviate the penalty of parity updating. The evaluation of our RPFS shows that its read performance is almost the same as that of PVFS (2% to 13% degradation). As to the write performance, 28% to 45% improvement can be achieved depending on the behavior of the operations.
Min-su KIM Young-Hyun JUN Sung-Bae PARK Bai-Sun KONG
A novel CMOS level converter with balanced rise and fall delays for arbitrary voltage conversion is presented. The proposed level converter was designed using a 90 nm CMOS process technology. The comparison result indicates that the maximum difference between the rise and fall delays of the proposed level converter was reduced by up to 92% compared to the conventional CMOS level converters.
Yasuhiro KAWASAKI Fumihiko INO Yoshinobu SATO Shinichi TAMURA Kenichi HAGIHARA
This paper presents the design and implementation of a hip range of motion (ROM) estimation method that is capable of fine-grained estimation during total hip replacement (THR) surgery. Our method is based on two acceleration strategies: (1) adaptive mesh refinement (AMR) for complexity reduction and (2) parallelization for further acceleration. On the assumption that the hip ROM is a single closed region, the AMR strategy reduces the complexity for N N N stance configurations from O(N3) to O(ND), where 2≤D≤3 and D is a data-dependent value that can be approximated by 2 in most cases. The parallelization strategy employs the master-worker paradigm with multiple task queues, reducing synchronization between processors with load balancing. The experimental results indicate that the implementation on a cluster of 64 PCs completes estimation of 360360180 stance configurations in 20 seconds, playing a key role in selecting and aligning the optimal combination of artificial joint components during THR surgery.
Yuanzhi CHENG Yoshinobu SATO Hisashi TANAKA Takashi NISHII Nobuhiko SUGANO Hironobu NAKAMURA Hideki YOSHIKAWA Shuguo WANG Shinichi TAMURA
Accurate thickness measurement of sheet-like structure such as articular cartilage in CT images is required in clinical diagnosis as well as in fundamental research. Using a conventional measurement method based on the zero-crossing edge detection (zero-crossings method), several studies have already analyzed the accuracy limitation on thickness measurement of the single sheet structure that is not influenced by peripheral structures. However, no studies, as of yet, have assessed measurement accuracy of two adjacent sheet structures such as femoral and acetabular cartilages in the hip joint. In this paper, we present a model of the CT scanning process of two parallel sheet structures separated by a small distance, and use the model to predict the shape of the gray-level profiles along the sheet normal orientation. The difference between the predicted and the actual gray-level profiles observed in the CT data is minimized by refining the model parameters. Both a one-by-one search (exhaustive combination search) technique and a nonlinear optimization technique based on the Levenberg-Marquardt algorithm are used to minimize the difference. Using CT images of phantoms, we present results showing that when applying the one-by-one search method to obtain the initial values of the model parameters, Levenberg-Marquardt method is more accurate than zero-crossings and one-by-one search methods for estimating the thickness of two adjacent sheet structures, as well as the thickness of a single sheet structure.
Yangxing LIU Takeshi IKENAGA Satoshi GOTO
Traffic sign detection is a valuable part of future driver support system. In this paper, we present a novel framework to accurately detect traffic signs from a single color image by analyzing geometrical, physical and text/symbol features of traffic signs. First, we utilize an elaborate edge detection algorithm to extract edge map and accurate edge pixel gradient information. Then, we extract 2-D geometric primitives (circles, ellipses, rectangles and triangles) efficiently from image edge map. Third, the candidate traffic sign regions are selected by analyzing the intrinsic color features, which are invariant to different illumination conditions, of each region circumvented by geometric primitives. Finally, a text and symbol detection algorithm is introduced to classify true traffic signs. Experimental results demonstrated the capabilities of our algorithm to detect traffic signs with respect to different size, shape, color and illumination conditions.
In this paper, we propose an algorithm that solves the node-to-node disjoint paths problem in n-burnt pancake graphs in polynomial-order time of n. We also give a proof of its correctness as well as the estimates of time complexity O(n3) and the maximum path length 3n+4. We conducted a computer experiment for n=2 to 100 to measure the average performance of our algorithm. The results show that the average time complexity is O(n3.0) and the maximum path length is 3n+4.
Taiji SASAOKA Hideyuki KAWABATA Toshiaki KITAMURA
Parallel programs for distributed memory machines are not easy to create and maintain, especially when they involve sparse matrix computations. In this paper, we propose a program translation system for generating parallel sparse matrix computation codes utilizing PSBLAS. The purpose of the development of the system is to offer the user a convenient way to construct parallel sparse code based on PSBLAS. The system is build up on the idea of bridging the gap between the easy-to-read program representations and highly-tuned parallel executables based on existing parallel sparse matrix computation libraries. The system accepts a MATLAB program with annotations and generates subroutines for an SPMD-style parallel program which runs on distributed-memory machines. Experimental results on parallel machines show that the prototype of our system can generate fairly efficient PSBLAS codes for simple applications such as CG and Bi-CGSTAB programs.
This paper introduces a new graph problem to find an Optimal Euler Circuit (OEC) in an Euler graph. OEC is defined as the Euler circuit that maximizes the sum of contiguous costs along it, where the contiguous cost is assigned for each of the two contiguous edges incident to a vertex. We prove that the OEC problem is NP-complete. A polynomial time algorithm will be presented for the case of a graph without vertex of degree greater than 4, and for the general case, a 1/4-approximation polynomial time algorithm will be proposed.
Xuan-Hieu PHAN Le-Minh NGUYEN Yasushi INOGUCHI Susumu HORIGUCHI
Conditional random fields (CRFs) have been successfully applied to various applications of predicting and labeling structured data, such as natural language tagging & parsing, image segmentation & object recognition, and protein secondary structure prediction. The key advantages of CRFs are the ability to encode a variety of overlapping, non-independent features from empirical data as well as the capability of reaching the global normalization and optimization. However, estimating parameters for CRFs is very time-consuming due to an intensive forward-backward computation needed to estimate the likelihood function and its gradient during training. This paper presents a high-performance training of CRFs on massively parallel processing systems that allows us to handle huge datasets with hundreds of thousand data sequences and millions of features. We performed the experiments on an important natural language processing task (text chunking) on large-scale corpora and achieved significant results in terms of both the reduction of computational time and the improvement of prediction accuracy.
Masafumi NAKADA Hiroki TSUDA Keishi OHASHI Jun AKEDO
Complex thin oxide films with electro-optic (EO) properties are promising for use in advanced optical devices because of their large EO effect. We developed a method of aerosol deposition (AD) for fabricating EO films. The mechanism for AD is based on the solidification by impact of submicron particles onto a substrate. Since particles in AD films preserve their crystalline structure during the formation of film, epitaxial growth is not necessary for exhibiting the EO effect. Highly transparent Pb(Zr, Ti)O3 films, which have acceptable transmittance loss for use as optical devices, were directly deposited on glass substrates by AD. We found the Pb(Zr, Ti)O3 film by AD produced a fairly high EO coefficient (>150 pm/V), approximately 10 times larger than that of LiNbO3. A Fabry-Perot (FP) optical modulator was developed with EO films fabricated by AD. We demonstrated the modulation of optical intensity with an electrical field applied to an EO film made of ferroelectric Pb (Zr, Ti)O3.
Takaaki FUJITA Maki YOSHIDA Toru FUJIWARA
A typical watermarking scheme consists of an embedding scheme and a detection scheme. In detecting a watermark, there are two kinds of detection errors, a false positive error (FPE) and a false negative error (FNE). A detection scheme is said to be optimum if the FNE probability is minimized for a given FPE probability. In this paper, we present an optimum watermark detection scheme for an additive embedding scheme with a spatial domain. The key idea of the proposed scheme is to use the differences between two brightnesses for detecting a watermark. We prove that under the same FPE probability the FNE probability of the proposed optimum detection scheme is no more than that of the previous optimum detection scheme for the additive embedding scheme with the spatial domain. Then, it is confirmed that for an actual image, the FNE probability of the proposed optimum detection scheme is much lower than that of the previous optimum detection scheme. Moreover, it is confirmed experimentally that the proposed optimum detection scheme can control the FPE probability strictly so that the FPE probability is close to a given probability.
Seiichiro NAKABAYASHI Nobuko TANIMURA Toshikazu YAMASHITA Shinichiro KOKUBUN
The relationship between the topology and collective function of a nonlinear oscillator network was investigated using nonlinear electrochemical oscillators. The constitutive experiments showed that the physiological robustness in the living system is due to their topological redundancy and asymmetry in the nonlinear network.
Masato MIZUKAMI Yoshitada KATAGIRI
We propose and demonstrate wavelength-selectable filters available for 32 WDM channels using a micro-mechanically movable mechanism with miniaturized voice-coil motors (VCMs). A simple straight geometry with a staggered configuration is used to densely pack 32 in/out moving elements into a small space of 452411 mm. The elements are precisely arranged along a collimated beam between fiber facets to provide flat-top passbands centered at ITU-T grids while maintaining small total insertion losses of less than 2.5 dB for all elements. The driving condition of the VCMs is also optimized for quick dynamic response with typical settling time of less than 10 ms. A repetition test 106 repetitions per element showed good wavelength reproducibility to an accuracy of below 0.1 nm, indicating the switches are feasible for practical system equipped with reconfigurable functionality for the next generation of optical networks.
Yuanyuan ZHANG Wei SUN Yasushi INOGUCHI
To make the best use of the resources in a shared grid environment, an application scheduler must make a prediction of available performance on each resource. In this paper, we examine the problem of predicting available CPU performance in time-shared grid system. We present and evaluate a new and innovative method to predict the one-step-ahead CPU load in a grid. Our prediction strategy forecasts the future CPU load based on the variety tendency in several past steps and in previous similar patterns, and uses a polynomial fitting method. Our experimental results on large load traces collected from four different kinds of machines demonstrate that this new prediction strategy achieves average prediction errors which are between 22% and 86% less than those incurred by four previous methods.
In this paper, we present preliminary work on recognizing affect from a Korean textual document by using a manually built affect lexicon and adopting natural language processing tools. A manually built affect lexicon is constructed in order to be able to detect various emotional expressions, and its entries consist of emotion vectors. The natural language processing tools analyze an input document to enhance the accuracy of our affect recognizer. The performance of our affect recognizer is evaluated through automatic classification of song lyrics according to moods.
In this letter, an analytic model for real-time flow connections in a Wireless Mobile Internet (WMI) is developed, and then performance measures are derived. Some examples are also presented in order to show the call-blocking ratio and the number of connections admitted into a WMI.
Noboru OHASHI Masakazu NAKAMURA Norio MURAISHI Masatoshi SAKAI Kazuhiro KUDO
A well-defined test structure of organic static-induction transistor (SIT) having regularly sized nano-apertures in the gate electrode has been fabricated by colloidal lithography using 130-nm-diameter polystyrene spheres as shadow masks during vacuum deposition. Transistor characteristics of individual nano-apertures, namely 'nano-SIT,' have been measured using a conductive atomic-force-microscope (AFM) probe as a movable source electrode. Position of the source electrode is found to be more important to increase current on/off ratio than the distance between source and gate electrodes. Experimentally obtained maximum on/off ratio was 710 (at VDS = -4 V, VGS = 0 and 2 V) when a source electrode was fixed at the edge of gate aperture. The characteristics have been then analyzed using semiconductor device simulation by employing a strongly non-linear carrier mobility model in the CuPc layer. From device simulation, source current is found to be modulated not only by a saddle point potential in the gate aperture area but also by a pinch-off effect near the source electrode. According to the obtained results, a modified structure of organic SIT and an adequate acceptor concentration is proposed. On/off ratio of the modified organic SIT is expected to be 100 times larger than that of a conventional one.
Yu-Chi PU Wei-Chang DU I-Chang JOU
Digital watermarking techniques were developed for regular raster data such as images or video, but little research addressed irregular vector data, such as the shapes of cartoons or elevation contours. Vector graphic images, such as those in SVG format, are popular on the WWW, and provide the advantage of permitting affine transformations without aliasing. The creation of cartoon images or the acquisition of GIS geometry data involves much work, so the copyright and ownership of vector data must be protected. Common components in vector graphic images are polygonal lines or polylines. This work develops a normal multi-resolution representation of a polygonal line, and embeds a copyright notice or serial number in this representation. Previous studies on polyline watermarking have the non-transparent problems, including self-intersection of line segments. The experimental results demonstrate that the proposed watermarking approach is perceptually transparent, and solves the self-intersection problem. It is also resistant to similarity transformation, traversal reordering, point insertion/deletion and random noise attacks.
A new 4B5B block inversion coding is proposed for dc-balanced transmission in high-speed optical parallel links. An 8-bit byte is partitioned into two 4-bit data and converted to two 5-bit blocks by an inversion encoding. The proposed coding greatly reduces circuit complexity with the minimum latency overhead of one clock for the encoder and none for the decoder. The maximum run length is 11.