• 한국지능시스템학회논문지
• /
• 제21권3호
• /
• pp.395-400
• /
• 2011

본 논문에서는 얼굴 표정에서 나타나는 동적인 정서상태 변화를 고려한 얼굴 영상 기반 정서 인식 연구를 제안한다. 본 연구는 얼굴 영상 기반 정서적 특징 검출 및 분석 단계와 정서 상태 분류/인식 단계로 구분할 수 있다. 세부 연구의 구성 중 첫 번째는 Facial Action Units (FAUs)과 결합한 Active Shape Model (ASM)을 이용하여 정서 특징 영역 검출 및 분석기법의 제안이며, 두 번째는 시간에 따른 정서 상태의 동적 변화를 고려한 정확한 인식을 위하여 Hidden Markov Model(HMM) 형태의 Dynamic Bayesian Network를 사용한 정서 상태 분류 및 인식기법의 제안이다. 또한, 최적의 정서적 상태 분류를 위한 HMM의 파라미터 학습 시 Harmony Search (HS) 알고리즘을 이용한 휴리스틱 최적화 과정을 적용하였으며, 이를 통하여 동적 얼굴 영상 변화를 기반으로 하는 정서 상태 인식 시스템을 구성하고 그 성능의 향상을 도모하였다.

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

This paper presents a fast block-matching algorithm to improve the conventional Three-Step Search (TSS) based method. The proposed Comparison Fast Block Matching Algorithm (CFBMA) begins with DAB for adaptive search range to choose searching method, and searches a part of search window that has high possibility of motion vector like other partial search algorithms. The CFBMA also considers the opposite direction to reduce local minimum, which is ignored in almost conventional based partial search algorithms. CFBMA uses the summation half-stop technique to reduce the computational load. Experimental results show that the proposed algorithm achieves the high computational complexity compression effect and very close or better image quality compared with TSS, SES, NTSS based partial search algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권8호
• /
• pp.2913-2929
• /
• 2014

Traditional vector quantization (VQ) schemes encode image blocks as VQ indices, in which there is significant similarity between the image block and the codeword of the VQ index. Thus, the method can compress an image and maintain good image quality. This paper proposes a novel lossless VQ indices compression algorithm to further compress the VQ index table. Our scheme exploits the high correlation of adjacent image blocks to search for the same VQ index with the current encoding index from the neighboring indices. To increase compression efficiency, codewords in the codebook are sorted according to the degree of similarity of adjacent VQ indices to generate a state codebook to find the same index with the current encoding index. Note that the repetition indices both on the search path and in the state codebooks are excluded to increase the possibility for matching the current encoding index. Experimental results illustrated the superiority of our scheme over other compression schemes in the index domain.

• 복식문화연구
• /
• 제21권1호
• /
• pp.42-56
• /
• 2013

Nowadays the advantages of multichannel retailing strategy in fashion business have been widely discussed, but empirical research on fashion retail has been limited. The purpose of this research is to provide some ideas on multichannel retailing strategy to fashion retailers through the case of UNIQLO. The online survey was conducted on each 100 female customers in their 20s, 30s, 40s living in seoul among UNIQLO customers. The survey was consisted of measurement items for UNIQLO's online store image and offline store image, customer satisfaction, purchase intention, and demographic attributes. The online survey was found that 30.3% of UNIQLO's multichannel customers bought a product from offline store using online shopping mall as a search channel, on the other hand, 20.7% of UNIQLO's multichannel customers bought a product from online store using offline store as a search channel. Factors of the online shopping mall image were consisted of shopping convenience, product information, price policy, trust. And factors of the offline store image were consisted of trust and store, product information, service. Some factors of online store and offline store image had impact on multichannel customer satisfaction. And, customer satisfaction also had impact on purchase intention of UNIQLO product. Some suggestion for the future of multichannel research in fashion retailing was given.

• 대한전자공학회논문지SP
• /
• 제43권1호
• /
• pp.1-8
• /
• 2006

본 논문은 다중 참조영상(multiple reference image)에 적용 가능한 새로운 고속 전역탐색 움직임 추정 기법을 제안한다. 제안된 방법은 기존의 비트율을 고려한 연속제거알고리즘(rate constrained successive elimination algorithm: RSEA)을 다중 참조영상에 확대 적용하는 방법이다. 첫 번째 참조영상에 대한 움직임 추정의 계산량에 비해 그 이후 참조영상에 대한 움직임 추정의 계산량이 적어질 수 있음을 보일 것이다. 계산량 감축을 위해, 본 논문에서 최적 움직임 벡터의 후보 블록의 개수를 감소시킬 수 있는 새로운 조건을 소개한다. 실험 결과을 통해 제안된 방법이 기존의 RSEA과 동일한 움직임 추정오차를 가지면서도 계산량을 감소시킴을 보일 것이다.

• 정보처리학회논문지B
• /
• 제10B권6호
• /
• pp.681-686
• /
• 2003

대량의 일반 이미지 집합에서 사용자가 원하는 이미지를 효율적으로 찾아내는 것이 내용기반 이미지 검색 연구의 주된 목적이나 특정한 분야에 속하지 않은 일반 이미지를 대상으로 하는 연구는 아직까지 만족스럽지 못한 실정이다. 이 논문에서는 이미지의 색상과 형태의 특징 정보들을 추출하여 자동으로 색인하고 검색하는 시스템을 제안하였다. 특징 추출은 인간의 이미지 인식 과정에 기반하여 전체적인 정보와 세부적인 정보로 구분하여 수행하였다. 추출된 특징 정보들은 전역 칼라, 부분 영역 칼라, 전역 형태, 부분 영역 형태 정보로 구분하였다. 실험 결과 제안한 방법은 기존의 방법과 비슷한 시간 내에 비교적 높은 Precision과 Retail로 이미지를 검색함을 알 수 있었다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2005년도 추계종합학술대회
• /
• pp.959-962
• /
• 2005

Efficient video data storage and search techniques are essential for DVR-based security systems. We have designed appropriate data structures and search techniques for efficient image storage and search, in this study. The date and time can be saved and searched as a folder form. The overall system is designed for MPEG4 CODEC. It can handle variable sizes of frames (100bytes $^{\sim}$ 6Kbytes) produced by MPEG4 CODEC without errors. We also have developed image transmission techniques through inter-net networking.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.859-863
• /
• 1993

There are two methods to get 3-dimensional information by matching image pair feature-based matching and area-based matching. One of the problems in the area-based matching is how the optimal search region which gives accurate correlation between given point and its neighbors can be selected. In this paper, we proposed a new area-based matching algorithm which uses edge-features used in the conventional feature-based matching. It first selects matching candidates by feature-based and matches image pair with area-based method by taking these candidates as guidance to decision of search area. The results show that running time is reduced by optimizing search area(considering edge points and continuity of disparity), keeping on the precision as the conventional area-based matching method.

• 전자공학회논문지A
• /
• 제33A권12호
• /
• pp.110-119
• /
• 1996

A novel high speed VLSI architecture and its VLSI realization methodologies for a motion estimation processor based on full search block matching algorithm are presentd. The presented architecture is designed in order to be suitable for highly parallel and pipelined processing with identical PE's and adjustable in performance and hardware amount according to various application areas. Also, the throughput is maximized by enhancing PE utilization up to 100% and the chip pin count is reduced by reusing image data with embedded image memories. Also, the uniform and identical data processing structure of PE's eases VLSI implementation and the clock rate of external I/O data can be made slower compared to internal clock rate to resolve I/O bottleneck problem. The logic and spice simulation results of the proposed architecture are presented. The performances of the proposed architecture are evaluated and compared with other architectures. Finally, the chip layout is shown.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.311-311
• /
• 2000

We propose a DP-based formulation for matching line patterns by defining a robust and stable geometric representation that is based on the conceptual organizations. Usually, the endpoint proximity and collinearity of image lines, as two main conceptual organization groups, are useful cues to match the model shape in the scene. As the endpoint proximity, we detect junctions from image lines. We then search for junction groups by using geometric constraint between the junctions. A junction chain similar to the model chain is searched in the scene, based on a local comparison. A Dynamic Programming-based search algorithm reduces the time complexity for the search of the model chain in the scene. Our system can find a reasonable matching, although there exist severely distorted objects in the scene. We demonstrate the feasibility of the DP-based matching method using both synthetic and real images.