View in EDS HTML Full Text PDF Full Text

An efficient iterative pseudo point elimination technique to represent the shape of the digital image boundary.

Saved in:
Bibliographic Details
Title: An efficient iterative pseudo point elimination technique to represent the shape of the digital image boundary.
Authors: Ramaiah, Mangayarkarasi1 (AUTHOR), Ravi, Vinayakumar2 (AUTHOR) vravi@pmu.edu.sa, Chandrasekaran, Vanmathi1 (AUTHOR), Mohanraj, Vanitha1 (AUTHOR), Mani, Deepa1 (AUTHOR), Maruthamuthu, Angulakshmi1 (AUTHOR)
Source: Multimedia Tools & Applications. Nov2024, Vol. 83 Issue 38, p85899-85915. 17p.
Subjects: Floating-point arithmetic, Arithmetic, Sum of squares, Polygons, Integers
Abstract: Visually, the environment is made up of a chaotic of irregular polygons. It is an important and intriguing issue in many fields of study to represent and comprehend the irregular polygon. However, approximating the polygon presents significant difficulties from a variety of perspectives. The method provided in this research eliminates the pseudo-redundant points that are not contributing to shape retention and then makes the polygonal approximation with the remaining high-curvature points, as opposed to searching for the real points on the digital image boundary curve. The proposed method uses chain code assignment to obtain initial segmentation points. Using integer arithmetic, the presented method calculates the curvature at each initial pseudo point using sum of squares of deviation. For every initial segmented pseudo point, the difference incurred by all the boundary points lies between its earlier pseudo point and its next initial pseudo point was taken into account. Then, this new proposal removes the redundant point from the subset of initial segmentation points whose curvature deviation is the lowest with each iteration. The method then recalculates the deviation information for the next and previous close pseudo points. Experiments are done with MPEG datasets and synthetic contours to show how well the proposed method works in both quantitative and qualitative ways. The experimental result shows the effectiveness of the proposed method in creating polygons with few points. [ABSTRACT FROM AUTHOR]
Copyright of Multimedia Tools & Applications is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 180991363
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: An efficient iterative pseudo point elimination technique to represent the shape of the digital image boundary.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Ramaiah%2C+Mangayarkarasi%22">Ramaiah, Mangayarkarasi</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Ravi%2C+Vinayakumar%22">Ravi, Vinayakumar</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> vravi@pmu.edu.sa</i><br /><searchLink fieldCode="AR" term="%22Chandrasekaran%2C+Vanmathi%22">Chandrasekaran, Vanmathi</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Mohanraj%2C+Vanitha%22">Mohanraj, Vanitha</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Mani%2C+Deepa%22">Mani, Deepa</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Maruthamuthu%2C+Angulakshmi%22">Maruthamuthu, Angulakshmi</searchLink><relatesTo>1</relatesTo> (AUTHOR)
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Multimedia+Tools+%26+Applications%22">Multimedia Tools & Applications</searchLink>. Nov2024, Vol. 83 Issue 38, p85899-85915. 17p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Floating-point+arithmetic%22">Floating-point arithmetic</searchLink><br /><searchLink fieldCode="DE" term="%22Arithmetic%22">Arithmetic</searchLink><br /><searchLink fieldCode="DE" term="%22Sum+of+squares%22">Sum of squares</searchLink><br /><searchLink fieldCode="DE" term="%22Polygons%22">Polygons</searchLink><br /><searchLink fieldCode="DE" term="%22Integers%22">Integers</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Visually, the environment is made up of a chaotic of irregular polygons. It is an important and intriguing issue in many fields of study to represent and comprehend the irregular polygon. However, approximating the polygon presents significant difficulties from a variety of perspectives. The method provided in this research eliminates the pseudo-redundant points that are not contributing to shape retention and then makes the polygonal approximation with the remaining high-curvature points, as opposed to searching for the real points on the digital image boundary curve. The proposed method uses chain code assignment to obtain initial segmentation points. Using integer arithmetic, the presented method calculates the curvature at each initial pseudo point using sum of squares of deviation. For every initial segmented pseudo point, the difference incurred by all the boundary points lies between its earlier pseudo point and its next initial pseudo point was taken into account. Then, this new proposal removes the redundant point from the subset of initial segmentation points whose curvature deviation is the lowest with each iteration. The method then recalculates the deviation information for the next and previous close pseudo points. Experiments are done with MPEG datasets and synthetic contours to show how well the proposed method works in both quantitative and qualitative ways. The experimental result shows the effectiveness of the proposed method in creating polygons with few points. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Multimedia Tools & Applications is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=180991363
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s11042-024-20183-1
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 17
        StartPage: 85899
    Subjects:
      – SubjectFull: Floating-point arithmetic
        Type: general
      – SubjectFull: Arithmetic
        Type: general
      – SubjectFull: Sum of squares
        Type: general
      – SubjectFull: Polygons
        Type: general
      – SubjectFull: Integers
        Type: general
    Titles:
      – TitleFull: An efficient iterative pseudo point elimination technique to represent the shape of the digital image boundary.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Ramaiah, Mangayarkarasi
      – PersonEntity:
          Name:
            NameFull: Ravi, Vinayakumar
      – PersonEntity:
          Name:
            NameFull: Chandrasekaran, Vanmathi
      – PersonEntity:
          Name:
            NameFull: Mohanraj, Vanitha
      – PersonEntity:
          Name:
            NameFull: Mani, Deepa
      – PersonEntity:
          Name:
            NameFull: Maruthamuthu, Angulakshmi
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 25
              M: 11
              Text: Nov2024
              Type: published
              Y: 2024
          Identifiers:
            – Type: issn-print
              Value: 13807501
          Numbering:
            – Type: volume
              Value: 83
            – Type: issue
              Value: 38
          Titles:
            – TitleFull: Multimedia Tools & Applications
              Type: main
ResultId 1