• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.31 no.6
• /
• pp.408-411
• /
• 2018

We fabricated highly flexible Mn-doped $SnO_2$ (MTO)/Ag/MTO/polydimethylsiloxane (PDMS)/MTO multilayer transparent conducting films. To reduce refractive-index mismatching of the MTO/Ag/MTO/polyethylene terephthalate (PET), index-matching layers were inserted between the oxide-metal-oxide-structured films and the PET substrate. The PDMS layer was deposited by spin-coating after adjusting the mixing ratio of PDMS and hexane. We investigated the effects of the index-matching layer on the color and reflectance differences with different PDMS dilution ratios. As the dilution ratio increased from 1:100 to 1:130, the color difference increased slightly, while the reflectance difference decreased from 0.62 to 0.32. The MTO/Ag/MTO/PDMS/MTO film showed a transmittance of 87.18~87.68% at 550 nm. The highest value of the Haacke figure of merit was $47.54{\times}10^{-3}{\Omega}^{-1}$ for the dilution ratio of 1:130.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.193-196
• /
• 2010

In this paper, we propose a method to classify the types of vehicle as full, medium, or small size. The proposed method is composed of three steps. First, after obtaining vehicle contour from template candidate image, edge distance template is created by distance transform of the vehicle's contour. Second, the vehicle type of input image is classified as the type of template which has minimal edge distance with input image. The edge distance value means the measurement of distance between input image and template at each pixel which is part of vehicle contour. Experimental results demonstrate that our method presented a good performance of 80% about test images.

• The KIPS Transactions:PartC
• /
• v.16C no.4
• /
• pp.449-460
• /
• 2009

The signature hashing algorithm[9] provides the fast pattern matching speed for network IPS(Intrusion Prevention System) using the hash table. It selects 2 bytes from all signature rules and links to the hash table by the hash value. It has an advantage of performance improvement because it reduces the number of inspecting rules in the pattern matching. However it has a disadvantage of performance drop if the number of rules with the same hash value increases when the number of rules are large and the corelation among rules is strong. In this paper, we propose a method to make all rules distributed evenly to the hash table independent of the number of rules and corelation among rules for overcoming the disadvantage of the signature hashing algorithm. In the proposed method, it checks whether or not there is an already assigned rule linked to the same hash value before a new rule is linked to a hash value in the hash table. If there is no assigned rule, the new rule is linked to the hash value. Otherwise, the proposed method recalculate a hash value to put it in other position. We implemented the proposed method in a PC with a Linux module and performed experiments using Iperf as a network performance measurement tool. The signature hashing method shows performance drop if the number of rules with the same hash value increases when the number of rules are large and the corelation among rules is strong, but the proposed method shows no performance drop independent of the number of rules and corelation among rules.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.6
• /
• pp.33-41
• /
• 2004

This paper proposes a color matching 3D look-up table simplifying the complex color matching procedure between a monitor and a mobile display device. In other to perform color matching, it is necessary to process color of image in the device independent color space like CIEXYZ or CIELAB. To obtain the data of the device independent color space from that of the device dependent RGB color space, we must perform display characterizations. LCD characterization error using S-curve model is larger than tolerance error since LCD is more nonlinear than CRT. This paper improves the S-curve model to have smaller characterization error than tolerance error using the electro-optical transfer functions of X, Y, and Z value. We obtained images having higher color fidelity on mobile display devices through color matching experiments between monitor and mobile display devices. As a result of this experiments, we concluded that the color matching look-up table with 64(4${\times}$4${\times}$4) is the smallest size allowing characterization error to be acceptable.

• The Journal of the Korea Contents Association
• /
• v.3 no.2
• /
• pp.11-18
• /
• 2003

In this paper, we propose a fast variable block matching algorithm for motion estimation based on bit-patterns. Motion estimation in the proposed algorithm is peformed after the representation of image sequence is transformed 8-bit pixel values into 1-bit ones by the mean pixel value of search block, which brings a short searching time by reducing the computational complexity. Moreover, adaptive searching methods according to the motion information of the block make the procedure of motion estimation efficient by eliminating unnecessary searching processes of low motion block and deepening a searching procedure in high motion block. Experimental results show that the proposed algorithm provides bettor performance - average 0.5dB PSNR improvement and about 99% savings in the number of operations - than full search Hock matching algorithm with a fixed block size.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.38 no.1
• /
• pp.15-27
• /
• 2013

Because consumers tend to have negative opinion about a company that neglects social issues like poverty or pollution while it focuses on its own profit, a lot of companies have invested their resources in Corporate Social Responsibility(CSR). CSR has merits of image improving and profit gaining, on the other hand, it has also many shortcomings. First, the cost of CSR may become a heavy financial burden. Specifically, CSR tends to be implemented by a company's unilateral backup, and then this may impose a heavy burden on the company. Second, one cannot expect effects of CSR in a short-term. Because of these shortcomings, the unilateral CSR has gone into alteration of the type of CSR since 1980's. Instead of unilaterality, Cause-Related Marketing(CRM) began to be used for mutual profits among company, consumers, and society. That is, CRM has become to be spotlighted as a new type of CSR. It focuses on partnership between a company and consumers based on cause and mutual profit pursuing through this partnership. So, many contemporary companies prefer CRM activities that derive their positive corporate image, that increase their sales, and that reduce their financial cost. The IBM Matching Grants Program, which is the largest of the IBM-Employee partnership programs, is a typical CRM. This program enables employees and retirees to increase the value of their donations to educational institutions, hospitals, hospices, nursing homes, and cultural & environmental organizations with a matching gift from IBM. Hundreds of educational institutions and thousands of nonprofit organizations have benefited from the contributions by IBM. There might be various types of matching grants. For example, an employee might choose a lump-sum expense or partitioning a lump-sum into a series of small ongoing expenses for his (or her) donation, and a firm might match the employee's total contribution with a lump-sum expense or might match the employee's total contribution with a series of small ongoing expenses. However, it is not easy to find an academic research on which type of matching grant is preferred by employees. This paper shows that an employee prefers the type of matching grants that consists of a lump-sum expense for his (or her) contribution and a series of small ongoing expenses for a firm's contribution [or the type of matching grants that consists of a series of small ongoing expenses for an employee's contribution and a lump-sum expense for a firm's contribution] to the other types of matching grants.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.8 no.6
• /
• pp.85-90
• /
• 1998

The most important step image processing is stereo matching process. That is finding pixels of 3 dimensional pair in the left and right image. There are two matching methods. One is an area based approach and the other is a feature based approach. An area based approach needs much calculation time. In the other hand, we have the advantage of calculation time in the feature based approach, but can not obtain matched data for all pixels in the image. In recent years, fuzzy image processing methods are developed to manage vagueness and noise in image and ambiguous, inconsistent knowledge in recognition step. In this paper, we propose a fuzzy stereo matching algorithm. This method converts brightness data of image to fuzzy membership value and processes an area based approach method for stereo matching algorithm. We experiment with some stereo images to validate effectiveness of this algorithm.

• Journal of Korea Multimedia Society
• /
• v.6 no.7
• /
• pp.1178-1188
• /
• 2003

In this paper, we describe image mosaicing techniques for constructing a large high-resolution image with images taken by a video camera in hand. we propose the method which is automatically retrieving the exact matching area using color information and shape information. The proposed method extracts first candidate areas which have similar form using a Voronoi Distance Matching Method which is rapidly estimating the correspondent points between adjacent images, and calculating initial transformations of them and finds the final matching area using color information. It is a method that creates Voronoi Surface which set the distance value among feature points and other points on the basis of each feature point of a image, and extracts the correspondent points which minimize Voronoi Distance in matching area between an input image and a basic image using the binary search method. Using the Levenberg-Marquadt method we turn an initial transformation matrix to an optimal transformation matrix, and using this matrix combine a basic image with a input image.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3C
• /
• pp.279-287
• /
• 2009

In this paper, a hierarchical stereo matching with color information is proposed. To generate an initial disparity map, feature based stereo matching is carried out and to generate a final disparity map, hierarchical stereo matching is carried out. The boundary (edge) region is obtained by segmenting a given image into R, G, B and White components. From the obtained boundary, disparity is extracted. The initial disparity map is generated when the extracted disparity is spread to the surrounding regions by evaluating autocorrelation from each color region. The initial disparity map is used as an initial value for generating the final disparity map. The final disparity map is generated from each color region by changing the size of a block and the search range. 4 test images that are provided by Middlebury stereo vision are used to evaluate the performance of the proposed algorithm objectively. The experiment results show better performance compared to the Graph-cuts and Dynamic Programming methods. In the final disparity map, about 11% of the disparities for the entire image were inaccurate. It was verified that the boundary for the non-contiguous point was clear in the disparity map.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.18 no.3
• /
• pp.315-322
• /
• 2000

DSM(Digital Surface Model) is a digital model which represents the surface elevation of a region. DSM is necessary for orthoimage generation, and frequently used in man-made object extraction from aerial photographs nowadays. Image matching technique enables automatic DSM generation. This proposed a image matching method which can be applied to automatic generation of DSM for Built-up Area. The matching method proposed is to find conjugate points and conjugate lines from overlapping aerial images. In detecting conjugate points, the positional relation between possible conjugate point pair as well as correlation of pixel gray value is compared. In detecting conjugate lines, the color attribute of flank region of line, shape of line, positional relation between neighborhood points and lines, and the connection relation between lines are compared. The proposed matching method is assumed to be useful for DSM generation including Built-up Area.