• 제목/요약/키워드: Computer Image Analysis

검색결과 1,424건 처리시간 0.029초

멀티 스레드를 이용한 영상 처리 속도 분석 (Analysis of Image Processing Speed Using Multi-Threads)

  • 허태성;장형규
    • 한국컴퓨터정보학회:학술대회논문집
    • /
    • 한국컴퓨터정보학회 2023년도 제68차 하계학술대회논문집 31권2호
    • /
    • pp.471-472
    • /
    • 2023
  • 본 논문에서는 멀티 쓰레드를 이용하여 UI에 영상을 표현할 때, 걸리는 시간 및 적정 사용 방법을 연구하였다. 영상처리는 오픈 API인 OpenCV를 사용하여 처리하였으며, 1~4개의 스레드로 영상을 다운로드하는 시간부터 GUI에 보여주는 시간까지를 계산하는 기능을 구현하여 영상을 다운로드하고, GUI에 넣어주어야 할 때 스레드의 개수가 퍼포먼스에 관여하는 처리속도를 알아볼 수 있다.

  • PDF

라이트필드 영상 압축을 위한 Affine 움직임 보상 분석 (Analysis of Affine Motion Compensation for Light Field Image Compression)

  • ;;;전병우
    • 한국방송∙미디어공학회:학술대회논문집
    • /
    • 한국방송∙미디어공학회 2019년도 하계학술대회
    • /
    • pp.216-217
    • /
    • 2019
  • Light Field (LF) image can be understood as a set of images captured by a multi-view camera array at the same time. The changes among views can be modeled by a general motion model such as affine motion model. In this paper, we study the impact of affine coding tool of Versatile Video Coding (VVC) on LF image compression. Our experimental results show a small contribution by affine coding tool in overall LF image compression of roughly 0.2% - 0.4%.

  • PDF

cDNA 마이크로어레이 이미지를 위한 그래프 모델과 분석 알고리즘 (A Graph Model and Analysis Algorithm for cDNA Microarray Image)

  • 정호열;황미녕;유영중;조환규
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제29권7호
    • /
    • pp.411-421
    • /
    • 2002
  • 본 논문에서는 마이크로어레이 처리를 위한 새로운 이미지 분석 알고리즘과 격자 반점들의 위상 정보를 이용하여 격자의 위치를 결정하는 방법을 제시한다. 마이크로어레이는 유전자의 발현량의 측정을 위해서 수만 혹은 수십 만개의 유전자에 대해서 한번에 실험을 할 수 있는 장비이다. 한번의 실험으로 생성되는 데이터 양이 엄청나게 많기 때문에 자동화된 분석이 필요하다. 이 마이크로어레이의 실험 결과는 16-비트 회색조 이미지 파일로 하나의 유전자가 여러 개의 픽셀로 뭉쳐져 있는 반점(spot)이 격자 구조형태로 나타난다. 본 논문에서 이미지 데이터에서 그래프 구조를 생성하여 이들 반점이 어느 격자에 속하는지 결정하는 알고리즘과 격자 구조의 기울어짐을 측정하여 격자의 정확한 위치와 모양을 결정하는 방법을 제시하고 실제 이미지 데이터를 통한 많은 실험 결과를 보여 준다.

Smart Rectification on Satellite images

  • Seo, Ji-Hun;Jeong, Soo;Kim, Kyoung-Ok
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2002년도 Proceedings of International Symposium on Remote Sensing
    • /
    • pp.75-80
    • /
    • 2002
  • The mainly used technique to rectify satellite images with distortion is to develop a mathematical relationship between the pixel coordinates on the image and the corresponding points on the ground. By defining the relationship between two coordinate systems, a polynomial model is designed and various linear transformations are used. These GCP based geometric correction has performed overall plane to plane mapping. In the overall plane mapping, overall structure of a scene is considered, but local variation is discarded. The highly variant height of region is resampled with distortion in the rectified image. To solve this problem this paper proposed the TIN-based rectification on a satellite image. The TIN based rectification is good to correct local distortion, but insufficient to reflect overall structure of one scene. So, this paper shows the experimental result and the analysis of each rectification model. It also describes the relationship GCP distribution and rectification model. We can choose a geometric correction model as the structural characteristic of a satellite image and the acquired GCP distribution.

  • PDF

Single Image Dehazing: An Analysis on Generative Adversarial Network

  • Amina Khatun;Mohammad Reduanul Haque;Rabeya Basri;Mohammad Shorif Uddin
    • International Journal of Computer Science & Network Security
    • /
    • 제24권2호
    • /
    • pp.136-142
    • /
    • 2024
  • Haze is a very common phenomenon that degrades or reduces the visibility. It causes various problems where high quality images are required such as traffic and security monitoring. So haze removal from images receives great attention for clear vision. Due to its huge impact, significant advances have been achieved but the task yet remains a challenging one. Recently, different types of deep generative adversarial networks (GAN) are applied to suppress the noise and improve the dehazing performance. But it is unclear how these algorithms would perform on hazy images acquired "in the wild" and how we could gauge the progress in the field. This paper aims to bridge this gap. We present a comprehensive study and experimental evaluation on diverse GAN models in single image dehazing through benchmark datasets.

Reversible Sub-Feature Retrieval: Toward Robust Coverless Image Steganography for Geometric Attacks Resistance

  • Liu, Qiang;Xiang, Xuyu;Qin, Jiaohua;Tan, Yun;Zhang, Qin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제15권3호
    • /
    • pp.1078-1099
    • /
    • 2021
  • Traditional image steganography hides secret information by embedding, which inevitably leaves modification traces and is easy to be detected by steganography analysis tools. Since coverless steganography can effectively resist steganalysis, it has become a hotspot in information hiding research recently. Most coverless image steganography (CIS) methods are based on mapping rules, which not only exposes the vulnerability to geometric attacks, but also are less secure due to the revelation of mapping rules. To address the above issues, we introduced camouflage images for steganography instead of directly sending stego-image, which further improves the security performance and information hiding ability of steganography scheme. In particular, based on the different sub-features of stego-image and potential camouflage images, we try to find a larger similarity between them so as to achieve the reversible steganography. Specifically, based on the existing CIS mapping algorithm, we first can establish the correlation between stego-image and secret information and then transmit the camouflage images, which are obtained by reversible sub-feature retrieval algorithm. The received camouflage image can be used to reverse retrieve the stego-image in a public image database. Finally, we can use the same mapping rules to restore secret information. Extensive experimental results demonstrate the better robustness and security of the proposed approach in comparison to state-of-art CIS methods, especially in the robustness of geometric attacks.

Robust Facial Expression Recognition Based on Local Directional Pattern

  • Jabid, Taskeed;Kabir, Md. Hasanul;Chae, Oksam
    • ETRI Journal
    • /
    • 제32권5호
    • /
    • pp.784-794
    • /
    • 2010
  • Automatic facial expression recognition has many potential applications in different areas of human computer interaction. However, they are not yet fully realized due to the lack of an effective facial feature descriptor. In this paper, we present a new appearance-based feature descriptor, the local directional pattern (LDP), to represent facial geometry and analyze its performance in expression recognition. An LDP feature is obtained by computing the edge response values in 8 directions at each pixel and encoding them into an 8 bit binary number using the relative strength of these edge responses. The LDP descriptor, a distribution of LDP codes within an image or image patch, is used to describe each expression image. The effectiveness of dimensionality reduction techniques, such as principal component analysis and AdaBoost, is also analyzed in terms of computational cost saving and classification accuracy. Two well-known machine learning methods, template matching and support vector machine, are used for classification using the Cohn-Kanade and Japanese female facial expression databases. Better classification accuracy shows the superiority of LDP descriptor against other appearance-based feature descriptors.

색상분포에 대한 이미지 분석에 관한 연구 (A Study on the Image Analysis used by Color Distribution)

  • 박현근;이희석;장일기;이상문
    • 한국컴퓨터정보학회:학술대회논문집
    • /
    • 한국컴퓨터정보학회 2012년도 제45차 동계학술발표논문집 20권1호
    • /
    • pp.69-72
    • /
    • 2012
  • 영상처리 기법을 이용한 이미지 인식에 관한 콘텐츠들은 다양한 알고리즘을 사용하고 있다. 영상처리 기법 중 이미지 인식 기법에는 대표적으로 PCA(Principal Component Analysis)알고리즘이 있으며, 이 알고리즘에 적용된 대표적인 콘텐츠로 얼굴 문자인식이 있다. 이 알고리즘은 정확성을 위하여 학습을 통한 영상의 저장과 인식을 통한 복잡한 알고리즘을 사용한다. 복잡한 알고리즘의 사용으로 간단한 이미지 인식 콘텐츠의 경우 시스템 처리속도에 영향을 줄 수 있다. 따라서 이 논문에서는 색상의 분포를 통하여 그 수치를 이용한 이미지를 분석한 실험을 통하여 간단한 이미지인식 시스템을 위한 알고리즘을 제시하고, 이 알고리즘을 통해서 얻을 수 있는 장 단점을 분석하였다.

  • PDF

음악 분석을 이용한 클라이언트 중심의 키프레임 생성 시스템 (Client-driven Animated Keyframe Generation System Using Music Analysis)

  • 무즈타바 굴람;김선대;박은수;김승환;유재성;류은석
    • 한국방송∙미디어공학회:학술대회논문집
    • /
    • 한국방송∙미디어공학회 2019년도 하계학술대회
    • /
    • pp.173-175
    • /
    • 2019
  • Animated images formats such as WebP are highly portable graphics formats that are being used everywhere on the Internet. Despite their small sizes and duration, WebP image previews the video without watching the entire content with minimum bandwidth. This paper proposed a novel method to generate personalized WebP images in the client side using its computation resources. The proposed system automatically extracts the WebP image from climax point using music analysis. Based on user interest, the system predicts the genre using Convolutional Neural Network (CNN). The proposed method can easily integrate with streaming platforms such as YouTube, Netflix, Hulu, and others.

  • PDF

경계의 값 분포 특성과 정보를 기반한 새로운 경계 영상 압축 기법 (New Still Edge Image Compression based on Distribution Characteristics of the Value and the Information on Edge Image)

  • 김도현;한종우;김윤
    • 한국멀티미디어학회논문지
    • /
    • 제19권6호
    • /
    • pp.990-1002
    • /
    • 2016
  • In this paper, we propose a new compression method for the edge image by analyzing the characteristics and the distribution of pixel values of the edge image. The pixel values of the edge image have the Gaussian distribution around '0', and most of the pixel values are `0`. By these analyses we suggest the Zero-Based codec that expresses all values in a CU by a single bit flag. Also, in order to reduce the computational complexity of the proposed codec, the block partition and the intra-prediction techniques are proposed by using edge information like the number of each edge direction, the distribution and the amplitude of a major edge direction in the CU. Experimental results show that the proposed codec leads to a slighter distortion in Y domain than that of HEVC, but has far faster processing speed up to 53 times while it maintains the similar image quality compared to HEVC.