• Journal of the Korean Society of Costume
• /
• v.66 no.8
• /
• pp.98-108
• /
• 2016

Knitwear has been used as an active and functional clothing item due to its flexible and soft nature. Diverse design expressions have made knitwear into an essential fashion item for people today, who are constantly seeking for ways to display their individualism. The purpose of this study is to analyze the actual wearing conditions, and the preferred designs of knitwear for female college students in order to provide a baseline data, which can be used to develop knitwear designs for the subjects of the study. Survey by questionnaire of 135 female college students in 3 universities in Seoul were analysed. The results of the study are as follows: First, the most owned knitwear were sweaters and cardigans. Knitwear was viewed as soft and warm, as well as versatile. It was not restricted to certain sizes, and was comfortable to wear for different activities. Seound, the most preferred items were sweaters and cardigans. The most preferred styles were round neckline sweaters and open V-neckline cardigans. Third, the most preferred designs were plain designs with achromatic colors and wool-blended fabrics. The most preferred images were simple images. The most preferred fit was loose enough for little bit of room inside. Fourth, appropriateness and design of the knitwear were assessed during the purchasing stage. the most preferred method of purchase was purchasing via online stores after researching the knitwear through various channels, such as store visits and the Internet. The preferred price of knitwear was below 100,000 KRW. Fifth, the most common complaints were as follows: changes in the shape and quality of the knitwear after a wash, appearance of nap, and loose threads. In short, it is necessary for female college students to develop high quality knitwear with designs that can display individuality, while being simple.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.10-18
• /
• 2004

Quadtree, which is a hierarchical data structure, is a very important data structure to represent binary images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related with quadtrees. The operations of unaligned linear quadtrees, which are operations among the linear quadtrees with different origin, are able to perform the translated or rotated images efficiently. And this operations requires alignment of the linear quadtrees. In this paper, we present an efficient algorithm to perform alignment of unaligned linear quadtrees, using three-dimensional $n{\pm}n{\pm}n$ processors on RMESH(Reconfigurable MESH). This algorithm has constant-time complexity by using efficient basic operations to route the locational codes of quardtree on the hierarchical structure of $n{\pm}n{\pm}n$ RMESH.

• Journal of Broadcast Engineering
• /
• v.25 no.3
• /
• pp.399-404
• /
• 2020

The Disaster text service is a text-based service for public alert. But, foreigners who are not familiar with korean can not understand exactly the disaster text messages provided. Using multimedia information such as images is expected to solve this problem. However, the current disaster message service method is not suitable for multimedia information delivery. This study proposes a firmware-based disaster character service method for displaying disaster image in a terminal. A device using this method should store images corresponding to the type of disaster and use special characters to inform the presentation of image in a terminal. This approach can be implemented in the new firmware installed device and it can be work with the existing device.

• The Research Journal of the Costume Culture
• /
• v.25 no.5
• /
• pp.577-592
• /
• 2017

The purpose of this study was to propose various directions for effectively proposing window displays that satisfy changing consumer needs by investigating and analyzing the characteristics of unexpected expressions used in recent Christmas windows. Research was conducted by investigating unexpectedness in window displays through literature reviews and previous studies. To observe unexpectedness in Christmas windows, website-based case images of window displays from the six years between 2010 and 2015 were collected from the department stores of Bergdorf Goodman, Printemps, Selfridges, and Isetan. Unexpected expressions in department-store Christmas window displays could be categorized into four expressive methods of hybrid expressions, figurative expressions, amusing expressions, and exaggerative expressions. The results were as follows: First, hybrid expressions are interpreted by consumers as having new or diverse meanings that change the original external forms of subjects or objects. Second, Christmas colors are used in the window backgrounds' figurative expressions, but these windows do not use excessive expressions; furthermore, these windows personify people as animals and anthropomorphize animals as people, using subjects to depict other subjects to show unfamiliar images. Third, amusing expressions are used to decorate windows with unique and novel ideas that provide stimulation and amusement for customers and capture their attention through the composition of windows that entail childish props and elements that create funny. Fourth, exaggerative expressions deliberately stretch and expand subjects or objects in windows to elicit customers' curiosity and interest through emphasis.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.463-466
• /
• 2008

With the development of Information Technology in recent years, the image has been an important means to store or express information. Generally, during the process of acquiring and storing images, the images can be corrupted by noise of which typical types are Impulse(Impulse Noise) and AWGN(Addiction White Gaussian Noise). Impulse noise shows irregularly in black and white over the length and breadth of the image by sharp and sudden disturbance of the image signal. In the Impulse noise environment, SM(Standard Median) filter would be used because of its good noise removal performance and simple algorithm. However, when SM filter removes noise, it also produces error at the edge of image and causes whole image quality deterioration. In this paper, we propose a method based on modified nonlinear filter operation scheme which enhances the features of noise removal and detail image preservation when restoring image in Impulse noise environment. And, we compared it with existing methods and the performances through simulation.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.1
• /
• pp.54-63
• /
• 2011

This paper proposes a fast learning-based interpolation algorithm to up-scale an input low-resolution image into a high-resolution image. In conventional learning-based super-resolution, a certain relationship between low-resolution and high-resolution images is learned from various training images and a specific high frequency synthesis information is derived. And then, an arbitrary low resolution image can be super-resolved using the high frequency synthesis information. However, such super-resolution algorithms require heavy memory space to store huge synthesis information as well as significant computation due to two-dimensional matching process. In order to mitigate this problem, this paper presents one-dimensional patch-based learning and synthesis. So, we can noticeably reduce memory cost and computational complexity. Simulation results show that the proposed algorithm provides higher PSNR and SSIM of about 0.7dB and 0.01 on average, respectively than conventional bicubic interpolation algorithm.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.4
• /
• pp.116-123
• /
• 2009

Feature point matching, which is finding the corresponding points from two images with different viewpoint, has been used in various vision-based applications and the demand for the real-time operation of the matching is increasing these days. This paper presents a real-time feature point matching method by using a local descriptor derived by Zernike moments. From an input image, we find a set of feature points by using an existing fast corner detection algorithm and compute a local descriptor derived by Zernike moments at each feature point. The local descriptor based on Zernike moments represents the properties of the image patch around the feature points efficiently and is robust to rotation and illumination changes. In order to speed up the computation of Zernike moments, we compute the Zernike basis functions with fixed size in advance and store them in lookup tables. The initial matching results are acquired by an Approximate Nearest Neighbor (ANN) method and false matchings are eliminated by a RANSAC algorithm. In the experiments we confirmed that the proposed method matches the feature points in images with various transformations in real-time and outperforms existing methods.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.12
• /
• pp.2270-2277
• /
• 2016

In modern society, creation and distribution of multimedia contents is being actively conducted. These multimedia information have come out the enormous amount daily, the amount of data is also large enough it can't be compared with past text information. Since it has been increased for a need of the method to efficiently store multimedia information and to easily search the information, various methods associated therewith have been actively studied. In particular, image search methods for finding what you want from the video database or multiple sequential images, have attracted attention as a new field of image processing. Image retrieval method to be implemented in this paper, utilizes the attribute of corner patches based on the corner points of the object, for providing a new method of efficient and robust image search. After detecting the edge of the object within the image, the straight lines using a Hough transformation is extracted. A corner patches is formed by defining the extracted intersection of the straight line as a corner point. After configuring the feature vectors with patches rearranged, the similarity between images in the database is measured. Finally, for an accurate comparison between the proposed algorithm and existing algorithms, the recall precision rate, which has been widely used in content-based image retrieval was used to measure the performance evaluation. For the image used in the experiment, it was confirmed that the image is detected more accurately in the proposed method than the conventional image retrieval methods.

• The KIPS Transactions:PartA
• /
• v.14A no.3 s.107
• /
• pp.151-158
• /
• 2007

Quadtree, which is a hierarchical data structure, is a very important data structure to represent images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related with quadtrees. The computation of block location is one of important geometry operations in image processing, which extracts a component completely including a given block. In this paper, we present a constant time algorithm to compute the block location of images represented by quadtrees, using three-dimensional $n\times n\times n$ processors on RMESH(Reconfigurable MESH). This algorithm has constant-time complexity by using efficient basic operations to deal with the locational codes of quardtree on the hierarchical structure of $n\times n\times n$ RMESH.

• The KIPS Transactions:PartA
• /
• v.10A no.3
• /
• pp.207-214
• /
• 2003

Quadtree, which is a hierarchical data structure, is a very important data structure to represent binary images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related with quadtrees. The linear translation is one of important operations in image processing, which moves the image by a given distance. In this paper, we present an algorithm to perform the linear translation of binary images represented by quadtrees, using three-dimensional $n{\times}n{\times}n$ processors on RMESH (Reconfigurable MESH). This algorithm has constant-time complexity by using efficient basic operations to route the locational codes of quardtree on the hierarchical structure of n${\times}$n${\times}$n RMESH.