WebSite Logo
  • Content
  • Similar Resources
  • Metadata
  • Cite This
  • Log-in
  • Fullscreen
Log-in
Do not have an account? Register Now
Forgot your password? Account recovery
  1. Science in China Series : Information Sciences
  2. Science in China Series : Information Sciences : Volume 56
  3. Science in China Series : Information Sciences : Volume 56, Issue 1, January 2013
  4. Vector morphological operators in HSV color space
Loading...

Please wait, while we are loading the content...

Science in China Series : Information Sciences : Volume 61
Science in China Series : Information Sciences : Volume 60
Science in China Series : Information Sciences : Volume 59
Science in China Series : Information Sciences : Volume 58
Science in China Series : Information Sciences : Volume 57
Science in China Series : Information Sciences : Volume 56
Science in China Series : Information Sciences : Volume 56, Issue 12, December 2013
Science in China Series : Information Sciences : Volume 56, Issue 11, November 2013
Science in China Series : Information Sciences : Volume 56, Issue 10, October 2013
Science in China Series : Information Sciences : Volume 56, Issue 9, September 2013
Science in China Series : Information Sciences : Volume 56, Issue 8, August 2013
Science in China Series : Information Sciences : Volume 56, Issue 7, July 2013
Science in China Series : Information Sciences : Volume 56, Issue 6, June 2013
Science in China Series : Information Sciences : Volume 56, Issue 5, May 2013
Science in China Series : Information Sciences : Volume 56, Issue 4, April 2013
Science in China Series : Information Sciences : Volume 56, Issue 3, March 2013
Science in China Series : Information Sciences : Volume 56, Issue 2, February 2013
Science in China Series : Information Sciences : Volume 56, Issue 1, January 2013
A 65 mW fully integrated UHF-band CMMB tuner in 65 nm CMOS process
Utility function of TCP Reno under precise end-to-end drop probability
A dynamical inequality for the output of uncertain nonlinear systems
An octree-based proxy for collision detection in large-scale particle systems
An IconMap-based exploratory analytical approach for multivariate geospatial data
Construction of minimal trellises for quantum stabilizer codes
Improving cis-regulatory elements modeling by consensus scaffolded mixture models
Forced-convergence decoding for LDPC-coded modulation
Vector morphological operators in HSV color space
Parameters identification of UCAV flight control system based on predator-prey particle swarm optimization
A representative model based algorithm for maximal contractions
Clustering by data competition
Animating Chinese ink painting through generating reproducible brush strokes
Resource allocation based on subcarrier exchange in multiuser OFDM system
Optimal switching target-assignment based on the integral performance in cooperative tracking
Selectively unforgeable but existentially forgeable signature schemes and applications
Effects of finite samples on the resolution performance of the rank reduction estimator
Finding shrink critical section refactoring opportunities for the evolution of concurrent code in trustworthy software
A broker-based semantic agent for discovering Semantic Web services through process similarity matching and equivalence considering quality of service
Science in China Series : Information Sciences : Volume 55
Science in China Series : Information Sciences : Volume 54
Science in China Series : Information Sciences : Volume 53
Science in China Series : Information Sciences : Volume 52
Science in China Series : Information Sciences : Volume 51
Science in China Series : Information Sciences : Volume 50
Science in China Series : Information Sciences : Volume 49
Science in China Series : Information Sciences : Volume 48
Science in China Series : Information Sciences : Volume 47
Science in China Series : Information Sciences : Volume 46
Science in China Series : Information Sciences : Volume 45
Science in China Series : Information Sciences : Volume 44

Similar Documents

...
Edge detection of color image using vector morphological operators

Article

...
Fusion tracking in color and infrared images using joint sparse representation

Article

...
Color image enhancement based on HVS and PCNN

Article

...
Patch-based variational image approximation

Article

...
Bi-conjugate gradient based computation of weight vector in space-time adaptive processing

Article

...
Morphological Granulometries for Color Images

Article

...
Support vector regression based color image restoration in YUV color space

Article

...
Video color conceptualization using optimization

Article

...
Querying color images using user-specified wavelet features

Article

Vector morphological operators in HSV color space

Content Provider Springer Nature Link
Author Lei, Tao Wang, Yi Fan, YangYu Zhao, Jiong
Copyright Year 2012
Abstract In HSV color space, the current vector morphological operators have low capability to reduce color noise caused by hue and saturation in color image processing. Because they sort the color pixels according to the hierarchical ordering of V, S, H, which is against the equal principle of the three channels in color image processing. A novel vector ordering based on the combination of H, S and V is proposed in this paper, and the associated vector morphological erosion, dilation and composite filtering operators are defined. Compared with the popular vector morphological operators, experimental results show that the new operators can reduce the color noise effectively without any new color pixels while preserving the image details. And the filtered images have higher peak signal-to-noise ratio (PSNR) and lower mean absolute error (MSE).
Starting Page 1
Ending Page 12
Page Count 12
File Format PDF
ISSN 1674733X
Journal Science in China Series : Information Sciences
Volume Number 56
Issue Number 1
e-ISSN 18691919
Language English
Publisher SP Science China Press
Publisher Date 2012-01-02
Publisher Place Heidelberg
Access Restriction One Nation One Subscription (ONOS)
Subject Keyword HSV color space vector morphological operators vector ordering image details Information Systems and Communication Service
Content Type Text
Resource Type Article
Subject Computer Science
  • About
  • Disclaimer
  • Feedback
  • Sponsor
  • Contact
  • Chat with Us
About National Digital Library of India (NDLI)
NDLI logo

National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.

Learn more about this project from here.

Disclaimer

NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.

Feedback

Sponsor

Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.

Contact National Digital Library of India
Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302
See location in the Map
03222 282435
Mail: support@ndl.gov.in
Sl. Authority Responsibilities Communication Details
1 Ministry of Education (GoI),
Department of Higher Education
Sanctioning Authority https://www.education.gov.in/ict-initiatives
2 Indian Institute of Technology Kharagpur Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project https://www.iitkgp.ac.in
3 National Digital Library of India Office, Indian Institute of Technology Kharagpur The administrative and infrastructural headquarters of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
4 Project PI / Joint PI Principal Investigator and Joint Principal Investigators of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
Prof. Saswat Chakrabarti  will be added soon
5 Website/Portal (Helpdesk) Queries regarding NDLI and its services support@ndl.gov.in
6 Contents and Copyright Issues Queries related to content curation and copyright issues content@ndl.gov.in
7 National Digital Library of India Club (NDLI Club) Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach clubsupport@ndl.gov.in
8 Digital Preservation Centre (DPC) Assistance with digitizing and archiving copyright-free printed books dpc@ndl.gov.in
9 IDR Setup or Support Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops idr@ndl.gov.in
I will try my best to help you...
Cite this Content
Loading...