• Speech Sciences
• /
• v.9 no.3
• /
• pp.185-200
• /
• 2002

The current study confirmed the existence of an ip prosodic level in French intonation structure, as previously proposed by Sun-Ah Jun & $C\acute{e}cile$cile Fougeron (2000). However, in contrast to the previous suggestion of the plateau realized in an ip in several syntactic structures, the current study supposed that the plateau doesn't come from the different type of syntactic structures but arise from the unspecified syllables without any PA in an ip. Because if we limited ip phrasal tone to the syntactic structure, it would be difficult to find the more general reasons of ip level. Besides /Hi/ and /$H^*$/ we also used /$Hi^*$/ for the focused syllable in the current study. In emphasized sentences, in general, /$Hi^*$/ appeared in the first or second syllable of a leftward AP in an ip and /$H^*$/ in the final syllable of a rightmost AP of an ip, In contrast to these PAs, /$Hi^*$/ might appear in any syllable in an ip, but not to far from /$H^*$/ because the duration time and length t of plateau realized between /$Hi^*$/ and /$H^*$/ or /Hi/ and /$H^*$/ would make an essential harmonious rhythmic unit, Therefore, the current study determined the duration time and the number of syllables realized in each plateau in an ip level composed of more than one AP. As a phrase constituent structure, there is a practical need for intermediate prosodic units to allow for generalization over the many possible combinations of prosodic patterns that can occur. Further evidence is still needed to analyze and relate the different pitch ranges of the plateau of an ip according to the syntactic structure, to identify the considerable character in the French prosodic hierarchy.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.6
• /
• pp.295-301
• /
• 2014

In the absence of a sorting algorithm faster than O(n log n), Quicksort remains the best and fastest of its kind in practice. For given n data, Quicksort records running in O(n log n) at best and $O(n^2)$ at its worst. In this paper, I propose an algorithm by which 3-points average P=(L+M+H)/3 is set as a pivot for first array L=a[s], last array H=a[e], and middle array $M=a[{\lfloor}(s+e)/2{\rfloor}]$ in order to find the more fast than Quicksort. Test results prove that the proposed 3-points average pivot Quicksort has the time complexity of O(n log n) at its best, average, and worst cases. And the proposed algorithm can be reduce the $O(n^2)$ time of Quicksort to O(n log n).

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.9
• /
• pp.1146-1151
• /
• 2019

Histogram H is an x-monotone rectilinear polygon with a horizontal edge, called by a base, connecting the leftmost vertical edge and the rightmost vertical edge. Here the rectilinear polygon is a polygon with only horizontal and vertical edges and the x- monotone polygon P is a polygon in which every line orthogonal to the x-axis intersects P at most twice. Walking counterclockwise on the boundary of a histogram H yields a sequence of left turns and right turns at its vertices. Conversely, a given sequence of the turns at the vertices can be realized by a histogram. In this paper, we consider the problem of finding a histogram to realize a given turn sequence. Particularly, we will find the histograms to minimize its area and its bounding box. It will be shown that both of the problems can be solved by linear time algorithms.

• Journal of Broadcast Engineering
• /
• v.17 no.2
• /
• pp.363-373
• /
• 2012

This paper proposes a method to generate a depth image at an arbitrary intermediate view-point, which is targeting a video service for free-view, auto-stereoscopy, holography, etc. It assumes that the leftmost and the rightmost depth images are given and they both have been camera-calibrated and image-rectified. This method calculates and uses a disparity increment per depth value. In this paper, it is obtained by stereo matching for the given two depth image by considering more general cases. The disparity increment is used to find the location in the intermediate view-point depth image (IVPD) for each depth in the given images. Thus, this paper finds two IVPDs, from left image and from right image. Noises are removed and holes are filled in each IVPDs and the two results are combined to get the final IVPD. The proposed method was implemented and applied to several test sequences. The results revealed that the quality of the generated IVPD corresponds to 33.84dB of PSNR in average and it takes about 1 second to generate a HD IVPD. We evaluate that this image quality is quite good by considering the low correspondency among the left images, intermediate images, and the right images in the test sequences. If the execution speed is improved, the proposed method can be a very useful method to generate an IVPD at an arbitrary view-point, we believe.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1C
• /
• pp.129-139
• /
• 2004

This paper studies the support region of an optimum (minimum mean-squre error) fixed-rate scalar quantizer for a Weibull source. The support region is defined to be the interval determined by the outermost thresholds of a quantizer and plays an important role in its performance, and hence it motivates this study. The paper reports the following specific results. First, approximation formulas are derived for the outermost thresholds of optimum scalar quantizers for a Weibull distributions. Second, in the case of Rayleigh and exponential distributions the derived approximation formulas are compared for the evaluation of their accuracy with the true values of optimum quantizers. Numerical results show that the formula for the leftmost threshold stays within 1% of the true value for 128 and 256 quantization points or more, for Rayleigh and exponential distribution, respectively, while that for the rightmost threshold does so for 512 and 32 quantization points or more. These formulas exhibit increased accuracy with the number of quantization points. In conclusion, the formulas have high accuracy. The contribution of the paper consists in the derivation of closed accurate formulas for the support of optimum.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.4
• /
• pp.139-145
• /
• 2012

Generally, Quicksort selects the pivot from leftmost, rightmost, middle, or random location in the array. This paper suggests Quicksort using middle range pivot $P_0$ and continually divides into 2. This method searches the minimum value $L$ and maximum value $H$ in the length n of list $A$. Then compute the initial pivot key $P_0=(H+L)/2$ and swaps $a[i]{\geq}P_0$,$a[j]<P_0$ until $i$=$j$ or $i$>$j$. After the swap, the length of list $A_0$ separates in two lists $a[1]{\leq}A_1{\leq}a[j]$ and $a[i]{\leq}A_2{\leq}a[n]$ and the pivot values are selected by $P_1=P_0/2$, $P_2=P_0+P_1$. This process repeated until the length of partial list is two. At the length of list is two and $a$[1]>$a$[2], swaps as $a[1]{\leftrightarrow}a[2]$. This method is simpler pivot key process than Quicksort and improved the worst-case computational complexity $O(n^2)$ to $O(n{\log}n)$.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.8
• /
• pp.1908-1918
• /
• 2013

Free-view, auto-stereoscopic video service is a next generation broadcasting system which offers a three-dimensional video, images of the various point are needed. This paper proposes a method that parallelizes the algorithm for arbitrary intermediate view-point image fast generation and make it faster using General Propose Graphic Processing Unit(GPGPU) with help of the Compute Unified Device Architecture(CUDA). It uses a parallelized stereo-matching method between the leftmost and the rightmost depth images to obtain disparity information and It use data calculated disparity increment per depth value. The disparity increment is used to find the location in the intermediate view-point image for each depth in the given images. Then, It is eliminate to disocclusions complement each other and remaining holes are filled image using hole-filling method and to get the final intermediate view-point image. The proposed method was implemented and applied to several test sequences. The results revealed that the quality of the generated intermediate view-point image corresponds to 30.47dB of PSNR in average and it takes about 38 frames per second to generate a Full HD intermediate view-point image.

• Journal of Conservation Science
• /
• v.37 no.5
• /
• pp.491-504
• /
• 2021

Gwanghwamun Gate of Gyeongbokgung Palace was dismantled and relocated during the Japanese colonial period, destroyed during the Korean War, reconstructed with reinforced concrete in 1968, and finally erected at its present location in 2010. A pair of Haechi statues located in front of Gwanghwamun was dismantled and relocated several times, and the statues have yet to be returned precisely to their original positions. This study assesses the historical accuracy of their current placement under the Gwanghwamun Square Restructuring Project of the Seoul Metropolitan Government and the Cultural Heritage Administration based on archival photos from the early 1900s, and proposes a method to estimate the original positions of the Haechi through image analysis of contemporary photographs and recent digital camera photos. We estimated the original position of the Haechi before the Japanese colonial period by identifying the shooting location of the archival photo and reproducing contemporary photographs by calculating the angle and distance to the Haechi from the shooting location. The leftmost and rightmost Haechi were originally located about 9.6 m to the east and 7.4 m to the north and about 1.9 m to the west and 8.0 m to the north, respectively, of their current location indicators. As the first attempt to determine the original location of a building and its accessories using archival photos, this study launches a new scientific methodology for the restoration of cultural properties.