• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.2 s.308
• /
• pp.1-11
• /
• 2006

In this paper, we propose the novel video retrieval algorithm using non-parametric based motion classification in the shot-based video indexing structure. The proposed system firstly gets the key frame and motion information from each shot segmented by scene change detection method, and then extracts visual features and non-parametric based motion information from them. Finally, we construct real-time retrieval system supporting similarity comparison of these spatio-temporal features. After the normalized motion vector fields is created from MPEG compressed stream, the extraction of non-parametric based motion feature is effectively achieved by discretizing each normalized motion vectors into various angle bins, and considering a mean, a variance, and a direction of these bins. We use the edge-based spatial descriptor to extract the visual feature in key frames. Experimental evidence shows that our algorithm outperforms other video retrieval methods for image indexing and retrieval. To index the feature vectors, we use R*-tree structures.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.7A
• /
• pp.1044-1049
• /
• 2000

Projection that can be used as a feature for image representation, includes much available informations such as approximated shape and location. But when we retrieve image using it, there are some disadvantage such as requiring much index data and making different length of projected vector for differenr image size. In order to overcome these problems, we propose a method of using block variance for the projected vector. We use block variance of the projection vector to localize the characteristics of image and to reduce the number of index data in database. Proposed algorithm can make use of statistical advantage through database including various size of images and be executed with fast response time in implementation.

• The Journal of the Korea Contents Association
• /
• v.9 no.9
• /
• pp.68-79
• /
• 2009

A variance map can be used to detect and distinguish texts from background in images. However, previous variance maps work at one level and they suffer a limitation in dealing with varieties in text size, slant, orientation, translation, and color. We present a method for robustly segmenting text regions in complex color Web images using two-level variance maps. The two-level variance maps work hierarchically. The first level finds the approximate locations of text regions using global horizontal and vertical color variances with the specific mask sizes. The second level then segments each text region using intensity variance with a local mask size, which is determined adaptively. By the second process, backgrounds tend to disappear in each region and segmentation can be accurate. Highly promising experimental results have established the effectiveness of our approach.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4B
• /
• pp.333-343
• /
• 2006

MANET and P2P applications have a common nature that they don't have any fixed infrastructures that might maintain network topologies. With such common characteristics, a P2P application can be a killer application over MANET. Due to absence of reliable node which serves indexing services in MANET, fully distributed P2P applications are more suitable for MANET. By using DHT like Chord, we can save network bandwidth and avoid a point of failure of a directory server. However, since MANET allows nodes to depart from network freely, P2P file sharing applications using Chord lookup protocol should address how to recover the keys stored at the departed node. In this paper, we propose BU-Chord in order to detect and recover the departure of nodes by creating and storing backup file information in distributed manner. Our BU-Chord shows off better performance than existing Chord especially in case of high departure rate of nodes.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04c
• /
• pp.295-297
• /
• 2003

본 논문에서는 각 프레임으로부터 추출된 통계적 특성을 이용하여 동영상의 분할방법과 분할된 각 장면에 대한 대표프레임을 추출하는 방법을 제안한다. 제안된 방법은 동영상의 각 프레임에 대하여 다해상도 분석을 실시하여 저주파 부 밴드로부터 히스토그램 특징을 추출하여 급격한 장면전환을 분할하는데 이용하였으며 또한 점진적인 장면전환을 검출하기 위해서는 고주파 부 밴드로부터 계산되는 화소의 분산치를 계산하여 특징벡터로 사용하였다. 실험의 결과를 통하여 제안된 동영상의 분할방법과 대표프레임 추출에 대한 알고리즘들이 동영상 자료의 분석 및 색인을 위한 효율적인 동영상 분할을 가능하게 하며, 차후 내용기반 영상과 비디오의 색인 및 검색을 위한 전처리의 단계로 사용되어질 수 있는 매우 유용한 방법임을 보였다.

• Journal of Gifted/Talented Education
• /
• v.21 no.1
• /
• pp.39-56
• /
• 2011

The purpose of this study was to analyze the characteristics of science gifted students who participated in science gifted activity using rainbow. For this purpose, the science gifted activity using rainbow was developed and applied to 23 seventh grade science gifted students. The results indicated that gifted students had various concepts and ideas of optics. For example, some gifted students thought that there was rainbowshaped light at the place of rainbow, and another considered the process of dispersion of light in a waterdrop would be same as the process of the dispersion in the prism. Also, various rainbow theories and scientific imagination of gifted students were found. For devising new rainbow, gifted students used two strategies, 'changing the features' and 'changing conditions'. In addition, we discussed effective methods of applying this activity and implications to science gifted education.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2004.03a
• /
• pp.3-6
• /
• 2004

위치 기반 서비스에서 이동체 정보의 저장 및 관리는 이동체 데이터베이스에 의해 수행되며, 이동체 정보의 표현을 위한 데이터 모델과 별도의 자료 구조를 포함하고 있다. 그러나, 기존 이동체 데이터베이스에 대한 대부분의 연구는 이동체 정보의 관리에 초점을 맞추고 있어 실제 응용에 있어서 대용량 정보의 처리가 불가능하며, 기존의 이동체 색인 구조는 특정분야에 특화되어 위치기반 서비스의 다양한 응용에 적용하기 힘든 문제점이 있다. 본 논문에서는 효율적인 이동체 질의 처리를 위해 네트워크 상의 여러 저장소존 연결하고 각각의 프로세스들을 다양한 질의 특성에 맞게 구성하는 디스크 클러스터 기반 저장 관리자에서의 질의 처리 구조를 제안한다. 이는 네트워크 기반의 디스크를 구축하고 공간 영역별 그룹 분할, 현재 위치 정보의 분할 저장 및 과거 위치 정보의 중복 저장을 통해 고성능 대용량 처리를 가능하게 하며, 다양한 색인을 지원하여 작업 분산 및 다양한 응용에 적용이 가능한 특징을 갖는다.

• The Journal of the Convergence on Culture Technology
• /
• v.10 no.5
• /
• pp.397-406
• /
• 2024

Today, in the field of contemporary fashion design, AI is being actively utilized as a new design tool, leading to a new paradigm of collaboration between designers and AI. This study is about a method for developing integrated fashion design through collaboration between human designers and AI. The purpose of this study is to analyze the visual and formative characteristics and changes of fashion design images generated using the AI generation program Midjourney, thereby expanding the understanding and utilization methods of AI image generation programs in fashion design development. The results of this study are as follows. First, Midjourney has the characteristic of relying more on the characteristics of the existing image used rather than the command when creating the image. It also creates new images by distributing and applying the design through an eclectic interaction between the costume and the image background. By excluding the names of fashion items from the commands, you can generate images that can give you more diverse ideas. Second, Midjourney initially expressed clothing colors using colors used in fashion schematics in color creation, and gradually expanded to various color series. Third, there is a kind of compromise between color and design when Midjourney creates an image, and accordingly, by specifying and limiting the image background and clothing colors, more diverse and advanced fashion design images can be created.

• Journal of the Society of Cosmetic Scientists of Korea
• /
• v.47 no.1
• /
• pp.41-48
• /
• 2021

Formulations which are dispersed in water are often used in color cosmetics because they are characterized by no powder flying, not sticky, and high adherence while giving a light feeling of use. However, little research has been considered on the effect of the pigment on the above formulations used in color cosmetics. In this study, experiments were conducted to measure and analyze the effect of pigments on the formulation of pigments, organic pigments, and pearl polish, which are mainly used in the manufacture of color cosmetics, on appearance changes, pH changes, and photometric stability. Carmine or ferric ferrocyanide coated titanium dioxide mica-based pigments were not suitable for use due to poor photostability, with colors appearing on the surface from low viscosity formulations. Organic pigments had a good photostability of 1% of the formulation which are dispersed in water, but were not suitable for use because they came out of color on the water surface and did not spread well due to the clumping of powders. The titanium dioxide mica system pigments coated with pearl polish, inorganic pigments, and iron oxide were suitable for use due to their excellent appearance and optical stability in the formulation. Furthermore, the pH of all samples distributed by each pigment seems to be within the range of 3.0 to 9.0, which is suitable for cosmetic applications. This is expected to help manufacture color cosmetics with a stable water dispersible formulations by selecting and using stable pigments in anticipation of the behavior of pigments in the formulations.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2294-2304
• /
• 1999

Our research purpose in this paper is to improve the performance of query processing in GIS(Geographic Information System) by enhancing the I/O performance exploiting parallel I/O and efficient disk access. By packing adjacent spatial data, which are very likely to be referenced concurrently, into one block or continuous disk blocks, the number of disk accesses and the disk access overhead for query processing can be decreased, and this eventually leads to the I/O time decrease. So, in this paper, we proposes EPR(Enhanced Parallel R-tree) indexing method which integrates the parallel I/O method of the previous Parallel R-tree method and a packing-based clustering method. The major characteristics of EPR method are as follows. First, EPR method arranges spatial data in the increasing order of proximity by using Hilbert space filling curve, and builds a packed R-tree by bottom-up manner. Second, with packing-based clustering in which arranged spatial data are clustered into continuous disk blocks, EPR method generates spatial data clusters. Third, EPR method distributes EPR index nodes and spatial data clusters on multiple disks through round-robin striping. Experimental results show that EPR method achieves up to 30% or more gains over PR method in query processing speed. In particular, the larger the size of disk blocks is and the smaller the size of spatial data objects is, the better the performance of query processing by EPR method is.