Sung-Hak LEE Jong-Hyub LEE Kyu-Ik SOHNG
An image sensor for a use of colorimeter is characterized based on the CIE standard colorimetric observer. We use the method of least squares to derive a colorimetric characterization matrix between RGB output signals and CIE XYZ tristimulus values. This paper proposes an adaptive measuring method to obtain the chromaticity of colored scenes and illumination through a 33 camera transfer matrix under a certain illuminant. Camera RGB outputs, sensor status values, and photoelectric characteristic are used to obtain the chromaticity. Experimental results show that the proposed method is valid in the measuring performance.
Toshiro NUNOME Shuji TASAKA Ken NAKAOKA
This paper performs application-level QoS and user-level QoS assessment of audio-video streaming in cross-layer designed wireless ad hoc networks. In order to achieve high QoS at the user-level, we employ link quality-based routing in the network layer and media synchronization control in the application layer. We adopt three link quality-based routing protocols: OLSR-SS (Signal Strength), AODV-SS, and LQHR (Link Quality-Based Hybrid Routing). OLSR-SS is a proactive routing protocol, while AODV-SS is a reactive one. LQHR is a hybrid protocol, which is a combination of proactive and reactive routing protocols. For application-level QoS assessment, we performed computer simulation with ns-2 where an IEEE 802.11b mesh topology network with 24 nodes was assumed. We also assessed user-level QoS by a subjective experiment with 30 assessors. From the assessment results, we find AODV-SS the best for networks with long inter-node distances, while LQHR outperforms AODV-SS for short inter-node distances. In addition, we also examine characteristics of the three schemes with respect to the application-level QoS in random topology networks.
Ki-Hong PARK Hong-Chuan YANG Young-Chai KO
Transmit diversity systems based on orthogonal space-time block coding (OSTBC) usually suffer from rate loss and power spreading. Proper antenna selection scheme can help to more effectively utilize the transmit antennas and transmission power in such systems. In this paper, we propose a new antenna selection scheme for such systems based on the idea of antenna switching. In particular, targeting at reducing the number of pilot channels and RF chains, the transmitter now replaces the antennas with the lowest received SNR with unused ones if the output SNR of space time decoder at the receiver is below a certain threshold. With this new scheme, not only the number of pilot channels and RF chains to be implemented is decreased, the average amount of feedback information is also reduced. To analyze the performance of this scheme, we derive the exact integral closed form for the probability density function (PDF) of the received SNR. We show through numerical examples that the proposed scheme offers better performance than traditional OSTBC systems using all available transmitting antennas, with a small amount of feedback information. We also examine the effect of different antenna configuration and feedback delay.
Shunsuke KOSHITA Satoru TANAKA Masahide ABE Masayuki KAWAMATA
This paper proposes the Gramian-preserving frequency transformation for linear discrete-time state-space systems. In this frequency transformation, we replace each delay element of a discrete-time system with an allpass system that has a balanced realization. This approach can generate transformed systems that have the same controllability/observability Gramians as those of the original system. From this result, we show that the Gramian-preserving frequency transformation gives us transformed systems with different magnitude characteristics, but with the same structural property with respect to the Gramians as that of the original system. This paper also presents a simple method for realization of the Gramian-preserving frequency transformation. This method makes use of the cascaded normalized lattice structure of allpass systems.
Frequency offset estimation is an important technique in receiver design of wireless communications. In many applications, sampled single frequency tone is selected as training symbol/sequence for frequency synchronization. Under this assumption, frequency offset estimation can be regarded as the problem of single carrier frequency offset estimation. In this Letter, an approximate maximum likelihood frequency estimator is proposed. This estimator is efficient at moderate and high SNR's. Compared with other estimators, the proposed estimator is less sensitive to the variance threshold and offers feasible levels of computation complexity. The proposed estimator is suitable for high frequency offset cases and coarse/fine frequency synchronization applications.
Tetsuya KAWAI Naoki WAKAMIYA Masayuki MURATA
Wireless sensor networks are expected to become an important social infrastructure which helps our life to be safe, secure, and comfortable. In this paper, we propose design methodology of an architecture for fast and reliable transmission of urgent information in wireless sensor networks. In this methodology, instead of establishing single complicated monolithic mechanism, several simple and fully-distributed control mechanisms which function in different spatial and temporal levels are incorporated on each node. These mechanisms work autonomously and independently responding to the surrounding situation. We also show an example of a network architecture designed following the methodology. We evaluated the performance of the architecture by extensive simulation and practical experiments and our claim was supported by the results of these experiments.
Intark HAN Hong-Shik PARK Man-Soo HAN
A fast class-of-service oriented packet scheduling (FCOPS) has a service fairness problem since a credit pool for a service class is initialized at the beginning of a transmission cycle whose starting moment is fixed at a specific ONU. To remedy the service unfairness of FCOPS, we suggest an enhanced class-of-service oriented packet scheduling (ECOPS) that uses a new initialization cycle whose starting moment is fairly distributed to each ONU. Also, ECOPS generates a colorless grant to utilize the resource wastage, when traffic is light and the total sum of grants of an ONU is less than a minimum size. Using simulation, we validate ECOPS as superior to FCOPS in the mean delay and the service fairness.
Xuewen LIAO Shihua ZHU Erlin ZENG
Multipath energy capture and inter-symbol interference (ISI) are two intractable problems in high-data-rate Ultra-wideband (UWB) systems. To tackle the problems and simplify the receiver, we propose an adaptive interference avoidance scheme based on Pre-RAKE combining technique. The symbol repetition period (SRP) is regarded a changeable parameter in an ordered set to avoid severe interference paths and guarantee high data-rate. The set is known to both the transmitter and receiver. The index of the selected SRP is then sent to the receiver to coordinate the transmitter and receiver. The SRP can be updated adaptively according to the variations of the channels. Both theoretical analysis and simulations show that the ISI is mitigated and the transmission rate is improved simultaneously compared to the constant SRP transmission scheme.
Li-ming HAO Song-nian LU Shu-tang YANG Ning LIU Qi-shan HUANG
In 2006, Miranda et al. proposed an anonymity scheme to achieve peers' anonymity in Peer-to-Peer (P2P) reputation systems. In this paper, we show that this scheme can not achieve peers' anonymity in two cases. We also propose an improvement which solves the problem and improves the degree of anonymity.
Abolfazl GHASSEMI T. Aaron GULLIVER
Partial transmit sequence (PTS) is a well known technique used to reduce the peak-to-average power ratio (PAPR) of an orthogonal frequency division multiplexing (OFDM) signal. However, it has relatively high complexity due to the computation of multiple inverse fast Fourier transforms (IFFTs). To reduce this complexity, we use intermediate signals within a decimation in frequency (DIF) radix IFFT and propose a new PTS subblocking technique which requires the computation of only partial IFFTs. Performance results are presented which show a PAPR reduction similar to that with other techniques such as original PTS (O-PTS). Further, we show that complexity reduction can be achieved with either low or high radix IFFT algorithms.
Gamma correction is an essential function and is time consuming task in every display device such as CRT and LCD. And gray scale CCT reproduction in most LCD are quite different from those of standard CRT. An automated fast and accurate display adjusment method and system for gamma correction and for constant gray scale CCT calibration of mobile phone LCD is presented in this paper. We develop the test pattern disply and register control program in mobile phone and devleop automatic measure program in computer using spectroradimeter. The proposed system is maintain given gamma values and CCT values accuratly. In addition, This system is possible to fast mobile phone LCD adjusment within one hour.
Yufeng ZHAO Yao ZHAO Zhenfeng ZHU Jeng-Shyang PAN
A novel automatic image annotation (AIA) scheme is proposed based on multiple-instance learning (MIL). For a given concept, manifold ranking (MR) is first employed to MIL (referred as MR-MIL) for effectively mining the positive instances (i.e. regions in images) embedded in the positive bags (i.e. images). With the mined positive instances, the semantic model of the concept is built by the probabilistic output of SVM classifier. The experimental results reveal that high annotation accuracy can be achieved at region-level.
In this letter, we investigate the outage performance for decode-and-forward relaying under Rayleigh fading in the presence of multiple unequal-powered Rayleigh co-channel interferers. A close-form expression for the outage probability is derived and simulation results verify the theoretical solution.
Yutaka MURAKAMI Takashi MATSUOKA Masayuki ORIHASHI
In this paper, BER (Bit Error Rate) performance in 22 MIMO (Multiple-Input Multiple-Output) spatial multiplexing systems under Rician fading channels is evaluated. We examine BER performances employing inverse channel detection (ICD) under Rician fading channels, adding the phase of the direct path and Rician factor as a parameter. The results clearly indicate that the phase of the direct path and Rician factor have a great influence on BER performances employing ICD under Rician fading channels.
Point Pattern Matching (PPM) is an essential problem in many image analysis and computer vision tasks. This paper presents a two-stage algorithm for PPM problem using ellipse fitting and dual Hilbert scans. In the first matching stage, transformation parameters are coarsely estimated by using four node points of ellipses which are fitted by Weighted Least Square Fitting (WLSF). Then, Hilbert scans are used in two aspects of the second matching stage: it is applied to the similarity measure and it is also used for search space reduction. The similarity measure named Hilbert Scanning Distance (HSD) can be computed fast by converting the 2-D coordinates of 2-D points into 1-D space information using Hilbert scan. On the other hand, the N-D search space can be converted to a 1-D search space sequence by N-D Hilbert Scan and an efficient search strategy is proposed on the 1-D search space sequence. In the experiments, we use both simulated point set data and real fingerprint images to evaluate the performance of our algorithm, and our algorithm gives satisfying results both in accuracy and efficiency.
Masatsugu HIGASHINAKA Hiroshi KUBO Akihiro OKAZAKI Yasutaka OGAWA Takeo OHGANE Toshihiko NISHIMURA
This paper proposes a novel channel estimation method for iterative equalization in MIMO systems. The proposed method incorporates co-channel interference (CCI) cancellation in the channel estimator and the channel estimation is successively performed with respect to each stream. Accuracy of channel estimation holds the key to be successfully converged the iterative equalization and decoding process. Although the channel estimates can be re-estimated by means of LS (Least Square) channel estimation using tentative decisions obtained in the iterative process, its performance is severely limited in a MIMO system because of erroneous decisions and ill-conditioned channel estimation matrix. The proposed method can suppress the above effects by means of CCI cancellation and successive channel estimation. Computer simulation confirms that the proposed channel estimation method can accurately estimate the channel, and the receiver with iterative equalization and the proposed method achieves excellent decoding performance in a MIMO-SM system.
In this paper we show some new look at large deviation theorems from the viewpoint of the information-spectrum (IS) methods, which has been first exploited in information theory, and also demonstrate a new basic formula for the large deviation rate function in general, which is expressed as a pair of the lower and upper IS rate functions. In particular, we are interested in establishing the general large deviation rate functions that are derivable as the Fenchel-Legendre transform of the cumulant generating function. The final goal is to show, under some mild condition, a necessary and sufficient condition for the IS rate function to be derivable as the Fenchel-Legendre transform of the cumulant generating function, i.e., to be a rate function of Gartner-Ellis type.
This paper considers a proportional fairness of end-to-end session rates in a multihop wireless network through the rate control framework. In multihop wireless networks, there are two classes of rate control problem. One focuses in optimizing the transmission attempt probabilities at the lower layers, but not the transmit powers while other problem is closely related to jointly optimal congestion control and power control. Proportional fairness is a fundamental concept in flow control problems. In this paper, we give in-depth analysis and show that the optimal solutions of these problems are proportionally fair provided that the objective functions are suitably chosen.
This paper proposes a novel chaotic multiple-bits modulation scheme that uses the parameters in the map as data carrier for chaotic digital communication. Chaotic signals modulated with the parameters corresponding to the information to be transmitted are sent to the receiver. The information sent to the receiver can be decoded by a correlation detector. This scheme can increase the number of transmittable information bit per unit carrier signals by increasing the number of mapping parameters to be used for modulation. We verify the performance of this scheme using bit error rate (BER) through computer simulation. Also, we compare the performance of the proposed method with a conventional single-bit modulation scheme.
Ying-Dar LIN Po-Ching LIN Meng-Fu TSAI Tsao-Jiang CHANG Yuan-Cheng LAI
Managing increasing traffic from Instant Messengers and P2P applications is becoming more important nowadays. We present an in-kernel architecture of management gateway, namely kP2PADM, built upon open-source packages with several modifications and design techniques. First, the in-kernel design streamlines the data path through the gateway. Second, the dual-queue buffer eliminates head-of-line blocking for multiple connections. Third, a connection cache reduces useless reconnection attempts from the peers. Fourth, a fast-pass mechanism avoids slowing down the TCP transmission. The in-kernel design approximately doubles the throughput of the design in the user space. The internal benchmarks also analyze the impact of each function on performance.