diff --git a/Modules/DICOMReader/mitkDICOMSortByTag.cpp b/Modules/DICOMReader/mitkDICOMSortByTag.cpp
index 8cacc7fef5..61b84349c1 100644
--- a/Modules/DICOMReader/mitkDICOMSortByTag.cpp
+++ b/Modules/DICOMReader/mitkDICOMSortByTag.cpp
@@ -1,125 +1,126 @@
 /*===================================================================
 
 The Medical Imaging Interaction Toolkit (MITK)
 
 Copyright (c) German Cancer Research Center,
 Division of Medical and Biological Informatics.
 All rights reserved.
 
 This software is distributed WITHOUT ANY WARRANTY; without
 even the implied warranty of MERCHANTABILITY or FITNESS FOR
 A PARTICULAR PURPOSE.
 
 See LICENSE.txt or http://www.mitk.org for details.
 
 ===================================================================*/
 
 #include "mitkDICOMSortByTag.h"
 
 mitk::DICOMSortByTag
 ::DICOMSortByTag(const DICOMTag& tag, DICOMSortCriterion::Pointer secondaryCriterion)
 :DICOMSortCriterion(secondaryCriterion)
 ,m_Tag(tag)
 {
 }
 
 mitk::DICOMSortByTag
 ::~DICOMSortByTag()
 {
 }
 
 mitk::DICOMSortByTag
 ::DICOMSortByTag(const DICOMSortByTag& other )
 :DICOMSortCriterion(other)
 ,m_Tag(other.m_Tag)
 {
 }
 
 mitk::DICOMSortByTag&
 mitk::DICOMSortByTag
 ::operator=(const DICOMSortByTag& other)
 {
   if (this != &other)
   {
     DICOMSortCriterion::operator=(other);
     m_Tag = other.m_Tag;
   }
   return *this;
 }
 
 void
 mitk::DICOMSortByTag
 ::Print(std::ostream& os) const
 {
   m_Tag.Print(os);
 }
 
 
 mitk::DICOMTagList
 mitk::DICOMSortByTag
 ::GetTagsOfInterest() const
 {
   DICOMTagList list;
   list.push_back(m_Tag);
   return list;
 }
 
 bool
 mitk::DICOMSortByTag
 ::IsLeftBeforeRight(const mitk::DICOMDatasetAccess* left, const mitk::DICOMDatasetAccess* right) const
 {
   return this->NumericCompare(left, right, m_Tag);
 }
 
 bool
 mitk::DICOMSortByTag
 ::StringCompare(const mitk::DICOMDatasetAccess* left, const mitk::DICOMDatasetAccess* right, const DICOMTag& tag) const
 {
   assert(left);
   assert(right);
 
   std::string leftString = left->GetTagValueAsString(tag);
   std::string rightString = right->GetTagValueAsString(tag);
 
   if (leftString != rightString)
   {
     return leftString.compare(rightString) < 0;
   }
   else
   {
     return this->NextLevelIsLeftBeforeRight(left, right);
   }
 }
 
 bool
 mitk::DICOMSortByTag
 ::NumericCompare(const mitk::DICOMDatasetAccess* left, const mitk::DICOMDatasetAccess* right, const DICOMTag& tag) const
 {
   assert(left);
   assert(right);
 
   std::string leftString = left->GetTagValueAsString(tag);
   std::string rightString = right->GetTagValueAsString(tag);
 
   std::istringstream lefti(leftString);
   std::istringstream righti(rightString);
 
   double leftDouble(0);
   double rightDouble(0);
 
-  if ( (lefti >> leftDouble) && (righti >> rightDouble) )
+  if (    (lefti >> leftDouble) && (righti >> rightDouble)
+       && lefti.eof() && righti.eof() )
   {
     if (leftDouble != rightDouble) // can we decide?
     {
       return leftDouble < rightDouble;
     }
     else // ask secondary criterion
     {
       return this->NextLevelIsLeftBeforeRight(left, right);
     }
   }
   else // no numerical conversion..
   {
     return this->StringCompare(left,right, tag); // fallback to string compare
   }
 }