• Journal of the Korean Society of Food Culture
• /
• v.22 no.1
• /
• pp.127-139
• /
• 2007

This research was peformed to investigate the anthropometric data, blood profiles, and nutrient intakes of elderly persons living in a rural area. The subjects were 67 undernourished people who participated in follow-up nutrition intervention programs for9 weeks. Anthropometric data showed that the mean heights and weights in the management group were 157.6 cm and 59.1 kg, respectively, for the males and 152.6 cm and 51.0 kg, respectively, for the females. The mean BMIs of the management group were 23.8 kg/m$^2$ in the males and 22.4 kg/m$^2$ in the females. The total cholesterol, HDL-cholesterol, and albumin levels of the subjects were 181.7-191.4mg/dL, 48.3-53.0mg/dL, and 3.85-4.00g/dL, respectively. Energy, ash, P, Na, vitamin B$_1$, vitamin B$_2$, vitamin B$_6$, and niacin increased significantly after intervention for the management group. The mINQ, however, did not significantly increase after intervention. Also after intervention, there was no significant difference in mINQ between the management group and the comparison group. MAR (14) in the management group was significantly increased from 0.62${\pm}$0.2 before intervention to 0.68${\pm}$0.2 after intervention (p=0.022), and it was significantly different between the management group and the comparison group (p=0.017). MAR (8) in the management group was not significantly different (p=0.915) before and after intervention. However, MAR (8) between the management group and the comparison group did show a significant difference (p=0.031). MAR (3) in the management group was significantly increased from 0.48${\pm}$0.2 before intervention to 0.55${\pm}$0.2 after intervention (p=0.045), however, MAR (3) was not significantly different between the management group and the comparison group (p=0.093). For the probability of nutrient insufficiency, in the management group the probability of nutrient values below the EAR (except for Fe) decreased after intervention compared to before intervention. On the other hand, the probabilities of values above the RI, or EAR${\sim}$RI, were increased

• The Journal of the Korea institute of electronic communication sciences
• /
• v.19 no.1
• /
• pp.317-326
• /
• 2024

Biometric recognition is a technology that determines whether a person is identified by extracting information on a person's biometric and behavioral characteristics with a specific device. Cyber threats such as forgery, duplication, and hacking of biometric characteristics are increasing in the field of biometrics. In response, the security system is strengthened and complex, and it is becoming difficult for individuals to use. To this end, multiple biometric models are being studied. Existing studies have suggested feature fusion methods, but comparisons between feature fusion methods are insufficient. Therefore, in this paper, we compared and evaluated the fusion method of multiple biometric models using fingerprint, face, and iris images. VGG-16, ResNet-50, EfficientNet-B1, EfficientNet-B4, EfficientNet-B7, and Inception-v3 were used for feature extraction, and the fusion methods of 'Sensor-Level', 'Feature-Level', 'Score-Level', and 'Rank-Level' were compared and evaluated for feature fusion. As a result of the comparative evaluation, the EfficientNet-B7 model showed 98.51% accuracy and high stability in the 'Feature-Level' fusion method. However, because the EfficietnNet-B7 model is large in size, model lightweight studies are needed for biocharacteristic fusion.

• Journal of Intelligence and Information Systems
• /
• v.17 no.3
• /
• pp.203-219
• /
• 2011

Previously common users just want to watch the video contents without any specific requirements or purposes. However, in today's life while watching video user attempts to know and discover more about things that appear on the video. Therefore, the requirements for finding multimedia or browsing information of objects that users want, are spreading with the increasing use of multimedia such as videos which are not only available on the internet-capable devices such as computers but also on smart TV and smart phone. In order to meet the users. requirements, labor-intensive annotation of objects in video contents is inevitable. For this reason, many researchers have actively studied about methods of annotating the object that appear on the video. In keyword-based annotation related information of the object that appeared on the video content is immediately added and annotation data including all related information about the object must be individually managed. Users will have to directly input all related information to the object. Consequently, when a user browses for information that related to the object, user can only find and get limited resources that solely exists in annotated data. Also, in order to place annotation for objects user's huge workload is required. To cope with reducing user's workload and to minimize the work involved in annotation, in existing object-based annotation automatic annotation is being attempted using computer vision techniques like object detection, recognition and tracking. By using such computer vision techniques a wide variety of objects that appears on the video content must be all detected and recognized. But until now it is still a problem facing some difficulties which have to deal with automated annotation. To overcome these difficulties, we propose a system which consists of two modules. The first module is the annotation module that enables many annotators to collaboratively annotate the objects in the video content in order to access the semantic data using Linked Data. Annotation data managed by annotation server is represented using ontology so that the information can easily be shared and extended. Since annotation data does not include all the relevant information of the object, existing objects in Linked Data and objects that appear in the video content simply connect with each other to get all the related information of the object. In other words, annotation data which contains only URI and metadata like position, time and size are stored on the annotation sever. So when user needs other related information about the object, all of that information is retrieved from Linked Data through its relevant URI. The second module enables viewers to browse interesting information about the object using annotation data which is collaboratively generated by many users while watching video. With this system, through simple user interaction the query is automatically generated and all the related information is retrieved from Linked Data and finally all the additional information of the object is offered to the user. With this study, in the future of Semantic Web environment our proposed system is expected to establish a better video content service environment by offering users relevant information about the objects that appear on the screen of any internet-capable devices such as PC, smart TV or smart phone.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.7
• /
• pp.1218-1226
• /
• 2008

With the development of semiconductor integrated technology and with the increasing use of multimedia functions in computer, more functions have been implemented as hardware. Nowadays, most microprocessors beyond 32 bits generally implement an integer multiplier as hardware. However, as for a divider, only specific microprocessor implements traditional SRT algorithm as hardware due to complexity of implementation and slow speed. This paper suggested an algorithm that uses a multiplier, 'w bit $\times$ w bit = 2w bit', to process $\frac{N}{D}$ integer division. That is, the reciprocal number D is first calculated, and then multiply dividend N to process integer division. In this paper, when the divisor D is '$D=0.d{\times}2^L$, 0.5 < 0.d < 1.0', approximate value of ' $\frac{1}{D}$', '$1.g{\times}2^{-L}$', which satisfies ' $0.d{\times}1.g=1+e$, $e<2^{-w}$', is defined as over reciprocal number and then an algorithm for over reciprocal number is suggested. This algorithm multiplies over reciprocal number '$01.g{\times}2^{-L}$' by dividend N to process $\frac{N}{D}$ integer division. The algorithm suggested in this paper doesn't require additional revision, because it can calculate correct reciprocal number. In addition, this algorithm uses only multiplier, so additional hardware for division is not required to implement microprocessor. Also, it shows faster speed than the conventional SRT algorithm and performs operation by word unit, accordingly it is more suitable to make compiler than the existing division algorithm. In conclusion, results from this study could be used widely for implementation SOC(System on Chip) and etc. which has been restricted to microprocessor and size of the hardware.

• Journal of the Korean Society of Radiology
• /
• v.18 no.3
• /
• pp.187-201
• /
• 2024

Osteoporosis is a major health issue globally, often remaining undetected until a fracture occurs. To facilitate early detection, deep learning (DL) models were developed to classify osteoporosis using abdominal computed tomography (CT) scans. This study was conducted using retrospectively collected data from 3,012 contrast-enhanced abdominal CT scans. The DL models developed in this study were constructed for using image data, demographic/clinical information, and multi-modality data, respectively. Patients were categorized into the normal, osteopenia, and osteoporosis groups based on their T-scores, obtained from dual-energy X-ray absorptiometry, into normal, osteopenia, and osteoporosis groups. The models showed high accuracy and effectiveness, with the combined data model performing the best, achieving an area under the receiver operating characteristic curve of 0.94 and an accuracy of 0.80. The image-based model also performed well, while the demographic data model had lower accuracy and effectiveness. In addition, the DL model was interpreted by gradient-weighted class activation mapping (Grad-CAM) to highlight clinically relevant features in the images, revealing the femoral neck as a common site for fractures. The study shows that DL can accurately identify osteoporosis stages from clinical data, indicating the potential of abdominal CT scans in early osteoporosis detection and reducing fracture risks with prompt treatment.

• Cartoon and Animation Studies
• /
• s.33
• /
• pp.31-53
• /
• 2013

In the early twentieth century, history of animation began by modern artists, they produced various experimental images with the newly invented film and cameras. Artists in the field of movie, photography, paintings and others manipulated images in motion. But as some animated movies won industrial success and popularity, they became the trend but experimental style of early animation preserved by so-called non-mainstreamers or experimental animators, counteracting commercialism. Disney animation also followed the trend by applying realistic Hollywood film style, the worse critics placed a low value on the animation and it tarnished the image, although it was profitable investment from a business standpoint. To make images realistic, they opened a drawing class that animators developed skills to imitate motions and forms from subjects in real life. Also some techniques and gizmos were used to mimic and simulate three dimensional objects and spaces, multiplane camera and compositing 3D CG images with 2D drawings. Moreover, they brought animation stories from fairly tales or folk tales, and Walt's personal interest in live-action movies, they applied Hollywood-film-like narratives and realistic visual, and harsh criticism ensued. On the surface early disney animations' potential seems to be weakened, but in reality it still exists by simplifying and exaggerating forms and color as modern arts. Disney animation employs concepts of the modernism paintings such as simplified shapes and colors to a character design, when their characters are placed together in a scene, that visual elements cause mental reaction. This modification gives a new internal experience to audiences. As conceptual colors in abstract paintings make images appeared to be flat, coloring characters with no shading make them look flat and comparing to them, background images are also appeared to be flat. On top of that, multi-perspective at background images recalls modernist paintings. This essay goes in details with the animation pioneers' works and how Disney animation developed its techniques to emulate real life and analyses color schemes, forms, and spaces in Disney animation compared with modern artists' works, in that the visual language of Disney animation reminds of impression from abstract paintings in the beginning of the twentieth centuries.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.188-198
• /
• 2005

The Goldschmidt iterative algorithm for finding a floating point square root calculated it by performing a fixed number of multiplications. In this paper, a variable latency Goldschmidt's square root algorithm is proposed, that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the square root of a floating point number F, the algorithm repeats the following operations: $R_i=\frac{3-e_r-X_i}{2},\;X_{i+1}=X_i{\times}R^2_i,\;Y_{i+1}=Y_i{\times}R_i,\;i{\in}\{{0,1,2,{\ldots},n-1} }}'$with the initial value is $'\;X_0=Y_0=T^2{\times}F,\;T=\frac{1}{\sqrt {F}}+e_t\;'$. The bits to the right of p fractional bits in intermediate multiplication results are truncated, and this truncation error is less than $'e_r=2^{-p}'$. The value of p is 28 for the single precision floating point, and 58 for the doubel precision floating point. Let $'X_i=1{\pm}e_i'$, there is $'\;X_{i+1}=1-e_{i+1},\;where\;'\;e_{i+1}<\frac{3e^2_i}{4}{\mp}\frac{e^3_i}{4}+4e_{r}'$. If '|X_i-1|<2^{\frac{-p+2}{2}}\;'$ is true, $'\;e_{i+1}<8e_r\;'$ is less than the smallest number which is representable by floating point number. So, $\sqrt{F}$ is approximate to $'\;\frac{Y_{i+1}}{T}\;'$. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications per an operation is derived from many reciprocal square root tables ($T=\frac{1}{\sqrt{F}}+e_i$) with varying sizes. The superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a square root unit. Also, it can be used to construct optimized approximate reciprocal square root tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia, scientific computing, etc.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.2
• /
• pp.380-389
• /
• 2005

The Goldschmidt iterative algorithm for a floating point divide calculates it by performing a fixed number of multiplications. In this paper, a variable latency Goldschmidt's divide algorithm is proposed, that performs multiplications a variable number of times until the error becomes smaller than a given value. To calculate a floating point divide '$\frac{N}{F}$', multifly '$T=\frac{1}{F}+e_t$' to the denominator and the nominator, then it becomes ’$\frac{TN}{TF}=\frac{N_0}{F_0}$'. And the algorithm repeats the following operations: ’$R_i=(2-e_r-F_i),\;N_{i+1}=N_i{\ast}R_i,\;F_{i+1}=F_i{\ast}R_i$, i$\in${0,1,...n-1}'. The bits to the right of p fractional bits in intermediate multiplication results are truncated, and this truncation error is less than ‘$e_r=2^{-p}$'. The value of p is 29 for the single precision floating point, and 59 for the double precision floating point. Let ’$F_i=1+e_i$', there is $F_{i+1}=1-e_{i+1},\;e_{i+1}',\;where\;e_{i+1}, If '$[F_i-1]<2^{\frac{-p+3}{2}}$ is true, ’$e_{i+1}<16e_r$' is less than the smallest number which is representable by floating point number. So, ‘$N_{i+1}$ is approximate to ‘$\frac{N}{F}$'. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications per an operation is derived from many reciprocal tables ($T=\frac{1}{F}+e_t$) with varying sizes. 1'he superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a divider. Also, it can be used to construct optimized approximate reciprocal tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia, scientific computing, etc

• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.413-420
• /
• 2005

The Newton-Raphson iterative algorithm for finding a floating point reciprocal square mot calculates it by performing a fixed number of multiplications. In this paper, a variable latency Newton-Raphson's reciprocal square root algorithm is proposed that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the rediprocal square root of a floating point number F, the algorithm repeats the following operations: '$X_{i+1}=\frac{{X_i}(3-e_r-{FX_i}^2)}{2}$, $i\in{0,1,2,{\ldots}n-1}$' with the initial value is '$X_0=\frac{1}{\sqrt{F}}{\pm}e_0$'. The bits to the right of p fractional bits in intermediate multiplication results are truncated and this truncation error is less than '$e_r=2^{-p}$'. The value of p is 28 for the single precision floating point, and 58 for the double precision floating point. Let '$X_i=\frac{1}{\sqrt{F}}{\pm}e_i$, there is '$X_{i+1}=\frac{1}{\sqrt{F}}-e_{i+1}$, where '$e_{i+1}{<}\frac{3{\sqrt{F}}{{e_i}^2}}{2}{\mp}\frac{{Fe_i}^3}{2}+2e_r$'. If '$|\frac{\sqrt{3-e_r-{FX_i}^2}}{2}-1|<2^{\frac{\sqrt{-p}{2}}}$' is true, '$e_{i+1}<8e_r$' is less than the smallest number which is representable by floating point number. So, $X_{i+1}$ is approximate to '$\frac{1}{\sqrt{F}}$. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications Per an operation is derived from many reciprocal square root tables ($X_0=\frac{1}{\sqrt{F}}{\pm}e_0$) with varying sizes. The superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a reciprocal square root unit. Also, it can be used to construct optimized approximate reciprocal square root tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia, scientific computing, etc.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.11
• /
• pp.3514-3523
• /
• 2009

Before 1990's, Korea had only few colleges that had film and film related majors. As Korean film industry started its marvelous improvement in both commercial and artistic phase, many colleges were interested in this new academic field. They hurried up to launch this new and profitable major; as a result, Korea now has more than hundred colleges and universities that has film related majors. Each college enumerates numbers of academic courses that may look reasonable; they have almost every course a fine film school should provide such as film theory, production, and performance in film. Lots of film schools offer lots of film courses; and they look alike. One unique thing in film major is its vast sub fields and categories. After you decide to study film, you have to select what specific field in film you want to study. Studying film theory and film production can be as different as majoring physics and physical education. The problem Korean colleges are dealing with is that there are too much film schools, and moreover those colleges have similar curriculums that just look like a department store that sells everything. One suggestion is specializing its curriculum in which the school can take advantages using their special conditions. San Francisco Art Institute is one of United States well known private film schools, but many people remember this school as a specialized film school in experimental film. San Francisco where this school is located has had many liberal and experimental artists as the city has been supporting and offering them an environment they can concentrate their work. Naturally, the school has world famous faculty members in experimental film, and students who want to study and make experimental film come to this school from all over the world because they know this school would be the best to study experimental film. There are many film schools in metro Los Angeles area; since its location near Hollywood, no wonder these schools concentrate on film producing and film production. They take advantage of their geographical location to hire film industry professional and to focus on commercial feature film productions. What we can do now to adjust the curriculum in film and film related major in Korean colleges is to adapt new standards in this changed film industry. One school can emphasize digital production while another school focuses on digital intermediate process. But if one school tries to both fields or all fields of film major just like we have done so far, the school could not take care of all the equipment and the faculty that the fields would need. Korean film schools should devide the field in film major and concentrate what they selected. Selection and concentration can be and should be applied in Korean film schools.