• Parasites, Hosts and Diseases
• /
• v.44 no.4 s.140
• /
• pp.331-341
• /
• 2006

Actin binding proteins play key roles in cell structure and movement particularly as regulators of the assembly, stability and localization of actin filaments in the cytoplasm. In the present study, a cDNA clone encoding an actin bundling protein named as AhABP was isolated from Acanthamoeba healyi, a causative agent of granulomatous amebic encephalitis. This clone exhibited high similarity with genes of Physarum polycephalum and Dictyostelium discoideum, which encode actin bundling proteins. Domain search analysis revealed the presence of essential conserved regions, i.e., an active actin binding site and 2 putative calcium binding EF-hands. Transfected amoeba cells demonstrated that AhABP is primarily localized in phagocytic cups, peripheral edges, pseudopods, and in cortical cytoplasm where actins are most abundant. Moreover, AhABP after the deletion of essential regions formed ellipsoidal inclusions within transfected cells. High-speed co-sedimentation assays revealed that AhABP directly interacted with actin in the presence of up to $10{\mu}M$ of calcium. Under the electron microscope, thick parallel bundles were formed by full length AhABP, in contrast to the thin actin bundles formed by constructs with deletion sites. In the light of these results, we conclude that AhABP is a novel actin bundling protein that is importantly associated with actin filaments in the cytoplasm.

• Journal of Korea Multimedia Society
• /
• v.10 no.1
• /
• pp.128-138
• /
• 2007

With the development of broadcasting technology from analogue to interactive digital, the number of TV channels and contents provided to audience is increasing in a rapid speed. In this multi-media and multi-channel world, it is difficult to adapt to the increase of TV channel numbers and their contents merely using remote controller to search channels. Due to this reason, EPG (Electronic Program Guide) has been one of the essential services providing convenience to audience. So EPG complying with European DVB-MHP specifications, which will be also our domestic standard, is proposed in this paper. In order to provide audiences with DiTV contents they preferred, we apply collaborative filtering algorithm to recommend contents according to preference value of audience group with similar preference. And we use JavaXlet application which is based on MHP to implement this EPG, while the result can be verified by OpenMHP emulator.

• Journal of Fashion Business
• /
• v.3 no.1
• /
• pp.81-92
• /
• 1999

The purpose of this thesis is to analyze the present conditions and problems of the Electronic Commerce, specially by the fashion companies that utilize the Internet and to propose using plans of Internet Electronic Commerce as a strategic method of fashion companies that have a information-oriented mind to adapt itself to modern century. On the basis of my analysis, I propose some using plans of Internet Electronic Commerce by the fashion companies as follows. As a means of construction method, it is need for the pertinent companies to have an information-oriented mind and then to construct the low-expense but high-speed communication Infrastructure. As an operation and management method, positive web site advertisements plans, such as promotion, using various mass media, subscribing to the Internet search engines and dissemination of products information, etc., are need for companies to attract the consumers to connect to the web site. Second, to offer more satisfactory experiences, it is need for companies to frame the integrated shopping mall as a strategic alliance in the management of shopping mall. To frame the integrated shopping mall is also effective in solving financial problems of shopping mall management and introducing of security system As a means of technology supplement, security management systems, such as SSL or SET, should be introduced for consumers to pay the price and furnish their personal informations. Second, new technology developments, such as the newest simulation programs using Virtual Reality to solve the problem of products' actual feeling, should be need for consumers to feel as they really put clothes on. If these technological developments are realized, fashionable products will be dealt in the Internet shopping mall as well and the marketability of Internet shopping mall will be expanded.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.10
• /
• pp.3490-3507
• /
• 2014

License plate detection (LPD) is one of the most important aspects of an automatic license plate recognition system. Although there have been some successful license plate recognition (LPR) methods in past decades, it is still a challenging problem because of the diversity of plate formats and outdoor illumination conditions in image acquisition. Because the accurate detection of license plates under different conditions directly affects overall recognition system accuracy, different methods have been developed for LPD systems. In this paper, we propose a license plate detection method that is rapid and robust against variation, especially variations in illumination conditions. Taking the aspects of accuracy and speed into consideration, the proposed system consists of two stages. For each stage, Haar-like features are used to compute and select features from license plate images and a cascade classifier based on the concatenation of classifiers where each classifier is trained by an AdaBoost algorithm is used to classify parts of an image within a search window as either license plate or non-license plate. And it is followed by connected component analysis (CCA) for eliminating false positives. The two stages use different image preprocessing blocks: image preprocessing without adaptive thresholding for the first stage and image preprocessing with adaptive thresholding for the second stage. The method is faster and more accurate than most existing methods used in LPD. Experimental results demonstrate that the LPD rate is 98.38% and the average computational time is 54.64 ms.

• Journal of Broadcast Engineering
• /
• v.3 no.1
• /
• pp.85-92
• /
• 1998

The block matching algorithm is the most popular motion estimation method in image sequence coding. In this paper, we propose a VLSI architecture. for implementing a recently proposed fast bolck matching algorith, which uses spatial correlation of motion vectors and hierarchical searching scheme. The proposed architecture consists of a basic searching unit based on a systolic array and two shift register arrays. And it covers a search range of -32~ +31. By using the basic searching unit repeatedly, it reduces the number of gatyes for implementation. For basic searching unit implementation, a proper systolic array can be selected among various conventional ones by trading-off between speed and hardware cost. In this paper, a structure is selected as the basic searching unit so that the hardware cost can be minimized. The proposed overall architecture is fast enough for low bit-rate applications (frame size of $352{\times}288$, 3Oframes/sec) and can be implemented by less than 20,000 gates. Moreover, by simply modifying the basic searching unit, the architecture can be used for the higher bit-rate application of the frame size of $720{\times}480$ and 30 frames/sec.

• The Journal of the Korea Contents Association
• /
• v.17 no.11
• /
• pp.60-69
• /
• 2017

Recently, with the rapid development of internet and smart phones, social network services that can create and share various information through relationships among users have been actively used. Especially as the amount of information becomes enormous and unreliable information increases, expert recommendation that can offer necessary information to users have been studied. In this paper, we propose an expert recommendation scheme considering users' interests, human relations, and response quality. The users' interests are evaluated by analyzing their past activities in social network. The human relations are evaluated by extracting the users who have the same interesting fields. The response quality is evaluated by considering the user's response speed and response contents. The proposed scheme determines the user's expert score by combining the users' interests, the human relations, and the response quality. Finally, we recommend proper experts by matching queries and expert groups. It is shown through various performance evaluations that the proposed scheme outperforms the existing schemes.

• The Journal of the Korea Contents Association
• /
• v.20 no.10
• /
• pp.715-725
• /
• 2020

In this paper, we propose an optimization scheme for a k-Nearest Neighbor(k-NN) query, which finds k objects closest to the query in the high dimensional feature vectors. The k-NN query is converted and processed into a range query based on the range that is likely to contain k data. In this paper, we propose an optimization scheme using DNN model to derive an optimal range that can reduce processing cost and accelerate search speed. The entire system of the proposed scheme is composed of online and offline modules. In the online module, a query is actually processed when it is issued from a client. In the offline module, an optimal range is derived for the query by using the DNN model and is delivered to the online module. It is shown through various performance evaluations that the proposed scheme outperforms the existing schemes.

• Journal of Korea Multimedia Society
• /
• v.12 no.2
• /
• pp.219-230
• /
• 2009

With the development of broadcasting technology from analogue to interactive digital, the number of TV channels and TV contents provided to audiences is increasing in a rapid speed. In this multi-channel world, it is difficult to adapt to the increase of the TV channel numbers and their contents merely using remote controller to search channels. For these reasons, the EPG system, one of the essential services providing convenience to audiences, is proposed in this paper. Collaborative filtering method with multi-step filtering is used in EPG to recommend contents according to the preference of audience groups with similar preference. To implement our designed TV contents recommendation EPG, we prefer DiTV and use JavaXlet programming based on MHP. The European DVB-MHP specification will be also our domestic standard in DiTV. Finally, the result is verified by OpenMHP emulator.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.4
• /
• pp.275-285
• /
• 2003

The now video coding standard H.264 employs variable block size motion compensation, multiple references, and quarter-pel motion vector accuracy. These techniques are key features to accomplish higher coding gain, however, at the same time main factors that increase overall computational complexity. Therefore, in order to apply H.264 to many applications, key techniques are requested to improve their speed. For this reason, we propose a fast motion estimation which is suited for variable block size motion communication. In addition, we propose a fast mode decision method to choose the best mode at early stage. Experimental results show the reduction of the number of SAT SATD calculations by a factor of 4.5 and 2.6 times respectively, when we compare the proposed fast motion estimation and the conventional MVFAS $T^{［8-10］}$. Besides, the number of RDcost computations is reduced by about 45%. Therefore, the proposed methods reduces significantly its computational complexity without noticeable coding loss.

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

This paper proposes a novel algorithm for hybrid lossless audio coding, which employs an integer wavelet transform and a linear prediction model. The proposed algorithm divides the input signal into flames of a proper length, decorrelates the framed data using the integer wavelet transform and linear prediction and finally entropy-codes the frame data. In particular, the adaptive Golomb-Rice coding method used for the entropy coding selects an optimal option which gives the best compression efficiency. Since the proposed algorithm uses integer operations, it significantly improves the computation speed in comparison with an algorithm using real or floating-point operations. When the coding algorithm is implemented in hardware, the system complexity as well as the power consumption is remarkably reduced. Finally, because each frame is independently coded and is byte-aligned with respect to the frame header, it is convenient to move, search, and edit the coded, compressed data.