• 제목/요약/키워드: image complexity

검색결과 941건 처리시간 0.025초

대역 적응 양자화와 중요 클러스터 추출을 이용한 웨이브릿 영상 부호화 (The wavelet Image Coding Using Band Adaptive Quantization and the Significant Cluster Extraction)

  • 류권열
    • 한국정보통신학회논문지
    • /
    • 제9권6호
    • /
    • pp.1234-1240
    • /
    • 2005
  • 본 논문에서는 대역 적응 양자화와 중요 클러스터 추출을 이용한 웨이브릿 영상 부호화 방법을 제안한다. 제안한 방법은 모폴로지를 이용하여 형태소보다 적은 클러스터를 제거함으로써 기존의 MRWD 부호화에서 생성되는 불필요한 부가정보를 감소시킨다. 그리고 대역 적응 양자화를 이용하여 양자화 과정에 소요되는 계산량을 감소시킴으로써 고속 부호화를 가능하게 한다. 실험결과 제안한 방법은 양자화 계산량이 비트율에 따라 $20\%{\~}33.3\%$ 감소함을 알 수 있었다.

Improvement of image processing speed of the 2D Fast Complex Hadamard Transform

  • Fujita, Yasuhito;Tanaka, Ken-Ichi
    • 한국방송∙미디어공학회:학술대회논문집
    • /
    • 한국방송공학회 2009년도 IWAIT
    • /
    • pp.498-503
    • /
    • 2009
  • As for Hadamard Transform, because the calculation time of this transform is slower than Discrete Cosine Transform (DCT) and Fast Fourier Transform (FFT), the effectiveness and the practicality are insufficient. Then, the computational complexity can be decreased by using the butterfly operation as well as FFT. We composed calculation time of FFT with that of Fast Complex Hadamard Transform by constructing the algorithm of Fast Complex Hadamard Transform. They are indirect conversions using program of complex number calculation, and immediate calculations. We compared calculation time of them with that of FFT. As a result, the reducing the calculation time of the Complex Hadamard Transform is achieved. As for the computational complexity and calculation time, the result that quadrinomial Fast Complex Hadamard Transform that don't use program of complex number calculation decrease more than FFT was obtained.

  • PDF

Double Random Phase Encryption Based Orthogonal Encoding Technique for Color Images

  • Lee, In-Ho;Cho, Myungjin
    • Journal of the Optical Society of Korea
    • /
    • 제18권2호
    • /
    • pp.129-133
    • /
    • 2014
  • In this paper, we propose a simple Double random phase encryption (DRPE)-based orthogonal encoding technique for color image encryption. In the proposed orthogonal encoding technique, a color image is decomposed into red, green, and blue components before encryption, and the three components are independently encrypted with DRPE using the same key in order to decrease the complexity of encryption and decryption. Then, the encrypted data are encoded with a Hadamard matrix that has the orthogonal property. The purpose of the proposed orthogonal encoding technique is to improve the security of DRPE using the same key at the cost of a little complexity. The proposed orthogonal encoder consists of simple linear operations, so that it is easy to implement. We also provide the simulation results in order to show the effects of the proposed orthogonal encoding technique.

A Fast SIFT Implementation Based on Integer Gaussian and Reconfigurable Processor

  • Su, Le Tran;Lee, Jong Soo
    • 한국정보전자통신기술학회논문지
    • /
    • 제2권3호
    • /
    • pp.39-52
    • /
    • 2009
  • Scale Invariant Feature Transform (SIFT) is an effective algorithm in object recognition, panorama stitching, and image matching, however, due to its complexity, real time processing is difficult to achieve with software approaches. This paper proposes using a reconfigurable hardware processor with integer half kernel. The integer half kernel Gaussian reduces the Gaussian pyramid complexity in about half [] and the reconfigurable processor carries out a parallel implementation of a full search Fast SIFT algorithm. We use a low memory, fine grain single instruction stream multiple data stream (SIMD) pixel processor that is currently being developed. This implementation fully exposes the available parallelism of the SIFT algorithm process and exploits the processing and I/O capabilities of the processor which results in a system that can perform real time image and video compression. We apply this novel implementation to images and measure the effectiveness. Experimental simulation results indicate that the proposed implementation is capable of real time applications.

  • PDF

High-Speed Transformer for Panoptic Segmentation

  • Baek, Jong-Hyeon;Kim, Dae-Hyun;Lee, Hee-Kyung;Choo, Hyon-Gon;Koh, Yeong Jun
    • 방송공학회논문지
    • /
    • 제27권7호
    • /
    • pp.1011-1020
    • /
    • 2022
  • Recent high-performance panoptic segmentation models are based on transformer architectures. However, transformer-based panoptic segmentation methods are basically slower than convolution-based methods, since the attention mechanism in the transformer requires quadratic complexity w.r.t. image resolution. Also, sine and cosine computation for positional embedding in the transformer also yields a bottleneck for computation time. To address these problems, we adopt three modules to speed up the inference runtime of the transformer-based panoptic segmentation. First, we perform channel-level reduction using depth-wise separable convolution for inputs of the transformer decoder. Second, we replace sine and cosine-based positional encoding with convolution operations, called conv-embedding. We also apply a separable self-attention to the transformer encoder to lower quadratic complexity to linear one for numbers of image pixels. As result, the proposed model achieves 44% faster frame per second than baseline on ADE20K panoptic validation dataset, when we use all three modules.

Eigen Value 기반의 영상검색 기법 (Eigen Value Based Image Retrieval Technique)

  • 김진용;소운영;정동석
    • 정보기술과데이타베이스저널
    • /
    • 제6권2호
    • /
    • pp.19-28
    • /
    • 1999
  • Digital image and video libraries require new algorithms for the automated extraction and indexing of salient image features. Eigen values of an image provide one important cue for the discrimination of image content. In this paper we propose a new approach for automated content extraction that allows efficient database searching using eigen values. The algorithm automatically extracts eigen values from the image matrix represented by the covariance matrix for the image. We demonstrate that the eigen values representing shape information and the skewness of its distribution representing complexity provide good performance in image query response time while providing effective discriminability. We present the eigen value extraction and indexing techniques. We test the proposed algorithm of searching by eigen value and its skewness on a database of 100 images.

  • PDF

도시여성의 특성에 따른 실내디자인 이미지 선호성향 - 광주광역시 여성들을 중심으로 - (Preferences for Interior Image among Urban Female Residents - Focus on Females living In Kwangju City -)

  • 김미희;문희정
    • 한국실내디자인학회논문집
    • /
    • 제26호
    • /
    • pp.11-18
    • /
    • 2001
  • This study explores the interior image preferred by females living in urban areas. It also examines the relationship between interior image and socio-demographic characteristics such as age, marital status, employment status, total household income. The target population of this study was 301 adult females living in Kwangju City. The data were analyzed with frequency, percentage, General Linear Model, and Duncan's multiple range test using the SAS package. The major findings of this study were as follows. 1) The majority of the females generally preferred modernity of interior image to traditionalism. Also they preferred feminity of interior image to masculinity and complexity to simplicity. 2) Females in the age of 40s were more likely to prefer simple and oriental-traditionalism image to those under the age of 30s. 3) Those with the higher total household income were more 1ike1y prefer western-traditionalism image to those with the lower. But those with the lower household income were more tended to prefer modernity image to those with the higher.

  • PDF

Image Dehazing Enhancement Algorithm Based on Mean Guided Filtering

  • Weimin Zhou
    • Journal of Information Processing Systems
    • /
    • 제19권4호
    • /
    • pp.417-426
    • /
    • 2023
  • To improve the effect of image restoration and solve the image detail loss, an image dehazing enhancement algorithm based on mean guided filtering is proposed. The superpixel calculation method is used to pre-segment the original foggy image to obtain different sub-regions. The Ncut algorithm is used to segment the original image, and it outputs the segmented image until there is no more region merging in the image. By means of the mean-guided filtering method, the minimum value is selected as the value of the current pixel point in the local small block of the dark image, and the dark primary color image is obtained, and its transmittance is calculated to obtain the image edge detection result. According to the prior law of dark channel, a classic image dehazing enhancement model is established, and the model is combined with a median filter with low computational complexity to denoise the image in real time and maintain the jump of the mutation area to achieve image dehazing enhancement. The experimental results show that the image dehazing and enhancement effect of the proposed algorithm has obvious advantages, can retain a large amount of image detail information, and the values of information entropy, peak signal-to-noise ratio, and structural similarity are high. The research innovatively combines a variety of methods to achieve image dehazing and improve the quality effect. Through segmentation, filtering, denoising and other operations, the image quality is effectively improved, which provides an important reference for the improvement of image processing technology.

스테레오 영상 교정 구조의 간략화를 이용한 고효율 3D 비젼시스템 (High efficient 3D vision system using simplification of stereo image rectification structure)

  • 김상현
    • 한국정보전자통신기술학회논문지
    • /
    • 제12권6호
    • /
    • pp.605-611
    • /
    • 2019
  • 3D Vision system has many applications recently but popularization have many problems that need to be overcome. Volumetric display may process a amount of visual data and design the high efficient vision system for display. In case of stereo system for volumetric display, disparity vectors from the stereoscopic sequences and residual images with the reference images has been transmitted, and the reconstructed stereoscopic sequences have been displayed at the receiver. So central issue for the design of efficient volumetric vision system lies in selecting an appropriate stereo matching and robust vision system. In this paper, we propose high efficient vision system with the reduction of rectification error which can perform the 3D data extraction efficiently with low computational complexity. In experimental results with proposed vision system, the proposed method can perform the 3D data extraction efficiently with reducing rectification error and low computational complexity.

A Bit Allocation Method Based on Proportional-Integral-Derivative Algorithm for 3DTV

  • Yan, Tao;Ra, In-Ho;Liu, Deyang;Zhang, Qian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제15권5호
    • /
    • pp.1728-1743
    • /
    • 2021
  • Three-dimensional (3D) video scenes are complex and difficult to control, especially when scene switching occurs. In this paper, we propose two algorithms based on an incremental proportional-integral-derivative (PID) algorithm and a similarity analysis between views to improve the method of bit allocation for multi-view high efficiency video coding (MV-HEVC). Firstly, an incremental PID algorithm is introduced to control the buffer "liquid level" to reduce the negative impact on the target bit allocation of the view layer and frame layer owing to the fluctuation of the buffer "liquid level". Then, using the image similarity between views is used to establish, a bit allocation calculation model for the multi-view video main viewpoint and non-main viewpoint is established. Then, a bit allocation calculation method based on hierarchical B frames is proposed. Experimental simulation results verify that the algorithm ensures a smooth transition of image quality while increasing the coding efficiency, and the PSNR increases by 0.03 to 0.82dB while not significantly increasing the calculation complexity.