• 한국멀티미디어학회논문지
• /
• 제19권8호
• /
• pp.1310-1319
• /
• 2016

Face detection is the first step in a wide range of face applications. However, detecting faces in the wild is still a challenging task due to the wide range of variations in pose, scale, and occlusions. Recently, many deep learning methods have been proposed for face detection. However, further improvements are required in the wild. Another important issue to be considered in the face detection is the computational complexity. Current state-of-the-art deep learning methods require a large number of patches to deal with varying scales and the arbitrary image sizes, which result in an increased computational complexity. To reduce the complexity while achieving better detection accuracy, we propose a fully convolutional network-based face detection that can take arbitrarily-sized input and produce feature maps (heat maps) corresponding to the input image size. To deal with the various face scales, a multi-scale network architecture that utilizes the facial components when learning the feature maps is proposed. On top of it, we design multi-task learning technique to improve detection performance. Extensive experiments have been conducted on the FDDB dataset. The experimental results show that the proposed method outperforms state-of-the-art methods with the accuracy of 82.33% at 517 false alarms, while improving computational efficiency significantly.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(3)
• /
• pp.145-148
• /
• 2000

This paper proposes a character segmentation method for Korean letter address image. The poor quality of image binarization results in broken character strokes. To overcome this problem, two steps of processing ate introduced. The first one is to merge broken characters to generate character candidates, and the other one is to reduce the complexity of segmentation graph path. These two steps do not use recognition information to keep in high-speed.

• 한국통신학회논문지
• /
• 제22권8호
• /
• pp.1715-1721
• /
• 1997

Wavelet transform is not applicable to arbitrarily-shaped region (or object) in images, due to the nature of its global decomposition. In this paper, the arbitrarily-shaped wavelet transform(ASWT) is proposed in order to solve this problem and its properties are investigated. Computation complexity of the ASWT is also examined and it is shown that the ASWT requires significantly fewer computations than conventional wavelet transform, since the ASWT processes only the object region in the original image. Experimental resutls show that any arbitrarily-shaped image segment can be decomposed using the ASWT and perfectly reconstructed using the inverse ASWT.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권5호
• /
• pp.2273-2286
• /
• 2018

This paper describes transformations between elemental image arrays and a RGBD image for three-dimensional integral imaging and transmitting systems. Two transformations are introduced and analyzed in the proposed method. Normally, a RGBD image is utilized in efficient 3D data transmission although 3D imaging and display is restricted. Thus, a pixel-to-pixel mapping is required to obtain an elemental image array from a RGBD image. However, transformations and their analysis have little attention in computational integral imaging and transmission. Thus, in this paper, we introduce two different mapping methods that are called as the forward and backward mapping methods. Also, two mappings are analyzed and compared in terms of complexity and visual quality. In addition, a special condition, named as the hole-free condition in this paper, is proposed to understand the methods analytically. To verify our analysis, we carry out experiments for test images and the results indicate that the proposed methods and their analysis work in terms of the computational cost and visual quality.

• 한국전자통신학회논문지
• /
• 제9권5호
• /
• pp.601-608
• /
• 2014

본 연구에서는 스마트폰의 제한된 연산 환경에 적합한 영상 잡음 제거 알고리즘을 개발하여 기존의 연구들과 비교할 시에 스마트폰에서 보다 빠르게 영상 후처리 결과물을 얻고, 품질적인 면에서도 비교할 만한 수준의 영상을 얻는 앱 환경에서 실용적인 알고리즘을 제안한다. 제안된 저조도 환경에서 스마트폰 카메라를 위한 영상잡음 제거 알고리즘은 영상획득 과정에서 발생한 가우시안 잡음만 찾아내어 제거함으로써 영상 복원과정에서 발생하는 연산량을 감축하면서 윤곽선의 블러링 현상을 방지한다. 실험 결과에 의하면 기존의 평균필터와 메디언 필터 적용 기법들에 비해 훨씬 양호한 PSNR 값을 가짐을 보였다. 그리고 영상 내 윤곽선의 흐려짐을 방지하여 기존의 방법들에 의한 결과들보다 선명한 영상 품질을 가지며, 또한 기존의 라플라시안 마스크 연산적용에 비해 연산량을 약 52% 감소시킴으로서 안드로이드 기반의 스마트폰 카메라 앱으로 구현 및 적용했을 때도 복원된 영상이 원 영상에 훨씬 근접하는 영상복원 성능을 가짐을 확인하였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.1899-1902
• /
• 2003

Recently several methods have been developed for the virtual space construction. Generally, most of the methods are geometric-based rendering technic, but they are difficult to construct real-time rendering because of large data. In this paper, we present a three dimension image-based rendering method that enable a constant speed of real-time rendering regardless of object complexity in virtual space. The Proposed method shows good performance for the virtual space construction with high complexity.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 하계학술대회 논문집 G
• /
• pp.2225-2227
• /
• 1998

An efficient stereo matching method with variable matching weights is proposed. The edge segment-based stereo matching has been shown to be efficient method. The method includes 5 matching factor with different weights. The ordinary matching weights are not always adequate for every image. Employing different weight sets depending on the complexity shows better matching performance. In this paper, an evaluation criterion for complexity is suggested and the experimental results with the proposed method is shown.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 제14회 신호처리 합동 학술대회 논문집
• /
• pp.121-124
• /
• 2001

For efficient transmission of 3DTV video signals, it is necessary to eliminate the inherent redundancy between the stereo image pairs. Though disparity estimation provides a powerful tool for eliminating the redundancy, it is very time consuming. This paper presents a novel disparity estimation scheme based on the human visual property. The disparity vectors of image blocks spatially adjacent to the current block are used as initial guesses fur the disparity vector of the current block. In addition, mixed-resolution coding is applied to reduce the computational complexity of disparity estimation. Through computer simulations on a stereoscopic sequence we show that the proposed method gives rise .to visually pleasing results with much reduced computational complexity.

• IEIE Transactions on Smart Processing and Computing
• /
• 제6권4호
• /
• pp.292-298
• /
• 2017

The complexity of image compression algorithms has increased in order to improve image compression efficiency. One way to resolve high computational complexity is parallel processing. However, entropy coding, which is lossless compression, does not fit into the parallel processing form because of the correlation between consecutive symbols. This paper proposes a new application-specific instruction set processor (ASIP) platform by adding new context-adaptive binary arithmetic coding (CABAC) instructions to the existing platform to quickly process a variety of entropy coding. The newly added instructions work without conflicts with all other existing instructions of the platform, providing the flexibility to handle many coding standards with fast processing speeds. CABAC software is implemented for High Efficiency Video Coding (HEVC) and the performance of the proposed ASIP platform was verified with a field programmable gate array simulation.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.304-306
• /
• 2007

Methods of Object recognition from camera image are to compare features of color. edge or pattern with model in a general way. SIFT(scale-invariant feature transform) has good performance but that has high complexity of computation. Using simple color histogram has low complexity. but low performance. In this paper we represent a model as a color cooccurrence histogram. and we improve performance using pyramid matching. The color cooccurrence histogram keeps track of the number of pairs of certain colored pixels that occur at certain separation distances in image space. The color cooccurrence histogram adds geometric information to the normal color histogram. We suggest object recognition by pyramid matching of color cooccurrence histogram.