• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.5
• /
• pp.54-63
• /
• 2000

We present a multi-resolution block matching algorithm (BMA) for fast motion estimation At the coarsest level, a motion vector (MV) having minimum matching error is chosen via a full search, and a MV with minimum matching error is concurrently found among the MVs of the spatially adjacent blocks Here, to examine the spatial MVs accurately, we propose an efficient method for searching full resolution MV s without MV quantization even at the coarsest level The chosen two MV s are used as the initial search centers at the middle level At the middle level, the local search is performed within much smaller search area around each search center If the method used at the coarsest level is adopted here, the local searches can be done at integer-pel accuracy A MV having minimum matching error is selected within the local search areas, and then the final level search is performed around this initial search center Since the local searches are performed at integer-pel accuracy at the middle level, the local search at the finest level does not take an effect on the overall performance So we can skip the final level search without performance degradation, thereby the search speed increases Simulation results show that in comparison with full search BMA, the proposed BMA without the final level search achieves a speed-up factor over 200 with minor PSNR degradation of 02dB at most, under a normal MPEG2 coding environment Furthermore, our scheme IS also suitable for hardware implementation due to regular data-flow.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.32 no.5
• /
• pp.459-467
• /
• 2014

The importance of fusion and association using established spatial information has increased gradually with the production and supply of various spatial data by public institutions. The generation of necessary spatial information without field investigation and additional surveying can reduce time, labor, and financial costs. However, the study of the integration of the newly introduced road name address map with the digital map is very insufficient. Even though the use of the road name address map is encouraged for public works related to spatial information, the digital map is still widely used because it is the national basic map. Therefore, in this study, building matching and update were performed to associate the digital map with the road name address map. After geometric calibration using the block-based ICP (Iterative Closest Point) method, multi-scale corresponding pair searching with hierarchical clustering was applied to detect the multi-type match. The accuracy assessment showed that the proposed method is more than 95% accurate and the matched building layer of the two maps is useful for the integrated application and fusion. In addition, the use of the road name address map, which carries the latest and most frequently renewed data, enables cost-effective updating of new buildings.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.3 s.309
• /
• pp.9-16
• /
• 2006

Many image and video compression algorithms work by splitting the image into blocks and producing variable-length code bits for each block data. If variable-length code data are transmitted consecutively over error-prone channel without any error protection technique, the receiving decoder cannot decode the stream properly. So the standard image and video compression algorithms insert some redundant information into the stream to provide some protection against channel errors. One of redundancies is resynchronization marker, which enables the decoder to restart the decoding process from a known state in the event of transmission errors, but its usage should be restricted not to consume bandwidth too much. The Error Resilient Entropy Code(EREC) is well blown method which can regain synchronization without any redundant information. It can work with the overall prefix codes, which many image compression methods use. This paper proposes EREREC method to improve FEREC(Fast Error-Resilient Entropy Coding). It first calculates initial searching position according to bit lengths of consecutive blocks. Second, initial offset is decided using statistical distribution of long and short blocks, and initial offset can be adjusted to insure all offset sequence values can be used. The proposed EREREC algorithm can speed up the construction of FEREC slots, and can improve the compressed image quality in the event of transmission errors. The simulation result shows that the quality of transmitted image is enhanced about $0.3{\sim}3.5dB$ compared with the existing FEREC when random channel error happens.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5C
• /
• pp.706-715
• /
• 2004

In this paper, to decide the watermark embedding positions and embed the watermark we use the subband tee structure which is presented in the wavelet domain and the edge information in the spatial domain. The significant frequency region is estimated by the subband searching from the higher frequency subband to the lower frequency subband. LH1 subband which has the higher frequency in tree structure of the wavelet domain is divided into 4${\times}$4 submatrices, and the threshold which is used in the watermark embedding is obtained by the blockmatrix which is consists by the average of 4${\times}$4 submatrices. Also the watermark embedding position, Keymap is generated by the blockmatrix for the energy distribution in the frequency domain and the edge information in the spatial domain. The watermark is embedded into the wavelet coefficients using the Keymap and the random sequence generated by LFSR(Linear feedback shift register). Finally after the inverse wavelet transform the watermark embedded image is obtained. the proposed watermarking algorithm showed PSNR over 2㏈ and had the higher results from 2％ to 8％ in the comparison with the previous research for the attack such as the JPEG compression and the general image processing just like blurring, sharpening and gaussian noise.

• Korean Journal of Social Welfare
• /
• v.57 no.4
• /
• pp.119-146
• /
• 2005

The purpose of this study is to find out the structural and developmental characteristics of inter-organizational community network of the school social work and the characteristics of direct workers and the school social work organizations delivering services to the children in low-income families, and to identify the magnitude of efficient structure for networking for the children living in Kayang-dong. By searching out the central organization and block modeling, this study attempted to show the characteristics of inter-organizational community network for the children. The research sample was 18 organizations, and the data were collected by a survey questionnaire and analyzed by SPSSWIN 12.0 and UCINET 6.29. The main results show that the social welfare organization is the central organization in almost every dimensions(information exchange, client referral, cooperation, resource exchange) and education organizations play an important role in betweenness centrality. Also it can be evaluated that the present developmental stage of the network is collaboration. Based on the research results, implications for the future practice are discussed.

• Journal of Korean Society of Environmental Engineers
• /
• v.32 no.10
• /
• pp.979-985
• /
• 2010

This study was performed to detect enterococci strain as an indicator of faecal contamination, to identify of 16S rDNA sequence and vancomycin resistance by MIC (Minimum Inhibitory Concentration) test from drinking spring-water samples in Seoul. The detection frequency of enterococci was 42 (19.8%) among 212 samples, and its concentration was ranged from 0 to 110 CFU/100 mL. These results were confirmed the possibility as an indicator microorganisms that similar to the frequency of E. coli detection (t test p-value 0.268, significant level 0.05). Isolated 56 enterococci samples were identified by 16S rDNA sequence data and their NCBI BLAST searching. They were identified to Enterococcus faecalis of 24 samples, E. faecium (10), E. casseliflavus (10), E. gallinarum (3), E. hirae (2), E. durans (2), E. sanguinicola (1). E. faecalis was dominant species that clinical case report of a domestic was similar. Vancomycin resistant enterococci (VRE) of 53 samples showed that vanB and vanC1/C2 type with 2 and 12 case, respectively. These results indicated that the drinking spring-water quarantined to fecal pollution for block out outbreak of gastrointestinal symptom with using such as disinfection process.

• Science of Emotion and Sensibility
• /
• v.13 no.4
• /
• pp.613-620
• /
• 2010

The purpose of this study was to quantitatively evaluate the effects of the secondary task while simulated driving using the variable indicating control of vehicle and smoothness of motion. Fifteen healthy adults having 1~2years driving experience were participated. 9 markers were attached on the subjects' upper(shoulder, elbow, Wrist) and lower(knee, ankle, toe) limbs and all subjects were instructed to keep the 30m distance with the front vehicle running at 80km/hr speed. Sending text message(STM) and searching navigation(SN) were selected as the secondary task. Experiment consisted of driving alone for 1 min and driving with secondary task for 1 min, and was defined driving and cognition blocks respectively. To indicate the effects of secondary task, coefficient of variation of distance between vehicles and lane keeping(APCV and MLCV) and jerk-cost function(JC) were analyzed. APCV was increased by 222.1% in SN block. MLCV was increased by 318.2% in STM and 308.4% in SN. JC were increased at the drivers' elbow, knee, ankle and toe, especially the total mean JC of lower limbs were increased by 218.2% in STM and 294.7% in SN. Conclusively, Performing secondary tasks while driving decreased the smoothness of motion with increased JC and disturbed the control of vehicle with increased APCV and MLCV.