50,240 research outputs found

    ํ˜•ํƒœ ์ง€์‹์„ ์‚ฌ์šฉํ•œ ์˜์ƒ ๋ถ„ํ• ์„ ์œ„ํ•œ ๋ณ€๋ถ„๋ฒ•์  ์ ‘๊ทผ

    Get PDF
    ํ•™์œ„๋…ผ๋ฌธ (๋ฐ•์‚ฌ)-- ์„œ์šธ๋Œ€ํ•™๊ต ๋Œ€ํ•™์› : ์ˆ˜๋ฆฌ๊ณผํ•™๋ถ€, 2014. 8. ๊ฐ•๋ช…์ฃผ.์ด ๋…ผ๋ฌธ์—์„œ ์šฐ๋ฆฌ๋Š” ํ˜•ํƒœ ์‚ฌ์ „ ์ง€์‹์„ ์‚ฌ์šฉํ•œ ๋ ˆ๋ฒจ ์…‹ ๋ฐฉ๋ฒ•์— ๊ธฐ์ดˆํ•ด์„œ๋ถ„ํ•  ์•Œ๊ณ ๋ฆฌ์ฆ˜์„ ๋‹ค๋ฃฌ๋‹ค. ๊ธฐ๋ณธ์ ์ธ ๋ถ„ํ•  ๋ชจ๋ธ์€ ๋Œ€์ƒ์ด ๊ฐ€๋ ค์ ธ ์žˆ๊ฑฐ๋‚˜ ์ผ๋ถ€๋ถ„์ด ๋ˆ„๋ฝ๋œ ๊ฒฝ์šฐ์— ๋ฐฐ๊ฒฝ์—์„œ ๋ฐ”๋žŒ์งํ•œ ๋Œ€์ƒ์„ ๋ถ„ํ• ํ•˜์ง€ ๋ชปํ•œ๋‹ค. ์ด๋Ÿฐ์–ด๋ ค์›€์„ ๊ทน๋ณตํ•˜๊ธฐ ์œ„ํ•ด์„œ ๋ถ€๋ถ„ ๋ฐ ์ „์ฒด ์ด๋ฏธ์ง€ ์ •๋ณด๋ฅผ ์ด์šฉํ•ด์„œ ๋งŒ๋“  ์—๋„ˆ์ง€ ํ•จ์ˆ˜๋ฅผ ํ˜•ํƒœ ์‚ฌ์ „ ์ง€์‹๊ณผ ํ†ตํ•ฉํ•œ๋‹ค. ์ด ๋ฐฉ๋ฒ•์€ ๋‹ค๋ฅธ ๋ฌธํ—Œ์—์„œ ์ œ์‹œ๋œ๋ฐฉ๋ฒ•๋“ค์„ ํ–ฅ์ƒ ์‹œ์ผœ์„œ ์‹ฌ์ง€์–ด ์ด๋ฏธ์ง€๊ฐ€ ๋ˆ„๋ฝ๋ผ์žˆ๊ฑฐ๋‚˜ ๊ฐ€๋ ค์ง, ์žก์Œ, ๋‚ฎ์€๋ช…์•”์„ ๊ฐ€์ง„ ๋ถˆ๊ท ์ผํ•œ ๊ฐ•๋„์˜ ์ด๋ฏธ์ง€๋„ ๋ถ„ํ• ํ•œ๋‹ค. ์šฐ๋ฆฌ๋Š” ๋‘ ๊ฐ€์ง€ ๊ฒฝ์šฐ๋ฅผ๊ณ ๋ คํ•œ๋‹ค. ํ•˜๋‚˜๋Š” ํ˜•ํƒœ ์‚ฌ์ „ ์ง€์‹์ด ์›ํ•˜๋Š” ๊ฐœ์ฒด์˜ ์œ„์น˜์— ์ •ํ™•ํ•˜๊ฒŒ ๋ฐฐ์น˜๋˜๊ณ , ๋‹ค๋ฅธ ํ•˜๋‚˜๋Š” ํ˜•ํƒœ ์‚ฌ์ „ ์ง€์‹์ด ์ž„์˜์˜ ์œ„์น˜์— ๋ฐฐ์น˜๋œ๋‹ค. ์šฐ๋ฆฌ๋Š” ๋‹ค์–‘ํ•œ์ด๋ฏธ์ง€์— ์šฐ๋ฆฌ ๋ฐฉ๋ฒ•์„ ํ…Œ์ŠคํŠธํ•˜๊ณ  ๊ธฐ์กด์˜ ๋‹ค๋ฅธ ๋ฐฉ๋ฒ•๊ณผ ๋น„๊ตํ•œ๋‹ค. ์‹คํ—˜ ๊ฒฐ๊ณผ๋“ค๋กœ ์šฐ๋ฆฌ ๋ฐฉ๋ฒ•์ด ์ •ํ™•ํ•˜๊ณ  ๊ณ„์‚ฐ์ด ํšจ์œจ์ ์ผ๋ฟ๋งŒ ์•„๋‹ˆ๋ผ ๊ธฐ์กด์˜ ๋ฐฉ๋ฒ•๋“ค๋ณด๋‹ค ๋” ๋น ๋ฅด๋‹ค๋Š” ๊ฒƒ์„ ๋ณผ ์ˆ˜ ์žˆ๋‹ค.In this dissertation, we discuss segmentation algorithms based on the level set method that incorporates shape prior knowledge. Fundamental segmentation models fail to segment desirable objects from a background when the objects are occluded by others or missing parts of their whole. To overcome these difficulties, we incorporate shape prior knowledge into a new segmentation energy that, uses global and local image information to construct the energy functional. This method improves upon other methods found in the literature and segments images with intensity inhomogeneity, even when images have missing or misleading information due to occlusions, noise, or low-contrast. We consider the case when the shape prior is placed exactly at the locations of the desired objects and the case when the shape prior is placed at arbitrary locations. We test our methods on various images and compare them to other existing methods. Experimental results show that our methods are not only accurate and computationally efficient, but faster than existing methods as well.Abstract 1 Introduction 1.1 Research background 1.2 Outline of thesis 2 Previous works 2.1 Level set method 2.2 Fundamental models for image segmentation 2.3 Segmentation models for images with intensity inhomogeneity 2.4 Shape prior segmentation models 3 Proposed models 3.1 Global and local image fitting energy 3.2 Global and local image fitting energy with shape prior 4 Experimental results 5 Conclusion Abstract (in Korean) AcknowledgementsDocto

    Hybrid machine learning approaches for scene understanding: From segmentation and recognition to image parsing

    Get PDF
    We alleviate the problem of semantic scene understanding by studies on object segmentation/recognition and scene labeling methods respectively. We propose new techniques for joint recognition, segmentation and pose estimation of infrared (IR) targets. The problem is formulated in a probabilistic level set framework where a shape constrained generative model is used to provide a multi-class and multi-view shape prior and where the shape model involves a couplet of view and identity manifolds (CVIM). A level set energy function is then iteratively optimized under the shape constraints provided by the CVIM. Since both the view and identity variables are expressed explicitly in the objective function, this approach naturally accomplishes recognition, segmentation and pose estimation as joint products of the optimization process. For realistic target chips, we solve the resulting multi-modal optimization problem by adopting a particle swarm optimization (PSO) algorithm and then improve the computational efficiency by implementing a gradient-boosted PSO (GB-PSO). Evaluation was performed using the Military Sensing Information Analysis Center (SENSIAC) ATR database, and experimental results show that both of the PSO algorithms reduce the cost of shape matching during CVIM-based shape inference. Particularly, GB-PSO outperforms other recent ATR algorithms, which require intensive shape matching, either explicitly (with pre-segmentation) or implicitly (without pre-segmentation). On the other hand, under situations when target boundaries are not obviously observed and object shapes are not preferably detected, we explored some sparse representation classification (SRC) methods on ATR applications, and developed a fusion technique that combines the traditional SRC and a group constrained SRC algorithm regulated by a sparsity concentration index for improved classification accuracy on the Comanche dataset. Moreover, we present a compact rare class-oriented scene labeling framework (RCSL) with a global scene assisted rare class retrieval process, where the retrieved subset was expanded by choosing scene regulated rare class patches. A complementary rare class balanced CNN is learned to alleviate imbalanced data distribution problem at lower cost. A superpixels-based re-segmentation was implemented to produce more perceptually meaningful object boundaries. Quantitative results demonstrate the promising performances of proposed framework on both pixel and class accuracy for scene labeling on the SIFTflow dataset, especially for rare class objects

    Shape-driven segmentation of the arterial wall in intravascular ultrasound images

    Get PDF
    Segmentation of arterial wall boundaries from intravascular images is an important problem for many applications in the study of plaque characteristics, mechanical properties of the arterial wall, its 3D reconstruction, and its measurements such as lumen size, lumen radius, and wall radius. We present a shape-driven approach to segmentation of the arterial wall from intravascular ultrasound images in the rectangular domain. In a properly built shape space using training data, we constrain the lumen and media-adventitia contours to a smooth, closed geometry, which increases the segmentation quality without any tradeoff with a regularizer term. In addition to a shape prior, we utilize an intensity prior through a non-parametric probability density based image energy, with global image measurements rather than pointwise measurements used in previous methods. Furthermore, a detection step is included to address the challenges introduced to the segmentation process by side branches and calcifications. All these features greatly enhance our segmentation method. The tests of our algorithm on a large dataset demonstrate the effectiveness of our approach

    A Framework for Image Segmentation Using Shape Models and Kernel Space Shape Priors

    Get PDF
    ยฉ2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or distribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.DOI: 10.1109/TPAMI.2007.70774Segmentation involves separating an object from the background in a given image. The use of image information alone often leads to poor segmentation results due to the presence of noise, clutter or occlusion. The introduction of shape priors in the geometric active contour (GAC) framework has proved to be an effective way to ameliorate some of these problems. In this work, we propose a novel segmentation method combining image information with prior shape knowledge, using level-sets. Following the work of Leventon et al., we propose to revisit the use of PCA to introduce prior knowledge about shapes in a more robust manner. We utilize kernel PCA (KPCA) and show that this method outperforms linear PCA by allowing only those shapes that are close enough to the training data. In our segmentation framework, shape knowledge and image information are encoded into two energy functionals entirely described in terms of shapes. This consistent description permits to fully take advantage of the Kernel PCA methodology and leads to promising segmentation results. In particular, our shape-driven segmentation technique allows for the simultaneous encoding of multiple types of shapes, and offers a convincing level of robustness with respect to noise, occlusions, or smearing
    • โ€ฆ
    corecore