• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.10a
• /
• pp.576-580
• /
• 2005

New real-time confocal microscopy using spectral encoding technique and slit confocal aperture is proposed and designed. Spectral encoding technique, which encodes one-dimensional spatial information of a specimen in wavelength, and slit aperture make it possible to obtain two-dimensional lateral image of the specimen simultaneously at standard video rates without expensive scanning units such as polygon mirrors and galvano mirrors. The working principle and the configuration of the system are explained. The variation in axial responses for the simplified model of the system with normalized slit width is numerically analyzed based on the wave optics theory. Slit width that directly affects the depth discrimination of the system is determined by a compromise between axial resolution and signal intensity from the simulation result. On the assumption of the lateral sampling resolution of 50 nm, design variables and governing equations of the system are derived. The system is designed to have the mapping error less than the half pixel size, to be diffraction-limited and to have the maximum illumination efficiency. The designed system has the FOV of $12.8um{\times}9.6um$, the theoretical axial FWHM of 1.1 um and the lateral magnification of-367.8.

• Journal of Internet Computing and Services
• /
• v.12 no.4
• /
• pp.45-50
• /
• 2011

In this paper, the encoding time delay of FH/TDD(Frequency Hopping/Time Division Duplex) based Motion JPEG image compression CODEC is analyzed for radio video transmissions of multi-camera systems in a vehicle. And, Synchronized connection of minimum channel collision is designed with synchronized shift and access according to channel status for Motion JPEG based FH/TDD multiple access.

• Journal of IKEEE
• /
• v.2 no.2 s.3
• /
• pp.185-193
• /
• 1998

Fractal-based monochrome image coding method can be easily applied for color image compression by splitting the color image into different primary spectral channels such as RGB, YIQ or $YC_bC_r$, and encoding each channel independently According to this method, it needs to repeat the fractal coding for each channel, so it have the problem of encoding time. In this paper, a fractal-based coder for color still image is proposed which features the enhancement of compression rate and the reduction of coding time. As the result of the experiment where the proposed algorithm is applied far color images, the compression rate is enhanced by 28 : 1 above with average PSNR value $28{\sim}29[dB]$, do not lossless encoding process using JPEG. And the encoding time is reduced by maximum 11.5 %.

• Journal of Broadcast Engineering
• /
• v.19 no.3
• /
• pp.405-414
• /
• 2014

High Efficiency Video Coding(HEVC) obtains high compression ratio by applying recursive quad-tree structured coding unit(CU). However, this recursive quad-tree structure brings very high computational complexity to HEVC encoder. In this paper, we present fast CU decision algorithm in recursive quad-tree structure. The proposed algorithm estimates initial CU size before CTU encoding and checks the proposed condition using Coded Block Flag(CBF) and Rate-distortion cost to achieve the fast encoding time saving. And, intra mode estimation is also possible to be skipped using the CBF values acquired during the inter PU mode estimations. Experiment results shows that the proposed algorithm saved about 49.91% and 37.97% of encoding time according to the weighting condition.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.13-18
• /
• 2003

This paper proposes a design method of PID controllers in the framework of a constrained optimization problem. Owing to the popularity for the controller's simplicity and robustness, a great deal of literature concerning PID control design has been published, which can be classified into frequency-based and time-based approaches. However, both approaches have to be considered together for a designed PID control to work well with a guaranteed closed-loop stability. For this purpose, a penalty function is formulated to satisfy both frequency- and time-domain specifications, and is minimized by a recet nonlinear optimization algorithm to attain optimal PID control gains. The proposed method is compared with Wang's and Ho's methods on a suite of example systems. Simulation results show that the PID control tuned by the proposed method improves time-domain performance without deteriorating closed-loop stability.

• Journal of Communications and Networks
• /
• v.5 no.2
• /
• pp.174-183
• /
• 2003

Space-Time (ST) codes are known to provide high transmission rates, diversity and coding gains. In this paper, a tight upper bound on the error probability of ST codes over rapid fading channels is presented. Moreover, ST codes suitable for rapid fading channels are presented. These codes are designed using the QPSK and 16-QAM signal constellations. The proposed codes are based on two different encoding schemes. The first scheme uses a single trellis encoder, whereas the second scheme uses the I-Q encoding technique. Code design is achieved via partitioning the signal space such that the design criteria are maximized. As a solution for the decoding problem of I-Q ST codes, the paper introduces a low-complexity decoding algorithm. Results show that the I-Q ST codes using the proposed decoding algorithm outperform singleencoder ST codes with equal complexity. The proposed codes are tested over fading channels with different interleaving conditions, where it is shown that the new codes are robust under such imperfect interleaving conditions.

• Journal of Industrial Technology
• /
• v.29 no.B
• /
• pp.9-15
• /
• 2009

In the case of traditional binary encoding technique, it takes long time to converge the optimal solutions and brings about complexity of the systems due to encoding and decoding procedures. However, the ROGAs (real-coded genetic algorithms) do not require these procedures, and the k-means clustering algorithm can avoid global searching space. Thus, this paper proposes a new approach by using their advantages. The proposed method constructs the multiple predictors using the optimal differences that can reveal the patterns better and properties concealed in non-stationary time series where the k-means clustering algorithm is used for data classification to each predictor, then selects the best predictor. After selecting the best predictor, the cluster centers of the predictor are tuned finely via RCGKA in secondary tuning procedure. Therefore, performance of the predictor can be more enhanced. Finally, we verifies the prediction performance of the proposed system via simulating typical time series examples.

• Proceedings of the KIEE Conference
• /
• 2008.10b
• /
• pp.117-118
• /
• 2008

The low latency encoder for high data rate duo-binary turbo codes with tail biting trellises is considered. Encoder hardware architecture is proposed using inherent encoding property of duo-binary turbo codes. And we showed that half of execution time as well as the energy can be reduced with the proposed architecture.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.925-926
• /
• 2008

This paper presents an object tracking method using motion vectors generated in the MPEG4 encoding process and the snake algorithm for active contours. This paper shows the possibility of realtime object tracking during MPEG4 encoding process in a conventional surveillance system. The experiments is performed on a PC platform to prove the effectiveness of the method.

• ETRI Journal
• /
• v.36 no.3
• /
• pp.407-417
• /
• 2014

A new-generation video coding standard, named High Efficiency Video Coding (HEVC), has recently been developed by JCT-VC. This new standard provides a significant improvement in picture quality, especially for high-resolution videos. However, one the most important challenges in HEVC is time complexity. A quadtree-based structure is created for the encoding and decoding processes and the rate-distortion (RD) cost is calculated for all possible dimensions of coding units in the quadtree. This provides a high encoding quality, but also causes computational complexity. We focus on a reduction scheme of the computational complexity and propose a new approach that can terminate the quadtree-based structure early, based on the RD costs of the parent and current levels. Our proposed algorithm is compared with HEVC Test Model version 10.0 software and a previously proposed algorithm. Experimental results show that our algorithm provides a significant time reduction for encoding, with only a small loss in video quality.