• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(4)
• /
• pp.355-358
• /
• 2002

In this paper, we propose RTP(Real-Time Transport Protocol) based image transport system to transport still images in real-time after JPEG2000 compression, which is still image compression standard for next generation. To add RTP packet on UDP packet, the image transport system inserts packetizer and depacketizer process into transmitter and receiver of RTP data, respectively. We apply the proposed system to several image and compare the transport time to TCP-based method.

• International Journal of Internet, Broadcasting and Communication
• /
• 제9권1호
• /
• pp.9-17
• /
• 2017

This paper describes a process of developing commercial real time image recognition system with company. In this paper we will make a system that is combining an empirical kernel map method and conjugate least squares support vector machine in order to represent images in a low-dimensional subspace for real time image recognition. In the traditional approach calculating these eigenspace models, known as traditional PCA method, model must capture all the images needed to build the internal representation. Updating of the existing eigenspace is only possible when all the images must be kept in order to update the eigenspace, requiring a lot of storage capability. Proposed method allows discarding the acquired images immediately after the update. By experimental results we can show that empirical kernel map has similar accuracy compare to traditional batch way eigenspace method and more efficient in memory requirement than traditional one. This experimental result shows that proposed model is suitable for commercial real time image recognition system.

• 한국정보처리학회논문지
• /
• 제3권4호
• /
• pp.720-732
• /
• 1996

아이콘 이미지를 위한 공간 매치 검색기법은 이미지를 몇개의 인식가능한 심볼로 인식하고, 이것을 도큐먼트를 대표하는 값으로 받아들여 인덱싱한다. 사용자가 이미지에 대한 내용-본위 검색을 요구하면, 질의에 있는 이미지를 심볼로 변환한 후 접근기법을 통해 원하는 이미지를 검색한다. 따라서 본 연구에서는 이미지의 내용-본위 검색을 효율적으로 지원하기 위하여, 시그니쳐를 이용한 아이콘 이미지의 공간 매치 검색 기법을 제안하다. 이를 위하여 2차원 아이코닉 이미지에 대한 새로운 색인 표현 방법을 제시하며, 구현한 전체 시스템 구성을 설명한다. 아울러 기존의 9-DLT 방법과 정확률과 검색율면에서 성능평가를 수행하여, 제안하는 기법이 이미지의 내용-본위 검색에 효율적임을 보인다.

• ETRI Journal
• /
• 제28권1호
• /
• pp.51-58
• /
• 2006

In this paper, we propose a method of applying a lifting-based wavelet domain e-median filter (LBWDEMF) for image restoration. LBWDEMF helps in reducing the number of computations. An e-median filter is a type of modified median filter that processes each pixel of the output of a standard median filter in a binary manner, keeping the output of the median filter unchanged or replacing it with the original pixel value. Binary decision-making is controlled by comparing the absolute difference of the median filter output and the original image to a preset threshold. In addition, the advantage of LBWDEMF is that probabilities of encountering root images are spread over sub-band images, and therefore the e-median filter is unlikely to encounter root images at an early stage of iterations and generates a better result as iteration increases. The proposed method transforms an image into the wavelet domain using lifting-based wavelet filters, then applies an e-median filter in the wavelet domain, transforms the result into the spatial domain, and finally goes through one spatial domain e-median filter to produce the final restored image. Moreover, in order to validate the effectiveness of the proposed method we compare the result obtained using the proposed method to those using a spatial domain median filter (SDMF), spatial domain e-median filter (SDEMF), and wavelet thresholding method. Experimental results show that the proposed method is superior to SDMF, SDEMF, and wavelet thresholding in terms of image restoration.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제13권3호
• /
• pp.225-236
• /
• 2009

Image inpainting is the process of reconstructing lost or deteriorated parts of images using information from surrounding areas. We propose a computationally efficient and fast phase-field method which uses automatic switching parameter, adaptive time step, and automatic stopping of calculation. The algorithm is based on an energy functional. We demonstrate the performance of our new method and compare it with a previous method.

• Communications for Statistical Applications and Methods
• /
• 제8권2호
• /
• pp.573-579
• /
• 2001

Wavelet thresholding is a method for he reduction of noise in image. Wavelet coefficients of image are correlated in local characterization. Thee correlations also appear in he original pixel representation of the image, and they do not follow from the characterizations of the wavelet transform. In this paper, we compare noise-free distributions of Bayes approach to improve the classical threshold algorithm.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2013년도 하계학술대회
• /
• pp.322-324
• /
• 2013

Haze is an extreme reason of the reduction of contrast when capturing image in the outdoor. Recently, there are several single image dehazing techniques, but they are not robust in dynamic variations of natural environment caused by the thickness, coverage of haze and appearance of sunlight. In this paper, we propose an effective and robust method to enhance luminance for image dehazing depending on histogram analysis. Compare with conventional methods, our proposal have better performance in term of contrast, and computation time.

• Journal of Advanced Marine Engineering and Technology
• /
• 제28권4호
• /
• pp.587-592
• /
• 2004

Pixel classification is one of basic issues of image processing. The general characteristics of the pixels belonging to various classes are discussed and the radical principles of pixel classification are given. At the same time, a pixel classification scheme based on image information scales is proposed. The proposed method is overcome that computation amount become greater and contents easily get turned. And image directional scales has excellent anti-noise performance. In the result of experiment. good efficiency is showed compare with other methods.

• 한국멀티미디어학회논문지
• /
• 제21권3호
• /
• pp.342-347
• /
• 2018

We proposed a fast detection of copy-move image forgery using four step search algorithm in the spatial domain. In the four-step search algorithm, the search area is 21 (-10 ~ +10), and the number of pixels to be scanned is 33. Our algorithm reduced computational complexity more than conventional copy move image forgery methods. The proposed method reduced 92.34 % of computational complexity compare to exhaustive search algorithm.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2012년도 추계학술대회
• /
• pp.5-8
• /
• 2012

Haze is an extreme reason of the reduction of contrast when capturing image in the outdoor. Recently, there are several single image dehazing techniques, but they are not robust in dynamic variations of natural environment caused by the thickness, coverage of haze and appearance of sunlight. In this paper, we propose an effective and robust method to restore degradation of hazy image. Compare with conventional methods, our proposal have better performance and computation time.