• Title/Summary/Keyword: Picture Complexity

Search Result 96, Processing Time 0.027 seconds

Hierarchical Haze Removal Using Dark Channel Prior (Dark Channel Prior를 이용한 계층적 영상 안개 제거 알고리즘)

  • Kim, Jin-Hwan;Kim, Chang-Su
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.59 no.2
    • /
    • pp.457-464
    • /
    • 2010
  • The haze removal algorithm using dark channel prior, which was proposed by He et al., is an efficient algorithm and presents impressive results. But its high memory and computational requirements limit its applications. In this paper, we propose a method to improve the memory usage and calculation speed. We notice that the matting process accounts for most calculation time, so we replace the matting process with a fast bilateral filtering scheme. Using the bilateral filter, we can reduce the memory usage, but its computational complexity is still high. To reduce the computational complexity as well, we adapt a hierarchical structure for the bilateral filtering. Experimental results show that the proposed algorithm can remove haze in a picture effectively, while requiring much less computations than the He et al.'s method.

Multi-Layer Perceptron Based Ternary Tree Partitioning Decision Method for Versatile Video Coding (다목적 비디오 부/복호화를 위한 다층 퍼셉트론 기반 삼항 트리 분할 결정 방법)

  • Lee, Taesik;Jun, Dongsan
    • Journal of Korea Multimedia Society
    • /
    • v.25 no.6
    • /
    • pp.783-792
    • /
    • 2022
  • Versatile Video Coding (VVC) is the latest video coding standard, which had been developed by the Joint Video Experts Team (JVET) of ITU-T Video Coding Experts Group (VCEG) and ISO/IEC Moving Picture Experts Group (MPEG) in 2020. Although VVC can provide powerful coding performance, it requires tremendous computational complexity to determine the optimal block structures during the encoding process. In this paper, we propose a fast ternary tree decision method using two neural networks with 7 nodes as input vector based on the multi-layer perceptron structure, names STH-NN and STV-NN. As a training result of neural network, the STH-NN and STV-NN achieved accuracies of 85% and 91%, respectively. Experimental results show that the proposed method reduces the encoding complexity up to 25% with unnoticeable coding loss compared to the VVC test model (VTM).

The Zoo of Early-type Dwarf Galaxies in Clusters

  • Rey, Soo-Chang
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.37 no.1
    • /
    • pp.40.2-40.2
    • /
    • 2012
  • Early-type dwarf galaxies are the most numerous galaxies in dense environments, making them ideal probes of the mechanisms that govern galaxy formation and evolution. Despite the common picture of an early-type dwarf galaxy as a quiescent one with no star formation and little gas, recent systematic investigations of early-type dwarf galaxies in the cluster revealed an unexpected variety among these apparently simple objects. In this talk, I review intriguing complexity of early-type dwarf galaxies in the cluster. I will also briefly introduce a new catalog of galaxies in the Virgo cluster using SDSS data, extended Virgo Cluster Catalog (EVCC).

  • PDF

$\alpha$ Scaling Parameter Optimization On Watermarking Using Autostereogram (오토스테레오그램을 이용한 워터마킹에서 $\alpha$스켈링 파라미터 최적화)

  • 허덕규;이인정;김성옥
    • Journal of Internet Computing and Services
    • /
    • v.2 no.4
    • /
    • pp.101-109
    • /
    • 2001
  • In recent year, the use of digital picture information and general picture information has been increased, However, numerous copyright infringement and pirate copy of picture information through Internet and CD-ROM happen very often, As a result, several methods of watermarking have been presented to solve and verify distortion of the original data, In addition, watermark data have been suggested to resolve the vastness of the original data, Watermarking methods are often used to protect the right of ownership of a copyright, However, these Watermarking methods have brought the obscurity of recognition caused by the complexity of verification procedure and the increase of magnitude computation occurrence, This paper mainly mentions about the local optimization of scaling parameter, the maximization of hiding of Watermark information and maximization of watermark information in case of restoration that determine the amount of inserted information which is used for preventing distortion and transformation of the original data caused by insertion and hiding of Watermark information on compounding Autostereogram into JPEG picture information.

  • PDF

Audio Signal Coding Using Wavelet Transform (웨이블렛 변환을 이용한 오디오 코딩)

  • Bae, Seok-Mo;Kim, Do-Hyoung;Chung, Jae-Ho
    • The Journal of the Acoustical Society of Korea
    • /
    • v.16 no.4
    • /
    • pp.64-70
    • /
    • 1997
  • This paper is aimed to propose a new wavelet audio signal coding scheme which reduces the complexity of well-known MPEG(Moving Picture Expert Group)-Audio. The filters of MPEG0audio apply subband technique on the 16-bits PCM audio to aquire bitstream of subband sample using dynamic bit allocation. If we use the wavelet coefficients instead of subband samples and 6 bands which is less than 32 bands of MPEG-audio, the complexity can be reduced. A new audio signal compression algorithm in this paper is based on wavelet transform and the proposed algorithm is compared with MPEG-audio. At the bitrate of 256kbps, the proposed algorithm maintains the CD(Compact-disc) quality. We were able to reduce the about 40% of complexity at encoder and about 70% at decoder.

  • PDF

Early Coding Unit-Splitting Termination Algorithm for High Efficiency Video Coding (HEVC)

  • Goswami, Kalyan;Kim, Byung-Gyu;Jun, Dongsan;Jung, Soon-Heung;Choi, Jin Soo
    • 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.

FACE DETECTION USING SKIN-COLOR MODEL AND SUPPORT VECTOR MACHINE

  • Seld, Yoko;Yuyama, Ichiro;Hasegawa, Hiroshi;Watanabe, Yu
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.592-595
    • /
    • 2009
  • In this paper, we propose a face detection technique for still pictures which sequentially uses a skin-color model and a support vector machine (SVM). SVM is a learning algorithm for solving the classification problem. Some studies on face detection have reported superior results of SVM over neural networks. The SVM method searches for a face in a picture while changing the size of the window. The detection accuracy and the processing time of SVM vary largely depending on the complexity of the background of the picture or the size of the face. Therefore, we apply a face candidate area detection method using a skin-color model as a preprocessing technique. We compared the method using SVM alone with that of the proposed method in respect to face detection accuracy and processing time. As a result, the proposed method showed improved processing time while maintaining a high recognition rate.

  • PDF

Fine Granular Scalable Coding using Matching Pursuit with Multi-Step Search (다단계 탐색 기반 Matching Pursuit을 이용한 미세 계층적 부호화 기법)

  • 최웅일
    • Journal of Broadcast Engineering
    • /
    • v.6 no.3
    • /
    • pp.225-233
    • /
    • 2001
  • Real-time video communication applications over Internet should be able to support such functionality as scalability because of the unpredictable and varying channel bandwidth between server and client. To accommodatethe wide variety of channel bitrates, a new scalable coding tool, namely the Fine Granular Scalability (FGS) coding tool has been reduce the adopted In the MPEG-4 video standard. This paper presentsa new FGS algorithm with matching Pursuit that can reduce the computational complexity of ordinal matching pursuit-based algorithm. The Proposed coding algorithm can make trade-off between Picture Quality and computationalcomplexity. Our simulation result shows that the proposed algorithm can reduce the computational cumplexity up to 1/5 compared to the conventional FGS method while retaining a similar picture quality.

  • PDF

Performance Analysis of 6DoF Video Streaming Based on MPEG Immersive Video (MPEG 몰입형 비디오 기반 6DoF 영상 스트리밍 성능 분석)

  • Jeong, Jong-Beom;Lee, Soonbin;Kim, Inae;Ryu, Eun-Seok
    • Journal of Broadcast Engineering
    • /
    • v.27 no.5
    • /
    • pp.773-793
    • /
    • 2022
  • The moving picture experts group (MPEG) immersive video (MIV) coding standard has been established to support six degrees of freedom (6DoF) in virtual reality (VR) by transmitting high-quality multiple immersive videos. The MIV exploits two approaches considering tradeoff between bandwidth and computational complexity: 1) eliminating correlation between multi-view videos or 2) selecting representative videos. This paper presents performance analysis on intermediate synthesized views on source view positions and synthesized pose traces using high-efficiency video coding (HEVC) and versatile video coding (VVC) for above-mentioned two approaches.

A Propensity of Formative Presentation by Line Drawing (라인드로잉에 의한 디자인 조형의 표현성향)

  • 우흥룡
    • Archives of design research
    • /
    • v.11 no.2
    • /
    • pp.95-103
    • /
    • 1998
  • During design thinking and developing, its idea into the real world, and we are under pattern recognition and gestalt principles of perceptual organization. Generally originality is a part of creativity which consists an integral factor of the designing. This is a study on the measure system for an ability of originality in design. It is reorganized that the OTLD(Originality Test of Line Drawing) is a measuring system for personal originality. In order to catch the development the thoughts, we presented 10 picture planes as stimuli (each picture plane contained 3-18 dots), recorded the tape displaying eye-mark trajectories and outputting the trajectories with EMR(Eye Mark Recorder), then found the process of visual sensation and perception. From the results of this study, we examined the relationships between connections and complexity of the objects on the picture plane, which could be transformed into some objective measuring parameters. We would suggest this OLTD as a measurement system for an ability of originality in design fields, but we couldn't find any reliability and validity for fine art fields.

  • PDF