• Journal of Broadcast Engineering
• /
• v.5 no.2
• /
• pp.247-259
• /
• 2000

This paper introduces a new technique that reduces the search times and Improves the accuracy of motion estimation using high temporal and spatial correlation of motion vector. Instead of using the fixed first search Point of previously proposed search algorithms, the proposed method finds more accurate first search point as to compensating searching area using high temporal and spatial correlation of motion vector. Therefore, the main idea of proposed method is to find first search point to improve the performance of motion estimation and reduce the search times. The proposed method utilizes the direction of the same coordinate block of the previous frame compared with a block of the current frame to use temporal correlation and the direction of the adjacent blocks of the current frame to use spatial correlation. Based on these directions, we compute the first search point. We search the motion vector in the middle of computed first search point with two fixed search patterns. Using that idea, an efficient adaptive predicted direction search algorithm (APDSA) for block matching motion estimation is proposed. In the experimental results show that the PSNR values are improved up to the 3.6dB as depend on the Image sequences and advanced about 1.7dB on an average. The results of the comparison show that the performance of the proposed APDSA algorithm is better than those of other fast search algorithms whether the image sequence contains fast or slow motion, and is similar to the performance of the FS (Full Search) algorithm. Simulation results also show that the performance of the APDSA scheme gives better subjective picture quality than the other fast search algorithms and is closer to that of the FS algorithm.

• Journal of Korean Academy of Nursing
• /
• v.24 no.2
• /
• pp.264-277
• /
• 1994

In Korea the concept of social support was first used as a research concept in nursing and has not had much application in the clinical field. Another problem is that research on social support has used a direct translation of the words “social support” into Korean as “sawhejuk jiji”. Three questions were posed to direct the re-search. 1) Is there a concept of social support in Korean society? 2) if so, what words or expressions are used to de-scribe it? 3) further, if so, how is social support structured and how does it function? In order to answer the research questions a three-step research methodology was used : The first step consisted of a literature review on re-search related to social support and on information on the background of, and the way of thinking re-lated to interpersonal relations among Korean people. The second step, which was done to identify whether there is a concept of social support in korean society, involved interviewing a sample of the population. The third step involved a panel discussion that included the members of the research team and three consultants, a sociologist, a philosopher and a scholor in korean literature. A review of the literature on interpersonal relationships in traditional korean society identified a four cirole structure that explains interpersonal relationships. The first circle with “me” at the center is the family but here “me” disappears into the “we” that is essential for a cooperative agricultural society. In the second circle are those close to “me” but outside the family. The third circle includes those with whom “I ” have infrequent but regular contact and with whom correct conduct is important. The last circle is all the people with whom “I” have nothing in common. They are excluded in interpersonal relationships. The literature on interpersonal relationships showed that within the traditional Korean society people lived in villages where most people were very familiar with each other. “Yun”, the social network established the connection and “Jung”, the feeling of affection increased with time as the connection was strengthened. In the traditional village psychological support was provided through “Mallaniki”, “Pumashi” and “Kae” with the latter two also providing material support. In modern Korea there are more informal and formal social networks, like social services and community activities on the formal level and cultural and leisure groups along with “kae’s on the informal level. But even with this modern variety of groups, most social support comes from informal networks that resemble the traditiorlal “Pumashi”, “Kai” md “Mallaniki”. The six member research team interviewed 65 people in order to identify whether there is a concept of social support and then analysed their responses. There were 20 different words describing the reception of the social support and these could be grouped into seven major categories : virtuous, fortunate, helped, supported, blessed, attached(receiving affection) and receiving (grace) benevolence. there were 27 words describing the act of social support which could be categorized into seven major categories : love, looking after, affection(attachment), kindness(goodness), faith, psychological help and material help. for the meaning of social support translated as “sawhe juk jiji” there were a total of 14 different answers which could be categorized into 3 major categories : help, agreement, and faith. In third step, the results of the literature review and the answers to the questions were discussed in a pannel. The results of the discussion led to the following definition of social support in Korea which is shaped like a the four sided pyramid on a base. Social support is the apex of the pyramid and four sides are made up of : “do-oom” (both emotional and material help), “jung” (connectedness, or relationship bound by affection, regard or shared common experience ), “midum” (faith or belief in), “eunhae” (kindness or benevolence). The research team identified “Yun”( the basic network of relationships) as the base of the pyramid and as such the foundation for the components of social support in Korean culture. On “Yun” rest the other four components of social support : “Jung”, “Midum”, “Do-oom”, and “Eunhae”, For social support to take place there must be “Yun”. This is an important factor in social support. In private social network “Jung” is an essential factor in social support. But not in the public social network. “Yun” is a condition for “Jung” and “Jung” is the manifestation of support.

• Smart Structures and Systems
• /
• v.25 no.2
• /
• pp.123-133
• /
• 2020

Compressive sensing (CS) is a newly developed data acquisition and processing technique that takes advantage of the sparse structure in signals. Normally signals in their primitive space or format are reconstructed from their compressed measurements for further treatments, such as modal analysis for vibration data. This approach causes problems such as leakage, loss of fidelity, etc., and the computation of reconstruction itself is costly as well. Therefore, it is appealing to directly work on the compressed data without prior reconstruction of the original data. In this paper, a direct approach for modal analysis of damped systems is proposed by decomposing the compressed measurements with an appropriate dictionary. The damped free vibration function is adopted to form atoms in the dictionary for the following sparse decomposition. Compared with the normally used Fourier bases, the damped free vibration function spans a space with both the frequency and damping as the control variables. In order to efficiently search the enormous two-dimension dictionary with frequency and damping as variables, a two-step strategy is implemented combined with the Orthogonal Matching Pursuit (OMP) to determine the optimal atom in the dictionary, which greatly reduces the computation of the sparse decomposition. The performance of the proposed method is demonstrated by a numerical and an experimental example, and advantages of the method are revealed by comparison with another such kind method using POD technique.

• Journal of Convergence Society for SMB
• /
• v.5 no.1
• /
• pp.25-30
• /
• 2015

The APT attacks are hackers created a variety of security threats will continue to attack applied to the network of a particular company or organization. It referred to as intelligent sustained attack. After securing your PC after a particular organization's internal staff access to internal server or database through the PC or remove and destroy the confidential information. The APT attack is so large, there are two zero-day attacks and rootkits. APT is a process of penetration attack, search, acquisition, and is divided into outlet Step 4. It was defined in two ways how you can respond to APT through the process. Technical descriptions were divided into ways to delay the attacker's malicious code attacks time and plan for attacks to be detected and removed through.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.9
• /
• pp.3008-3028
• /
• 2022

In this paper, we investigate traffic scheduling for a delay-sensitive multi-hop relay network, and aim to minimize the priority-based end-to-end delay of different data packet via joint relay selection, subcarrier assignment, and power allocation. We first derive the priority-based end-to-end delay based on queueing theory, and then propose a two-step method to decompose the original optimization problem into two sub-problems. For the joint subcarrier assignment and power control problem, we utilize an efficient particle swarm optimization method to solve it. For the relay selection problem, we prove its convexity and use the standard Lagrange method to deal with it. The joint relay selection, subcarriers assignment and transmission power allocation problem for each hop can also be solved by an exhaustive search over a finite set defined by the relay sensor set and available subcarrier set. Simulation results show that both the proposed routing scheme and the resource allocation scheme can reduce the average end-to-end delay.

• Progress in Medical Physics
• /
• v.11 no.1
• /
• pp.49-57
• /
• 2000

New method about the dose optimization problem in radiation treatment was researched. Since all conditions are more complex and there are more relevant variables, the solution of three-dimensional treatment planning is much more complicate than that of current two-dimensional one. There(ore, in this study, as a method to solve three-dimensional dose optimization problem, the considered variables was minized and researched by reducing the domain that solutions can exist and pre-determining the important beam parameters. First, the dangerous beam range that passes critical organ was found by coordinate transformation between linear accelerator coordinate and patient coordinate. And the beam size and rotation angle for rectangular collimator that conform tumor at arbitrary beam position was also determined. As a result, the available beam position could be reduced and the dependency on beam size and rotation angle, that is very important parameter in treatment planning, totally removed. Therefore, the resultant combinations of relevant variables could be greatly reduced and the dose optimization by objective function can be done with minimum variables. From the above results, the dose optimization problem was solved for the two-dimensional radiation treatment planning useful in clinic. The objective function was made by combination of dose gradient, critical organ dose and dose homogeniety. And the optimum variables were determined by applying step search method to objective function. From the dose distributions by optimum variables, the merit of new dose optimization method was verified and it can be implemented on commercial radiation treatment planning system with further research.

• Journal of Broadcast Engineering
• /
• v.7 no.2
• /
• pp.114-125
• /
• 2002

Although there have been a lot of researches on a video abstraction algorithm, the video abstraction tool is necessary to correctly pick up some important shots in a video because the important shots might vary on the person's subjectivity. This paper proposes a video abstraction and search system for making a video abstraction automatically or manually. Proposed system has two main components, server and client. The server generates the Metadata and makes a video abstraction file. The description for video abstraction file is based on MPEG-7. Since proposed system has a function to manually correct the results of each step, the author could produce a good video abstraction easily and efficiently. The proposed system could be used to build a digital video library.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2271-2280
• /
• 1999

In this paper, a variable motion estimation scheme based on HBMA(Hierarchical Block Matching Algorithm) to improve the performance and to reduce heavy computational and transmission load, is presented. The proposed algorithm is composed of four steps. First, block activity for each block is defined using the edge information of differential image between two sequential images, and then average block activity of the present image is found by taking the mean of block activity. Secondly, camera pan compensation is carried out, according to the average activity of the image, in the hierarchical pyramid structure constructed by wavelet transform. Next, the LUT classifying each block into one among Moving, No Moving, Semi-Moving Block according to the block activity compensated camera pan is obtained. Finally, as varying the block size and adaptively selecting the initial search layer and the search range referring to LUT, the proposed variable HBMA can effectively carries out fast motion estimation in the hierarchical pyramid structure. The cost function needed above-mentioned each step is only the block activity defined by the edge information of the differential image in the sequential images.

• Journal of Information Processing Systems
• /
• v.9 no.4
• /
• pp.511-537
• /
• 2013

Numerous data intensive applications demand the efficient processing of a new type of query, which is called a progressive query (PQ). A PQ consists of a set of unpredictable but inter-related step-queries (SQ) that are specified by its user in a sequence of steps. A conventional DBMS was not designed to efficiently process such PQs. In our earlier work, we introduced a materialized view based approach for efficiently processing PQs, where the focus was on selecting promising views for materialization. The problem of how to efficiently find usable views from the materialized set in order to answer the SQs for a PQ remains open. In this paper, we present a new index technique, called the Dynamic Materialized View Index (DMVI), to rapidly discover usable views for answering a given SQ. The structure of the proposed index is a special ordered tree where the SQ domain tables are used as search keys and some bitmaps are kept at the leaf nodes for refined filtering. A two-level priority rule is adopted to order domain tables in the tree, which facilitates the efficient maintenance of the tree by taking into account the dynamic characteristics of various types of materialized views for PQs. The bitmap encoding methods and the strategies/algorithms to construct, search, and maintain the DMVI are suggested. The extensive experimental results demonstrate that our index technique is quite promising in improving the performance of the materialized view based query processing approach for PQs.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.1-16
• /
• 2005

When Web-based special retrieval systems for scientific field extremely restrict the expression of user's information request, the process of the information content analysis and that of the information acquisition become inconsistent. Accordingly, this study suggests the re-ranking retrieval model which reflects the content based similarity between user's inquiry terms and index words by grasping the document knowledge structure. In order to accomplish this, the former constructs a thesaurus and similarity relation matrix to provide the subject analysis mechanism and the latter propose the algorithm which establishes a search model such as query expansion in order to analyze the user's demands. Therefore, the algorithm that this study suggests as retrieval utilizing the information structure of a retrieval system can be content-based retrieval mechanism to establish a 2-step search model for the preservation of recall and improvement of accuracy which was a weak point of the previous fuzzy retrieval model.