• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.8
• /
• pp.731-737
• /
• 2014

This paper presents abnormal behavior detection in crowd within surveillance video. We have defined below two cases as a abnormal behavior; first as a sporadically spread phenomenon and second as a sudden running in same direction. In order to detect these two abnormal behaviors, we first extract the motion vector and propose a new descriptor which is combined MHOF(Multi-scale Histogram of Optical Flow) and DCHOF(Directional Change Histogram of Optical Flow). Also, binary classifier SVM(Support Vector Machine) is used for detection. The accuracy of the proposed algorithm is evaluated by both UMN and PETS 2009 dataset and comparisons with the state-of-the-art method validate the advantages of our algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5605-5623
• /
• 2016

We propose a face recognition method that utilizes the LCP face descriptor. The proposed method applies a LoG mask to extract a face contour response, and employs the LCP algorithm to produce a binary pattern representation that ensures high recognition performance even under the changes in illumination, noise, and aging. The proposed LCP algorithm produces excellent noise reduction and efficiency in removing unnecessary information from the face by extracting a face contour response using the LoG mask, whose behavior is similar to the human eye. Majority of reported algorithms search for face contour response information. On the other hand, our proposed LCP algorithm produces results expressing major facial information by applying the threshold to the search area with only 8 bits. However, the LCP algorithm produces results that express major facial information with only 8-bits by applying a threshold value to the search area. Therefore, compared to previous approaches, the LCP algorithm maintains a consistent accuracy under varying circumstances, and produces a high face recognition rate with a relatively small feature vector. The test results indicate that the LCP algorithm produces a higher facial recognition rate than the rate of human visual's recognition capability, and outperforms the existing methods.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.4
• /
• pp.309-316
• /
• 2001

MPEG-4 describes audiovisual scenes that are composed of several media objects, organized in a hierarchical fashion. And for end users, it brings higher levels of interaction with content, within the limits set by the author. These spatio-temporal arrangements of the objects in the scene are specified using a parametric methodology, BIFS(BInary Format for Scenes). This paper proposes MPEG-4 Contents Authoring System that provides visual configuration of an MPEG-4 scene and its event information. The developed MPEG-4 Contents Authoring System generates streaming MPEG-4 Contents, such as BIFS stream, OD(Object Descriptor) stream automatically.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.3-5
• /
• 2007

본 논문에서는 새로운 내용기반 이미지 검색 기법으로 식물 잎의 윤곽선에 대하여 동적 시간 정합 기법을 이용하여 유사한 이미지를 효과적으로 검색하는 방법을 제안한다. 이를 위하여 우선 식물 잎의 기준점에 대하여 잎의 가장자리를 따라 가면서 구해지는 거리의 곡선을 통하여 잎의 외형 특성을 표현하였다. 추출된 곡선 정보의 효율적인 저장과 처리를 위하여 곡선의 특성을 표현할 수 있는 퓨리에 계수(Fourier Coefficients)를 계산하고 이를 바탕으로 유사한 이미지를 계산하였다. 이런 과정에서 생기는 문제점으로는 복잡한 형태의 곡선에 대해서는 퓨리에 계수를 통하여 저장하고 복원하는 과정에서 원본 곡선의 세부적인 형태 정보를 상실하게 된다. 이러한 문제를 해결하기 위해서는 복잡한 곡선 유형에 대해서는 복원시 상실되는 정보가 최소화될 수 있는 작은 단위의 구간으로 나누고 이에 대한 퓨리에 계수를 계산하는 방법으로 다수의 퓨리에 계수 세트를 추출하는 이진 구간 분할 (Binary Range Reduction) 알고리즘을 사용하였고 질의 이미지와 저장된 이미지들을 비교하는 과정에서 검색의 정확도를 향상시키기 위하여 동적 시간 정합(Dynamic Time Warping) 알고리즘을 사용하였다. 그리고 검색의 효율을 더욱 높이기 위하여 추출된 외형 정보를 기반으로 잎의 유형을 다양한 카테고리로 분류하는 외형 기형 기반의 잎 분류 기법을 제안하였다. 다양한 실험을 통하여 제안한 기법이 식물 잎 검색에 우수한 성능을 나타냄을 보인다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.1
• /
• pp.9-20
• /
• 2005

Recently, the MPEG-7 standard a multimedia content description standard is wide]y used for content based image/video retrieval systems. However, since the descriptors standardized in MPEG-7 are usually multidimensional and the problem called 'Curse of dimensionality', previously proposed indexing methods(for example, multidimensional indexing methods, dimensionality reduction methods, filtering methods, and so on) could not be used to effectively index the multimedia database represented in MPEG-7. This paper proposes an efficient multimedia data indexing mechanism reflecting the characteristics of MPEG-7 visual descriptors. In the proposed indexing mechanism, the descriptor is transformed into a histogram of some attributes. By representing the value of each bin as a binary number, the histogram itself that is a visual descriptor for the object in multimedia database could be represented as a bit string. Bit strings for all objects in multimedia database are collected to form an index file, bitmap index, in the proposed indexing mechanism. By XORing them with the descriptors for query object, the candidate solutions for similarity search could be computed easily and they are checked again with query object to precisely compute the similarity with exact metric such as Ll-norm. These indexing and searching mechanisms are efficient because the filtering process is performed by simple bit-operation and it reduces the search space dramatically. Upon experimental results with more than 100,000 real images, the proposed indexing and searching mechanisms are about IS times faster than the sequential searching with more than 90% accuracy.

• Journal of Broadcast Engineering
• /
• v.19 no.3
• /
• pp.396-404
• /
• 2014

The field of searching clothing, which is very difficult due to the nature of the informal sector, has been in an effort to reduce the recognition error and computational complexity. However, there is no concrete examples of the whole progress of learning and recognizing for cloth, and the related technologies are still showing many limitations. In this paper, the whole process including identifying both the person and cloth in an image and analyzing both its color and texture pattern is specifically shown for classification. Especially, deformable search descriptor, LBPROT_35 is proposed for identifying the pattern of clothing. The proposed method is scale and rotation invariant, so we can obtain even higher detection rate even though the scale and angle of the image changes. In addition, the color classifier with the color space quantization is proposed not to loose color similarity. In simulation, we build database by training a total of 810 images from the clothing images on the internet, and test some of them. As a result, the proposed method shows a good performance as it has 94.4% matching rate while the former Dense-SIFT method has 63.9%.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.6
• /
• pp.728-735
• /
• 2017

With the proliferation of digital devices, the devices have generated considerable additive white Gaussian noise while acquiring digital images. The most well-known denoising methods focused on eliminating the noise, so detailed components that include image information were removed proportionally while eliminating the image noise. The proposed algorithm provides a method that preserves the details and effectively removes the noise. In this proposed method, the goal is to separate meaningful detail information in image noise environment using the edge strength and edge connectivity. Consequently, even as the noise level increases, it shows denoising results better than the other benchmark methods because proposed method extracts the connected detail component information. In addition, the proposed method effectively eliminated the noise for various noise levels; compared to the benchmark algorithms, the proposed algorithm shows a highly structural similarity index(SSIM) value and peak signal-to-noise ratio(PSNR) value, respectively. As shown the result of high SSIMs, it was confirmed that the SSIMs of the denoising results includes a human visual system(HVS).

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.1
• /
• pp.1-14
• /
• 2010

With the rapid growth of 3D content industry fields, 3D content-based hashing (or hash function) has been required to apply to authentication, trust and retrieval of 3D content. A content hash can be a random variable for compact representation of content. But 3D content-based hashing has been not researched yet, compared with 2D content-based hashing such as image and video. This paper develops a robust 3D content-based hashing based on key-dependent 3D surface feature. The proposed hashing uses the block surface coefficient using shape coordinate of 3D SSD and curvedness for 3D surface feature and generates a binary hash by a permutation key and a random key. Experimental results verified that the proposed hashing has the robustness against geometry and topology attacks and has the uniqueness of hash in each model and key.

• The Journal of the Acoustical Society of Korea
• /
• v.24 no.4
• /
• pp.186-193
• /
• 2005

The Terrestrial Digital Multimedia Broadcasting (T-DMB) system supplies high quality audio comparable with VCD in 7 inch display and high quality audio comparable CD at the mobile reception environment T-DMB will launch commercial service at the middle of 2005. However the bandwidth for audio data and the number of channels are restricted to 128 kbps and 2 respectively in the current T-DMB standard because of the limitation of available bandwidth for multimedia data. This Paper Proposes a novel media processor structure for providing multi-channel audio contents oyer T-DMB system allowing backward compatibility with the legacy T-DMB receiver. Furthermore. we also Propose an adaptive receiver structure to supply optimal audio contents on various speaker configuration in T-DMB receiver. To provide multi-channel audio contents allowing backward comaptilbity with the legacy T-DMB receiver, the additional data for multi-channel audio are defined as a dependent stream of main audio stream. The OD strucure for control an additional multi-channel audio elementary stream is proposed without changing the BIFS of the legacy T-DMB system.

• Journal of Broadcast Engineering
• /
• v.11 no.3 s.32
• /
• pp.263-275
• /
• 2006

This paper introduces an interactive contents authoring system which can easily and conveniently produce interactive contents for the Terrestrial Digital Multimedia Broadcasting (T-DMB). For interactive broadcasting service, T-DMB adopted MPEG-4 BIFS technology. In order to the interactive service becomes flourishing on the market, various types of interactive contents should be well provided prior to the service. In MPEG-4 BIFS, broadcasting contents are described by the combination of a large number of nodes, routes and descriptors. In order to provide interactive data services through the T-DMB network, it is essential to have an interactive contents authoring system which allows contents authors to compose interactive contents easily and conveniently even if they lack any background on MPEG-4 BIFS technology. The introduced authoring system provides powerful graphical user Interface and produces interactive broadcasting contents in the forms of binary and textual format. Therefore, the BIFS contents authoring system presented in this paper would vastly contribute to the flourishing interactive service.