• Title/Summary/Keyword: frame complexity

Search Result 406, Processing Time 0.026 seconds

Development of a Computer System for the Lot-sizing and Scheduling of the Side Frame Press Shop (상용차 Side Frame 공정의 생산계획 및 일정계획 수립 시스템 개발)

  • Hwang, Hark;Cha, Chun-Nam;Sun, Ji-Ung;Hann, Kyu-Hun;Moon, Seong-Woo;Lee, Suk;Hong, Seong-Pyo
    • IE interfaces
    • /
    • v.9 no.2
    • /
    • pp.3-17
    • /
    • 1996
  • Productivity improvement is one of the most challenging problem facing the motor industry. This paper deals with the lot sizing and production scheduling problems of the side frame press shop in a domestic truck manufacturing company. The problems can not be solved simultaneously due to the computational complexity. Thus, we present a heuristic method which solves the two problems sequentially with the objective of maximizing the press utilization while maintaining a minimum inventory level. A micro-computer-based software is developed for easy implementation of the heuristic in the shop floor level.

  • PDF

EFFICIENT VIDEO TRANSCODING IN THE GOP STRUCTURE CONVERSION (GOP 구조 변환에 있어서의 효율적인 트랜스코딩 기법)

  • Lee, Kang-Jun;Kim, Jeong-Jun;Jeong, Je-Chang
    • Proceedings of the KIEE Conference
    • /
    • 2007.04a
    • /
    • pp.292-294
    • /
    • 2007
  • Recently, for satisfying many application demands such as coding delay, computing power, transporting channel characteristic, etc, many profiles are supported in video coding standards. Therefore, in transcoding between same standards or between other standards, the functional difference of profiles supported by application occur many problems. In this paper, transcoding MPEG-2 main profile to H.264/AVC baseline profile which has restriction in the number of reference frame is focused. In this case, the bidirectional prediction supported in MPEG-2 main profile is not supported in H.264/AVC baseline profile. Also, in the restriction of reference frame, motion vectors in the MPEG-2 decoder as predictor should be adjusted. In this paper, the proposed algorithm is based on the characteristic of which motion. vector is uniform according to the distance from reference frame. The adaptive search techniques through the determination of the uniformity extremely reduce the computational complexity.

  • PDF

A Digital Acoustic Transceiver for Underwater Acoustic Communication

  • Park Jong-Won;Choi Youngchol;Lim Yong-Kon;Kim Youngkil
    • The Journal of the Acoustical Society of Korea
    • /
    • v.24 no.3E
    • /
    • pp.109-114
    • /
    • 2005
  • In this paper, we present a phase coherent all-digital transceiver for underwater acoustic communication, which allows the system to reduce complexity and increase robustness in time variant underwater environments. It is designed in the digital domain except for transducers and amplifiers and implemented by using a multiple digital signal processors (DSPs) system. For phase coherent reception, conventional systems employed phase-locked loop (PLL) and delay-locked loop (DLL) for synchronization, but this paper suggests a frame synchronization scheme based on the quadrature receiver structure without using phase information. We show experimental results in the underwater anechoic basin at MOERI. The results show that the adaptive equalizer compensates frame synchronization error and the correction capability is dependent on the length of equalizer.

Lossless Audio Coding using Integer DCT

  • Kang MinHo;Lee Sung Woo;Park Se Hyoung;Shin Jaeho
    • Proceedings of the IEEK Conference
    • /
    • summer
    • /
    • pp.114-117
    • /
    • 2004
  • This paper proposes a novel algorithm for hybrid lossless audio coding, which employs integer discrete cosine transform. The proposed algorithm divides the input signal into frames of a proper length, decorrelates the framed data using the integer DCT and finally entropy-codes the frame data. In particular, the adaptive Golomb-Rice coding method used for the entropy coding selects an optimal option which gives the best compression efficiency. Since the proposed algorithm uses integer operations, it significantly improves the computation speed in comparison with an algorithm using real or floating-point operations. When the coding algorithm is implemented in hardware, the system complexity as well as the power consumption is remarkably reduced. Finally, because each frame is independently coded and is byte-aligned with respect to the frame header, it is convenient to move, search, and edit the coded data.

  • PDF

Quantization of Line Spectrum Pair Frequencies using Lattice Vector Quantizers (격자벡터양자화기를 이용한 음성신호의 LSP 주파수 양자화)

  • 강정원;정재호;정대권
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.10
    • /
    • pp.2634-2644
    • /
    • 1996
  • Two different low rate speech coders using one of four types of lattice vector quantizers(LVQ's) with fairly low complexity were investigated for an application to mobile communications. More specifically, two-stage vector quantizer-lattic vector quantizer(VQ-LVQ) systems and vector differenctial pulse code modulation(VDPCM)systems with lattice vector quantizers simulated to encode the line spectrum frequencies of various sentences at the rate 22 to 39 bits per 20 msec frame. The simulation results showed that the VDPCM system with the lattice VQ can save up to 10 bits/fram compared to the quantization scheme used in QCELP system. For the VQ-LVQ system, the spherical quasi-uniform LVQ below 36 bits/frame outperformed the other 3 types of LVQ's and the pyramidal quasi-uniform LVQ at 37 bits/frame outperformed the other 3 types of LVQ's with the spectral distortion 0.97.

  • PDF

Adaptive Motion Vector Smoothing for Improving Side Information in Distributed Video Coding

  • Guo, Jun;Kim, Joo-Hee
    • Journal of Information Processing Systems
    • /
    • v.7 no.1
    • /
    • pp.103-110
    • /
    • 2011
  • In this paper, an adaptive motion vector smoothing scheme based on weighted vector median filtering is proposed in order to eliminate the motion outliers more effectively for improving the quality of side information in frame-based distributed video coding. We use a simple motion vector outlier reliability measure for each block in a motion compensated interpolated frame and apply weighted vector median filtering only to the blocks with unreliable motion vectors. Simulation results show that the proposed adaptive motion vector smoothing algorithm improves the quality of the side information significantly while maintaining low complexity at the encoder in frame-based distributed video coding.

Video Content-Based Bit Rate Estimation Scheme for Transcoding in IPTV Services

  • Cho, Hye Jeong;Sohn, Chae-Bong;Oh, Seoung-Jun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.3
    • /
    • pp.1040-1057
    • /
    • 2014
  • In this paper, a new bit rate estimation scheme is proposed to determine the bit rate for each subclass in an MPEG-2 TS to H.264/AVC transcoder after dividing an input MPEG-2 TS sequence into several subclasses. Video format transcoding in conventional IPTV and Smart TV services is a time-consuming process since the input sequence should be fully transcoded several times with different bit-rates to decide the bit-rate suitable for a service. The proposed scheme can automatically decide the bit-rate for the transcoded video sequence in those services which can be stored on a video streaming server as small as possible without losing any subject quality loss. In the proposed scheme, an input sequence to the transcoder is sub-classified by hierarchical clustering using a parameter value extracted from each frame. The candidate frames of each subclass are used to estimate the bit rate using a statistical analysis and a mathematical model. Experimental results show that the proposed scheme reduces the bit rate by, on an average approximately 52% in low-complexity video and 6% in high-complexity video with negligible degradation in subjective quality.

Video Transmission Method for Constant Video Quality in Next-Generation Wireless Networks (차세대 이동망에서 영상 품질을 보장하기 위한 전송 방법)

  • Park, Sang-Hyun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.06a
    • /
    • pp.175-178
    • /
    • 2007
  • According to recently presented QoS architecture by 3GPP, a traffic conditioner may be deployed to provide conformance of the negotiated QoS. A real-time frame-layer rate control method which can be applied to the traffic conditioner is proposed. The proposed rate control method uses a non-iterative optimization method for low computational complexity, and performs bit allocation at the frame level to minimize the average distortion over an entire sequence as well as variations in distortion between frames. The proposed algorithm does not produce time delay from encoding, and is suitable for real-time low-complexity video encoder.

  • PDF

Fast Generation of Stereoscopic Virtual Environment Display Using P-buffer

  • Heo, Jun-Hyeok;Jung, Soon-Ki;Wohn, Kwang-Yun
    • Journal of Electrical Engineering and information Science
    • /
    • v.3 no.2
    • /
    • pp.202-210
    • /
    • 1998
  • This paper is concerned with an efficient generation of stereoscopic views for complex virtual environments by exploiting frame coherence in visibility. The basic idea is to keep visible polygons throughout the rendering process. P-buffer, a buffer of image size, holds the id of the visible polygon for each pixel. This contrasts to the frame buffer and the Z-buffer which hold the color information and the depth information, respectively. For the generation of a consecutive image, the position and the orientation of the visible polygons in the current view are updated according to the viewer's movements, and re-rendered on the current image under the assumption that, when the viewer moves slightly, the visibility of polygons remains unchanged. In the case of stereoscopic views, it may not introduce much difficulty when we render the right(left) image using visible polygons on the (right) image only, The less difference in two images is, the easier the matching becomes in perceiving depth. Some psychophysical experiments have been conducted to support this claim. The computational complexity for generating a fight(left) image from the previous left(right) image is bounded by the size of image space, and accordingly. It is somewhat independent of the complexity of the 3-D scene.

  • PDF

The Embedded System Realization Based on the IDCT for the Moving Image Down Conversion (동영상 축소전환을 위한 IDCT기반 임베디드 시스템 구현)

  • 김영빈;강희조;윤호군;류광렬
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2004.05b
    • /
    • pp.136-139
    • /
    • 2004
  • This thesis is realization of embedded system that of MPEG-2 down conversion using IDCT. A method for down conversion of MPEG compressed video is to perform low-pass filtering and sub-sampling after full decompression. However, this method is need large memory and high computational complexity. Recent research has been focussed on the down conversion in the DCT domain. But DCT method is reduced image qualify. The embedded system is require low complexity, and high speed algorithm. When applied to embedded system that down conversion method, DCT method is played average 29 frame per second, and better 25% than spatial-domain down conversion.

  • PDF