• Title/Summary/Keyword: 2D point-sequence

Search Result 85, Processing Time 0.024 seconds

An offset algorithm with forward tracing of tangential circle for open and closed poly-line segment sequence curve (접원의 전방향 경로이동에 의한 오프셋 알고리즘)

  • Yun, Seong-Yong;Kim, Il-Hwan
    • Proceedings of the KIEE Conference
    • /
    • 2003.11c
    • /
    • pp.1022-1030
    • /
    • 2003
  • In this paper we propose a efficient offset curve construction algorithm for $C^0$-continuous Open and Closed 2D sequence curve with line segment in the plane. One of the most difficult problems of offset construction is the loop problem caused by the interference of offset curve segments. Prior work[1-10] eliminates the formation of local self-intersection loop before constructing a intermediate(or raw) offset curve, whereas the global self-intersection loop are detected and removed explicitly(such as a sweep algorithm[13]) after constructing a intermediate offset curve. we propose an algorithm which removes global as well as local intersection loop without making a intermediate offset curve by forward tracing of tangential circle. Offset of both open and closed poly-line segment sequence curve in the plane constructs using the proposed approach.

  • PDF

3DTV System Adaptive to User's Environment (사용자 환경에 적응적인 3DTV 시스템)

  • Baek, Yun-Ki;Choi, Mi-Nam;Park, Se-Whan;Yoo, Ji-Sang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.10C
    • /
    • pp.982-989
    • /
    • 2007
  • In this paper, we propose a 3DTV system that considers user's view point and display environment. The proposed system consists of 3 parts - multi-view encoder/decoder, face-tracker, and 2D/3D converter. The proposed system try to encode multi-view sequence and decode it in accordance with the user's view point and it also gives a stereopsis to the multi-view image by using of 2D/3D conversion which converts decoded two-dimensional(2D) image to three-dimensional(3D) image. Experimental results shows that we are able to correctly reconstruct a stereoscopic view that is exactly corresponding to user's view point.

CONVERGENCE THEOREMS OF THE ITERATIVE SEQUENCES FOR NONEXPANSIVE MAPPINGS

  • Kang, Jung-Im;Cho, Yeol-Je;Zhou, Hai-Yun
    • Communications of the Korean Mathematical Society
    • /
    • v.19 no.2
    • /
    • pp.321-328
    • /
    • 2004
  • In this paper, we will prove the following: Let D be a nonempty of a normed linear space X and T : D -> X be a nonexpansive mapping. Let ${x_n}$ be a sequence in D and ${t_n}$, ${s_n}$ be real sequences such that (i) $0\;{\leq}\;t_n\;{\leq}\;t\;<\;1\;and\;{\sum_{n=1}}^{\infty}\;t_n\;=\;{\infty},\;(ii)\;(a)\;0\;{\leq}\;s_n\;{\leq}\;1,\;s_n\;->\;0\;as\;n\;->\;{\infty}\;and\;{\sum_{n=1}}^{\infty}\;t_ns_n\;<\;{\infty}\;or\;(b)\;s_n\;=\;s\;for\;all\;n\;{\geq}\;1\;and\;s\;{\in}\;[0,1),\;(iii)\;x_{n+1}\;=\;(1-t_n)x_n+t_nT(s_nTx_n+(1-s_n)x_n)\;for\;all\;n\;{\geq}\;1.$ Then, if the sequence {x_n} is bounded, then $lim_{n->\infty}\;$\mid$$\mid$x_n-Tx_n$\mid$$\mid$\;=\;0$. This result improves and complements a result of Deng [2]. Furthermore, we will show that certain conditions on D, X and T guarantee the weak and strong convergence of the Ishikawa iterative sequence to a fixed point of T.

Clinical validation of the 3-dimensional double-echo steady-state with water excitation sequence of MR neurography for preoperative facial and lingual nerve identification

  • Kwon, Dohyun;Lee, Chena;Chae, YeonSu;Kwon, Ik Jae;Kim, Soung Min;Lee, Jong-Ho
    • Imaging Science in Dentistry
    • /
    • v.52 no.3
    • /
    • pp.259-266
    • /
    • 2022
  • Purpose: This study aimed to evaluate the clinical usefulness of magnetic resonance (MR) neurography using the 3-dimensional double-echo steady-state with water excitation (3D-DESS-WE) sequence for the preoperative delineation of the facial and lingual nerves. Materials and Methods: Patients underwent MR neurography for a tumor in the parotid gland area or lingual neuropathy from January 2020 to December 2021 were reviewed. Preoperative MR neurography using the 3D-DESS-WE sequence was evaluated. The visibility of the facial nerve and lingual nerve was scored on a 5-point scale, with poor visibility as 1 point and excellent as 5 points. The facial nerve course relative to the tumor was identified as superficial, deep, or encased. This was compared to the actual nerve course identified during surgery. The operative findings in lingual nerve surgery were also described. Results: Ten patients with parotid tumors and 3 patients with lingual neuropathy were included. Among 10 parotid tumor patients, 8 were diagnosed with benign tumors and 2 with malignant tumors. The median facial nerve visibility score was 4.5 points. The distribution of scores was as follows: 5 points in 5 cases, 4 points in 1 case, 3 points in 2 cases, and 2 points in 2 cases. The lingual nerve continuity score in the affected area was lower than in the unaffected area in all 3 patients. The average visibility score of the lingual nerve was 2.67 on the affected side and 4 on the unaffected side. Conclusion: This study confirmed that the preoperative localization of the facial and lingual nerves using MR neurography with the 3D-DESS-WE sequence was feasible and contributed to surgical planning for the parotid area and lingual nerve.

Distribution of Runs and Patterns in Four State Trials

  • Jungtaek Oh
    • Kyungpook Mathematical Journal
    • /
    • v.64 no.2
    • /
    • pp.287-301
    • /
    • 2024
  • From the mathematical and statistical point of view, a segment of a DNA strand can be viewed as a sequence of four-state (A, C, G, T) trials. Herein, we consider the distributions of runs and patterns related to the run lengths of multi-state sequences, especially for four states (A, B, C, D). Let X1, X2, . . . be a sequence of four state independent and identically distributed trials taking values in the set 𝒢 = {A, B, C, D}. In this study, we obtain exact formulas for the probability distribution function for the discrete distribution of runs of B's of order k. We obtain longest run statistics, shortest run statistics, and determine the distributions of waiting times and run lengths.

Video Content Manipulation Using 3D Analysis for MPEG-4

  • Sull, Sanghoon
    • Journal of Broadcast Engineering
    • /
    • v.2 no.2
    • /
    • pp.125-135
    • /
    • 1997
  • This paper is concerned with realistic mainpulation of content in video sequences. Manipulation of content in video sequences is one of the content-based functionalities for MPEG-4 Visual standard. We present an approach to synthesizing video sequences by using the intermediate outputs of three-dimensional (3D) motion and depth analysis. For concreteness, we focus on video showing 3D motion of an observer relative to a scene containing planar runways (or roads). We first present a simple runway (or road) model. Then, we describe a method of identifying the runway (or road) boundary in the image using the Point of Heading Direction (PHD) which is defined as the image of, the ray along which a camera moves. The 3D motion of the camera is obtained from one of the existing 3D analysis methods. Then, a video sequence containing a runway is manipulated by (i) coloring the scene part above a vanishing line, say blue, to show sky, (ii) filling in the occluded scene parts, and (iii) overlaying the identified runway edges and placing yellow disks in them, simulating lights. Experimental results for a real video sequence are presented.

  • PDF

Detecting Peripheral Nerves in the Elbow using Three-Dimensional Diffusion-Weighted PSIF Sequences: a Feasibility Pilot Study

  • Na, Domin;Ryu, Jaeil;Hong, Suk-Joo;Hong, Sun Hwa;Yoon, Min A;Ahn, Kyung-Sik;Kang, Chang Ho;Kim, Baek Hyun
    • Investigative Magnetic Resonance Imaging
    • /
    • v.20 no.2
    • /
    • pp.81-87
    • /
    • 2016
  • Purpose: To analyze the feasibility of three-dimensional (3D) diffusion-weighted (DW) PSIF (reversed FISP [fast imaging with steady-state free precession]) sequence in order to evaluate peripheral nerves in the elbow. Materials and Methods: Ten normal, asymptomatic volunteers were enrolled (6 men, 4 women, mean age 27.9 years). The following sequences of magnetic resonance images (MRI) of the elbow were obtained using a 3.0-T machine: 3D DW PSIF, 3D T2 SPACE (sampling perfection with application optimized contrasts using different flip angle evolution) with SPAIR (spectral adiabatic inversion recovery) and 2D T2 TSE (turbo spin echo) with modified Dixon (m-Dixon) sequence. Two observers used a 5-point grading system to analyze the image quality of the ulnar, median, and radial nerves. The signal-to-noise ratio (SNR) and contrast-to-noise ratio (CNR) of each nerve were measured. We compared 3D DW PSIF images with other sequences using the Wilcoxon-signed rank test and Friedman test. Inter-observer agreement was measured using intraclass correlation coefficient (ICC) analysis. Results: The mean 5-point scores of radial, median, and ulnar nerves in 3D DW PSIF (3.9/4.2/4.5, respectively) were higher than those in 3D T2 SPACE SPAIR (1.9/2.8/2.8) and 2D T2 TSE m-Dixon (1.7/2.8/2.9) sequences (P < 0.05). The mean SNR in 3D DW PSIF was lower than 3D T2 SPACE SPAIR, but there was no difference between 3D DW PSIF and 2D T2 TSE m-Dixon in all of the three nerves. The mean CNR in 3D DW PSIF was lower than 3D T2 SPACE SPAIR and 2D T2 TSE m-Dixon in the median and ulnar nerves, but no difference among the three sequences in the radial nerve. Conclusion: The three-dimensional DW PSIF sequence may be feasible to evaluate the peripheral nerves around the elbow in MR imaging. However, further optimization of the image quality (SNR, CNR) is required.

A Protein Sequence Prediction Method by Mining Sequence Data (서열 데이타마이닝을 통한 단백질 서열 예측기법)

  • Cho, Sun-I;Lee, Do-Heon;Cho, Kwang-Hwi;Won, Yong-Gwan;Kim, Byoung-Ki
    • The KIPS Transactions:PartD
    • /
    • v.10D no.2
    • /
    • pp.261-266
    • /
    • 2003
  • A protein, which is a linear polymer of amino acids, is one of the most important bio-molecules composing biological structures and regulating bio-chemical reactions. Since the characteristics and functions of proteins are determined by their amino acid sequences in principle, protein sequence determination is the starting point of protein function study. This paper proposes a protein sequence prediction method based on data mining techniques, which can overcome the limitation of previous bio-chemical sequencing methods. After applying multiple proteases to acquire overlapped protein fragments, we can identify candidate fragment sequences by comparing fragment mass values with peptide databases. We propose a method to construct multi-partite graph and search maximal paths to determine the protein sequence by assembling proper candidate sequences. In addition, experimental results based on the SWISS-PROT database showing the validity of the proposed method is presented.